Plan-based Complex Event Detection across Distributed Sources


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Complex Event Processing RSS News Plan-based Complex Event Detection across Distributed Sources
# 1  
Old 09-25-2008
Plan-based Complex Event Detection across Distributed Sources

Tim Bass
09-25-2008 09:49 AM
Here is an interesting 2008 paper, Plan-based Complex Event Detection across Distributed Sources.

Abstract
Complex Event Detection (CED) is emerging as a key capability for many monitoring applications such as intrusion detection, sensorbased activity & phenomena tracking, and network monitoring. Existing CED solutions commonly assume centralized availability and processing of all relevant events, and thus incur significant overhead in distributed settings. In this paper, we present and evaluate communication efficient techniques that can efficiently perform CED across distributed event sources.

Our techniques are plan-based: we generate multi-step event acquisition and processing plans that leverage temporal relationships among events and event occurrence statistics to minimize event transmission costs, while meeting application-specific latency expectations. We present an optimal but exponential-time dynamic programming algorithm and two polynomial-time heuristic algorithms, as well as their extensions for detecting multiple complex events with common sub-expressions. We characterize the behavior and performance of our solutions via extensive experimentation on synthetic and real-world data sets using our prototype implementation.

Source...
Login or Register to Ask a Question

Previous Thread | Next Thread
Login or Register to Ask a Question
Complex(3o)							   OCaml library						       Complex(3o)

NAME
Complex - Complex numbers. Module Module Complex Documentation Module Complex : sig end Complex numbers. This module provides arithmetic operations on complex numbers. Complex numbers are represented by their real and imaginary parts (carte- sian representation). Each part is represented by a double-precision floating-point number (type float ). type t = { re : float ; im : float ; } The type of complex numbers. re is the real part and im the imaginary part. val zero : t The complex number 0 . val one : t The complex number 1 . val i : t The complex number i . val neg : t -> t Unary negation. val conj : t -> t Conjugate: given the complex x + i.y , returns x - i.y . val add : t -> t -> t Addition val sub : t -> t -> t Subtraction val mul : t -> t -> t Multiplication val inv : t -> t Multiplicative inverse ( 1/z ). val div : t -> t -> t Division val sqrt : t -> t Square root. The result x + i.y is such that x > 0 or x = 0 and y >= 0 . This function has a discontinuity along the negative real axis. val norm2 : t -> float Norm squared: given x + i.y , returns x^2 + y^2 . val norm : t -> float Norm: given x + i.y , returns sqrt(x^2 + y^2) . val arg : t -> float Argument. The argument of a complex number is the angle in the complex plane between the positive real axis and a line passing through zero and the number. This angle ranges from -pi to pi . This function has a discontinuity along the negative real axis. val polar : float -> float -> t polar norm arg returns the complex having norm norm and argument arg . val exp : t -> t Exponentiation. exp z returns e to the z power. val log : t -> t Natural logarithm (in base e ). val pow : t -> t -> t Power function. pow z1 z2 returns z1 to the z2 power. OCamldoc 2012-06-26 Complex(3o)