Results 151 to 160 of about 75,602 (180)

M-DFA (multithreaded DFA)

Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems, 2012
This paper proposes a multi-thread based regular expression (regexp) matching algorithm, M-DFA (multithreaded DFA), for parallel computer architectures such as multi-core processors and graphic processing units (GPU). At the thread level, one thread is designated to traverse the DFA of a possible matching path until its termination, and at the task ...
Cheng-Hung Lin, Jyh-Charn Liu
openaire   +1 more source

Pe-DFA

International Journal of Applied Metaheuristic Computing, 2016
DNA Fragment Assembly (DFA) is a process of finding the best order and orientation of a set of DNA fragments to reconstruct the original DNA sequence from them. As it has to consider all possible combinations among the DNA fragments, it is considered as a combinatorial optimisation problem.
Youcef Gheraibia   +3 more
openaire   +1 more source

Managing DFA History with Queue for Deflation DFA

Journal of Network and Systems Management, 2011
There is an increasing demand for network devices to perform deep packet inspection (DPI) in order to enhance network security. In DPI, the packet payload is compared against a set of predefined patterns that can be specified using regular expressions (regexes).
Yi Tang   +3 more
openaire   +1 more source

Cryptocurrency momentum effect: DFA and MF-DFA analysis

Physica A: Statistical Mechanics and its Applications, 2019
Abstract Cryptocurrency has experienced the skyrocketing and falling back in 2018. Beyond the hype, the specific price movements of different cryptocurrencies should be investigated in a more careful way. Since the cryptocurrency market is a non-linear complex system which are not suitable analyzed by tradition methods, this paper introduces methods ...
Qing Cheng, Xinyuan Liu, Xiaowu Zhu
openaire   +1 more source

SRD-DFA: Achieving Sub-rule Distinguishing with Extended DFA Structure

2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009
Deep Packet Inspection (DPI) relies highly on regular expression due to its power of description, generalization and flexibility. In DPI, packet payload is compared against a large number of rules written in regular expression. To achieve high throughput, multiple regular expressions are combined and compiled into one DFA, which leads to two problems ...
Gao Xia, Xiaofei Wang, Bin Liu
openaire   +1 more source

The house of DFA

Proceedings. IEEE International Symposium on Assembly and Task Planning, 2002
Design for assembly is one of the most important conditions for robotic assembly. In the past years numerous DFA methods have been developed to optimize product and process design, in order to reduce assembly costs. This paper introduces a new simple DFA method for robotic assembly, the so-called house of DFA.
openaire   +2 more sources

A Note on Ordinal DFAs

Order, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bloom, Stephen L., Zhang, Yi Di
openaire   +2 more sources

Partial Word DFAs

2013
Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a "hole" symbol ⋄. If we restrict what the symbol ⋄ can represent, we can use partial words to compress the representation of regular languages.
Eric Balkanski   +3 more
openaire   +1 more source

DFA State Minimization

1977
By now you have probably come across several situations in which you have observed that some automaton could be simplified either by deleting states inaccessible from the start state or by collapsing states that were equivalent in some sense. For example, if you were to apply the subset construction to the NFA Open image in new window accepting the ...
openaire   +1 more source

Home - About - Disclaimer - Privacy