High Level Efficiency in Database Languages

The subject of this Ph.D. thesis is the design and implementation of database languages. The thesis consists of five articles:  [1] Joan F. Boyar and Kim S. Larsen. Efficient Rebalancing of Chromatic Search Trees. In O. Nurmi and E. Ukkonen, eds., LNCS 621: Algorithm Theory -- SWAT'92 , pp. 151-164. Springer-Verlag, 1992. [2] Kim S. Larsen. On Aggregation and Computation on Domain Values. PB-414, Computer Science Department, Aarhus University, 1992. [3] Kim S. Larsen. Strategies for Expression Evaluation Using Sort-Merge Algorithms. PB-415, Computer Science Department, Aarhus University, 1992. [4] Kim S. Larsen and Michael I. Schwartzbach. Injectivity of Unary Queries With Computation on Domain Values. Computer Science Department, Aarhus University, 1992. Revised version of PB-311. [5] Kim S. Larsen, Michael I. Schwartzbach and Erik M. Schmidt. A New Formalism for Relational Algebra. IPL , 41(3):163-168, 1992. and this survey paper. In [5], a new query language design is proposed. The expressive power of the language is determined in [2] and all reasonable extensions are considered. In [3, 4], we focus on the optimization issue of avoiding unnecessary sorting of relations. The results in these papers are directly applicable to any algebra-based query language. In addition to the query language part, a database system also has to offer update facilities. The theory of standard tuple based updates is quite well developed in the sequential case. In [1], we discuss a new concurrent implementation of balanced search trees for that purpose.This survey paper describes the results of the papers which form the thesis, and relates these results to each other and to the area in a broader sense than is customary in the introductions of individual papers. The paper is intended to be read in combination with the papers on which it is based

Distributed Concurrent Persistent Languages: An Experimental Design and Implementation

A universal persistent object store is a logical space of persistent objects whose localities span over machines reachable over networks. It provides a conceptual framework in which, on one hand, the distribution of data is transparent to application programmers and, on the other, store semantics of conventional languages is preserved. This means the manipulation of persistent objects on remote machines is both syntactically and semantically the same as in the case of local data. Consequently, many aspects of distributed programming in which computation tasks cooperate over different processors and different stores can be addressed within the confines of persistent programming. The work reported in this thesis is a logical generalization of the notion of persistence in the context of distribution. The concept of a universal persistent store is founded upon a universal addressing mechanism which augments existing addressing mechanisms. The universal addressing mechanism is realized based upon remote pointers which although containing more locality information than ordinary pointers, do not require architectural changes. Moreover, these remote pointers are transparent to the programmers. A language, Distributed PS-algol, is designed to experiment with this idea. The novel features of the language include: lightweight processes with a flavour of distribution, mutexes as the store-based synchronization primitive, and a remote procedure call mechanism as the message-based interprocess communication mechanism. Furthermore, the advantages of shared store programming and network architecture are obtained with the introduction of the programming concept of locality in an unobtrusive manner. A characteristic of the underlying addressing mechanism is that data are never copied to satisfy remote demands except where efficiency can be attained without compromising the semantics of data. A remote store operation model is described to effect remote updates. It is argued that such a choice is the most natural given that remote store operations resemble remote procedure calls

Towards epistemic autonomy in adaptive biomimetic middleware for cooperative sensornets

University of Technology, Sydney. Faculty of Engineering and Information Technology.The importance of studying biomimetic models of software infrastructure for sensornet systems lies in the fact that they are not entirely formal models and thus have to cover a range of issues of epistemic autonomy as well as linguistic and mental adaptation. This adaptation considers the context of software ability to reflect upon the verifiability and validity of its actions and measurements. This research elucidates and explores epistemological consequences of embodying biological autonomic patterns in software architectural models. Autonomy in software systems is a complex issue that raises many fundamental inquiries. The proposal is to initially concentrate on transformations of biological paradigms into epistemological queries and then adapt suitable biomimetic mechanisms into the development of software structure and ethology. Such methodology has proven to be very successful in the design of many engineering systems. The approach leads to a better understanding of the ontology of biomimetic patterns in software as well as a confirmation of requirements validity and design verifiability of autonomous software systems. In a dynamic, cooperative but often hostile environment, a software system infrastructure requires autonomic abilities to execute its normal operations, detect faults and perform necessary recovery actions without the need for external intervention. We approach this problem from the point of view of cognitive and mimetic systems research. The simplest way to make an autonomous and adaptive sensornet system is to include a hierarchy of layers in its middleware, not only to monitor activities of its components but to learn and adapt new behavioural patterns of these components in a changing environment. There are situations, however, where the components will not be able to adapt, learn new behaviour and evolve by themselves. For instance, these may not have yet encountered the new situation while others already have. A solution to this problem is to distribute the new behaviour to neighbouring elements via direct and indirect stigmergy mechanisms so that collaborating components can mutually improve their individual and team performance. The main objective is to disallow distribution of multiple versions of the software components and rather allow each software component to acquire and share with others, new “skills”. The components have to compare/verify these new behavioural patterns against their own set of beliefs, desires and intentions. In this thesis we intend to present simulations to test the learning capability of biomimetic algorithms, build a proof-of-concept middleware solution and demonstrate that such systems can not only adapt and evolve but they are robust and highly interoperable (co-operative). The thesis also assesses the suitability of various biomimetic design patterns and algorithms for building autonomic software infrastructure systems for cooperative networked agents

Systematic gripper arrangement for a handling device in lightweight production processes

Handhabungsgeräte sind ein integraler Bestandteil automatisierter Produktionsprozesse. Dennoch werden sie in der Regel als nicht wertschöpfend angesehen, weshalb ihre Planung und Projektierung mit geringem Zeit- und Personalaufwand so effektiv wie möglich sein sollte. Gleichzeitig bleiben sie ein wichtiger Teil der Prozesskette und müssen in diesem Zusammenhang bestimmte Bedingungen erfüllen. Um ihre Funktionalität zu gewährleisten und wenig Zeit in die Projektierung zu investieren, sind Handhabungsgeräte oft überdimensioniert. Insbesondere bei flachen Teilen führt dies zu schweren Handhabungslösungen, bei denen das Gewicht des Handhabungsobjekts und des Handhabungsgerätes in einem Missverhältnis zueinander stehen. Ziel der vorliegenden Arbeit ist es, die Projektierung von Handhabungsgeräten so weit wie möglich zu automatisieren. Dieser Prozess wird am Beispiel der Prozesskette zur Herstellung von Leichtbauteilen mit den Verfahren „sheet molding compound“ (SMC) und „resin transfer molding“ (RTM) dargestellt. In einem ersten Schritt wird ein modulares Handhabungsgerät entwickelt und aufgebaut, das eine große Anzahl von Greiferanordnung ermöglicht. Mit diesem Handhabungsgerät kann dann die resultierende Durchbiegung von flachen Bauteilen mit verschiedenen Greiferanordnungen gemessen werden. Um sicherzustellen, dass es nicht immer notwendig ist die Durchbiegungen zu messen, wird mit ABAQUS ein Modell aufgebaut, das eine Simulation der Durchbiegung ermöglicht. Anhand dieses Simulationsmodells wird eine Designlogik für die Anordnung der Greifer entwickelt. Diese Designlogik arbeitet in zwei Schritten und basiert auf dem Ansatz des „growing neural gas“ (GNG), das durch die Implementierung zusätzlicher Regeln an das Problem angepasst wird. Zuerst wird eine erste Greiferkonfiguration basierend auf der Geometrie des Objekts erstellt, die dann durch einen iterativen Prozess aus Simulation und Anpassung verbessert wird. Da die Herstellung von Leichtbauteilen oft mehr als nur einen Zuschnitt erfordert, werden am Ende systematisch verschiedene Lösungen für die verschiedenen Zuschnitte zu einer Greiferanordnung zusammengefasst und ein Verfahren gezeigt, wie dies ,mit dem zuvor entwickelten modularen Handhabungsgerät realisiert, werden kann

Viaduct : an interactive, very-high-level data manipulation language for a microcomputer-based database system.

Bibliography: leaves 203-210.A very-high-level data manipulation language for a database system is one in which the user specifies in non-procedural terms the operations that are to be performed on the data stored in the database; the actual method by which the operations are executed does not concern the user. VIADUCT provides such an interface to a microcomputer-based database system known as MDBS. Thus VIADUCT allows a microcomputer user lacking in computer sophistication to interact with, and derive the benefits of, a powerful database management system. Additional security restrictions and integrity constraints usually found only on mainframe database management systems are provided by VIADUCT through the mechanism of a subschema generator

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

Active and Data-driven Health and Usage Monitoring of Aircraft Brakes

Aircraft brakes are a safety-critical subsystem, and their prolonged use in each landing maneuver makes them subject to significant wear. Thus, it is crucial to devise efficient methods for monitoring their correct functioning and their health and usage status using the signals available in the Brake Control Unit. This paper proposes and validates an innovative data-driven approach to this problem. The proposed architecture is integrated with the Anti-lock Braking System algorithm providing combined health monitoring and anomaly detection for aircraft brakes in addition to an online estimate of the residual useful life of these components