The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis of such data, the ability to process the data in a single pass, or a small number of passes, while using little memory, is crucial. We describe such a streaming algorithm that effectively clusters large data streams. We...

Analyzing information is recently becoming much more important than ever, as it is produced massively in every area. In the past years, data streams became more and more important and so were algorithms that can mine hidden patterns out of those non static data bases. Those algorithms can also be used to simulate processes and to find important information step by step. The translation of an En...

Introduction: Emergency Department (ED) records and over-the-counter (OTC) sales data are two of the most commonly used data sources for syndromic surveillance. Most current detection algorithms monitor these data sources separately, and either do not combine them, or combine them in an ad hoc fashion. This paper introduces a causal model that coherently combines the two data sources in order t...

In multicast applications such as video conference which consist of multiple streams, not all streams are of equal interest to all receivers. In this case we believe that this disparity in receiver interest should be reflected in the rate adaptation. This paper presents collaborative rate management architecture, named CRM, for layered multicast streams. CRM estimates shared bottleneck links am...

Processing and querying streams, XML streams in particular, has recently become a widely recognized area of interest both in research and in industry. In contrast to traditional query evaluation for databases, where multiple queries against the same data can be evaluated sequentially, for a streamed environment only the simultaneous execution of multiple queries is feasible, as the sequential e...

Query processing for data streams should be continuous and rapid, which requires strict time constraint. In most previous researches, in order to guarantee this constraint, the evaluation order of join predicates in a continuous query is optimized by a greedy. However, the greedy strategy traces only the first promising plan, so that it often finds a sub-optimal plan. This paper proposes an imp...

Given m groups of streams which consist of n1, . . . , nm coevolving streams in each group, we want to: (i) incrementally find local patterns within a single group, (ii) efficiently obtain global patterns across groups, and more importantly, (iii) efficiently do that in real time while limiting shared information across groups. In this paper, we present a distributed, hierarchical algorithm add...

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for analyzing various components. But the time to analyze a state-based component modeled by TA may be prohibitively high, due to the state space explosion problem....