Abstract. The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects are very large that only a subset of them can fit in memory at a time. This paper addresses the problem

phase is sufficiently smooth so as to endure map refinement largely unaltered. On the other hand, it offers the advantage of being more reliable in clearing modulus object contrast from raw maps. This is because a body coil reference cannot be acquired quite simultaneously with the array reference

In this paper, we address the problem of memory usage optimization in the evaluation of data-dependent program regions involving large data objects. We are interested in situations where the data objects are so large to fit in memory that they have to be dynamically allocated and deallocated during

. The communication tree is introduced as a useful representation for array expressions involving associative and commutative operators of one kind. Procedures for estimating communication and temporary memory costs for a communication tree are described. An efficient polynomial-time algorithm to determine

the heterogeneity arising in XML query processing, while avoiding redundant work. We present an algorithm to obtain a TLC algebra expression from an XQuery statement (for a large fragment of XQuery). We show how to implement the TLC algebra effi-ciently, introducing the nest-join as an important physical operator

and backchase

expressions involving primitive events and some operators: boolean conjunction and disjunction; sequence, repetition, and absolute, periodic and relative timer events. A concrete result of this work was the design and implementation of a general-purpose Event Processing Service (EPS) which may be used

of the emotional expressions of others One aspect of this definitional process involves the factual qualities ascribed to the attitude object Another aspect of this definitional process involves the moral qualities highlighted in the object (see As the foregoing discussion implies, attitudes do not follow from

objective is expressed as the average estimation error. A-GAP is decentralized and asynchronous to achieve robustness and scalability. It executes on an overlay that interconnects management processes on the devices. On this overlay, the protocol maintains a spanning tree and updates the network state

We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay