The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing becomes a hot and difficult topic, amo...
详细信息
The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing becomes a hot and difficult topic, amo...
ISBN:
(纸本)9783540241287
The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing becomes a hot and difficult topic, among which optimizing routing cache is one of the key techniques. In this paper, we propose an adaptive dynamic cache routing (DCR) strategy based on DSR (Dynamic Source Routing), which can evaluate the link expiration time rapidly. The experimental results show that the DCR has considerable improvement in control packets, packet delivery ratio, packet drops and end-to-end average delay in the MANET.
In this paper, we use networks of UML statechart diagrams to model compositional designs for real-time systems, and present an algorithm for checking networks of statechart diagrams for the scenario-based specificatio...
详细信息
In this paper, we use networks of UML statechart diagrams to model compositional designs for real-time systems, and present an algorithm for checking networks of statechart diagrams for the scenario-based specifications expressed by UML sequence diagrams with timing constraints. The algorithm is based on investigating the reachability graph of the integer state space of a network of statechart diagrams
Because of emergence of Semantic Web, It make possible for machines to understand the meaning of resources on the Web. The widespread availability of machine understandable information will impact on Information retri...
详细信息
It is important to reduce access latency and network traffic in distributed database management problem (DDMP). This problem has been formulated as a multiobjective combinatorial optimization problem in the paper. A n...
详细信息
ISBN:
(纸本)0780382730
It is important to reduce access latency and network traffic in distributed database management problem (DDMP). This problem has been formulated as a multiobjective combinatorial optimization problem in the paper. A new approach is proposed that is an intelligent configuration with multiple objectives based on genetic algorithm. Multiple criteria are developed with a goal to provide trade-off optimal performance for Web services. A set of good configurations with diverse spread of DDMP is generated to approximate Pareto front of the optimization problem. The corresponding results demonstrate that the proposed approach is capable of discovering a set of nondominated configurations within a finite genetic generation. Its feasibility and performance has been verified.
Ontology plays an important role on the Semantic Web. In this paper, we propose a method, AOIWD, of acquiring ontology information from Web documents. The AOIWD method employs data mining techniques combined with infe...
详细信息
Probabilistic methods are widely used in intrusion detection especially in computer audit data analysis. There are many famous probabilistic algorithm such as decision tree, Hotelling's T2, chi-square, first-order...
详细信息
ISBN:
(纸本)0780384032
Probabilistic methods are widely used in intrusion detection especially in computer audit data analysis. There are many famous probabilistic algorithm such as decision tree, Hotelling's T2, chi-square, first-order and high-order Markov model. These algorithms focus on some data features to mark anomaly state. New features are introduced into these algorithms and proper combination of these features will provide excellent result. But these algorithms are used single metric generated by multi-events so as to detect intrusion by comparison with a certain threshold. Experiment shows that using per event-based metric can improve accuracy of intrusion detection but not improve complexity of algorithm. In our paper we will provide a metric vector based on algorithm to detection intrusion that is more accurate and effective than traditional ones. Also, we provide some intrusion detection methods to our algorithm.
In the next fifty years, the main problem of AI is "the solution of multi-agent in the dynamic and un-forecast environment", the standard problem is the robot vs. robot or human vs. robot competition. This w...
详细信息
ISBN:
(纸本)0780384032
In the next fifty years, the main problem of AI is "the solution of multi-agent in the dynamic and un-forecast environment", the standard problem is the robot vs. robot or human vs. robot competition. This work discusses the problem of collaboration and coordination in RoboCup agent based on reinforcement learning and shows our experiment results.
Summary form only given. A parallel algorithm for EDT transform on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n/spl times/n pixels, the algorithm can complete the EDT...
详细信息
Summary form only given. A parallel algorithm for EDT transform on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n/spl times/n pixels, the algorithm can complete the EDT transform in O(nlogn/(c(n)logd(n))) time using n.d(n).c(n) processors, where c(n) and d(n) are parameters satisfying 1/spl les/c(n)/spl les/n , and 1
Summary form only given. There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(logn) hops per...
详细信息
Summary form only given. There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(logn) hops per lookup request with O(logn) neighbors per node, where n is the network size. We present a constant-degree P2P architecture, namely Cycloid, which emulates a cube-connected-cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of O(d) per lookup request by using O(1) neighbors per node, where n = d/spl middot/ 2/sup d/. We compare Cycloid with other two constant-degree systems, Viceroy and Koorde in various architectural aspects via simulation. Simulation results show that Cycloid has more advantages for large scale and dynamic systems that have frequent node arrivals and departures. In particular, Cycloid delivers a higher location efficiency in the average case and exhibits a more balanced distribution of keys and query loads between the nodes.
暂无评论