The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam kertas ini, pertama, kami mencadangkan algoritma rekursif baharu untuk menilai pelbagai keadaan umum k-daripada-n: Sistem F. Algoritma rekursif ini boleh digunakan pada sistem walaupun keadaan semua komponen dalam sistem diandaikan bukani.i.d. pembolehubah rawak. Algoritma kami berguna untuk mana-mana berbilang negeri k-daripada-nSistem :F, termasuk keadaan berbilang menurun, meningkat dan berterusan k-daripada-n: Sistem F. Tambahan pula, algoritma kami boleh menilai taburan keadaan bagi keadaan berbilang bukan monotonik yang lain k-daripada-n: Sistem F. Seterusnya, kami mengira susunan masa pengkomputeran dan kapasiti memori algoritma yang dicadangkan. Kami melakukan eksperimen berangka dalami.i.d. kes. Keputusan menunjukkan bahawa algoritma yang dicadangkan adalah cekap untuk menilai taburan keadaan sistem bagi pelbagai keadaan k-daripada-n: Sistem F apabila n besar dan kl kecil.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Hisashi YAMAMOTO, Tomoaki AKIBA, Hideki NAGATSUKA, "Calculating Method for the System State Distributions of Generalized Multi-State k-out-of-n:F Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 7, pp. 1593-1599, July 2009, doi: 10.1587/transfun.E92.A.1593.
Abstract: In this paper, first, we propose a new recursive algorithm for evaluating generalized multi-state k-out-of-n:F systems. This recursive algorithm can be applied to the systems even though the states of all components in the system are assumed to be non-i.i.d. random variables. Our algorithm is useful for any multi-state k-out-of-n:F system, including the decreasing, increasing and constant multi-state k-out-of-n:F system. Furthermore, our algorithm can evaluate the state distributions of the other non-monotonic multi-state k-out-of-n:F systems. Next, we calculate the order of computing time and memory capacity of the proposed algorithm. We perform numerical experiments in the non-i.i.d. case. The results show that the proposed algorithm is efficient for evaluating the system state distribution of multi-state k-out-of-n:F system when n is large and kl are small.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1593/_p
Salinan
@ARTICLE{e92-a_7_1593,
author={Hisashi YAMAMOTO, Tomoaki AKIBA, Hideki NAGATSUKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Calculating Method for the System State Distributions of Generalized Multi-State k-out-of-n:F Systems},
year={2009},
volume={E92-A},
number={7},
pages={1593-1599},
abstract={In this paper, first, we propose a new recursive algorithm for evaluating generalized multi-state k-out-of-n:F systems. This recursive algorithm can be applied to the systems even though the states of all components in the system are assumed to be non-i.i.d. random variables. Our algorithm is useful for any multi-state k-out-of-n:F system, including the decreasing, increasing and constant multi-state k-out-of-n:F system. Furthermore, our algorithm can evaluate the state distributions of the other non-monotonic multi-state k-out-of-n:F systems. Next, we calculate the order of computing time and memory capacity of the proposed algorithm. We perform numerical experiments in the non-i.i.d. case. The results show that the proposed algorithm is efficient for evaluating the system state distribution of multi-state k-out-of-n:F system when n is large and kl are small.},
keywords={},
doi={10.1587/transfun.E92.A.1593},
ISSN={1745-1337},
month={July},}
Salinan
TY - JOUR
TI - Calculating Method for the System State Distributions of Generalized Multi-State k-out-of-n:F Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1593
EP - 1599
AU - Hisashi YAMAMOTO
AU - Tomoaki AKIBA
AU - Hideki NAGATSUKA
PY - 2009
DO - 10.1587/transfun.E92.A.1593
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2009
AB - In this paper, first, we propose a new recursive algorithm for evaluating generalized multi-state k-out-of-n:F systems. This recursive algorithm can be applied to the systems even though the states of all components in the system are assumed to be non-i.i.d. random variables. Our algorithm is useful for any multi-state k-out-of-n:F system, including the decreasing, increasing and constant multi-state k-out-of-n:F system. Furthermore, our algorithm can evaluate the state distributions of the other non-monotonic multi-state k-out-of-n:F systems. Next, we calculate the order of computing time and memory capacity of the proposed algorithm. We perform numerical experiments in the non-i.i.d. case. The results show that the proposed algorithm is efficient for evaluating the system state distribution of multi-state k-out-of-n:F system when n is large and kl are small.
ER -