Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12358/23886
Title | New Recursive Algorithm to Find the Failure Function of the Connected (2,2)-out-of-(m,n): F Linear and Circular System |
---|---|
Untitled | |
Abstract |
The connected (r,s)-out-of-(m,n): F linear and circular system fails if there is an area of failures that includes at least a sub matrix (r,s) that contains all failed components. For example, the connected (2,2)-out-of-(m,n): F linear and circular system is failed if there is a square of failed components. In this paper, a new recursive algorithm to find the failure function of the connected (2,2)-out-of-(m,n): F linear and circular system is obtained. The algorithm uses the failure states of the consecutive 2-out-of-n: F linear and circular. Keywords Consecutive k-out-of-n: F Linear and Circular System, The Connected (r,s)-out-of-(m,n): Linear and Circular System. |
Authors | |
Type | Journal Article |
Date | 2015 |
Language | English |
Published in | IUG Journal for Natural and Engineering Studies |
Series | Volume: 23, Number: 2 |
Publisher | الجامعة الإسلامية - غزة |
Citation | |
License | ![]() |
Collections | |
Files in this item | ||
---|---|---|
295-819-1-PB.pdf | 532.9Kb |