An Algorithm for Obtaining the Prior Information of Bounded Sampling
Volume 9, Number 2, March 2013 - SC 35 - pp. 235-240
SHUANG-WEI XU and XIAO-YUE WUCollege of Information Systems and Management,
National University of Defense Technology, Changsha, China
(Received on February 27, 2012; Revised on July 3, 2012)
Analytical methods face many constraints in evaluating system’s reliability while the crude simulation is inefficient for evaluating the reliability of highly dependable system. Bounded sampling method is an efficient reliability simulation method, and prior information is the key factor that influences its efficiency. In this paper, an algorithm is proposed to obtain the non-intersection partial minimal cut sets and minimal path sets, which can greatly improve the performance of bounded sampling. The steps and pseudo code of this algorithm are given. A numerical example is used to demonstrate the efficiency of bounded sampling with this proposed algorithm.
Click here to download the paper.
Please note : You will need Adobe Acrobat viewer to view the full articles.