43740792
A general approach to evaluation of secure systems
As we know, current composable security properties are logically pessimistic, particularly when they are applied to security analysis of a system in a modular way. To overcome this problem we present a general approach to properly dealing with composition of components or modules by using matrices that describe operational properties of the components. The matrices of an entire system can be generated from those of its components, and then the security of the system be determined in terms of its matrices. This matrix-based approach enables us to allocate appropriate security requirements to components or to examine composability of component security requirements. Such security requirements allow a system with strong security to be built from components with weaker security.
1660866
A General Fuzzified CMAC Controller with Eligibility
This paper presents an online neural network controller. Cerebellar Model Articulation Controller (CMAC) is suitable to online control due to its fast learning speed. By integrating the CMAC address scheme with fuzzy logic concept, a general fuzzified CMAC (GFAC) is proposed. Then by incorporating the concept of eligibility into the GFAC, a GFAC controller with eligibility is presented, named FACE. A learning algorithm for the FACE is derived to tune the model parameters. To achieve online control, an efficient implementation of the proposed FACE method is presented. As an example, the proposed FACE is applied to a ship steering control system. The simulation results show that the ship course can be properly controlled under the disturbances of wave, wind and current.
14935404
Levels of Authentication Assurance: an Investigation
The ES-LoA project, funded by the UK Joint Information Systems Committee (JISC) under its e- Infrastructure Security Programme, investigates current and future needs among UK research and education community for a more fine-grained authorisation scheme that would allow service providers to take into account of the levels of confidence in identifying a remote entity requesting for service access. Such a fine-grained authorisation scheme is attractive to service providers offering resources with varying levels of sensitivity and/or wishing to tailor their security protections based upon risk levels. Service providers may wish to restrict access to more sensitive resources only to those who have gone through a more stringent authentication process, or given the same remote entity, require the use of a stronger authentication token should the access request come from a more risky environment. In this way, the quality of an authentication instance, expressed as an authentication Level of Assurance (LoA), becomes one of the parameters used in access control decision making. This paper investigates the current worldwide efforts in defining LoA and identifies gaps in existing definitions when they are applied to a federated environment.
1884872
A mobility monitoring based advance reservation protocol
Future wireless cellular networks will be Internet Protocol (IP) based. Users of wireless devices in these networks will expect to run real-time applications that require guarantees of Quality of Service (QoS). Such a user will expect the same seamless QoS that he would receive if he were running real-time applications on a wired network. Achieving seamless QoS in a mobile environment implies that a reservation should be re-established at the new Base Station (BS) before hand-over occurs. However, making these advance reservations is wasteful of valuable bandwidth in the wireless network. This paper proposes a protocol, called the Mobility Monitoring Based Advance Reservation Protocol (M²BARP), which aims to reduce the bandwidth overhead of making advance reservations. The protocol makes use of information about a Mobile Node's (MN) mobility to make a single advance reservation when the MN is about to hand-over. Unlike previous work, M²BARP takes advantage of overlapping cells to help to provide a more seamless QoS by reducing the number of calls dropped at hand-over
13044783
A New Time-domain Detection Approach with Blind Separation Based on Neural Network
In this paper a new technique is proposed for time-domain detection in energy detection. The proposed scheme is based on a independent-component analysis (ICA): blind separation of unknown source signals. This method not only improves the nicety of time-domain detection for narrow band signal and the sinusoidal signal but also reduces the power of the whole detection system.
42027884
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
Our problem formulation is as follows. Given a weighted disk graph Gwhere the weight of edge represents the transmission energy consumption, we wish to determine a dominating tree Tof Gsuch that the total weight of edges in Tis minimized. To the best of our knowledge, this problem have not been addressed in the literature. Solving the dominating tree problem can yield a routing backbone for broadcast protocols since: (1) each node does not have to construct their own broadcast tree, (2) utilize the virtual backbone to reduce the message overhead, and (3) the weight of backbone is minimized. 
 
Our contributions to this problem is multi-fold: First, the paper is the first to study this problem, prove the hardness of this problem and propose an approximation framework. Second, we present a heuristic to approximate the solution with low time complexity. Third, a distributed algorithm is provided for practical implementation. Finally, we verify the effectiveness of our proposal through simulation.
16464983
Self-Protection Model Based on Intelligent Agent
In this paper, we propose a self-protection model based on distributed intelligent agents. The major feather of this model is that autonomic agents can manage themselves given high-level objectives from administers. System can detect attacks and compromise, and recovering from security incidents without human intervention. We describe the model and the existing prototype, as well as some design and implementation experiences. Meanwhile several topics including structure of agent, relationship among agents and the establishment of a trustworthy system are discussed. We are implementing this model on the Eclipse Platform using Java. According to the experiments, this model provides significant advantages in scalability, flexibility, fault tolerance, and resistance to compromise.
18850818
A Fast Algorithm for the Chirp Rate Estimation
A fast algorithm for the chirp rate estimation is presented in this paper. By the computation of the cubic phase transform (CPT) of the signal, it is shown that the CPT is concentrated along the frequency rate law of the signal, and the peak of the CPT yields the estimate of the chirp rate. The proposed algorithm is fast in that it requires only one-dimensional (1-D) maximizations. The asymptotic statistical result is derived for the chirp rate estimation, and the computer simulation demonstrates that, when the input signal-to-noise ratio (SNR) is higher than -2 dB, the simulation results and the theoretical analyses are well matched, and the mean-square error (MSE) approaches optimality as the SNR tends to infinity.
15560929
UNDER DEVELOPMENTUCD in Chinese IT enterprises
A zoom lens system includes a first lens unit having a negative optical power, located closer to an object side, and a second lens unit having a positive optical power, located farther from the object side. Zooming is accomplished by varying the spacing between the first and second lens units. The surface of at least one lens element in the two lens units is a diffractive optical surface. At least one surface of the lens element is an aspherical surface.
5143150
On Miquel's Five-Circle Theorem
Miquel's Five-Circle Theorem is difficult to prove algebraically. In this paper, the details of the first algebraic proof of this theorem is provided. The proof is based on conformal geometric algebra and its accompanying invariant algebra called null bracket algebra, and is the outcome of the powerful computational techniques of null bracket algebra embodying the novel idea breefs.
10586032
A tag recommendation system for folksonomy
Social bookmarking tools become more and more popular nowadays and tagging is used to organize information and allow users to recall or search the resources. Users need to type the tags whenever they post a resource, so that a good tag recommendation system can ease the process of finding some useful and relevant keywords for users. Researchers have made lots of relevant work for tag recommendation systems, but those traditional collaborative systems may not perform well in the case of a new user and a new resource.
 To address this problem, we propose a tag recommendation system for two different cases. The first case is that the active user or active resource is a new one which has not appeared in the past while the second case is that the active user and resource has already been posted. In this paper, we present two different methods for these two cases: a content-based method and a graph-based method. We implement our tag recommendation system in a realworld academic Folksonomy system. In order to gain better results,we apply improvements and combinations of previous work in each of these two methods.and combinations of previous work in each of these two methods. We participated into the Discovery Challenge 2009 with the proposed methods. The results of our teams are within the top teams.