This paper introduces schema tuple queries and argues for their suitability in representing knowledge over standard relational databases. Schema tuple queries are queries that return only whole tuples of schema relations. In particular a subclass of the schema tuple queries is identified that is decidable for satisfiability and is closed over syntactic query difference. These properties enable ...

This paper presents an embedding of the Linda parallel programming paradigm into Prolog, resulting in a coarsely grained parallel Prolog1. The embedding provides a distributed tuple space, using unification for matching and Prolog style deduction in tuple space queries. Access to the tuple space is based on a general service mechanism, that facilitates flexible and unrestricted manipulation of ...

We show that every multivariable contractive weighted shift dilates to a tuple of commuting unitaries, and hence satisfies von Neumann’s inequality. This answers a question of Lubin and Shields. We also exhibit a closely related 3-tuple of commuting contractions, similar to Parrott’s example, which does not dilate to a 3-tuple of commuting unitaries.

Recently, cluster computers become a viable and less expensive alternative to multiprocessor systems. However, a serious difficulty in concurrent programming of a cluster computer system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Based on the four-tuple DLBM (dynamic load balancing model) which is proposed by other scholars, ...

A distributed data structure is an object which permits many producers to augment or modify its contents, and many consumers simultaneously to access its component elements. Synchronization is implicit in data structure access: a process that requests an element which has not yet been generated blocks until a producer creates it. In this paper, we describe a parallel programming language (calle...

A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G so that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G is the smallest t so that there is such a k-tuple coloring of G using t colors in all. The Kneser graph K(m,n) has as vertices all n-element subsets of the set {1,2, . . . ,m} and an edge between two ...

In this paper, the ReSpecT specification language for programming the behaviour of tuple centres is extended with the out tc predicate, enabling communication between tuple centres. The extension is formally defined, and its benefits in the management of multiple coordination flows are outlined. The paper shows how relevant interaction scenarios – typically event-oriented – can be framed as mul...

This paper considers the design and optimization of a simple asynchronous parallel language that uses rst-class tuple-spaces as its main communication and process creation device. Our proposed kernel language diiers from other tuple-space languages insofar tuple-spaces are treated as true rst-class objects. Moreover, we develop a formal framework for constructing an optimizing pre-processor for...

In recent years, fuzzy logic has been increasingly used to improve conventional methods. This paper proposes fuzzy-logic based improvements to the n-tuple recognizer algorithm. The original n-tuple method works by matching bunches of n pixels exactly between the test images and the template images. In the proposed method, new concepts such as ‘Importance of Tuple’ and ‘Degree of Match’ of a tup...