首页> 外文期刊>Pattern recognition letters >Efficient multicut enumeration of fc-out-of-n:F and consecutive k-out-of-n:F systems
【24h】

Efficient multicut enumeration of fc-out-of-n:F and consecutive k-out-of-n:F systems

机译:n:F和连续N:F系统的高效多割枚举

获取原文
获取原文并翻译 | 示例

摘要

We study multiple simultaneous cut events for k-out-of-n:F and linear consecutive k-out-of-n:F systems in which each component has a constant failure probability. We list the multicuts of these systems and describe the structural differences between them. Our approach, based on combinatorial commutative algebra, allows complete enumeration of the sets of multicuts for both kinds of systems. We also analyze the computational issues of multicut enumeration and reliability computations. (C) 2017 Elsevier B.V. All rights reserved.
机译:我们研究了n:F的k和线性连续n:F的连续系统的多个同时切割事件,其中每个组件具有恒定的失效概率。我们列出了这些系统的多部分,并描述了它们之间的结构差异。我们的方法基于组合可交换代数,可以对两种系统的多割集进行完整枚举。我们还分析了多重切割枚举和可靠性计算的计算问题。 (C)2017 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号