Shuffle grouping is a technique used by stream processing frameworks to share input load among parallel instances of stateless operators. With shuffle grouping each tuple of a stream can be assigned to any available operator instance, independently from any previous assignment. A common approach to implement shuffle grouping is to adopt a RoundRobin policy, a simple solution that fares well as ...

In this paper, a necessary and sufficient condition for the existence of an efficient 2-dominating set in a class of circulant graphs has been obtained and for those circulant graphs, an upper bound for the 2domination number is also obtained. For the circulant graphs Cir(n,A), where A = {1, 2, . . . , x, n − 1, n − 2, . . . , n − x} and x ≤ bn−1 2 c, the perfect 2-tuple total domination number...

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...

Phylogenies are useful for organizing knowledge of biological diversity, for structuring classifications, and for providing knowledge of events that occurred during evolution. Different phylogenetic reconstruction techniques are available. In this paper Distance based technique is used. Distance measure is an important issue in phylogenetic analysis. Traditional approaches are time-consuming du...

A careful reader of our recent EMNLP paper (Surdeanu et al., 2012) will observe a somewhat untraditional notation: we use Pi to denote the known positive labels for an entity tuple i, and Ni to denote the set of known negative labels for the same tuple, that is, labels for which tuple i serves as a negative example (introduced in Section 4). This is uncommon: traditionally at training time, an ...