Petri net systems synthesis can construct large systems without the requirement of reachability analysis so that it can reduce the high complexity of analyzing global system. In a synthesis process, such good properties of subsystems as liveness and deadlock-freeness etc, must be preserved in synthesized system. This paper focusses on liveness preservation in inhibitor-arc connection operations...

The modelling of concurrent systems by synchronized distributed automata generates naturally an independence notion between the events of the global system. The theory of (Mazurkiewicz) traces suggests that such an independence relation induces a nice equivalence relation over the sequences of events of the system. Two sequences will be equivalent just in case they constitute two different inte...

The benefit of using indexes for processing coqjunctive queries in a database system is well known. The use of indexes in distributed database systems is equally justified. In a distributed database environment a relation may be horizontally partitioned across the nodes of the system and indexes may be created for the fragment of the relation that resides at each node. However, as an alternativ...

With the emergence of social networks such as micro-blogging services like Twitter, the expert finding has become an interesting topic. However, previous methods cannot be directly used to learn about topic experts in Twitter. Some of the new methods employ the relations among users and Twitter lists for expert finding. A probabilistic method has been developed to explore the relations (i.e. fo...

Kim argues that weak and global supervenience are too weak to guarantee any sort of dependency. Of the three original forms of supervenience, strong, weak, and global, each commonly wielded across all branches of philosophy, two are thus cast aside as uninteresting or useless. His arguments, however, fail to appreciate the strength of weak and global supervenience. I investigate what weak and g...

In its traditional definition, a repair of an inconsistent database is a consistent database that differs from the inconsistent one in a “minimal way.” Often, repairs are not equally legitimate, as it is desired to prefer one over another; for example, one fact is regarded more reliable than another, or a more recent fact should be preferred to an earlier one. Motivated by these considerations,...

Kim argues that weak and global supervenience are too weak to guarantee any sort of dependency. Of the three original forms of supervenience, strong, weak, and global, each commonly wielded across all branches of philosophy, two are thus cast aside as uninteresting or useless. His arguments, however, fail to appreciate the strength of weak and global supervenience. I investigate what weak and g...

A distributed database is structured from global relations, fragmentation and data allocation. A global relation can be divided into fragments and each fragment may itself contain a relation. The fragmentation describes how each fragment of the distributed database is derived from the global relations. The data allocation allows the allocation of discrete sets of fragments to the sites of the c...

Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global cons...

A tight mass-temperature relation, M(r)/r ∝ TX , is expected in most cosmological models if clusters of galaxies are homologous and the intracluster gas is in global equilibrium with the dark matter. We here calibrate this relation using 8 clusters with well-defined global temperatures measured with ASCA and masses inferred from weak and strong gravitational lensing. The surface lensing masses ...