Search

This paper presents a new technique for the determination of minimal cut sets in substation reliability evaluation. The proposed technique detects events including the malfunction of circuit breakers referred to as stuck-breaker conditions. These selections are important steps in substation reliability evaluation. The effectiveness of the proposed technique is examined by it being applied to breaker-and-a-half, ring bus and radial configurations. The proposed technique can be easily used in the expansion of computer programs in order to obtain the substation reliability indices. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: In this article we consider a spectral sequence associated to a filtered Morse–Conley chain complex , where Δ is a connection matrix. The underlying motivation is to understand connection matrices under continuation. We show how the spectral sequence is completely determined by a family of connection matrices. This family is obtained by a sweeping algorithm for Δ over fields as well as over . This algorithm constructs a sequence of similar matrices  , where each matrix is related to the others via a change-of-basis matrix. Each matrix over (resp., over ) determines the vector space (resp., -module) and the differential . We also prove the integrality of the final matrix produced by the sweeping algorithm over which is quite surprising, mainly because the intermediate matrices in the process may not have this property. Several other properties of the change-of-basis matrices as well as the intermediate matrices are obtained. [Copyright &y& Elsevier]

Network reliability analysis is usually based on minimal path or cut enumeration from which the associated reliability expressions are deduced. The cut-set method is a popular approach in the reliability analysis of many systems from simple to complex configurations. The computational requirements necessary to determine the minimal cut-sets of a network depend mainly on the number of minimal paths between the source and the sink. A technique designated as the "Path Tracing Algorithm" is presented in this paper, which can handle both simple and complex networks, and considers both unidirectional and bi-directional branches. A step by step procedure is explained using a bridge-network. The algorithm is easy to program, and does not require limits on the size of the network. The applicability of the proposed technique is illustrated by application to a more complicated system. [ABSTRACT FROM AUTHOR]