Assessing the reliability of multistate flow networks considering distance constraints

Evaluating the reliability of complex technical networks, such as those in energy distribution, logistics, and transportation systems, is of paramount importance. These networks are often represented as multistate flow networks (MFNs). While there has been considerable research on assessing MFN reliability, many studies still need to pay more attention to a critical factor: transmission distance constraints. These constraints are typical in real-world applications, such as Internet infrastructure, where controlling the distances between data centers, network nodes, and end-users is vital for ensuring low latency and efficient data transmission. This paper addresses the evaluation of MFN reliability under distance constraints. Specifically, it focuses on determining the probability that a minimum of $d$ flow units can be transmitted successfully from a source node to a sink node, using only paths with lengths not exceeding a predefined distance limit of $\lambda$. We introduce an effective algorithm to tackle this challenge, provide a benchmark example to illustrate its application and analyze its computational complexity

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

Memristive Anodic Oxides: Production, Properties and Applications in Neuromorphic Computing

Memristive devices generally consist of metal oxide elements with specific structure and chemical composition, which are crucial to obtain the required variability in resistance. This makes the control of oxide properties vital. While CMOS compatible production technologies for metal oxides deposition generally involve physical or chemical deposition pathways, we here describe the possibility of using an electrochemical technique, anodic oxidation, as an alternative route to produce memristive oxides. In fact, anodization allows to form a very large range of oxides on the surface of valve metals, such as titanium, hafnium, niobium and tantalum, whose thickness, structure and functional properties depend on process parameters imposed. These oxides may be of interest to build neural networks based on memristive elements produced by anodic oxidation

Doctor of Philosophy

dissertationTraffic congestion occurs because the available capacity cannot serve the desired demand on a portion of the roadway at a particular time. Major sources of congestion include recurring bottlenecks, incidents, work zones, inclement weather, poor signal timing, and day-to-day fluctuations in normal traffic demand. This dissertation addresses a series of critical and challenging issues in evaluating the benefits of Advanced Traveler Information Strategies under different uncertainty modeling approaches are integrated in this dissertation, namely: mathematical programming, dynamic simulation and analytical approximation. The proposed models aim to 1) represent static-state network user equilibrium conditions, knowledge quality and accessibility of traveler information systems under both stochastic capacity and stochastic demand distributions; 2) characterize day-to-day learning behavior with different information groups under stochastic capacity and 3) quantify travel time variability from stochastic capacity distribution functions on critical bottlenecks. First, a nonlinear optimization-based conceptual framework is proposed for incorporating stochastic capacity, stochastic demand, travel time performance functions and varying degrees of traveler knowledge in an advanced traveler information provision environment. This method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with knowledge of the expected traffic conditions across different days. Using a gap function framework, two mathematical programming models are further formulated to describe the route choice behavior of the perfect information and expected travel time user classes under stochastic day-dependent travel time. This dissertation also presents adaptive day-to-day traveler learning and route choice behavioral models under the travel time variability. To account for different levels of information availability and cognitive limitations of individual travelers, a set of "bounded rationality" rules are adapted to describe route choice rules for a traffic system with inherent process noise and different information provision strategies. In addition, this dissertation investigates a fundamental problem of quantifying travel time variability from its root sources: stochastic capacity and demand variations that follow commonly used log-normal distributions. The proposed models provide theoretically rigorous and practically usefully tools to understand the causes of travel time unreliability and evaluate the system-wide benefit of reducing demand and capacity variability

The methodology of flowgraph models

Flowgraph models are directed graph models for describing the dynamic changes in a stochastic process. They are one class of multistate models that are applied to analyse time-to-event data. The main motivation of the flowgraph models is to determine the distribution of the total waiting times until an event of interest occurs in a stochastic process that progresses through various states. This thesis applies the methodology of flowgraph models to the study of Markov and SemiMarkov processes. The underlying approach of the thesis is that the access to the moment generating function (MGF) and cumulant generating function (CGF), provided by Mason’s rule enables us to use the Method of Moments (MM) which depends on moments and cumulant. We give a new derivation of the Mason’s rule to compute the total waiting MGF based on the internode transition matrix of a flowgraph. Next, we demonstrate methods to determine and approximate the distribution of total waiting time based on the inversion of the MGF, including an alternative approach using the Pad´e approximation of the MGF, which always yields a closed form density. For parameter estimation, we extend the Expectation-Maximization (EM) algorithm to estimate parameters in the mixture of negative weight exponential density. Our second contribution is to develop a bias correction method in the Method of Moments (BCMM). By investigating methods for tail area approximation, we propose a new way to estimate the total waiting time density function and surviva

A Bayesian Network methodology for railway risk, safety and decision support

For railways, risk analysis is carried out to identify hazardous situations and their consequences. Until recently, classical methods such as Fault Tree Analysis (FTA) and Event Tree Analysis (ETA) were applied in modelling the linear and logically deterministic aspects of railway risks, safety and reliability. However, it has been proven that modern railway systems are rather complex, involving multi-dependencies between system variables and uncertainties about these dependencies. For train derailment accidents, for instance, high train speed is a common cause of failure; slip and failure of brake applications are disjoint events; failure dependency exists between the train protection and warning system and driver errors; driver errors are time dependent and there is functional uncertainty in derailment conditions. Failing to incorporate these aspects of a complex system leads to wrong estimations of the risks and safety, and, consequently, to wrong management decisions. Furthermore, a complex railway system integrates various technologies and is operated in an environment where the behaviour and failure modes of the system are difficult to model using probabilistic techniques. Modelling and quantification of the railway risk and safety problems that involve dependencies and uncertainties such as mentioned above are complex tasks. Importance measures are useful in the ranking of components, which are significant with respect to the risk, safety and reliability of a railway system. The computation of importance measures using FTA has limitation for complex railways. ALARP (As Low as Reasonably Possible) risk acceptance criteria are widely accepted as ’\'best practice’’ in the railways. According to the ALARP approach, a tolerable region exists between the regions of intolerable and negligible risks. In the tolerable region, risk is undertaken only if a benefit is desired. In this case, one needs to have additional criteria to identify the socio-economic benefits of adopting a safety measure for railway facilities. The Life Quality Index (LQI) is a rational way of establishing a relation between the financial resources utilized to improve the safety of an engineering system and the potential fatalities that can be avoided by safety improvement. This thesis shows the application of the LQI approach to quantifying the social benefits of a number of safety management plans for a railway facility. We apply Bayesian Networks and influence diagrams, which are extensions of Bayesian Networks, to model and assess the life safety risks associated with railways. Bayesian Networks are directed acyclic probabilistic graphical models that handle the joint distribution of random variables in a compact and flexible way. In influence diagrams, problems of probabilistic inference and decision making – based on utility functions – can be combined and optimized, especially, for systems with many dependencies and uncertainties. The optimal decision, which maximizes the total benefits to society, is obtained. In this thesis, the application of Bayesian Networks to the railway industry is investigated for the purpose of improving modelling and the analysis of risk, safety and reliability in railways. One example application and two real world applications are presented to show the usefulness and suitability of the Bayesian Networks for the quantitative risk assessment and risk-based decision support in reference to railways.:ACKNOWLEDGEMENTS IV ABSTRACT VI ZUSAMMENFASSUNG VIII LIST OF FIGURES XIV LIST OF TABLES XVI CHAPTER 1: Introduction 1 1.1 Need to model and quantify the causes and consequences of hazards on railways 1 1.2 State-of-the art techniques in the railway 2 1.3 Goals and scope of work 4 1.4 Existing work 6 1.5 Outline of the thesis 7 CHAPTER 2: Methods for safety and risk analysis 10 2.1 Introduction 10 2.1.1 Simplified risk analysis 12 2.1.2 Standard risk analysis 12 2.1.3 Model-based risk analysis 12 2.2 Risk Matrix 14 2.2.1 Determine the possible consequences 14 2.2.2 Likelihood of occurrence 15 2.2.3 Risk scoring matrix 15 2.3 Failure Modes & Effect Analysis – FMEA 16 2.3.1 Example application of FMEA 17 2.4 Fault Tree Analysis – FTA 19 2.5 Reliability Block Diagram – RBD 22 2.6 Event Tree Analysis – ETA 24 2.7 Safety Risk Model – SRM 25 2.8 Markov Model – MM 27 2.9 Quantification of expected values 31 2.9.1 Bayesian Analysis – BA 35 2.9.2 Hazard Function – HF 39 2.9.3 Monte Carlo (MC) Simulation 42 2.10 Summary 46 CHAPTER 3: Introduction to Bayesian Networks 48 3.1 Terminology in Bayesian Networks 48 3.2 Construction of Bayesian Networks 49 3.3 Conditional independence in Bayesian Networks 51 3.4 Joint probability distribution in Bayesian Networks 52 3.5 Probabilistic Inference in Bayesian Networks 53 3.6 Probabilistic inference by enumeration 54 3.7 Probabilistic inference by variable elimination 55 3.8 Approximate inference for Bayesian Networks 57 3.9 Dynamic Bayesian Networks 58 3.10 Influence diagrams (IDs) 60 CHAPTER 4: Risk acceptance criteria and safety targets 62 4.1 Introduction 62 4.2 ALARP (As Low As Reasonably Possible) criteria 62 4.3 MEM (Minimum Endogenous Mortality) criterion 63 4.4 MGS (Mindestens Gleiche Sicherheit) criteria 64 4.5 Safety Integrity Levels (SILs) 65 4.6 Importance Measures (IMs) 66 4.7 Life Quality Index (LQI) 68 4.8 Summary 72 CHAPTER 5: Application of Bayesian Networks to complex railways: A study on derailment accidents 73 5.1 Introduction 73 5.2 Fault Tree Analysis for train derailment due to SPAD 74 5.2.1 Computation of importance measures using FTA 75 5.3 Event Tree Analysis (ETA) 78 5.4 Mapping Fault Tree and Event Tree based risk model to Bayesian Networks 79 5.4.1 Computation of importance measures using Bayesian Networks 81 5.5 Risk quantification 82 5.6 Advanced aspects of example application 83 5.6.1 Advanced aspect 1: Common cause failures 83 5.6.2 Advanced aspect 2: Disjoint events 84 5.6.3 Advanced aspect 3: Multistate system and components 84 5.6.4 Advanced aspect 4: Failure dependency 85 5.6.5 Advanced aspect 5: Time dependencies 85 5.6.6 Advanced aspect 6: Functional uncertainty and factual knowledge 85 5.6.7 Advanced aspect 7: Uncertainty in expert knowledge 86 5.6.8 Advanced aspect 8: Simplifications and dependencies in Event Tree Analysis 86 5.7 Implementation of the advanced aspects of the train derailment model using Bayesian Networks. 88 5.8 Results and discussions 92 5.9 Summary 93 CHAPTER 6: Bayesian Networks for risk-informed safety requirements for platform screen doors in railways 94 6.1 Introduction 94 6.2 Components of the risk-informed safety requirement process for Platform Screen Door system in a mega city 97 6.2.1 Define objective and methodology 97 6.2.2 Familiarization of system and information gathering 97 6.2.3 Hazard identification and hazard classification 97 6.2.4 Hazard scenario analysis 98 6.2.5 Probability of occurrence and failure data 99 6.2.6 Quantification of the risks 105 6.2.6.1. Tolerable risks 105 6.2.6.2. Risk exposure 105 6.2.6.3. Risk assessment 106 6.3 Summary 107 CHAPTER 7: Influence diagrams based decision support for railway level crossings 108 7.1 Introduction 108 7.2 Level crossing accidents in railways 109 7.3 A case study of railway level crossing 110 7.4 Characteristics of the railway level crossing under investigation 111 7.5 Life quality index applied to railway level crossing risk problem 115 7.6 Summary 119 CHAPTER 8: Conclusions and outlook 120 8.1 Summary and important contributions 120 8.2 Originality of the work 122 8.3 Outlook 122 BIBLIOGRAPHY 124 APPENDIX 1 13

Reliability models and analyses of the computing systems

Ph.DDOCTOR OF PHILOSOPH

An Integrated Fuzzy Inference Based Monitoring, Diagnostic, and Prognostic System

To date the majority of the research related to the development and application of monitoring, diagnostic, and prognostic systems has been exclusive in the sense that only one of the three areas is the focus of the work. While previous research progresses each of the respective fields, the end result is a variable grab bag of techniques that address each problem independently. Also, the new field of prognostics is lacking in the sense that few methods have been proposed that produce estimates of the remaining useful life (RUL) of a device or can be realistically applied to real-world systems. This work addresses both problems by developing the nonparametric fuzzy inference system (NFIS) which is adapted for monitoring, diagnosis, and prognosis and then proposing the path classification and estimation (PACE) model that can be used to predict the RUL of a device that does or does not have a well defined failure threshold. To test and evaluate the proposed methods, they were applied to detect, diagnose, and prognose faults and failures in the hydraulic steering system of a deep oil exploration drill. The monitoring system implementing an NFIS predictor and sequential probability ratio test (SPRT) detector produced comparable detection rates to a monitoring system implementing an autoassociative kernel regression (AAKR) predictor and SPRT detector, specifically 80% vs. 85% for the NFIS and AAKR monitor respectively. It was also found that the NFIS monitor produced fewer false alarms. Next, the monitoring system outputs were used to generate symptom patterns for k-nearest neighbor (kNN) and NFIS classifiers that were trained to diagnose different fault classes. The NFIS diagnoser was shown to significantly outperform the kNN diagnoser, with overall accuracies of 96% vs. 89% respectively. Finally, the PACE implementing the NFIS was used to predict the RUL for different failure modes. The errors of the RUL estimates produced by the PACE-NFIS prognosers ranged from 1.2-11.4 hours with 95% confidence intervals (CI) from 0.67-32.02 hours, which are significantly better than the population based prognoser estimates with errors of ~45 hours and 95% CIs of ~162 hours

Advances in Computer Science and Engineering

The book Advances in Computer Science and Engineering constitutes the revised selection of 23 chapters written by scientists and researchers from all over the world. The chapters cover topics in the scientific fields of Applied Computing Techniques, Innovations in Mechanical Engineering, Electrical Engineering and Applications and Advances in Applied Modeling