17864128
Traffic Localizing Strategy for Peer-to-Peer Systems
Topology mismatching problem between peer-to-peer overlay network and physical underlying network brings great stress to Internet infrastructure. This paper proposes a traffic localizing strategy (TLS), it keeps scalability property of current DHT algorithms and improves system routing performance by partitioning DHT key space associating with local physical information. Experiments based on CAN model show that the traffic localizing strategy can significantly alleviate the backbone link traffic burden. Meanwhile, the average routing hops are reduced.
14695418
Generic slow-motion replay detection in sports video
Slow-motion replays highlight important and exciting events in sports videos. Previous works for slow-motion replay detection, however, are usually limited to only some specific production rules such as frame repetition, special video effects and transitions. In this paper, we present a generic method for detecting slow-motion replays in sports video based on the difference of motions between slow-motion replays and normal shots within the same shot class. Experiments on different types of sports videos have verified our approach and achieve reasonable results.
46259333
PN-based Security Design for Data Storage
For improving the security and privacy of data storage, a novel model based on code division multiple access, called PNCD-DS, is proposed for dealing with the problem of resources sharing in a storage area network (SAN). This technology differs from existing such as spac e or time division multiple access, it has some essential features for ensuring the security and privacy of user's information and/or data. Through decreasing the information intensity by multi times during user's data storage and then recovering it normal when scan, the method makes the interference from other users or damages to the data weaken enormously. Therefore, damage to some extent in some local area of SAN will not destroy the integrity of saved data. On the other hand, because a SAN here can be regarded exclusive for each user with its own special code, the data management could be simplified. Due to coded when data storage and/or backup and decoded when scan, the probability of user's data leakage is also very low even if the disk is physical ly handed by some other users. Key Words Security, confidentiality, database, storage area network, PN sequence
14387828
Escape analysis for synchronization removal
In this paper we introduce our escape analysis framework for Java, which is a kind of flow-insensitive, inter-procedural, and context-sensitive data flow analysis. And we present an efficient static intra-procedural algorithm for inferring the set of types that can occur at runtime for each object. With intra-procedural type information, virtual method resolution, callee-stub inline, exception analysis, and thread allocation site analysis are implemented. Virtual method resolution and callee-stub inline effectively reduce the call graph and SCC (strongly connected components). In exception analysis, we present a more precise analysis algorithm, especially in the inter-procedural exception in SCC.Our escape analysis can be applied to the whole Java program and Java libraries to identify unnecessary synchronization in Java and remove them. We have developed an implementation on Intel's Open Runtime Platform. For our benchmarks, 7.3% to 99% (with an average of 54%) of synchronization operations are eliminated.
29918508
Round-Robin with VirtualClock Scheduling Algorithm in Multiservice Packet Networks
In this paper, we present a scheduler that incorporates round robin service within a VirtualClock discipline. Time-stamp based scheduling algorithms attain a low local delay bound and performance guarantee, but are computationally complex. On the other hand, round robin schemes are simple to implement and have computational complexity of O(1) but they are well known for their output burstiness and short-term unfairness. In order to overcome this problem, we combine round robin with VirtualClock in an algorithm we call VCRR. VCRR possesses better fairness than simple round robin, low jitter and a good scheduling delay bound. At the same time, VCRR preserves the O(1) time complexity of round robin. Simulation experiments show VCRR's efficiency in terms of delay performance, jitter and fairness..
195719977
Improved Hierarchical Network Model Based on Pastry Scheme
The traditional Pastry design is a flat overlay network and limited-scope searching, in which all nodes have identical capabilities and responsibilities and all communication is symmetric. But in practice, because of a variety of available bandwidth and delay, each node has different capabilities. in this paper, a hierarchical Pastry network model is presented to address this limitation. Furthermore, the routing procedure and handling algorithm of the arrival and departure of nodes will be carefully discussed. Finally, some elementary experimental results obtained with a prototype implementation on JXTA platform indicate that the improved Pastry network model is superior in routing performance.
15186113
Association based immune network for multimodal function optimization
For the problem of serious resources waste, indeterminate direction of local search and degeneration in the original opt-aiNet, a novel association based immune network is proposed for multimodal function optimization. The hexabasic model mimics natural phenomenon in immune system such as clonal selection, affinity maturation, immune network, immune memory and immune association. The antibody population scale is semi-fixed reducing the time and space required to execute it. The information of the antibody population and the memory cells population is effective utilized to point out the direction of local search, to regulate the ratio between local search and global search, and to enhance the affinity of new antibodies. The elitist selection mechanism is adopted to ensure the convergence and stability of our algorithm respectively. The experiments on 10 benchmark functions show that when compared with opt-aiNet method, the new algorithm is capable of improving the search performance significantly in global convergence, convergence speed, computational cost, search ability, solution quality and algorithm stability.