Learn More
In this paper, colored Petri nets are used to model the atomic processes and the composite processes of semantic Web services. After introducing the concept about the colored Petri net and the knowledge associated with OWL-S, colored Petri nets are used to model the composite processes of semantic Web services. In this model, input, output and precondition(More)
Large scale matrix inversion has been used in many domains and block-based Gauss-Jordan (G-J) algorithm as a classical method of large matrix inversion has become the focus of many researchers. Many people show us their parallel version of G-J. But the large parallel granularity in those algorithms restricts the performance of parallel block-based G-J(More)
Non-invasive prenatal testing (NIPT) is currently used as a frontline screening test to identify fetuses with common aneuploidies. Occasionally, incidental NIPT results are conveyed to the clinician suggestive of fetuses with rare chromosome disease syndromes. We describe a child with trisomy 9 (T9) mosaicism where the prenatal history reported a positive(More)
Volatility is the key challenge of the desktop Grid platform and the character of volatility mainly depends on the daily behavior of computer user. In this paper, a trust model (TM-DG) based on Dempster-Shafer's (D-S) theory is presented to predict which node is more reliable according to users' daily behavior based on history information from a desktop(More)
Two kinds of parallel possibilities which are intrastep and inter-steps parallelism exist in the block-based Gauss-Jordan algorithm which is a classical method of large scale matrix inversion. But the existing parallel paradigm of Block-based Gauss-Jordan algorithm just aiming at the intra-step parallelism, can’t meet the requirement of making more(More)
Large scale matrix inversion has been widely used in many scientific research domains. As a classical method of large matrix inversion, block-based Gauss-Jordan (BbGJ) algorithm has aroused great concern among many researchers. Many people have developed parallel versions of BbGJ. But large granularity based task parallelism (intra-iterative data dependence(More)
Two kinds of parallel possibilities exist in the block-based Gauss-Jordan (BbGJ) algorithm, which are intra-step and inter-steps based parallelism. But the existing parallel paradigm of BbGJ algorithm just aiming at the intra-step based parallelism, can‟t meet the requirement of dispatching simultaneously as many tasks as possible to computing nodes of(More)