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
Uma classe generalizada dek-de-n:G sistemas, referidos como Con/k*/n:G sistemas, é estudado. Um contra/k*/n:O sistema G tem n componentes encomendados e é bom se e somente se ki bons componentes consecutivos que se originam no componente i estão todos bem, onde ki é uma função de i. O teorema 1 dá um O(n) equação de tempo para calcular a confiabilidade de um sistema linear e o Teorema 2 fornece um O(n2) equação de tempo para um sistema circular. Um sistema de computação distribuído com topologia linear (anel) é um exemplo de tal sistema. Esta aplicação é muito importante, pois para outras classes de topologias, como grafos gerais, grafos planares, grafos série-paralelos, grafos em árvore e grafos em estrela, este problema provou ser NP-duro.
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.
Copiar
Min-Sheng LIN, Ming-Sang CHANG, Deng-Jyi CHEN, "A Generalization of Consecutive k-out-of-n:G Systems" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 6, pp. 1309-1313, June 2000, doi: .
Abstract: A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k*/n:G systems, is studied. A Con/k*/n:G system has n ordered components and is good if and only if ki good consecutive components that originate at component i are all good, where ki is a function of i. Theorem 1 gives an O(n) time equation to compute the reliability of a linear system and Theorem 2 gives an O(n2) time equation for a circular system. A distributed computing system with a linear (ring) topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_6_1309/_p
Copiar
@ARTICLE{e83-d_6_1309,
author={Min-Sheng LIN, Ming-Sang CHANG, Deng-Jyi CHEN, },
journal={IEICE TRANSACTIONS on Information},
title={A Generalization of Consecutive k-out-of-n:G Systems},
year={2000},
volume={E83-D},
number={6},
pages={1309-1313},
abstract={A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k*/n:G systems, is studied. A Con/k*/n:G system has n ordered components and is good if and only if ki good consecutive components that originate at component i are all good, where ki is a function of i. Theorem 1 gives an O(n) time equation to compute the reliability of a linear system and Theorem 2 gives an O(n2) time equation for a circular system. A distributed computing system with a linear (ring) topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.},
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
TY - JOUR
TI - A Generalization of Consecutive k-out-of-n:G Systems
T2 - IEICE TRANSACTIONS on Information
SP - 1309
EP - 1313
AU - Min-Sheng LIN
AU - Ming-Sang CHANG
AU - Deng-Jyi CHEN
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2000
AB - A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k*/n:G systems, is studied. A Con/k*/n:G system has n ordered components and is good if and only if ki good consecutive components that originate at component i are all good, where ki is a function of i. Theorem 1 gives an O(n) time equation to compute the reliability of a linear system and Theorem 2 gives an O(n2) time equation for a circular system. A distributed computing system with a linear (ring) topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.
ER -