The development of the idea of coordination languages, as deened by Carriero and Gelernter 8], has enabled work in concurrency to abstract away from the internals of processes or agents and hence to focus on their external interactions. A variety of practical parallel and/or distributed systems have resulted from the application of the coordination language concept | the most widely-known of th...

We have implemented the Linda model of shared distributed tuple space in a functional programming language, Standard ML. We use ML’s flexible type system and pattern matching facilities to provide ML programmers with the basic Linda operations on tuples. No preprocessor is used, and no compiler changes are required. We use separate ML modules to implement the Linda interface, operations on tupl...

In a graph G, a vertex is said to dominate itself and all of its neighbors. For a fixed positive integer k, the k-tuple domination problem is to find a minimum sized vertex subset in a graph such that every vertex in the graph is dominated by at least k vertices in this set. The current paper studies k-tuple domination in graphs from an algorithmic point of view. In particular, we give a linear...

The development of efficient and portable parallel programming systems can be a complex and troublesome task. Although there are several portable environments that are meant to be used as a support layer for higher level programming systems, they all provide different features and different levels of functionality to the system programmer. In this paper we report on our experience implementing ...

We obtain a complete characterization for doubly commuting mixed invariant subspaces of the Hardy space over unit polydisc. say closed subspace Q H2(Dn) is if Mzj(Q)⊆Q 1≤j≤k and Mzj⁎(Q)⊆Q, k+1≤j≤n some integer k∈{1,2,…,n−1}. prove that only ifQ=ΘH2(Dk)⊗Qθ1⊗⋯⊗Qθn−k, where Θ∈H∞(Dk) inner function Qθj either Jordan block H2(D)⊖θjH2(D) θj or H2(D). Furthermore, an explicit representation commutant ...

Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where self-interested agents compete for resources. The Internet is the most known example of environment where agents belonging to different applications exploit the available resources and services. The aim of this paper is to show how auction mechanisms can be easily implemented by using progra...

A common problem in decision-making is to analyze a tuple of numerical values associated with options, such as the degree of satisfaction assigned by experts to alternatives or probability values for hypotheses computed from data. With no loss of generality, it is assumed that the tuple contains values in the unit interval. For post-processing of typical value(s), singular values that may arise...

This document explains algorithms and basic operations of knowledge structures and knowledge spaces available in R through the kst package. Knowledge Space Theory (Doignon and Falmagne, 1999) is a set-theoretical framework, which proposes mathematical formalisms to operationalize knowledge structures in a particular domain. The most basic assumption of knowledge space theory is that every knowl...

OF THE THESIS A Framework for Opportunistic Cluster Computing using JavaSpaces

1 Human motion is difficult to create and manipulate because of the high dimen-sionality and spatiotemporal nature of human motion data. Recently, the use of large collections of captured motion data has added increased realism in character animation. In order to make the synthesis and analysis of motion data tractable, we present a low-dimensional motion space in which high-dimensional human m...