IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Recent Developments on Reliability, Maintainability and Dependability
Algorithm for Obtaining Optimal Arrangement of a Connected-(r,s)-out-of-(m,n): F System — The Case of m=r and s=2 —
Toru OMURATomoaki AKIBAXiao XIAOHisashi YAMAMOTO
Author information
JOURNALS RESTRICTED ACCESS

2015 Volume E98.A Issue 10 Pages 2018-2024

Details
Abstract

A connected-(r,s)-out-of-(m,n): F system is a kind of the connected-X-out-of-(m,n): F system defined by Boehme et al. [2]. A connected-(r,s)-out-of-(m,n): F system consists of m×n components arranged in (m,n)-matrix. This system fails if and only if there exists a grid of size r×s in which all components are failed. When m=r, this system can be regarded as a consecutive-s-out-of-n: F system, and then the optimal arrangement of this system satisfies theorem which stated by Malon [9] in the case of s=2. In this study, we proposed a new algorithm for obtaining optimal arrangement of the connected-(r,2)-out-of-(m,n): F system based on the above mentioned idea. We performed numerical experiments in order to compare the proposed algorithm with the algorithm of enumeration method, and calculated the order of the computation time of these two algorithms. The numerical experiments showed that the proposed algorithm was more efficiently than the algorithm of enumeration method.

Information related to the author
© 2015 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top