We study the relationships between the correctness of logic program transformation and program termination. We consider deenite programs and we identify somèinvariants' of the program transformation process. The validity of these invariants ensures the preservation of the success set semantics, provided that the existential termination of the initial program implies the existential termination ...

We describe a simple and fast algorithm for identifying friends-of-friends clusters and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our re...

We present an approach for a generic, multidimensional run-time data structure suitable for highperformance scientific computing in C++. Our approach for associating meta-information with the data structure as well as different underlying datatypes is depicted. The highperformance, multi-dimensional data access is realized by utilizing a heterogenous compile-time container generation function. ...

Title of Document: ROVER: ARCHITECTURAL SUPPORT FOR EXPOSING AND USING CONTEXT Christian Butiu Almazan, Doctor of Philosophy, 2010 Directed By: Professor Ashok K. Agrawala, Department of Computer Science Technology has advanced to the point where many people feel it has created a world with an insurmountable amount of information. Information includes messages people send to each other, logged ...

0. Introduction I. Takeuchi defined the following recursive function, called the tarai function, in [5]. t(x, y, z) = if x ≤ y then y else t(t(x− 1, y, z), t(y − 1, z, x), t(z − 1, x, y)) This function requires many recursive calls even for small x, y, and z, so it is used to see how effectively the programming language implementation handles recursive calls. In [3], J. McCarthy proved that thi...

This paper describes a new syntax that can be used to write OWL ontologies, and fragments of OWL ontologies for presentation and editing purposes. The syntax, which is known as the Manchester OWL Syntax, was developed in response to a demand from a wide range of users, who do not have a Description Logic background, for a“less logician like” syntax. The Manchester OWL Syntax is derived from the...

Advances in networking and storage technologie.; have made it possible to build multimedia on-demand servers that provide service similar to those of neighhorhood videotape rental stores. In this work. we p p o s e a speciaiized high-perforniance programmable multiprocessor architecture which allows continuous playback of mediastreams to large number of clients, a critical factor in multimedia ...

This paper presents experiences from the modelbased development of a framework for a middleware targeting the needs for self-management and context awareness in automotive systems. The major focus is on a simulation platform and a reference implementation of the middleware architecture. We also discuss challenges and possible future extensions.

Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the basic method to run concurrently and efficiently on a modern computing platform. In this paper we investigate the use of prefetching to further improve the efficiency of the reference-counting collector. We propose p...