检索结果-内蒙古大学图书馆

binary decision diagram-based reliability evaluation of k-out-of-(n plus k) warm standby systems subject to fault-level coverage

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART O-JOURNAL OF RISK AND RELIABILITY 2013年第5期227卷 540-548页

作者： Zhai, Qingqing Peng, Rui Xing, Liudong Yang, Jun Beihang Univ Sch Reliabil & Syst Engn Beijing Peoples R China Univ Sci & Technol Beijing Dongling Sch Econ & Management Beijing 100083 Peoples R China Univ Massachusetts Dartmouth MA USA

Warm standby sparing is a fault-tolerance technique that attempts to improve system reliability while compromising the system energy consumption and recovery time. However, when the imperfect fault coverage effect (an uncovered component fault can propagate and cause the whole system to fail) is considered, the reliability of a warm standby sparing can decrease with an increasing level of the redundancy. This article studies the reliability of a warm standby sparing subject to imperfect fault coverage, in particular, fault level coverage where the coverage probability of a component depends on the number of failed components in the system. The suggested approach is combinatorial and based on a generalized binary decision diagrams technique. The complexity for the binary decision diagram construction is analyzed, and several case studies are given to illustrate the application of the approach.

关键词： binary decision diagram fault tolerance imperfect fault coverage fault level coverage warm standby

来源：评论

学校读者我要写书评

暂无评论

binary decision diagram-based methods for risk assessment of systems subject to propagated failures and parametric uncertainties

引用

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL 2018年第7期34卷 1339-1351页

作者： Qiu, Siqi Ming, Henry X. G. Shanghai Jiao Tong Univ Sch Mech Engn Inst Intelligent Mfg & Informat Engn Shanghai Peoples R China Shanghai Key Lab Adv Mfg Environm Shanghai Peoples R China

Propagated failures between components mean that the failure of one component may cause the failures of other components within the system. Because propagated failures contribute greatly to the system unavailability, it is important to take into account propagated failures between components when modeling systems. Sometimes, it may be difficult to obtain the precise values of some parameters due to many reasons, such as the insufficiency of historical data and the randomness of statistical data. In this case, interval values can be given instead of precise values to represent the parametric uncertainty related to the values of parameters. This paper proposes explicit and implicit binary decision diagram-based methods to model systems subject to propagated failures and to evaluate the failure probability of systems under parametric uncertainty. The proposed methods are applied to a near head-to-head railway accident to evaluate the occurrence probability of accidents.

关键词： binary decision diagram common-cause failures parametric uncertainty propagated failures risk assessment

来源：评论

学校读者我要写书评

暂无评论

binary decision diagram (BDD)

Binary Decision Diagram (BDD)

引用

International Conference on Future Computer and Communications (ICFCC 2009)

作者： Towhidi, Farnaz Lashkari, Arash Habibi Hosseini, Raheleh Sadat UTM City Campus Fac Comp Sci Kuala Lumpur Malaysia Univ Malaysia FCSIT Kuala Lumpur Malaysia Univ Ljubljana Fac Comp Sci Ljubljana Slovenia

ISBN: (纸本)9780769535913

the primary aim of computer science is invention of new data structures and algorithms. Those data structures and algorithms could significantly help us to solve unsolved problems or let us give much better solutions for the already solved problems. In this paper we introduce BDD (binary decision diagram) and its variants OBDD (Ordered binary decision diagram) and ROBDD (Reduced Ordered binary decision diagram). Then we had a review on applications of BDD and it's variants to solving some problems. Finally we will introduce two another decision diagrams.

关键词： BDD binary diagram decision diagram binary decision diagram

来源：评论

学校读者我要写书评

暂无评论

binary decision diagram Based Generation Algorithm For Large Scale Graph Distribution 7

Binary Decision Diagram Based Generation Algorithm For Large...

引用

7th International Conference on Modelling, Identification and Control (ICMIC)

作者： Nacer, Tabib Ilie, Jean Michel Saidouni, Djamel Eddine Constantine 2 Univ MISC Lab Constantine 25000 Algeria Univ Paris 06 F-75005 Paris France Univ Paris 05 F-75005 Paris France

ISBN: (纸本)9780956715753

This paper proposes an on the fly algorithm for graph distribution. The algorithm uses a new distributed method combined with the binary decision diagram (BDD) for holding a global image of the system. Though, the proposed approach is a distributed algorithm, it uses little or none communication between the different nodes(sites). Hence it increases the fault tolerance of an unreliable network. In addition it preserves the workload balancing property. As a result, the proposed algorithm attempts to balance the workload between the different sites of the network and reduces as much as possible the inter-processors communications overhead result of reducing the inter-sites edges.

关键词： Distributed Generation Systems Graph distribution binary decision diagram Network applications

来源：评论

学校读者我要写书评

暂无评论

A binary decision diagram based approach for mining frequent subsequences

引用

KNOWLEDGE AND INFORMATION SYSTEMS 2010年第2期24卷 235-268页

作者： Loekito, Elsa Bailey, James Pei, Jian Univ Melbourne Natl ICT Australia NICTA Dept Comp Sci & Software Engn Melbourne Vic Australia Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

Sequential pattern mining is an important problem in data mining. State of the art techniques for mining sequential patterns, such as frequent subsequences, are often based on the pattern-growth approach, which recursively projects conditional databases. Explicitly creating database projections is thought to be a major computational bottleneck, but we will show in this paper that it can be beneficial when the appropriate data structure is used. Our technique uses a canonical directed acyclic graph as the sequence database representation, which can be represented as a binary decision diagram (BDD). In this paper, we introduce a new type of BDD, namely a sequence BDD (SeqBDD), and show how it can be used for efficiently mining frequent subsequences. A novel feature of the SeqBDD is its ability to share results between similar intermediate computations and avoid redundant computation. We perform an experimental study to compare the SeqBDD technique with existing pattern growth techniques, that are based on other data structures such as prefix trees. Our results show that a SeqBDD can be half as large as a prefix tree, especially when many similar sequences exist. In terms of mining time, it can be substantially more efficient when the support is low, the number of patterns is large, or the input sequences are long and highly similar.

关键词： Sequential pattern mining Frequent subsequences binary decision diagram Sequence binary decision diagram SeqBDD

来源：评论

学校读者我要写书评

暂无评论

State space and binary decision diagram models for discrete standby systems with multistate components

引用

APPLIED MATHEMATICAL MODELLING 2022年 110卷 298-319页

作者： Alkaff, Abdullah Inst Teknol Sepuluh Nopember ITS Dept Elect Engn Lab Syst & Cybernet Kampus ITS Surabaya 60111 Indonesia

A state space model for exact analysis of discrete time heterogeneous general standby systems applicable for hot, warm, and cold backups in any combination of them is pro-posed. The systems have multistate components whose lifetimes follow independent dis-crete phase-type distributions. The approach is by incorporating a deceleration matrix into the survival matrix of a component while as a backup and proving that such an approach results in a discrete phase-type representation of the system lifetime distribution. The method is applicable for dynamic reliability analyses of general structure systems having combinations of series, parallel, and standby structures. A binary decision diagram model for the same systems is also proposed by representing a multistate component as a single node. The performance of the two models in generating system reliability measures are compared numerically and qualitatively. Applications for a real-world system and finding optimal backup orderings are given.(c) 2022 Elsevier Inc. All rights reserved.

关键词： State space model binary decision diagram Backup ordering Discrete phase-type distribution

来源：评论

学校读者我要写书评

暂无评论

Reliability analysis for command-and-control systems based on edge extension diagram and binary decision diagram

引用

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL 2023年第8期39卷 3316-3334页

作者： Li, Yifan Huang, Hong-Zhong Zhang, Tingyu Huang, Sizhe Li, Yahua Univ Elect Sci & Technol China Sch Mech & Elect Engn Chengdu 611731 Sichuan Peoples R China Univ Elect Sci & Technol China Ctr Syst Reliabil & Safety Chengdu Sichuan Peoples R China Wuhan Digital Engn Res Inst Wuhan Peoples R China

As the central nervous system of modern information warfare, the command-and-control network becomes the brain of command and the strategic target of the enemy's primary attack during the operation. In this paper, a method based on edge extension diagram (EED) and binary decision diagram (BDD) is proposed to evaluate the reliability of connectivity within the basic command post of command-and-control network, which is solving the problem that the conventional methods failed to model failure probabilities of node links and with low calculation efficiency. First, graph simplification of network topology, extension of nodes under reliable state, construction of path functions, replacement of associated edges, variable sorting, construction of binary decision graphs, and recursive calculation to evaluate the reliability of the connection between the two ends of the command-and-control network. Then, further analyze and sort the variable importance of the command-and-control network and analyze the sensitivity of the network topology. This paper contributes to the reliability assessment of command-and-control network system, the identification and maintenance of key network nodes, and the design of network topology structure.

关键词： binary decision diagram command-and-control network connectivity reliability edge extension diagram

来源：评论

学校读者我要写书评

暂无评论

A Logarithmic binary decision diagram-Based Method for Multistate System Analysis

引用

IEEE TRANSACTIONS ON RELIABILITY 2008年第4期57卷 595-606页

作者： Shrestha, Akhilesh Xing, Liudong Univ Massachusetts Dept Elect & Comp Engn N Dartmouth MA 02747 USA

Multi-state systems (MSS) are systems in which both the systems, and/or their components may exhibit multiple performance levels or states. MSS can model complex behaviors such as shared loads, performance degradation, imperfect fault coverage, standby redundancy, and limited repair resources. The non-binary state property of MSS, and their components makes the analysis of MSS challenging. In this paper, we propose efficient logarithmically-encoded binary decision diagram (LBDD)-based methods for analysing MSS. The application and advantages of the proposed LBDD-based approaches, as compared to the existing binary decision diagram-based approaches, are demonstrated through the analyses of practical MSS examples, and a set of benchmark examples.

关键词： Benchmark binary decision diagram logarithmically-encoded binary decision diagram multi-state system

来源：评论

学校读者我要写书评

暂无评论

Displacement BDD and geometric transformations of binary decision diagram encoded images

引用

PATTERN RECOGNITION LETTERS 2008年第4期29卷 438-456页

作者： Leelapatra, Watis Kanchanasut, Kanchana Lursinsap, Chidchanok Asian Inst Technol Comp Sci & Informat Management Dept Klongluang 12120 Pathumthani Thailand Chulalongkorn Univ Dept Math Bangkok 10330 Thailand

binary decision diagram (BDD) has been shown to be an efficient data structure for image coding. This paper presents novel manipulation techniques for BDD encoded image. Image translation can be expressed as operation of BDDs. The concept of transition branch which represents displacement of translation is introduced. In addition to image translation, a technique to perform orthogonal rotation of image encoded by BDD is presented. These geometric transformations are applied directly on BDD representation of image. (c) 2007 Elsevier B.V. All rights reserved.

关键词： binary decision diagram transition branch translation rotation

来源：评论

学校读者我要写书评

暂无评论

Logic-Based Benders Decomposition and binary decision diagram Based Approaches for Stochastic Distributed Operating Room Scheduling

引用

INFORMS JOURNAL ON COMPUTING 2021年第4期33卷 1551-1569页

作者： Guo, Cheng Bodur, Merve Aleman, Dionne M. Urbach, David R. Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada Univ Toronto Inst Hlth Policy Management & Evaluat Toronto ON M5S 3E3 Canada Univ Hlth Network Techna Inst Toronto ON M5G 1P5 Canada Univ Toronto Dept Surg Toronto ON M5S 3E3 Canada Womens Coll Hosp Dept Surg Toronto ON M5S 1B2 Canada

The distributed operating room (OR) scheduling problem aims to find an assignment of surgeries to ORs across collaborating hospitals that share their waiting lists and ORs. We propose a stochastic extension of this problem where surgery durations are considered to be uncertain. In order to obtain solutions for the challenging stochastic model, we use sample average approximation and develop two enhanced decomposition frameworks that use logic-based Benders (LBBD) optimality cuts and binary decision diagram based Benders cuts. Specifically, to the best of our knowledge, deriving LBBD optimality cuts in a stochastic programming context is new to the literature. Our computational experiments on a hospital data set illustrate that the stochastic formulation generates robust schedules and that our algorithms improve the computational efficiency. Summary of Contribution: We propose a new model for an important problem in healthcare scheduling, namely, stochastic distributed operating room scheduling, which is inspired by a current practice in Toronto, Ontario, Canada. We develop two decomposition methods that are computationally faster than solving the model directly via a state-of-the-art solver. We present both some theoretical results for our algorithms and numerical results for the evaluation of the model and algorithms. Compared with its deterministic counterpart in the literature, our model shows improvement in relevant evaluation metrics for the underlying scheduling problem. In addition, our algorithms exploit the structure of the model and improve its solvability. Those algorithms also have the potential to be used to tackle other planning and scheduling problems with a similar structure.

关键词： distributed operating room scheduling stochastic integer programming logic-based Benders decomposition binary decision diagram

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：