Results 161 to 170 of about 27,251 (199)
Effects of Ingestion of Difructose Anhydride III (DFA III) and the DFA III-Assimilating BacteriumRuminococcus productuson Rat Intestine [PDF]
Bioscience, Biotechnology and Biochemistry, 2006 We have isolated a difructose anhydride III (DFA III)-assimilating bacterium, Ruminococcus productus AHU1760, from human. After an acclimation period of 1 week, male Sprague-Dawley rats (5 weeks old) were divided into four groups (control diet, R ...
Hiroshi Hara +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Managing DFA History with Queue for Deflation DFA
Journal of Network and Systems Management, 2011There 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 0002 +3 more
openaire +1 more source
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 +2 more sources
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 +2 more sources
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
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
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
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
Difructose Dianhydrides (DFAs) and DFA-Enriched Products as Functional Foods
2010This review provides an overview of the current status of the chemistry and biology of di-D-fructose dianhydrides (DFAs) with a focus on their potential as functional foods. The history of this family of cyclic ketodisaccharides has expanded for almost 100 years and offers a paradigmatic example of artificial synthetic molecules that were identified as
Ortiz-Mellet, Carmen +1 more
openaire +3 more sources
Cryptocurrency momentum effect: DFA and MF-DFA analysis
Physica A: Statistical Mechanics and its Applications, 2019Abstract 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
2005
In this paper we describe two different DFA attacks on the AES. The first one uses a fault model that induces a fault on only one bit of an intermediate result, hence allowing us to obtain the key by using 50 faulty ciphertexts for an AES-128. The second attack uses a more realistic fault model: we assume that we may induce a fault on a whole byte. For
openaire +1 more source
In this paper we describe two different DFA attacks on the AES. The first one uses a fault model that induces a fault on only one bit of an intermediate result, hence allowing us to obtain the key by using 50 faulty ciphertexts for an AES-128. The second attack uses a more realistic fault model: we assume that we may induce a fault on a whole byte. For
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, 2009Deep 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 0006, Bin Liu 0001
openaire +2 more sources
DFA minimization in map-reduce
Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2016We describe Map-Reduce implementations of two of the most prominent DFA minimization methods, namely Moore's and Hopcroft's algorithms. Our analysis shows that the one based on Hopcroft's algorithm is more efficient, both in terms of running time and communication cost.
Gösta Grahne +3 more
openaire +1 more source