| Budget Amount *help |
¥2,600,000 (Direct Cost: ¥2,600,000)
Fiscal Year 2004: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2003: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2002: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Research Abstract |
Multi-dimensional consecutive-k-systems consist of components arranged in a 2 or 3 dimensional space and fails when many components in a narrow space fail, but this system does not fail even if components fail in wide space. As the 2-dimensional oonsecutive-k-systems, we have connected-(r, s)-out-of-(m, n): F lattice system and 2-dimensional k-within-consecutive-(r, s)-out-of-(m, n) :F system. In this study, we proposed 3 dimensional systems as a type of consecutive-k-systems. These systems are applied to supervisory system for two or three dimensional space and so on.
In this study, first, we proposed efficient algorithm for optimal arrangement of components in consecutive-k-out-of-n: F system, based on genetic algorithm or branch and bound algorithm. For multidimensional systems with medium size, recursive formulas for the reliabilities of some consecutive-k-systems were proposed and the efficiency of these algorithms were proven by the order of algorithm and the results of numerical experiments. For large systems, we proposed upper and lower bounds or approximate values of system reliabilities based on limit theorems. And we confirm the good fitness of these bounds or approximate values by numerical experiments. Furthermore, by using the above basic idea, we proposed recursive algorithm for performance index or reliability of network system.
As the future works, we need to study more complex systems, for example, multi-states consecutive-k-systems, in order to research more systems in the real world.
|
