Diagnosis of malfunctioning deep-submicron (DSM) ICs is becoming more dificult due to the increasing sophistication of the manufacturing process and the structural complexity of the IC itself: At the same time, key diagnostic tusks that include defect localization are still solved using primitive models of the IC’s defects. This paper explores the use of “jault tuples” in diagnosis. Fault tuple...

Developing software for dynamic pervasive computing networks can be an intimidating prospect. While much research has focused on developing and describing algorithms and protocols for these environments, the process of deploying these technologies is far from mature or streamlined. Furthermore, the heterogeneity of computing platforms present in pervasive computing networks can make the deploym...

A (v, b, r, k) combinatorial configuration is a (r, k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some cryptographic applications to sensor networks and to peerto-peer communities. Configurable tuples are those tuples (v, b, r, k) for which a (v, b, r, k) combinatori...

The Iceberg SemiJoin (ISJ) of two datasets R and S returns the tuples in R which join with at least k tuples of S. The ISJ operator is essential in many practical applications including OLAP, Data Mining and Information Retrieval. In this paper we consider the distributed evaluation of Iceberg SemiJoins, where R and S reside on remote servers. We developed an efficient algorithm which employs B...

Fast join methods implemented in a relational database processor, RINDA, are described. RINDA performs complex queries including sorts and joins with specialized hardware. Join operations by RINDA are executed in three phases: filtering phase, sorting phase and merge-join phase. In the filtering phase, unjoinable tuples are removed with hashed-bit-arrays. Remaining tuples are sorted in the sort...

Nevins, T.A., Degrees of convex dependence in recursively enumerable vector spaces, Annals of Pure and Applied Logic 60 (1993) 31-47. Let W be a recursively enumerable vector space over a recursive ordered field. We show the Turing equivalence of the following sets: the set of all tuples of vectors in W which are linearly dependent; the set of all tuples of vectors in W whose convex closures co...

We address the problem of skyline query processing for a count-based window of continuous streaming data that involves both totallyand partially-ordered attribute domains. In this problem, a fixedsize buffer of the N most recent tuples is dynamically maintained and the key challenge is how to efficiently maintain the skyline of the sliding window of N tuples as new tuples arrive and old tuples ...

It is desirable to employ compression techniques in Relational OLAP systems to reduce disk space requirements and increase disk I/O throughput. Tuple Differential Coding (TDC) techniques have been introduced to compress views on a tuple level by storing only the differences between consecutive ordered tuples. These techniques work well for highly regular data in which the differences between tu...

Abstract. As a natural outgrowth of the work done in [18] and [21], we introduce an abstract framework to study generating m-tuples, and use it to analyze hypercontractivity and hyperexpansivity in several variables. These two notions encompass (joint) hyponormality and subnormality, as well as toral and spherical isometric-ness; for instance, the Drury-Arveson 2-shift is a spherical complete h...

In tuple space approaches to context-aware mobile systems, the notion of context is defined by the presence or absence of certain tuples in the tuple space. Existing approaches define such presence either by collocation of devices holding the tuples or by replication of tuples across all devices. We show that both approaches can lead to an erroneous perception of context. Collocation ties the p...