Building Reliable Budget-Based Binary-State Networks

Everyday life is driven by various network, such as supply chains for distributing raw materials, semi-finished product goods, and final products; Internet of Things (IoT) for connecting and exchanging data; utility networks for transmitting fuel, power, water, electricity, and 4G/5G; and social networks for sharing information and connections. The binary-state network is a basic network, where the state of each component is either success or failure, i.e., the binary-state. Network reliability plays an important role in evaluating the performance of network planning, design, and management. Because more networks are being set up in the real world currently, there is a need for their reliability. It is necessary to build a reliable network within a limited budget. However, existing studies are focused on the budget limit for each minimal path (MP) in networks without considering the total budget of the entire network. We propose a novel concept to consider how to build a more reliable binary-state network under the budget limit. In addition, we propose an algorithm based on the binary-addition-tree algorithm (BAT) and stepwise vectors to solve the problem efficiently

A hybrid load flow and event driven simulation approach to multi-state system reliability evaluation

Structural complexity of systems, coupled with their multi-state characteristics, renders their reliability and availability evaluation difficult. Notwithstanding the emergence of various techniques dedicated to complex multi-state system analysis, simulation remains the only approach applicable to realistic systems. However, most simulation algorithms are either system specific or limited to simple systems since they require enumerating all possible system states, defining the cut-sets associated with each state and monitoring their occurrence. In addition to being extremely tedious for large complex systems, state enumeration and cut-set definition require a detailed understanding of the system׳s failure mechanism. In this paper, a simple and generally applicable simulation approach, enhanced for multi-state systems of any topology is presented. Here, each component is defined as a Semi-Markov stochastic process and via discrete-event simulation, the operation of the system is mimicked. The principles of flow conservation are invoked to determine flow across the system for every performance level change of its components using the interior-point algorithm. This eliminates the need for cut-set definition and overcomes the limitations of existing techniques. The methodology can also be exploited to account for effects of transmission efficiency and loading restrictions of components on system reliability and performance. The principles and algorithms developed are applied to two numerical examples to demonstrate their applicability

Decision Diagram Based Symbolic Algorithm for Evaluating the Reliability of a Multistate Flow Network

Evaluating the reliability of Multistate Flow Network (MFN) is an NP-hard problem. Ordered binary decision diagram (OBDD) or variants thereof, such as multivalued decision diagram (MDD), are compact and efficient data structures suitable for dealing with large-scale problems. Two symbolic algorithms for evaluating the reliability of MFN, MFN_OBDD and MFN_MDD, are proposed in this paper. In the algorithms, several operating functions are defined to prune the generated decision diagrams. Thereby the state space of capacity combinations is further compressed and the operational complexity of the decision diagrams is further reduced. Meanwhile, the related theoretical proofs and complexity analysis are carried out. Experimental results show the following: (1) compared to the existing decomposition algorithm, the proposed algorithms take less memory space and fewer loops. (2) The number of nodes and the number of variables of MDD generated in MFN_MDD algorithm are much smaller than those of OBDD built in the MFN_OBDD algorithm. (3) In two cases with the same number of arcs, the proposed algorithms are more suitable for calculating the reliability of sparse networks

Multi-Objective Model to Improve Network Reliability Level under Limited Budget by Considering Selection of Facilities and Total Service Distance in Rescue Operations

Sudden disasters may damage facilities, transportation networks and other critical infrastructures, delay rescue and bring huge losses. Facility selection and reliable transportation network play an important role in emergency rescue. In this paper, the reliability level between two points in a network is defined from the point of view of minimal edge cut and path, respectively, and the equivalence of these two definitions is proven. Based on this, a multi-objective optimization model is proposed. The first goal of the model is to minimize the total service distance, and the second goal is to maximize the network reliability level. The original model is transformed into a model with three objectives, and the three objectives are combined into one objective by the method of weighting. The model is applied to a case, and the results are analyzed to verify the effectiveness of the model

Polarization-sensitive spectral interferometry as a function of depth for tissue identification

A polarization sensitive spectral interferometer apparatus and method for analyzing a sample by optical energy reflected from the sample. The polarization sensitive spectral interferometer apparatus and method determines polarization properties of the sample by optical energy reflected from the sample. The method for analyzing a sample with a spectral interferometer identifies the tissue type of the sample by the polarization properties as a function of depth from the sample.Board of Regents, University of Texas Syste

Polarization-sensitive spectral interferometry

A polarization sensitive spectral interferometer apparatus and method for analyzing a sample by optical energy reflected from the sample. The polarization sensitive spectral interferometer apparatus and method determines polarization properties of the sample by optical energy reflected from the sample.Board of Regents, University of Texas Syste

Polarization-sensitive spectral interferometry

A polarization sensitive spectral interferometer apparatus and method for analyzing a sample. The polarization sensitive spectral interferometer apparatus and method determines polarization properties of the sample.Board of Regents, University of Texas Syste

Data-driven extraction and analysis of repairable fault trees from time series data

Fault tree analysis is a probability-based technique for estimating the risk of an undesired top event, typically a system failure. Traditionally, building a fault tree requires involvement of knowledgeable experts from different fields, relevant for the system under study. Nowadays’ systems, however, integrate numerous Internet of Things (IoT) devices and are able to generate large amounts of data that can be utilized to extract fault trees that reflect the true fault-related behavior of the corresponding systems. This is especially relevant as systems typically change their behaviors during their lifetimes, rendering initial fault trees obsolete. For this reason, we are interested in extracting fault trees from data that is generated from systems during their lifetimes. We present DDFTAnb algorithm for learning fault trees of systems using time series data from observed faults, enhanced with Naïve Bayes classifiers for estimating the future fault-related behavior of the system for unobserved combinations of basic events, where the state of the top event is unknown. Our proposed algorithm extracts repairable fault trees from multinomial time series data, classifies the top event for the unseen combinations of basic events, and then uses proxel-based simulation to estimate the system’s reliability. We, furthermore, assess the sensitivity of our algorithm to different percentages of data availabilities. Results indicate DDFTAnb’s high performance for low levels of data availability, however, when there are sufficient or high amounts of data, there is no need for classifying the top event