The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes ...

This paper describes the implementation of a web service providing a tuple space service for distributed programming applications. Previous research has established the benefits of using tuple space-based systems, particularly with regard to simplicity. This project has developed a new web service providing a tuple space mechanism for distributed applications based on web services. The approach...

In this paper we describe the Cambridge Collaborative Agent System (CAS). This is a prototype system designed to demonstrate the functionality and basic architecture of a framework for co-ordination between different components (or agents) of distributed ‘Web’ applications. Co-ordination in CAS is achieved through the use of tuple spaces, as used in Linda. However, the access primitives used in...

Schema mappings have been extensively studied in database research over the past decade – notably in the areas of data exchange and data integration. Recently, the notion of an information transfer order on schema mappings has been introduced to compare the amount of source information that is actually transferred by two mappings. In this paper, we present two new operators: the union and inter...