Results 241 to 250 of about 29,290 (288)

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, Abdelouahab Moussaoui, Sohag Kabir, Smaine Mazouzi   +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, Junchen Jiang, Chengchen Hu, Bin Liu   +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

Regular expression matching with pipelined delayed input DFAs for high-speed networks

Symposium on Architectures for Networking and Communications Systems, 2018
Regular expression matching (RE matching) is a widely used operation in network security monitoring applications. With the speed of network links increasing to 100 Gbps and 400 Gbps, it is necessary to speed up packet processing and provide RE matching ...
Denis Matousek, J. Kubis, J. Matoušek, J. Korenek   +3 more
semanticscholar   +1 more source

Finding DFAs with Maximal Shortest Synchronizing Word Length

Language and Automata Theory and Applications, 2016
It was conjectured by Cerný in 1964 that a synchronizing DFA on n states always has a shortest synchronizing word of length at most \((n-1)^2\), and he gave a sequence of DFAs for which this bound is reached.
H. Don, H. Zantema
semanticscholar   +1 more source

Delocalization error: The greatest outstanding challenge in density‐functional theory

WIREs Computational Molecular Science, 2022
Every day, density‐functional theory (DFT) is routinely applied to computational modeling of molecules and materials with the expectation of high accuracy.
K. R. Bryenton, A. A. Adeleke, Stephen G. Dale, E. Johnson   +3 more
semanticscholar   +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

Efficient Minimization of DFAs with Partial Transition Functions

Symposium on Theoretical Aspects of Computer Science, 2008
Let PT-DFA mean a deterministic finite automaton whose transition relation is a partial function. We present an algorithm for minimizing a PT-DFA in $O(m lg n)$ time and $O(m+n+alpha)$ memory, where $n$ is the number of states, $m$ is the number of
A. Valmari, Petri Lehtinen
semanticscholar   +1 more source

Assessing Density Functional Theory for Chemically Relevant Open-Shell Transition Metal Reactions.

Journal of Chemical Theory and Computation, 2021
Due to the principle lack of systematic improvement possibilities of density functional theory, careful assessment of the performance of density functional approximations (DFAs) on well-designed benchmark sets, for example, for reaction energies and ...
Leonard R. Maurer, M. Bursch, S. Grimme, A. Hansen   +3 more
semanticscholar   +1 more source