In this paper we give a Specht-type characterization for unitary equivalence of operator tuples in the Cowen-Douglas class via their point-wise localizations.

XMLSpaces.NET implements the Linda concept as a middleware for XML documents on the .NET platform. It introduces an extended matching flexibility on nested tuples and richer data types for fields, including objects and XML documents. It is completely XML-based since data, tuples and tuplespaces are seen as trees represented as XML documents. XMLSpaces.NET is extensible in that it supports a hie...

The notions of nonsingularity, resolvent set, and spectrum, and the corresponding analytic functional calculus for n-tuples of elements of a commutative Banach algebra provide some of the deepest and most potent tools of modern analysis. A point of view one can adopt regarding this theory is as follows: The class of algebras (9(U)9 for U a domain in C9 provides a relatively small, well-understo...

We provide some additional completeness results for the full Lambek calculus and syntactic concept lattices, where the underlying structure is extended to tuples of arbitrary finite and infinite size. Whereas this answers an open question for finite tuples, infinite tuples have not been considered yet. Nonetheless, they have a number of interesting properties which we establish in this paper, s...

In a mobile computing environment, a user with a wireless connection to the information network can access data via submitting queries to data servers. As the mobility is the most distinguishing feature of the mobile computing paradigm, location becomes an important piece of information for the so-called location-dependent queries, where the answer to a query depends on the current location of ...

Recently, there has been an increased interest in incorporating in database management systems rank-aware query operators, such as top-k queries, that allow users to retrieve only the most interesting data objects. In this paper, we propose a cache-based approach for efficiently supporting top-k queries in distributed database management systems. In large distributed systems, the query performa...

Logical formalisms for representing and reasoning about relational databases have been very popular. However, fragments of the standard rst-order logic used in most of these formalisms are quite inadequate for reasoning about properties represented by a set of tuples from a relation. In this short note, we propose a formalism for reasoning about these properties by means of two operators with r...

Entity Resolution (ER) is the problem of identifying groups of tuples from one or multiple data sources that represent the same real-world entity. This is a crucial stage of data integration processes, which often need to integrate data at query time. This task becomes more challenging in scenarios with dynamic data sources or with a large volume of data. As most ER techniques deal with all tup...