A generalisation of consecutive k-out-of-n : G systems
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1313 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
1309 | en_US |
dc.citation.volume |
E83D | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Lin, MS | en_US |
dc.contributor.author |
Chang, MS | en_US |
dc.contributor.author |
Chen, DJ | en_US |
dc.contributor.department |
資訊科學與工程研究所 | zh_TW |
dc.contributor.department |
Institute of Computer Science and Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:45:14Z | |
dc.date.available |
2014-12-08T15:45:14Z | |
dc.date.issued |
2000-06-01 | en_US |
dc.description.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 k(i) 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(n(2)) 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. | en_US |
dc.identifier.issn |
0916-8532 | en_US |
dc.identifier.journal |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/30495 | |
dc.identifier.wosnumber |
WOS:000087901500013 | |
dc.language.iso |
en_US | en_US |
dc.subject |
reliability | en_US |
dc.subject |
consecutive-k-out-of-n : G system | en_US |
dc.subject |
distributed computing system | en_US |
dc.title |
A generalisation of consecutive k-out-of-n : G systems | en_US |
dc.type |
Letter | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文