Algorithm For Reliability Evaluation Research Articles

Substitution potential of solar thermal power stations in electrical energy systems

The use of fossil fuels should be reduced in future due to limited resources and increasing ecological impacts. Therefore, increased interest and incentives have been created for the development of electricity supply utilising renewable energy sources. Solar thermal generation represents an energy conversion device which has long-range potential and is applicable to most geographical regions. This paper describes the methodology used to study the substitution potential of solar energy in isolated power systems. An existing algorithm for system reliability evaluation and the corresponding production simulation program were modified and extended to more accurately account for the mode of operation and intermittent features of solar systems. The preservation of fossil fuels and installed capacity of the conventional plants, and the reduction of emissions are determined by implementing solar thermal stations. Sample computations for a real system in Jordan are carried out to define the substitution potential of solar stations with respect to conventional generation alternatives. The results are analysed and discussed according to the total cost and solar multiplier. The higher the multiplier, the lower the required breakeven cost of solar thermal stations.

Dependent and multimode failures in reliability evaluation of extra-stage shuffle-exchange MINs

Previous reliability evaluations for multistage interconnection networks (MINs) assumed that "all failures are statistically-independent and that no degraded operational modes exist for switches", though these assumptions are not realistic. For example, researchers have described instances of statistically-dependent failures, or fault side-effects, in some MINs. This paper presents efficient algorithms for terminal, broadcast, and K-terminal reliability evaluation of the shuffle-exchange network with an extra stage (SENE), a redundant-path MIN, under assumptions that allow statistical-dependence between failures and degraded operational modes for switches. A modified shock-model incorporates failure statistical-dependency and multiple operational modes into the reliability evaluation. For an N/spl times/N SENE, the reliability algorithms and their run-times are: terminal and broadcast /spl rarr/O(log(N)), and K-terminal/spl rarr/O(|K|/spl middot/log(N)).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A new algorithm for reliability evaluation of telecommunication networks with link-capacities

Abstract In the case of practical systems, a sample technique for the evaluation of symbolic reliability expression is presented. A system is considered reliable only if it successfully transmits at least the required system capacity from the transmitter to the receiver station. This paper gives two algorithms. The first algorithm begins at a valid group. All valid groups can be developed from it by successive replacement of branches one by one. All valid groups developed are mutually disjoint, represent just a probability term in final reliablity expression and there is no duplication. The second algorithm gives first algorithm's dual algorithm. It begins at a valid cut group, generates the unreliability.

A new algorithm for reliability evaluation of three-state device complex networks: Minimal cut-minimal path method

In this paper, we have modified W. J. Ruger's method [W. J. Rueger, Microelectron Reliab. 27, 273–277 (1987)], given a new algorithm to compute the two-terminal reliability of three-state device complex networks. It is a fast, simple method by hand and easily used by computers.

Reliability of multistate consecutively-connected systems

Abstract A consecutive -k- out - of -n: F system consists of an ordered sequence of n failure-prone components which all have the same transmitting capability k . The consecutive -k- out - of -n: F system is generalized to the consecutively-connected system in which each component may have a different transmitting capability. In a multistate consecutively-connected system, a component may have more than two states (working and failed). This paper provides an efficient algorithm for reliability evaluation of a circular multistate consecutively-connected system. An example is included to illustrate the application of the algorithm developed.

On distributed computing systems reliability analysis under program execution constraints

Presents an algorithm for computing the reliability of distributed computing systems (DCS). The algorithm, called the Fast Reliability Evaluation Algorithm, is based on the factoring theorem employing several reliability preserving reduction techniques. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economical in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Reliability evaluation and decision problems in extra stage shuffle‐exchange MINs

AbstractA multistage interconnection network (MIN) uses switching elements for interconnecting processors to memory or processors. This paper first considers a stochastic model of a shuffle exchange network (of size N) with an extra stage and develops terminal, broadcast, and K‐terminal reliability evaluation algorithms that run in time O(log log N), O(log N), and O(k log N), respectively, where k = |K|. Second, a deterministic model for the MIN is considered and decision problems in which one is interested in evaluating whether a network can effect a specified set of connections with a given set of failures are solved. We develop a set of approaches for the SENE for the terminal decision, broadcast decision, and network decision problems and for the general S, T decision problem for an input set S and output set T. Each algorithm runs within time polynomial in the size of the SENE and the number of faults and, in some cases, logarithmic in the size of the SENE and polynomial in the number of faults. These approaches are based on either testing for the existence of an appropriate pathset or testing for the nonexistence of an appropriate cutset. © 1993 by John Wiley &amp; Sons, Inc.

A new algorithm for multi-area reliability evaluation—Simultaneous decomposition-simulation approach

This paper presents a new and efficient approach for including a multi-state load model in multi-area reliability calculations. In the extended decomposition-simulation approach, indices are computed and stored for each load state separately, and then aggregated for all the load states, thus the computation time increases linearly with the number of load states. In the proposed approach, decomposition-simulation is performed for all load states simultaneously. This is achieved by using a modified generation model and a reference load state. The proposed algorithm is shown to be as accurate as the previous one and many times faster.

A general-purpose, high performance algorithm for distributed systems reliability evaluation

Abstract A general purpose, high performance algorithm for reliability evaluation of distributed systems is developed in this research. The algorithm is general in the sense that it is used to evaluate different network reliability measures such as terminal, K -terminal, all-terminal, and degraded system reliability. Furthermore, it is used to evaluate the above measures in networks that are directed or undirected as well as in networks with perfect or imperfect nodes. The options for numeric or symbolic and exact or approximate reliability computation are also available. The algorithm efficiently calculates reliability of distributed systems with sizes of practical interest, and has comparable or much better speed than other reported algorithms. Another significant contribution of this paper is the method for efficient handling of systems with imperfect nodes, an issue which is particularly important for practical distributed systems with unreliable processing nodes.

Implementation of a factoring algorithm for reliability evaluation of undirected networks : Lucia I. P. Resende. IEEE Trans. Reliab.37(5), 462 (December 1988)

Implementation of a factoring algorithm for reliability evaluation of undirected networks : Lucia I. P. Resende. IEEE Trans. Reliab.37(5), 462 (December 1988)

Probabilistic load flow techniques applied to power system expansion planning

An application of the probabilistic load flow (PLF) techniques to the expansion planning of power systems is presented. A brief review of the PLF formulation and solution is included to identify differences between this technique and other available tools such as composite generation and transmission reliability evaluation algorithms. The potential of the PLF technique is demonstrated by a case study using the Brazilian North/Northeastern system. The network expansion planning of an area of this system is studied using a conventional load flow program and the results are compared with those obtained from a PLF program that models generation capacity unavailabilities and peak load uncertainties. The significant differences demonstrate the benefits of the PLF technique. Special emphasis is given to short-term and long-term modeling using analyses of real system load data. >

Improved Algorithms for Multi-Area Reliability Evaluation Using the Decomposition-Simulation Approach

Algorithms are presented for improving the overall effectiveness and efficiency of the decomposition-simulation approach for multi-area reliability evaluation. An algorithm for developing a multi-area load model is first described. This algorithm is based on clustering concepts and captures correlation between area loads. Next, algorithms for simplifying frequency calculations are described. These algorithms provide substantial reductions in the computational time requirement, thus alleviating one of the drawbacks of the decomposition-simulation approach. System studies are presented to demonstrate the relative merits of all the algorithms introduced here. >

Improved algorithms for multi-area reliability evaluation using the decomposition-simulation approach

Algorithms are presented for improving the overall effectiveness and efficiency of the decomposition-simulation approach for multi-area reliability evaluation. An algorithm for developing a multi-area load model is first described. This algorithm is based on clustering concepts and captures correlation between area loads. Next, algorithms for simplifying frequency calculations are described. These algorithms provide substantial reductions in the computational time requirement, thus alleviating one of the drawbacks of the decomposition-simulation approach. System studies are presented to demonstrate the relative merits of all the algorithms introduced here. >

Implementation of a factoring algorithm for reliability evaluation of undirected networks

A description is given of a FORTRAN implementation of a factoring algorithm (LR-F) for reliability evaluation of undirected networks. The algorithm is used in conjunction with PolyChain, a FORTRAN program for reliability evaluation of undirected networks of a special structure via polygon-to-chain reductions. PolyChain is used as a preprocessor to reduce the size of the network. It places a constraint on the topology of the input network, requiring it to be nonseparable. The present version of PolyChain checks for this condition. In the case of separable networks a code using PolyChain as a subrouting can be used to compute the reliability of each nonseparable component and then the overall reliability of the network. A brief theoretical review of the LR-F factoring algorithm and the design and implementation of the code is presented. >

セラミックスの強度信頼性評価 Ｉ 評価アルゴリズムの提案とＰＳＺの寿命予測

The main objective of this study is to evaluate the strength reliability of ceramics for mechanical com-ponent applications based on fracture mechanics. This paper discribes an algorithm for the strength reliability evaluation of ceramics and prediction of the life of PSZ (Partially Stabirized Zirconia) components according to the proposed algorithm. Extensive crack growth is observed prior to the final fracture during cyclic three-point bending and it is confirmed that PSZ exhibits a linear relationship on logarithmic scale between the fatigue crack growth rate da/dN and the stress intensity factor range ΔK. Statistical charac-teristics of the crack growth rate parameters C, m and the fatigue fracture toughness value Kfc are also found to fit well with Weibull distribution. It was found that the estimated life of PSZ components decreases with increasing stress range and initial crack length and with decreasing fracture probability.

On computer communication network reliability under program execution constraints

The authors propose a technique to compute software system reliability (SSR). The method, called FARE (fast algorithm for reliability evaluation), does not require a priori knowledge of multiterminal connections (MCs) for computing the reliability expression. An effort is made to sole the problem of N-version programming by using the FARE approach. Owing to its short execution time and low memory requirement, FARE can be used to calculate the SSR of fairly large distributed systems. >

Recursive algorithm for reliability evaluation of [formula omitted]: G system : S. P. Jain and Krishna Gopal. IEEE Trans. Reliab.R-34 (2) 144 (1985)

Recursive algorithm for reliability evaluation of [formula omitted]: G system : S. P. Jain and Krishna Gopal. IEEE Trans. Reliab.R-34 (2) 144 (1985)

Reliability Evaluation of Multistate Systems with Multistate Components

This paper presents two efficient algorithms for reliability evaluation of monotone multistate systems with s-independent multistate components. The algorithms are based on the Doulliez & Jamoulle decomposition method. Algorithm 1 requires the minimal paths to be known; Algorithm 2 requires the minimal cuts to be known (the state of the system need not be specified for each vector of component states). Computer programs for implementing the algorithms are given. Computational-times are presented, and compared with the ``Inclusion-Exclusion Method'' and the ``State Enumeration Method''. The results demonstrate clearly the superiority of the algorithms to the two other methods.

Recursive Algorithm for Reliability Evaluation of k-out-of-n:G System

Recursive Algorithm for Reliability Evaluation of k-out-of-n:G System

Recursive Algorithm for Reliability Evaluation of k-out-of-n:G System

An algorithm for computing recursively the exact system reliability of k-out-of-n systems is proposed. It is simple, easy to implement, fast, and memory efficient. It gives a reliability expression with minimal number of terms, C(k, n) and involves only a few multiplications. The reduction in number of terms and multiplications is over 50 percent compared to some methods. The recursive nature of the algorithm enables one to design easily the number of units in the system to meet a reliability target. An alternative representation of the algorithm which is easy to remember and good for manual computation is given. However, it involves a few more multiplications compared to the original one but fewer than those required with existing methods.