Automating Integration of Heterogeneous COTS Components

Abstract. Mismatches make COTS components difficult to be incorporated. In this paper, an approach is presented to eliminate mismatches among COTS components, which can truly consider COTS components as black boxes. In the approach, only the assembly description of components is required, based on which adaptors for resolving mismatches can be generated automatically. This paper also described an agent-based GUI implementation of the approach.

Context-Aware Tuples for the Ambient

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 those tuples across all devices. We show that both approaches can lead to an erroneous perception of context. The former ties the perception of context to network connectivity which does not always yield the expected result. The latter causes context to be perceived even if a device has left that context a long time ago. We propose a tuple space approach in which tuples themselves carry a predicate that determines whether they are in the right context or not. We present a practical API for our approach and show its use by means of the implementation of a mobile game

The use of artificial intelligence for safeguarding fuel reprocessing plants

Recorded process data from the ''Minirun'' campaigns conducted at the Barnwell Nuclear Fuel Plant (BNFP) in Barnwell, South Carolina during 1980 to 1981 have been utilized to study the suitability of computer-based Artificial Intelligence (AI) methods for process monitoring for safeguards purposes. The techniques of knowledge engineering were used to formulate the decision-making software which operates on the process data customarily used for process operations. The OPS5 AI language was used to construct an Expert System for this purpose. Such systems are able to form reasoned conclusions from incomplete, inaccurate or otherwise ''fuzzy'' data, and to explain the reasoning that led to them. The programs were tested using minirun data taken during simulated diversions ranging in size from 1 to 20 L of solution that had been monitored previously using conventional procedural techniques. 13 refs., 3 figs

SPARQL Update for Complex Event Processing

Peer reviewe

Argus: Rete + dbms = efficient persistent profile matching on large-volume data streams

Abstract. Efficient processing of complex streaming data presents multiple challenges, especially when combined with intelligent detection of hidden anomalies in real time. We label such systems Stream Anomaly Monitoring Systems (SAMS), and describe the CMU/Dynamix ARGUS system as a new kind of SAMS to detect rare but high value patterns combining streaming and historical data. Such patterns may correspond to hidden precursors of terrorist activity, or early indicators of the onset of a dangerous disease, such as a SARS outbreak. Our method starts from an extension of the RETE algorithm for matching streaming data against multiple complex persistent queries, and proceeds beyond to transitivity inferences, conditional intermediate result materialization, and other such techniques to obtain both accuracy and efficiency, as demonstrated by the evaluation results outperforming classical techniques such as a modern DMBS.

The Correspondence between the Logical Algorithms Language and CHR

This paper investigates the relationship between the Logical Algorithms formalism (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHR rp: CHR with rule priorities and show that the metacomplexity theorem for LA can be applied to a subset of CHR rp via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the required complexity for the meta-complexity theorem to hold and can execute a subset of CHR rp with strong complexity bounds