Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a parallel, cOllaborative and Probabilistic sea...
详细信息
With the never-ending growth of the complexity of modern hardware and software systems, more and more sophisticated methods of verification are required. Model checking has been proved to be an effective approach to g...
详细信息
With the never-ending growth of the complexity of modern hardware and software systems, more and more sophisticated methods of verification are required. Model checking has been proved to be an effective approach to guaranteeing the correctness of design and implementation of software and hardware system. Model and temporal logics are used as specification languages in software and hardware verification. Modal μ-calculus is an extremely popular and important one among these logics. It is succinct in syntax and powerful in expressiveness. Since Kozen's paper on modal μ-calculus, it has received ever growing interest in both theoretical and application aspects. Based on the focus game theory, Lange and Stirling proposed the axiom systems for LTL and CTL. This paper extends that idea to that for modal μ-calculus. A game-theoretic approach is presented to test the satisfiability of modal μ-calculus formulas. In addition, this approach converts the satisfiability problem for μ-calculus into a solving problem for focus games. Consequently, based on these game rules, an axiom system for μ-calculus is developed, and the completeness of this deductive system can be proved via the game based satisfiability testing procedure. By comparison, this axiom system is much more intuitive and succinct than the existing μ-calculus axiom systems.
Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a parallel, collaborative and Probabilistic sea...
详细信息
Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a parallel, collaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called distributed Bloom filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations.
Resources over Internet have such intrinsic characteristics as growth, autonomy and diversity, which have brought many challenges to the efficient sharing and comprehensive utilization of these resources. This paper p...
详细信息
Resources over Internet have such intrinsic characteristics as growth, autonomy and diversity, which have brought many challenges to the efficient sharing and comprehensive utilization of these resources. This paper presents a novel approach for the construction of the Internet-based Virtual Computing Environment (iVCE), whose sig- nificant mechanisms are on-demand aggregation and autonomic collaboration. The iVCE is built on the open infrastructure of the Internet and provides harmonious, transparent and integrated services for end-users and applications. The concept of iVCE is presented and its architectural framework is described by introducing three core concepts, i.e., autonomic element, virtual commonwealth and virtual executor. Then the connotations, functions and related key technologies of each components of the architecture are deeply analyzed with a case study, iVCE for Memory.
Data replication introduces well-known consistency issues. This paper puts forward the question about data dependence in data consistency, which embodies pseudo-conflict updates and update dependency. According to tha...
详细信息
Meteorology Grid Computing aims to provide scientist with seamless, reliable, secure and inexpensive access to meteorological resources. In this paper, we presented a semantic-based meteorology grid service registry, ...
详细信息
Meteorology Grid Computing aims to provide scientist with seamless, reliable, secure and inexpensive access to meteorological resources. In this paper, we presented a semantic-based meteorology grid service registry, ...
详细信息
Data replication introduces well-known consistency issues. This paper puts forward the question about data dependence in data consistency, which embodies pseudo-conflict updates and update dependency. According to tha...
详细信息
Data replication introduces well-known consistency issues. This paper puts forward the question about data dependence in data consistency, which embodies pseudo-conflict updates and update dependency. According to that, an optimistic data consistency method is proposed. In our method, data object is partitioned into data blocks by fixed size, as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that our method is an efficient method to achieve consistency, good dynamic property, and strong robustness.
Meteorology Grid Computing aims to provide scientist with seamless, reliable, secure and inexpensive access to meteorological resources. In this paper, we presented a semantic-based meteorology grid service registry, ...
Meteorology Grid Computing aims to provide scientist with seamless, reliable, secure and inexpensive access to meteorological resources. In this paper, we presented a semantic-based meteorology grid service registry, discovery and composition framework by combining grid technologies and the advantages of semantic web techniques. The main objective of the framework is to support automating the discovery, selection, and workflow composition of semantically described heterogeneous meteorological grid services, which offers the possibility of facilitating geographically distributed meteorological scientists to resolve complex scientific problems cooperately. With this framework, the key technologies such as semantic registry, semantic matchmaking, QoS ranking and composition model, will be discussed.
Meteorology is a complex, interdisciplinary area. Meteorology Grid Computing tries to offer a flexible, secure, coordinated resource sharing and problem-resolving environment by making good use of semantic grid ideas....
详细信息
暂无评论