Volume 52, Number 1, March 2003
Ralph A. Evans
: Editorial confidence intervals for discrete variables.
John A. Connor
: Commentary: getting real about reliability, through wit and humor.
, Jie Wu
: Maximum-shortest-path (MSP) is not optimal for a general N×N torus.
: A unified way of comparing the reliability of coherent systems.
Michael G. H. Bell
: The use of game theory to measure the vulnerability of stochastic networks.
, Yuan Lin Zhang
: A geometric-process maintenance model for a deteriorating system under a random environment.
: A new methodology to handle Boolean models with loops.
Thomas E. Sälzer
: Tubulation techniques for locating fine-leak sites in hermetic electronic packages.
Volume 52, Number 2, June 2003
: Commentary: steady-state series-system availability.
Michael L. Ulrey
: Formulas for the distribution of sums of independent exponential random variables.
Andrew J. Fry
: Integrity-based self-validation test scheduling.
: Toward an efficient implementation of the MOCUS algorithm.
: Optimal allocation of multistate elements in a linear consecutively-connected system.
A. M. Mathai
: Order statistics from a logistic distribution and applications to survival and reliability analysis.
: Reliability evaluation for acyclic transmission networks of multi-state elements with delays.
, Ai Chen
, Jie Wu
: Reliable broadcasting in wormhole-routed hypercube-connected networks using local safety information.
Volume 52, Number 3, September 2003
Juan A. Carrasco
: Solving dependability/performability irreducible Markov models using regenerative randomization.
: Reliability of multi-state systems with two failure-modes.
: Computing consecutive-type reliabilities nonrecursively.
S. K. Yang
: A condition-based failure-prediction and processing-scheme for preventive maintenance.
Volume 52, Number 4, December 2003
, Andreas Steininger
: A transparent online memory test for simultaneous detection of functional faults and soft errors in memories.
: A software methodology for detecting hardware faults in VLIW data paths.
, Ramesh Karri
: Selectively breaking data dependences to improve the utilization of idle cycles in algorithm level re-computing data paths.