Filters








13 Hits in 6.6 sec

An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata

Madoda Nxumalo, Derrick G Kourie, Loek Cleophas, Bruce W Watson
2017 South African Computer Journal  
Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs).  ...  Since the classical Aho-Corasick algorithm builds an optimal FDFA from such a set (and only from such a set), it provides benchmark FDFAs against which the performance of the general algorithms can be  ...  INTRODUCTION Deterministic finite automata (DFAs) are widely studied and used in Computer Science.  ... 
doi:10.18489/sacj.v29i1.456 fatcat:vsluvfz5dzgmfp3npzbytxhmru

Flexible RNA design under structure and sequence constraints using formal languages [article]

Yu Zhou , Stéphane Vialette, Jérôme Waldispühl, Yi Zhang, Alain Denise
2013 arXiv   pre-print
To this purpose, we develop a general framework based on concepts of language theory, namely context-free grammars and finite automata.  ...  From there, we use generic generic algorithms to perform a (weighted) random generation, or an exhaustive enumeration, of candidate sequences.  ...  Therefore, we propose ad-hoc constructs based on the Aho-Corasick automaton, leading to much smaller automata. Formal language constructs.  ... 
arXiv:1305.3830v2 fatcat:awgsrpl4ird3xhlhquoqjuqtqa

Flexible RNA design under structure and sequence constraints using formal languages

Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispuhl, Yi Zhang, Alain Denise
2007 Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics - BCB'13  
To this purpose, we develop a general framework based on concepts of language theory, namely context-free grammars and finite state automata.  ...  From there, we use generic algorithms to perform a (weighted) random generation, or an exhaustive enumeration, of candidate sequences.  ...  Therefore, we propose ad-hoc constructs based on the Aho-Corasick automaton, leading to much smaller automata. Formal language constructs.  ... 
doi:10.1145/2506583.2506623 dblp:conf/bcb/ZhouPVWZD13 fatcat:4qy5xpq2nbgtlaxkhxcxexm4ty

Spam Filtering through Multiple Pattern Bit Parallel String Matching Combining Shift AND & OR

Vidya Saikrishna, Akhtar Rasool, Nilay Khare
2013 International Journal of Computer Applications  
Both method shows improvement over the Aho Corasick algorithm in context of space complexity and also behaves as an efficient filter and reducing the number of false matches as present in Shift OR method  ...  Traditionally Aho Corasick algorithm was used to filter spam which constructs a trie of the spam keywords.  ...  The following sections describe types of spam filters, traditional method of spam filtering through Aho-Corasick algorithm and Bit parallel method of filtering spam.  ... 
doi:10.5120/9926-4552 fatcat:qom2u7hmyzhphoyw6cykt5ofrq

A Secure Live Signature Verification with Aho–Corasick Histogram Algorithm for Mobile Smart Pad

Kuo-Kun Tseng, He Chen, Charles Chen, Charinrat Bansong
2021 Electronics  
A new AhoCorasick Histogram mechanism is proposed to perform this live signature verification.  ...  According to our experiment result, the proposed algorithm has satisfying performance in terms of speed and accuracy with an average of 91% accuracy.  ...  Aho-Corasick (AC) automata can be defined as 5-tuple symbols (Q, ∑ , q 0 , δ, F) where Q is a finite set of states, ∑ is a finite set of input symbols (also called the alphabet), δ(Q × ∑ → Q) is a transition  ... 
doi:10.3390/electronics10111337 fatcat:w6w4y4ycsvbmjpjmnxewmnqytu

A Review on Machine Learning and Deep Learning Techniques Applied to Liquid Biopsy [chapter]

Arets Paeglis, Boriss Strumfs, Dzeina Mezale, Ilze Fridrihsone
2018 Liquid Biopsy [Working Title]  
In this chapter, we attempt to review the state of ML and DL fields as applied to the analysis of liquid biopsy data and summarise the available corpus of techniques and methodologies.  ...  For more than a decade, machine learning (ML) and deep learning (DL) techniques have been a mainstay in the toolset for the analysis of large amounts of weakly correlated or high-dimensional data.  ...  Conflict of interest The authors declare that the chapter was written in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.  ... 
doi:10.5772/intechopen.79404 fatcat:ydcnwek7argurcs67lrrwp7x5e

A Scalable High-Performance Virus Detection Processor Against a Large Pattern Set for Embedded Network Security

Chieh-Jen Cheng, Chao-Ching Wang, Wei-Chun Ku, Tien-Fu Chen, Jinn-Shyan Wang
2012 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
However, the solutions in the literature for firewalls are not scalable, and they do not address the difficulty of an antivirus with an ever-larger pattern set.  ...  Instead of placing entire matching patterns on a chip, our solution is a two-phase dictionary-based antivirus processor that works by condensing as much of the important filtering information as possible  ...  Most automata-based approaches are based on the algorithm [8] proposed by Aho and Corasick in 1975 .  ... 
doi:10.1109/tvlsi.2011.2119382 fatcat:6srmktwk4rcsniwlwojbp5avja

Fast Regular Expression Matching Using Small TCAM

Chad R. Meiners, Jignesh Patel, Eric Norige, Alex X. Liu, Eric Torng
2014 IEEE/ACM Transactions on Networking  
We tested our techniques on eight real-world RE sets, and our results show that small TCAMs can be used to store large deterministic finite automata (DFAs) and achieve potentially high RE matching throughput  ...  In this paper, we propose the first hardware-based RE matching approach that uses ternary content addressable memory (TCAM), which is available as off-the-shelf chips and has been widely deployed in modern  ...  RE matching algorithms are typically based on the deterministic finite state automata (DFA) representation of regular expressions.  ... 
doi:10.1109/tnet.2013.2256466 fatcat:abvllhjfnnacfo7jbkys6xvijq

String Pattern Matching for a Deluge Survival Kit [chapter]

Alberto Apostolico, Maxime Crochemore
2002 Massive Computing  
This is an application of the Aho-Corasick algorithm to the trie, and results in a linear-time algorithm.  ...  The general methods to build antidictionaries are based on data structures that store substrings of words, such as suffix tries, suffix trees, dawgs, and suffix or factor automata.  ... 
doi:10.1007/978-1-4615-0005-6_6 fatcat:zx3uoflljbfs7oyclwxk2ic2ua

An architecture for exploiting multi-core processors to parallelize network intrusion prevention

Robin Sommer, Vern Paxson, Nicholas Weaver
2009 Concurrency and Computation  
At the lowest layer of the architecture is an 'Active Network Interface', a custom device based on an inexpensive FPGA platform.  ...  We need to be able to express the analysis in a form that is independent of the memory and threading parameters of a given CPU, so we can automatically retarget the implementations of analysis algorithms  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors or originators and do not necessarily reflect the views of the National Science Foundation  ... 
doi:10.1002/cpe.1422 fatcat:7yq5tk4n2neenmtbpr5jnkeatq

An architecture for exploiting multi-core processors to parallelize network intrusion prevention

Vern Paxson, Robin Sommer
2007 2007 IEEE Sarnoff Symposium  
At the lowest layer of the architecture is an 'Active Network Interface', a custom device based on an inexpensive FPGA platform.  ...  We need to be able to express the analysis in a form that is independent of the memory and threading parameters of a given CPU, so we can automatically retarget the implementations of analysis algorithms  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors or originators and do not necessarily reflect the views of the National Science Foundation  ... 
doi:10.1109/sarnof.2007.4567341 fatcat:5e3n2zwfbbdrjkpnvcwloxsa6m

Associative transducers for the parallel processing of streaming data

Peter Ogden, David Thomas, BAE SYSTEMS (Firm) ; Engineering And Physical Sciences Research Council
2017
At the same time CPU clock-speeds are stagnating so parallel algorithms are needed to process the high rate of data with low query response times.  ...  This thesis introduces a new computational model of associative transducers which transforms the execution of a transducer into an associative operator, associativity which is then used to provide highly  ...  Fixed strings allow for a variant of the Aho-Corasick [4] algorithm to be used and the starting offsets to be found by simple subtraction.  ... 
doi:10.25560/50190 fatcat:uidvxefzhrbnrmieqaubwrdtj4

Scalable and Declarative Information Extraction in a Parallel Data Analytics System [article]

Astrid Rheinländer, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2017
Based on this observation, an extensible, logical optimizer (SOFA) is introduced, which incorporates the semantics of UDFs into the optimization process.  ...  Hereby, we systematically evaluate scalability and robustness of the employed methods and tools in order to pinpoint the most critical challenges in building an IE system for very large data sets.  ...  For example, the runtime complexity of automaton-based algorithms performing Named Entity Recognition (NER) using a fixed dictionary of search terms is O(|search terms| + |sentence length|) [Aho and Corasick  ... 
doi:10.18452/17996 fatcat:5bjjxw4uibg4hj2jjbpgbznzvm