5798533
A Flexible Routing Decision Framework to Support Diversified Application-Level Data Types in MANETs
Owing to the technological advances in computing power and wireless communications, applications that used to be only accessible on desktop computers are increasingly run-able on wireless devices. As a result, a wireless device user may run several applications at the same time, and these different applications may generate different data types. In a mobile ad hoc network (MANET) environment, which is popular among wireless device users, different data types may impose different routing considerations and prefer using different routing criteria. To support diversified routing requirements and to achieve efficient routing for applications with different data types, this paper proposes a novel Flexible Routing Decision (FRD) framework. The framework supports several routing metric types in one platform. It allows users to weigh, rank and use different types of routing metrics to select different routes on an individual application basis. It is expected that this approach could help users to find a route that is most suited to their application requirements.
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.
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.
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.
10807744
XML Query Processing and Optimization
In this paper, I summarize my research on optimizing XML queries This work has two components: the first component is the definition of a logical algebra and logical optimization techniques This algebra can be translated into different physical algebras such as native or extended-relational algebras The second component is the design of physical storage structures and physical optimization techniques.
16897836
Analysis on Routing Convergence in Optical Network
Today wavelength division multiplexing (WDM) technology, optical amplifiers, and simple optical switching elements like optical add-drop multiplexers (OADMs) are used in the backbone networks of all operators worldwide. The optical network has its own distinct routing features, topology aggregation and abstraction used in inter-domain routing make the view of network topology different to each routing layer, all these factors demand a creative way to converge and synchronize the hierarchical network. This paper tries to bring forward a kind of parallel topology convergence mechanism depending on the exchange of topology abstracts information, which is suitable for inter-domain routing in multiple layers and domains ASON network. Optical systems nowadays provide the basis for cost-effective transmission of large amounts of bandwidth over the Internet, and will enable its future growth and the spreading of new applications and services.
38027788
Concurrent Garbage Collection Implementation in a Standard JVM for Real-Time Purposes
Programming in Java is attractive for its maintainability and reliability, but much work is to be performed to apply it into the real-time software development. We try to address the two main issues, thread scheduling and garbage collection, with real-time concerns. Besides, the extra memory requirement caused by the introduction of garbage collection in systems is carefully concerned. As a result, a concurrent garbage collector that combines incremental collection and real-time scheduling is figured out and implemented in a standard JVM, which plays a key role in our future real-time JVM.
15131459
An Ant Colony Optimization Algorithm for Learning Classification Rules
Ant colony optimization (ACO) algorithm has been applied to data mining recently. Aiming at Ant Miner, a classification rule learning algorithm based on ACO, this paper presents an enhanced Ant Miner, which includes two main contributions. Firstly, a rule punishing operator is employed to reduce the number of rules and the number of conditions. Secondly, an adaptive state transition rule and a mutation operator are applied to the algorithm to speed up the convergence rate. The results of experiments on some data sets demonstrate that the enhanced Ant-Miner can quickly discover better classification rules which have roughly competitive predicative accuracy and short rules
6932463
BlossomTree: evaluating XPaths in FLWOR expressions
Efficient evaluation of path expressions has been studied extensively. However, evaluating more complex FLWOR expressions that contain multiple path expressions has not been well studied. In this paper, we propose a novel pattern matching approach, called BlossomTree, to evaluate a FLWOR expression that contains correlated path expressions. BlossomTree is a formalism to capture the semantics of the path expressions and their correlations. We propose a general algebraic framework (abstract data types and logical operators) to evaluate BlossomTree pattern matching that facilitates efficient evaluation and experimentation. We design efficient data structures and algorithms to implement the abstract data types and logical operators. Our experimental studies demonstrate that the BlossomTree approach can generate highly efficient query plans in different environments.