Changes in the intestinal microbiota of 10 human subjects with long-term ingestion of 3 g/d difructose anhydride III (DFA III; 4 persons, 2 months; 3 persons, 6 months; and 3 persons, 12 months) were examined by denaturing gradient gel electrophoresis (DGGE). According to the answers to questionnaires, the subjects were divided into two groups (constipated and normal). The DGGE profile was diff...

Scanning tunneling microscopy images of diferrocenylacetylene (DFA) coadsorbed with benzene on Au(111) show individual and close-packed DFA molecules, either adsorbed alongside benzene or on top of a benzene monolayer. Images acquired over a range of positive and negative tip-sample bias voltages show a shift in contrast, with the acetylene linker appearing brighter than the ferrocenes at posit...

Hyper-minimization aims to compute a minimal deterministic finite automaton (dfa) that recognizes the same language as a given dfa up to a finite number of errors. Algorithms for hyper-minimization that run in time O(n logn), where n is the number of states of the given dfa, have been reported recently in [Gawrychowski and Jeż: Hyperminimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and ...

Differential Fault Analysis against AES has been actively studied these years. Based on similar assumptions of the fault injection, different DFA attacks against AES have been proposed. However, it is difficult to understand how different attack results are obtained for the same fault injection. It is also difficult to understand the relationship between similar assumptions of fault injection a...

Frameworks for interprocedural data ow analysis (DFA) often have a foundational character: designing concrete applications requires usually a deep understanding of the framework. Here, we reconsider interprocedural DFA from an application-oriented point of view, where all details irrelevant for application are hidden. In this view the underlying framework, which captures programs with mutually ...

Abstract This volume of studies goes back to research work that was carried out as part a long-standing project, Deutscher Familiennamenatlas (DFA). The DFA and the individual record family names in Germany border areas for first time on basis telephone connections (as 2005) with rich map material. considerations selected gathered here are preliminary DFA, which dedicated -mann .

Consider the DFA on the right. It has a particular defined start state. However, we could start it from any of its states. If the original DFA was named M , define Mq to be the DFA with its start state changed to state q. Then the language Lq, is the one accepted if you start at q. For example, in this picture, L3 is (a+b)∗, and L6 is the same. Also, L2 and L5 are both b∗a(a+b)∗. Finally, L7 is...

The concept of Design for Assembly (DFA) assure cost effective assembly process by minimizing the assembly efforts. Part count reduction is one of the primary objective of DFA, which reduces the number of assembly levels and assembly tooling. However reducing part count with modified part geometries do not allow to follow the same assembly sequence that of used earlier. In this contest a framew...

In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA similarly to Binary Decision Diagrams (BDDs). As a result, checking whether two DFAs are equal is a constant-time comparison. A hashbased cache can be used to improve significantly the performance of automata operation...

Nowadays, Deterministic Finite Automaton (DFA) has been widely used to compare packet contents at a constant speed against a set of regular expressions in network security inspections. However, combining multiple regular expressions into a single DFA may cause a serious state explosion, which makes them impractical on large-scale rule set. In order to address this issue, this paper proposed a m...