In this paper, we provide a practical formulation of the problem of identifying all error occurrences and all failed scan cells in atspeed scan based BIST environment. We propose a method that can be used to identify every error when the circuit test frequency is higher than the tester frequency. Our approach requires very little extra hardware for diagnosis and the test application time requir...

Several partition of unity methods (PUM) are compared on the problem of steady water flow in an aquifer-well system. In order to improve the approximation of a singular behaviour of the pressure near the wells, the standard finite element space is enriched with the cut-off fundamental solution to the Laplace problem. The optimal order of convergence of PUM in terms of L norm of the error is dem...

BACKGROUND Fitness-to-drive guidelines recommend employing the Trail Making B Test (a.k.a. Trails B), but do not provide guidance regarding cut-off scores. There is ongoing debate regarding the optimal cut-off score on the Trails B test. The objective of this study was to address this controversy by systematically reviewing the evidence for specific Trails B cut-off scores (e.g., cut-offs in bo...

Several theoretical and experimental studies have shown that the characterization of a target (tube,...) can be made from the cut-off frequencies of the anti-symmetric circumferential waves A1 propagating around the tube of various radius ratio b/a (a: outer radius and b: inner radius). This work investigates the abilities of Adaptive Neuro-fuzzy Inference System ANFIS and Artificial Neural Net...

PURPOSE To investigate the utility of uncorrected visual acuity measures in screening for refractive error in white school children aged 6-7-years and 12-13-years. METHODS The Northern Ireland Childhood Errors of Refraction (NICER) study used a stratified random cluster design to recruit children from schools in Northern Ireland. Detailed eye examinations included assessment of logMAR visual ...

The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...

This paper discusses the relation between network coding, (classical) algebraic coding, and network error correction. In the first part, we clarify the relation between network coding and algebraic coding. By showing that the Singleton bound in algebraic coding theory is a special case of the Maxflow Min-cut bound in network coding theory, we formally establish that linear multicast and its str...

The paper contain a report on simulation of fading channel using Markov Model through a very simple and effective approach, The study established the successful application of Discrete time Simulation in fading channel by applying a tri-states memory-less Markov Model. We generated Four Matlab programs to simulate the Markov Fading Channel and successfully implemented the generated code through...