In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a diierent process. T...

This report sets out the results of an investigation into the distributed implementation of tuple spaces, hence Linda. There are numerous such schemes for implementing distributed tuple spaces, and a selection of these implementations are examined. It is observed that all the implementations have a great deal of similarities. These similarities form the basis for a generalised tuple space imple...

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designin...

Coordination of multiagent systems is recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and selforganisation are exploited in order to tackle openness, dynamism and unpredictability of typical multiagent systems applications. In this paper we focus on a coordination problem called collective sorting, where autonomous agents are...

Multicriteria decision-making (MCDM) is one of the most common methods used to select best alternative from a set available alternatives. Many in MCDM are presented academic literature, with latest being Fuzzy Decision by Opinion Score Method (FDOSM). The FDOSM can solve many challenges that present other methods. However, several problems still exist and its extensions, such as uncertainty. On...

In this paper we will present a new construction of any real geometric (Clifford) algebra $${\mathbb {G}}^{(p,q)}$$ with signature (p, q) where $$p+q=n$$ by defining product on the vector space {R}}^{(2^n)}$$ in manner similar to Gauss’ ordered pair complex numbers ( {C}}$$ ) and Hamilton’s quadruple quaternions {H}}$$ ). We motivate definition generalizing tuple multiplication each . Similar w...

Krommydas, Ioannis, Evagelos, Georgia. MSc, Computer Science Department, University of Ioannina, Greece. June, 2008. Approximate Joins for Relational Data. Thesis Supervisor: Vassiliadis Panos. Relational databases often contain duplicate data entries. This may occur due to a variety of reasons, such as typographical errors, multiple conventions for recording database fields or other noise sour...

In this paper we recover an [m,C]-isometric operators and (m,C)-isometric commuting tuples of on a Hilbert space studied respectively in [11] [16], introduce the class [m,C]-isometries for tuple operators. This is generalization spaces. A S = (S1,..., Sp) ? B(H)p said to be p-tuple if ?m (S,C):= j=0 (?1)m?j (m j) (? |?|=j j!/?! CS?CS?)=0 some positive integer m conjugation C. We consider multi-...