Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 11 von 45
IEEE transactions on reliability, 1988-04, Vol.37 (1), p.70-72
1988

Details

Autor(en) / Beteiligte
Titel
A direct algorithm for computing reliability of a consecutive-k cycle
Ist Teil von
  • IEEE transactions on reliability, 1988-04, Vol.37 (1), p.70-72
Ort / Verlag
New York, NY: IEEE
Erscheinungsjahr
1988
Link zum Volltext
Quelle
IEEE Xplore
Beschreibungen/Notizen
  • A consecutive-k cycle is a circular system such that the system fails if and only if any i consecutive components all fail. Reliabilities for consecutive-k cycles are usually computed by recursive equations. However, most recursive equations proposed so far for the cycle involve reliabilities for consecutive-k lines, requiring two passes where the first pass computes only the line reliabilities. A recursive equation involving cycles only is proposed that is simpler in form but much harder to understand on intuitive grounds. Another advantage is that the proposed cycle recursion has the same form as a line recursion previously proposed. Thus a uniform treatment of lines and cycles is possible. This uniform approach is used to obtain some explicit solutions of both line and cycle reliabilities for 2<or=k<or=4.< >

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX