Filters








2,010 Hits in 2.5 sec

Design of high performance pattern matching engine through compact deterministic finite automata

Piti Piyachon, Yan Luo
2008 Proceedings of the 45th annual conference on Design automation - DAC '08  
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns.  ...  While a bit-DFA method is recently proposed to exploit the parallelism in pattern matching, we identify its limitations and present two schemes, Label Translation Table ( Table ( CLT), to reduce the DFA  ...  The matching procedure searches for predefined patterns in data stream. Growing of pattern sets (e.g. Snort NID) makes matching become one of the most challenging tasks.  ... 
doi:10.1145/1391469.1391685 dblp:conf/dac/PiyachonL08 fatcat:sbfzlsdj55fobe5rikp3fwoh2i

Processing nested complex sequence pattern queries over event streams

Mo Liu, Medhabi Ray, Elke A. Rundensteiner, Daniel J. Dougherty, Chetan Gupta, Song Wang, Ismail Ari, Abhay Mehta
2010 Proceedings of the Seventh International Workshop on Data Management for Sensor Networks - DMSN '10  
These monitoring applications submit complex event queries to track sequences of events that match a given pattern.  ...  CEP must be able to support sophisticated pattern matching on real time event streams including the arbitrary nesting of sequence operators and the flexible use of negation in such nested sequences.  ...  Event instances that satisfy the positive components with no events in the stream relative to this match satisfying the negative components are output. If several adjacent event types are marked by !  ... 
doi:10.1145/1858158.1858164 dblp:conf/dmsn/LiuRRDGWAM10 fatcat:hjx5blrgurbn3fnelqp2ycubte

Permutation Editing and Matching via Embeddings [chapter]

Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp
2001 Lecture Notes in Computer Science  
-We consider a novel class of problems called permutation matching problems which are similar to string matching problems, except that the pattern is a permutation (rather than a string) and present linear  ...  finding permutation distances in the "data stream" model.  ...  The problem of Approximate Permutation Matching is, given a long text string and a pattern permutation, to find all occurrences of the pattern in the text with at most a given threshold of distance.  ... 
doi:10.1007/3-540-48224-5_40 fatcat:avbcyu23djdfhk37g2523dwmqa

Learning in the Wild with Incremental Skeptical Gaussian Processes

Bontempelli Andrea, Teso Stefano, Giunchiglia Fausto, Passerini Andrea
2021 Zenodo  
Poster of the paper "Learning in the Wild with Incremental Skeptical Gaussian Processes".  ...  In: Pattern recognition and image analysis.  ...  ■ Interactive Classification in the WildGiven a stream of instances x1, x2, …, xt such that: with precision matrix: Prob. of positive class is: Learning in the Wild with Incremental Skeptical Gaussian  ... 
doi:10.5281/zenodo.5055507 fatcat:kmo2asedkbbt7mbuzglmxs4qga

Efficient GPU-Based Graph Cuts for Stereo Matching

Young-kyu Choi, In Kyu Park
2013 2013 IEEE Conference on Computer Vision and Pattern Recognition Workshops  
Finally, we propose a low-overhead global relabeling algorithm to increase the GPU occupancy ratio.  ...  Next, a repetitive block-based push and relabel method is used to increase the data transfer efficiency.  ...  Introduction Graph cuts (GC) has been successfully applied to many computer vision and pattern recognition tasks.  ... 
doi:10.1109/cvprw.2013.97 dblp:conf/cvpr/ChoiP13 fatcat:pdrfgsbsfvd6vaqxicsttf7qiq

Compact State Machines for High Performance Pattern Matching

Piti Piyachon, Yan Luo
2007 Proceedings - Design Automation Conference  
Recently, parallel pattern matching engines, based on ASICs, FPGAs or network processors, perform matching with multiple state machines.  ...  Pattern matching algorithms normally rely on state machines to detect predefined patterns.  ...  INTRODUCTION Pattern matching searches for predefined patterns in data streams.  ... 
doi:10.1109/dac.2007.375215 fatcat:4j3gfp7wirdy7isiuxlbtckulm

Compact state machines for high performance pattern matching

Piti Piyachon, Yan Luo
2007 Proceedings - Design Automation Conference  
Recently, parallel pattern matching engines, based on ASICs, FPGAs or network processors, perform matching with multiple state machines.  ...  Pattern matching algorithms normally rely on state machines to detect predefined patterns.  ...  INTRODUCTION Pattern matching searches for predefined patterns in data streams.  ... 
doi:10.1145/1278480.1278607 dblp:conf/dac/PiyachonL07 fatcat:hrbjqexiobca7cknvk4fom4dlm

An operational semantics for skeletons [chapter]

M. Aldinucci, M. Danelutto
2004 Advances in Parallel Computing  
As expected the parallelism exploited is reduced with respect to the steady state phase, that is matched by the second application.  ...  It marks the begin of stream by introducing ⊥ (empty stream) and labels the input stream with ⊥.  ... 
doi:10.1016/s0927-5452(04)80011-x fatcat:xq23mazwcrgxla4gauesa3ficq

Event-Driven Dashboarding and Feedback for Improved Event Detection in Predictive Maintenance Applications

Pieter Moens, Sander Vanden Hautte, Dieter De Paepe, Bram Steenwinckel, Stijn Verstichel, Steven Vandekerckhove, Femke Ongenae, Sofie Van Hoecke
2021 Applied Sciences  
This approach enables manufacturers to collect labeled data for refining event classification techniques with reduced human labeling effort.  ...  This synergy allows a transition from detecting only unlabeled events, such as anomalies, at the start to detecting labeled events, such as faults, with meaningful descriptions.  ...  Event Reasoning Time (s) Unknown pattern 0.452 (±0.012 std) Semantic fault 0.500 (±0.031 std) Known pattern 0.481 (±0.026 std) Relabeled event 0.457 (±0.011 std) Merged event 0.458 (±0.013 std) Relabeled  ... 
doi:10.3390/app112110371 fatcat:geahbfa6evc4flkm5z7vv4idtu

The use of mixers in heat recovery system design

Chuei-Tin Chang, Lien-Cheng Chen
1997 Chemical Engineering Science  
The feasibility and effectiveness of this approach is demonstrated with five examples.  ...  In particular, design problems associated with the heat recovery systems in chemical processes are discussed in detail.  ...  For the sake of conciseness, the previously described fictitious streams are now relabeled with single indices, i.e.  ... 
doi:10.1016/s0009-2509(96)00395-8 fatcat:lqzoksczwfhurcbnmndszzlrey

Executive Function: A Contrastive Value Policy for Resampling and Relabeling Perceptions via Hindsight Summarization? [article]

Chris Lengerich, Ben Lengerich
2022 arXiv   pre-print
This is made feasible by the use of a memory policy and a pretrained network with inductive biases for a grammar of learning and is trained to maximize evolutionary survival.  ...  the few-shot continual learning task from first principles and hypothesize an evolutionary motivation and mechanism of action for executive function as a contrastive value policy which resamples and relabels  ...  Resampling and Relabeling Data Via Memory and Hindsight Summarization The average human reaction time is 250ms and the human eye has a resolution of 576 megapixels, resulting in a data stream of at least  ... 
arXiv:2204.12639v1 fatcat:x7oxt3otxzez3prdrrivvutfky

A framework for traversing dense annotation lattices

Branimir Boguraev, Mary Neff
2010 Language Resources and Evaluation  
This particular characteristic presents challenges for the design of a pattern matching framework capable of interpreting 'flat' patterns over arbitrarily dense annotation lattices.  ...  Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories-the common representation basis for modern pipelined  ...  The boundary declaration caters for other situations where the scope of pattern application is important: we would not want to, for instance, have the [Subj]-[Obj] relabeling pattern (outlined in Sect.  ... 
doi:10.1007/s10579-010-9123-y fatcat:uh46qof5jzcrfm7al6lla5azpa

Skeleton-based parallel programming: Functional and parallel semantics in a single shot

Marco Aldinucci, Marco Danelutto
2007 Computer languages, systems & structures  
The main goal of these programming environments is to provide programmers with handy, effective ways of writing parallel applications.  ...  In particular, skeleton based parallel programming environments automatically deal with most of the difficult, cumbersome programming problems that must be usually handled by programmers of parallel applications  ...  patterns.  ... 
doi:10.1016/j.cl.2006.07.004 fatcat:dr3l2yfhg5ei7odgdb5gc5cdyy

TJDewey – On the Efficient Path Labeling Scheme Holistic Approach [chapter]

Radim Bača, Michal Krátký
2009 Lecture Notes in Computer Science  
We introduce the TJDewey algorithm which combines the TJFast algorithm with the DataGuide summary tree.  ...  In recent years, many approaches to XML twig pattern searching have been developed.  ...  Searching of matching labeled paths is called stream pruning in [5] . In [2] , authors show that the problem is identical with the query matching in a DataGuide tree.  ... 
doi:10.1007/978-3-642-04205-8_3 fatcat:tsscmufu3vfarmgvmhsl6nsyzq

Adaptive XML Stream Classification Using Partial Tree-Edit Distance [chapter]

Dariusz Brzezinski, Maciej Piernik
2014 Lecture Notes in Computer Science  
However, existing classification algorithms are designed for static XML collections, while modern information systems frequently deal with streaming data that needs to be processed on-line using limited  ...  XStreamClass was experimentally compared with four state-of-the-art data stream ensembles and provided best average classification accuracy on real and synthetic datasets simulating different drift scenarios  ...  XStreamClass needs to calculate the PTED between a document and each pattern, which is computationally more expensive than simple subtree matching.  ... 
doi:10.1007/978-3-319-08326-1_2 fatcat:njgjkeb2czaddnoterpztxcqby
« Previous Showing results 1 — 15 out of 2,010 results