Some computer algorithms to implement a reliability shorthand
Esary, James D.
MetadataShow full item record
Under the assumption of constant failure rates it is possible to build a "reliability shorthand" which gives a simple, unified approach to reliability computations for systems in the presence of complications like support by shared spares or changes in the failure rates of surviving components when other components fail. The computational implementation of the shorthand depends upon the convolution of strings of exponentially distributed random variables. This paper presents an algorithm for the numerical convolution exponentially distributed random variables. After reducing the system scenario to its shorthand format, one can see the programs that are given in the appendix to obtain numerical values for the reliability of the system.
RightsCopyright is reserved by the copyright owner
Showing items related by title, author, creator and subject.
McGuire, Mollie (2018-04-18);The focus of the current study is to examine reliance on automation using a decision making framework. Specifically, the decision to rely on automation under stressful conditions. Stress consumes executive resources (Hermans ...
Bernkopf, Miroslav (Monterey, CA; Naval Postgraduate School, 2021-06);Advancements in technology have accelerated the utilization of unmanned systems, which has led to an increased adoption rate of military human-machine teams. This study explored human reliance on automation in the context ...
Lim, Jong Chun (Monterey, California. Naval Postgraduate School, 1988-12);The objective of this investigation is to derive the reliability and the associated probabilistic failure criterion for composite materials under combined stress. In the analytical derivation, the concept of joint ...