首页> 外文会议>World multi-conference on systemics, cybernetics and informatics;WMSCI 2010 >An O(n) algorithm to compute the reliability of consecutive κ-out-of-r-from-n :F system under the condition of r < 2k
【24h】

An O(n) algorithm to compute the reliability of consecutive κ-out-of-r-from-n :F system under the condition of r < 2k

机译:一种O(n)算法,用于在r <2k的条件下计算从n:F到r的连续κ系统的可靠性

获取原文

摘要

A consecutive k -out~of~ r -from- n:F system consists of n ordered components such that the system fails if and only if there are r consecutive components at least of which are failed. Such systems arise in quality -control problems and inspection procedures as well as in radar detection. This paper studies the reliability of a linear consecutive k -out-of- r -from- n:F system in the general case when the component probabilities can be different from each other. New recursive equation is derived for explicit solution of such general system, which required O(n) computing time. The results of some computational experiments are also described.
机译:连续的从n:F到k的系统由n个有序组件组成,因此,当且仅当存在r个连续的组件中至少有一个发生故障时,系统才会发生故障。这样的系统出现在质量控制问题和检查程序以及雷达检测中。在一般情况下,当组件概率可能互不相同时,本文研究了线性连续k -out-r-from-n:F系统的可靠性。推导了一个新的递归方程,用于这种通用系统的显式求解,这需要O(n)计算时间。还描述了一些计算实验的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号