Paired nasopharyngeal aspirate (NPA) and midturbinate flocked-swab specimens from 153 children with respiratory symptoms were examined by the direct fluorescent antibody (DFA) technique. Seventy-four infants (49%) had a viral infection documented by DFA. The flocked-swab specimens had 93% sensitivity and 96.7% agreement with the NPA specimens, with a kappa coefficient of 93.4% (95% confidence i...

Abstract Indices of relative abundance are one the most important inputs into a stock assessment model. For many species, we must rely on several indices that routinely conflict with each other and which may result in biased uncertain outputs. Here, explored whether reconciled trends obtained from dynamic factor analysis (DFA) applied to conflicting can be used as trend input We simulated an ag...

We consider a dual version of the DFA pac-learning problem, in which concepts are strings over a xed alphabet, examples are DFAs, and a string s represents the set of all DFAs that accept it. It is shown that solving this problem is as hard as learning log-depth boolean circuits , even if the example DFAs are are always acyclic, leveled, and of logarithmic level width. Thus under cryptographic ...

In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in Σ of the DFA to be minimized, the algorithm runs in O(kn log n) time and uses O( n log n ) processors.

This work studies the control of robots in the adversarial world of “Hunt the Wumpus”. The hybrid learning algorithm which controls the robots behavior is a combination of a modified RPNI algorithm, and a utility update algorithm. The modified RPNI algorithm is a DFA learning algorithm, to learn opponents’ strategies. An utility update algorithm is used to quickly derive a successful conclusion...

One challenge in making online education more effective is to develop automatic grading software that can provide meaningful feedback. This paper provides a solution to automatic grading of the standard computation-theory problem that asks a student to construct a deterministic finite automaton (DFA) from the given description of its language. We focus on how to assign partial grades for incorr...

Pseudoaneurysms (PSA) of deep femoral artery (DFA) have been reported following penetrating and blunt trauma to the thigh and orthopedic procedures of the proximal femur. We describe a case of pseudoaneurysm of DFA as a late complication of limb trauma which was confirmed by exploration in an urgent surgery. After two operations successful surgical repair was performed.

We show that if M is a DFA with n states over an arbitrary alphabet and L = L(M), then the worst-case state complexity of L2 is n2 − 2n−1. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of L is kn− k + 1 for all k ≥ 2.