DFA (Design for Assembly) is important in that it potentially can reduce the estimated 15-70% of manufacturing cost that is attributable to assembly. Besides the reduction in cost, DFA promises additional benefits in increased quality, increased reliability, and shorter manufacturing time. While there has been considerable interest in DFA, the research that has been reported in this area tends ...

Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA), and then the production of the unique minimal DFA for the original NFA. We exhibit a parallel disk-based algorithm that uses a cluster of 29 commodity computers to produ...

Differential Fault Attack (DFA) is presently a very well known technique to evaluate security of a stream cipher. This considers that the stream cipher can be weakened by injection of the fault. In this paper we study DFA on three ciphers, namely Grain v1, Lizard and ACORN v3. We show that Grain v1 (an eStream cipher) can be attacked with injection of only 5 faults instead of 10 that has been r...

E cient learning of DFA is a challenging research problem in grammatical inference Both exact and approximate in the PAC sense identi ability of DFA from examples is known to be hard Pitt in his semi nal paper posed the following open research problem Are DFA PAC identi able if ex amples are drawn from the uniform distribu tion or some other known simple distribu tion Pitt We demonstrate that t...

Non-induced expectorated sputum (NIS) stained with tinctorial stains is not considered useful in the diagnosis of Pneumocystis carinii pneumonia (PCP). The diagnostic yield of NIS was evaluated in human immunodeficiency virus (HIV)-infected patients, when stained with a more sensitive direct fluorescent antibody for PCP-direct fluorescent antibody (PC-DFA). A retrospective analysis was carried ...

Giardia lamblia cysts in fecal specimens are detected by conventional morphological methods. The direct immunofluorescence monoclonal antibody assay (DFA) is also applied to detect G. lamblia cysts in feces, but little is known about the usefulness of DFA in fecal specimens stored under various conditions. The aim of the present study was to evaluate the DFA for detection of G. lamblia cysts an...

This paper proposes improved post analysis methods for Differential Fault Analysis (DFA) against AES. In detail, we propose three techniques to improve the attack efficiency as 1) combining previous DFA methods, 2) performing a divide-and-conquer attack by considering the AES key-schedule structure, and 3) taking the linearity of the MixColumns operation into account. As a result, the expectati...

We introduce NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similarly as in Angluin’s popular L algorithm, which, however, learns deterministic finitestate automata (DFA). Like in a DFA, the states of an RFSA represent residual languages. Unlike a DFA, a...

Recently regular expression matching has become a research focus as a result of the urgent demand for Deep Packet Inspection (DPI) in many network security systems. Deterministic Finite Automaton (DFA), which recognizes a set of regular expressions, is usually adopted to cater to the need for real-time processing of network traffic. However, the huge memory usage of DFA prevents it from being a...