Pattern matching in pseudo real-time

Pattern matching in pseudo real-time

It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as being local. Informally, a distance function is said to be local if for a pattern P of lengthm and any substring T [i, i+m−1] of a text T , the distance between P and T [i, i+m− 1] can be expressed as Σj∆(P [j], T [i+ j])...

- - - - Constant - time pattern matching for real - time production systems Dale

__________ Many intelligent systems must respond to sensory data or critical environmental conditions in fixed, predictable time. Rule-based systems, including those based on the efficient Rete matching algorithm, cannot guarantee this result. Improvement in execution-time efficiency is not all that is needed here; it is important to ensure constant, O(1) time limits for portions of the matchin...

Pseudo-realtime Pattern Matching: Closing the Gap

We consider the k-difference and k-mismatch problems in the pseudo-realtime model where the text arrives online and the time complexity measure is per arriving character and unamortised. The wellknown k-difference/k-mismatch problems are those of finding all alignments of a pattern of length m with a text of length n where the edit/Hamming distance is at most k. Offline, the literature gives ef...

Real-time, On-line, Low Impact, Temporal Pattern Matching

A temporal pattern matching technique based on formal specifications using Linear Time Temporal Logic (LTL) is described. The method is based on Remote Execution and Monitoring (REM) of LTL assertions. Unlike verification applications where the formal specification is used to locate errors in a corresponding program, REM is not concerened with correctness but rather with temporal pattern detect...

An Automatic Real Time Impedance Matching System for Use in an RF Electrostatics Accelerator Ion Source