The amplitude fluctuations of ongoing oscillations in the electroencephalographic (EEG) signal of the human brain show autocorrelations that decay slowly and remain significant at time scales up to tens of seconds. We call these long-range temporal correlations (LRTC). Abnormal LRTC have been observed in several brain pathologies, but it has remained unknown whether genetic factors influence th...

This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser that encodes the admissible parsing states as a DFA. This DFA is automatically constructed from the XML schemas of XML messages using a code generator. A twolevel DFA architecture is used to increase efficiency and to re...

Mechanisms of increased epithelial lung clearance of DTPA in diffuse fibrosing alveolitis. S. Labrune, Th. Chinet, M.A. Collignon, L. Barritault, G.J. Huchon. ERS Journals Ltd 1994. ABSTRACT: The aim of this study was to elucidate possible mechanisms of increased epithelial lung clearance in diffuse fibrosing alveolitis (DFA). We investigated the relationships between epithelial lung clearance...

Given a DFA we consider the random walk that starts at the initial state and at each time step moves to a new state by taking a random transition from the current state. This paper shows that for typical DFA this random walk induces an ergodic Markov chain. The notion of typical DFA is formalized by showing that ergodicity holds with high probability when a DFA is sampled uniformly at random fr...

Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...

Characterization of all possible faults in a cryptosystem exploitable for fault attacks is a problem which is of both theoretical and practical interest for the cryptographic community. The complete knowledge of exploitable fault space is desirable while designing optimal countermeasures for any given crypto-implementation. In this paper, we address the exploitable fault characterization proble...

Marine ecologists commonly use discriminant function analysis (DFA) to evaluate the similarity of distinct populations and to classify individuals of unknown origin to known populations. However, investigators using DFA must account for (1) the possibility of correct classification due to chance alone, and (2) the influence of prior probabilities of group membership on classification results. A...

BACKGROUND AND OBJECTIVES Patients with severe kidney function impairment often have autonomic dysfunction, which could be evaluated noninvasively by heart rate variability (HRV) analysis. Nonlinear HRV parameters such as detrended fluctuation analysis (DFA) has been demonstrated to be an important outcome predictor in patients with cardiovascular diseases. Whether cardiac autonomic dysfunction...

It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently. We present a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth-first search (BFS) ...