We investigate the multiple attribute group decision making (MAGDM) problems in which the attribute values take the form of 2-tuple linguistic information. Motivated by the ideal of dependent aggregation [Xu, Z. S. (2006). Dependent OWA operators. Lecture Notes in Artificial Intelligence, 3885, 172–178], in this paper, we develop some dependent 2-tuple linguistic aggregation operators: the depe...

DEFINITION An XML tuple-based algebra operates on a domain that consists of sets of tuples whose attribute values are items, i.e., atomic values or XML elements (and hence, possibly, XML trees). Operators receive one or more sets of tuples and produce a set, list or bag of tuples of items. It is common that the algebra has special operators for converting XML inputs into instances of the domain...

This thesis describes Tupleware, an implementation of a distributed tuple space which acts as a scalable and efficient cluster middleware for computationally intensive numerical and scientific applications. Tupleware is based on the Linda coordination language (Gelernter 1985), and incorporates additional techniques such as peer-to-peer communications and exploitation of data locality in order ...

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

Graph transformation units are rule-based devices to model and compute relations between initial and terminal graphs. In this paper, they are generalized to graph tuple transformation units that allow one to combine different kinds of graphs into tuples and to process the component graphs simultaneously and interrelated with each other. Moreover, one may choose some of the working components as...