For a coherent, binary system made up of elements, the exact failure probability requires knowledge statistical dependence all orders among minimal cut sets. Since sets beyond second order is generally difficult to obtain, bounds on have practical value. The upper bound conservative by definition and can be adopted in reliability based decision making. In this paper we propose new hierarchy m-l...

Previous research on materialized views has primarily been in the context of flat relational databases-materialized views defined in terms of one or more flat relations. This paper discusses a broader class of view definitions-materialized views defined over a nested data model such as the nested relational model or an object-oriented data model. An attribute of a tuple deriving the view can be...

This note provides two numerical representations of a nested system strict partial orders. The first representation is based on utility and threshold functions. We generalize the menu-dependent preferences by allowing to depend not only menu but also pair alternatives under comparison. function can be interpreted as distance between alternatives. second aggregation multi-dimensional preference....

Complex event processing (CEP) has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. These monitoring applications must detect complex event pattern sequences in event streams. However, the state-of-art in the CEP literature such as SASE, ZStream or Cayuga either do not support the specification of nest...

We adapted a nested Aspergillus PCR to a nested qualitative real-time format on a Light Cycler system. An evaluation using 134 clinical specimens showed that the real-time PCR assay significantly reduced the time for results to be made available without compromising sensitivity and was less labor-intensive. Its use will aid in the rapid diagnosis of invasive aspergillosis.

Nested Term Graphs are syntactic representations of cyclic term graphs. Via a simple translation they contain-terms as a subset. There exists a characterization of the-terms that unwind to the same tree, presented as a complete proof system. This paper gives a similar characterization for Nested Term Graphs. The semantics of tree unwinding is presented via bisimulations.