5516091
An New Global Dynamic Scheduling Algorithm with Multi-Hop Path Splitting and Multi-Pathing Using GridFTP
35619770
A Heuristic Greedy Optimum Algorithm for Target Coverage in Wireless Sensor Networks
7657998
MAC Performance and Improvement in Mobile Wireless Sensor Networks
Former Media Access Control (MAC) protocols for Wireless Sensor Networks (WSNs) are mainly for static networks. In the networks where mobile nodes exist, the performance will degrade greatly. In this paper the performance of MAC in mobile WSNs (mWSNs) is analyzed and improved algorithms are presented. Simulations validate the effects. A new MAC protocol also is presented for the scenario with more mobile nodes.
7558736
An Adaptive Schedule Medium Access Control for Wireless Sensor Networks
Many media access control (MAC) protocols for wireless sensor networks (WSNs) such as sensor MAC (S-MAC) and carrier sense multiple access with minimum preamble sampling (CSMA-MPS) exploit listen/sleep cycles to conserve energy. The cycles of nodes influence the network performances such as energy efficiency, packet latency and throughput in WSNs. In this paper, an adaptive schedule medium access control (AS-MAC) for WSNs is presented. AS-MAC introduces the adaptation of the cycles in MAC layer to the data traffic. The effect of the protocol is that it can decrease the latency, improve the throughput and energy efficiency when traffic is dynamic. We also compare AS-MAC with S-MAC and CSMA-MPS through simulations and the results show it has better performances than the former protocols.
29576879
An Ontology-Based Approach to Knowledge Management
Combining with the respective advantages of ontology and Web Service, this paper puts forward a knowledge management approach to overcome the problem of semantic heterogeneity in distributed environments. The emphasis is placed on establishing an XML-oriented semantic data model and the mapping between XML data based on a global semantic view, which enhances knowledge process efficiency, accuracy and the semantic interoperability as well.
30274733
Finding the Shortest Route Using Cases, Knowledge, and Djikstra's Algorithm
This prototype system integrates Dijkstra's algorithm with knowledge-based and case-based components, reducing the time required to find the shortest path between points in a road network. >
18339174
Robot Obstacle Avoidance based on an Improved Ant Colony Algorithm
Obstacle Avoidance for mobile robot is a nondeterministic polynomial hard (NP-hard) problem. Ant algorithm is the bionic algorithm which simulated ants foraging behavior, which can effectively solve the problems of this kind. In this paper, we propose an improved ant colony algorithm for robot obstacle avoidance, in which heuristic information is adjusted at run-time during the searching process. The proposed algorithm can effectively alleviate the local optimum problem, global optimal path can be robustly found in our experiments.
232928
Integrating Classification and Association Rule Mining
Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the database that satisfy some minimum support and minimum confidence constraints. For association rule mining, the target of discovery is not pre-determined, while for classification rule mining there is one and only one predetermined target. In this paper, we propose to integrate these two mining techniques. The integration is done by focusing on mining a special subset of association rules, called class association rules (CARs). An efficient algorithm is also given for building a classifier based on the set of discovered CARs. Experimental results show that the classifier built this way is, in general, more accurate than that produced by the state-of-the-art classification system C4.5. In addition, this integration helps to solve a number of problems that exist in the current classification systems.
37399849
A High-Performance Intelligent Integrated Data Services System in Data Grid
It is very complex and of low efficiency for grid users to access heterogeneous diverse data resources distributed over the whole wide area network. The integrated data services can implement more wide range of transparent access to data resources in Data Grid. One of the important building blocks for any Data Grid is the server which implements data services. In this paper, we describe HPIIDS which implements integrated data services and achieves more wide range of transparencies. In order to improve its performances, we emphasis on the server called DSB which provides integrated data services. The DSB bases on cluster and agent technologies. Agent-based DSB can cleverly prefetch required data, replicate them among DSBs. Multiple DSBs are formed cluster HPIIDS. Cluster-based HPIIDS implements a single entry, provides a virtual integrated storage system for users, hides distributed heterogeneous low-level data resources, and insures load balance of each server. HPIIDS architecture supporting these various scenarios, are also described.
14570653
A New Parallel Segmentation Model Based on Dictionary and Mutual Information
It is difficult to compute the word frequency for mutual information segmentation. Statistic of word frequency of parallel mutual information is integrated with dictionary segmentation to improve efficiency in this paper. The parallel model and dispatching policy are presented, the paper also gives the speed up ratio of parallel model at the same time, periods pattern string and non periods pattern string are optimized in parallel model. Experiment show that the algorithm is available. The parallel model also can use for other segmentation algorithms that base on statistic of word frequency.