The consequences of bridging, transition, and stuck-open faults in self-testing checkers designed only for single stuck-at faults are examined. A methodology for design that guarantees that the checkers will be self-t...
详细信息
The consequences of bridging, transition, and stuck-open faults in self-testing checkers designed only for single stuck-at faults are examined. A methodology for design that guarantees that the checkers will be self-testing in the presence of bridging, transition and stuck-open faults is established. This methodology is applied to several implementations of self-testing checkers. Simulations confirm that these checkers are self-testing in the presence of bridging, transition, and stuck-open faults. The problems associated with testing the checkers in the presence of non-stuck-at faults and the problems that result from reducing the number of checker outputs from two to one are discussed. It is shown that self-testing checkers designed for stuck-at faults will remain self-testing in the presence of nonclassical faults.< >
作者：
L. AvraCenter for Reliable Computing
Computer Systems Laboratory Departments of Electrical Engineering Computer Science University of Stanford Stanford CA USA
An analysis and design of a pseudorandom pattern generator, (PRPG), based on a linear recurrence, for built-in self-test (BIST) boundary scan design is presented. The authors present for the case when r>or=s, a des...
详细信息
An analysis and design of a pseudorandom pattern generator, (PRPG), based on a linear recurrence, for built-in self-test (BIST) boundary scan design is presented. The authors present for the case when r>or=s, a design of an s-stage PRPG capable of producing 2/sup s/-1 distinct r-bit patterns within 2/sup s/-1 clock pulses independent of the hardware realization of the PRPG. For the case when r >
Variants of simplex-based methodologies are generally used to solve underlying linear programming (LP) problems. An implementation of the dual affine (DA) algorithm (a variant of N. Karmarkar's (1984) interior poi...
详细信息
Variants of simplex-based methodologies are generally used to solve underlying linear programming (LP) problems. An implementation of the dual affine (DA) algorithm (a variant of N. Karmarkar's (1984) interior point method) is described in detail and some computational results are presented. This algorithm is particularly suitable for problems with a large number of constraints, and is applicable to linear and nonlinear optimization problems. In contrast with the simplex method, the number of iterations required by the DA algorithm to solve large-scale problems is relatively small. The DA algorithm has been implemented considering the sparsity of the constraint matrix. The normal equation that is required to be solved in every iteration is solved using a preconditioned conjugate gradient method. An application of the technique to a hydro-scheduling is presented; the largest problem is solved over nine times faster than an efficient simplex (MINOS) code. A new heuristic basis recovery procedure is implemented to provide primal and dual optimal basic solutions which are not generally available if interior point methods are used. The tested examples indicate that this new approach requires less than 10% of the original iterations of the simplex method to find the optimal basis.< >
Simple bounds on the aliasing probability for serial signature analysis are presented. To motivate the study, it is shown that calculation of exact aliasing is NP-hard and that coding theory does not necessarily help....
详细信息
Simple bounds on the aliasing probability for serial signature analysis are presented. To motivate the study, it is shown that calculation of exact aliasing is NP-hard and that coding theory does not necessarily help. It is shown that the aliasing probability is bounded above by 2/(L+2) for test lengths L less than the period, L/sub c/, of the signature polynomials; for test lengths L that are multiples of L/sub c/, the aliasing probability is bounded above by 1; and, for test lengths L greater than L/sub c/ and not a multiple of L/sub c/, the aliasing probability is bounded above by 2/(L/sub c/+1). These simple bounds avoid any exponential complexity associated with the exact computation of the aliasing probability. Simple bounds also apply to signature analysis based on any linear finite state machine (including linear cellular automata).< >
An early-processing algorithm to extract motion information from closely sampled image sequences is presented. This method outputs dense displacement field, based on the extraction of strips in slices taken from the i...
详细信息
An early-processing algorithm to extract motion information from closely sampled image sequences is presented. This method outputs dense displacement field, based on the extraction of strips in slices taken from the image volume along the temporal dimension. The extracted strips provide estimates of the velocity component along the slice orientation. Because of the high sampling rate, the motion is assumed to be piecewisely translational. A voting scheme to estimate the position of FOE while extracting strips is proposed. The true velocity can then be calculated. Results on several real image sequences and a promising speedup from the parallel implementation on the Connection Machine are presented.< >
作者：
SKOLNICK, DHSKOLNICK, ADavid H. Skolnickhas practiced naval engineering in both government and industry. He has supported the Military Sealift Command and the Naval Sea Systems Command Ship Design Group and Amphibious Ship Acquisition Program Office
participating in the design and assessment of ship structure evaluation of intact and damaged stability and arrangements during design and construction phases of acquisition conversion and overhaul. He is currently involved in systems engineering and integration. Recent responsibilities have included requirements analyses and feasibility studies interface analyses and computer aided analyses. He received his B.S. in naval architecture and marine engineering from Webb Institute of Naval Architecture in 1982 (as an ASNE scholar) and is currently an M.S. candidate in systems engineering at the University of Virginia. Alfred Skolnickserved over 30 years as an engineering duty officer and retired from the Navy with the rank of captain in 1983. His early assignments included tactical missile engineering
shipboard duty and Polaris submarine inertial navigation. He later served in the Deep Submergence Systems Project was project director
surface effect ships (SES) David Taylor Model Basin director of technology
Joint Navy-Commerce SES Program director
combat systems Naval Sea Systems Command and project manager directed energy weapons. His awards include the Navy League's Parsons Award in 1979 for scientific and technical progress ASNE's Gold Medal in 1981 for high energy laser development the Navy Legion of Merit in 1983 National Capital Engineer of the Year in 1986 and the American Defense Preparedness Association Gold Medal in 1988 for contributions to strategic defense. He was president of ASNE from 1985–1989. He received his B.S. in mathematics from Queens College his M.A. in mathematics from Columbia University his M.S. in electrical engineering from U.S. Naval Postgraduate School and his Ph.D. in electrical engineering/applied mathematics from Polytechnic University. He w
Changing threat requirements and radical budget shifts imply that Navy operational needs will broaden and engineering solutions will face tougher constraints. Existing and emerging technology promise increased combat ...
详细信息
Changing threat requirements and radical budget shifts imply that Navy operational needs will broaden and engineering solutions will face tougher constraints. Existing and emerging technology promise increased combat capability in smaller packages;space-based assets will allow operator orchestration of widely dispersed naval units via connectivity attributes previously unavailable. Tactical data relay by downlink may permit reallocation of responsibilities among several platforms, space, air, or seaborne, so ships can be outfitted for custom-use (sensing, unique data processing, high-firepower) and optimized to meet specific mission needs. These evolving capabilities demand a fresh look at ship concepts and prospective force structures consistent with global and fiscal realities. Warfighting performance formerly unknown in small ship design may offer a very effective solution to the intricate, interacting issues of falling defense budgets, diverse operational requirements and complex national priorities. Multimission ships which take advantage of new or current technology to reduce ship size, manning and cost could be affordable in sufficient numbers to meet our continuing worldwide obligations, complement our larger ships' force structure, and produce a balanced fleet. These same ships could satisfy U.S. maritime needs beyond the Navy and improve export trade through foreign military sales (FMS).
The detailed operation of variable capacitance harmonic (or wobble) side-drive micromotors was studied through gear ratio measurements. The gear ratio of the wobble micromotor is affected by wear in the bearing and by...
详细信息
The detailed operation of variable capacitance harmonic (or wobble) side-drive micromotors was studied through gear ratio measurements. The gear ratio of the wobble micromotor is affected by wear in the bearing and by rotor slip. Rotor slip is a function of motive torque magnitude, excitation angle, and friction torques. The gear ratio of a wobble micromotor can be expressed as a constant term plus a term that accounts for rotor slip. The constant term is the nominal gear ratio which is equal to the bearing radius divided by the bearing clearance. The rotor slip term is directly proportional to the bushing friction torque and inversely proportional to the square of the excitation voltage. Micromotor operation in air as opposed to nitrogen demonstrates a significantly larger bushing friction torque.< >
暂无评论