A growing number of applications require support for processing data that is in the form of continuous stream, rather than finite stored data. In this paper we present a new approach for detecting temporal patterns with complex predicates over continuous data stream. Our algorithm efficiently scans the stream with a sliding window, and checks the data inside the window from right-to-left to see...

In previous works, a system for supervised time series classification has been presented. It is based on boosting very simple classifiers: only one literal. The used predicates are based on temporal intervals. There are two types of predicates: i) relative predicates, such as “increases” and “stays”, and ii) region predicates, such as “always” and “sometime”, which operate ver regions in the do...

Abstract predicates are the primary abstraction mechanism for program logics based on access permissions, such as separation logic and implicit dynamic frames. In addition to abstract predicates, it is often useful to also support classical abstraction functions, for instance, to encode side-effect free methods of the program and use them in specifications. However, combining abstract predicate...

The problem of rewriting queries using views has important applications in data integration, query optimization, and physical data independence maintenance. Previous researchers have proposed rewriting algorithms for queries and views that are Datalog programs or conjunctive queries with arithmetic comparisons such as x < y and y ≥ 10. We present a method for finding rewritings of general conju...

The growing importance of enterprise risk management and the resulting integration efforts put the need for separate IT risk management frameworks in question. In this research we analyse common and distinct elements of the COSO enterprise risk management and ISACA Risk IT frameworks. The analysis affirms the hypothesis that separate IT risk management frameworks are redundant.

This paper explores some theoretical properties of summativity, a generalization of cumulativity. It presents an approach to plural semantics in which summativity can apply not only to lexical predicates, but also to partially saturated predicates. It is shown how this approach can be tied to an explicit type-logical syntax.

Almost every theory of vagueness shares at least one feature: it uses, and in most cases heavily relies on, some kind of normative predicate (or predicates) in its metalanguage. Metalinguistic normative predicates are discussed chiefly by supervaluationists and other defenders of higher-order vagueness. According to this group of theorists, the existence of higher-order vagueness depends on and...

ing TCTL Formulas Abstraction predicates are extracted from the timed-bounded modalities of the TCTL formula A new clock variable zi is introduced for every time-bounded operator Example: φ = EG<2 p ∧ A[qU≤4 r] Set of predicates: Ψφ = {z1 < 2 } {{ } ψ1 , z2 ≤ 4 } {{ } ψ2 } Abstract CTL formula: φ̂ = EG(p∧ψ1) ∧ A[qU (r∧ψ2)] Lazy Approximation – p.6 Soundness and Completeness Basis predicates: Set...

We describe a fragment of higher-order Horn logic which can be used as a higher-order extension of Prolog. It allows the programmer to axiomatize predicates of predicates and operations on predicates. The restrictions defining the fragment ensure that the higher-order predicates and operations defined are monotonic and continuous—that they are enumeration operators. As a result, the fragment is...

Floating-point arithmetic provides a fast but inexact way of computing geometric predicates. In order for these predicates to be exact, it is important to rule out all the numerical situations where floating-point computations could lead to wrong results. Taking into account all the potential problems is a tedious work to do by hand. We study in this paper a floating-point implementation of a f...