Deferoxamine (DFA, N'-[5-(acetyl-hydroxy-amino)-pentyl]-N-[5-[3-(5-aminopentyl-hydroxy-carbamoyl) propanoylamino]pentyl]-N-hydroxy-butane diamide) is a chelating agent used to remove excess iron from the body and to reduce organ and tissue damage. DFA enhances both iron regulatory protein 1 (IRP1) expression and its endoplasmic reticulum (ER) membrane-binding activity, as occurs in hypoxia, an ...

Deterministic finite automata (DFA) have long served as a fundamental computational model in the study of theoretical computer science, and the problem of learning a DFA from given input data is a classic topic in computational learning theory. In this paper we study the learnability of a random DFA and propose a computationally efficient algorithm for learning and recovering a random DFA from ...

BACKGROUND Equine influenza (EI) is a highly contagious respiratory disease of horses. OBJECTIVES The aim of this study was to evaluate two rapid antigen detection kits (Directigen or DFA, and Espline) and a commercial ELISA for the detection of EI nucleoprotein in nasal swabs. METHOD Nasal swab samples from naturally and experimentally infected horses were used to compare the sensitivity a...

Detrended fluctuation analysis (DFA) is one of the most frequently used fractal time series algorithms. DFA has also become the tool of choice for analysis of the short-time fluctuations despite the fact that its validity in this domain has never been demonstrated. We adopt an Ornstein-Uhlenbeck Langevin equation to generate a time series which exhibits short-time powerlaw scaling and incorpora...

We performed a cost analysis study using decision tree modeling to determine whether the use of multiplex PCR testing for respiratory viruses (xTAG RVP test) is a more or less costly strategy than the status quo testing methods used for the diagnosis of respiratory virus infections in pediatric patients. The decision tree model was constructed by using four testing strategies for respiratory vi...

We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results.

We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongly connected DFA, the isomorphism problem for a set of strongly connected minimized DFAs, and the minimization of a connected DFA consisting in two strongly connected components, both of which are minimized. We apply this proced...

A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. Černy conjectured in 1964 that every nstate synchronizable automaton possesses a synchronizing word of length at most (n− 1). The problem is still open. It will be proved that the minimal length of synchronizing word is not grea...

In this paper we describe two different DFA attacks on the AES. The first one uses a theoretical 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 an AES-128, this second attack...