Reliability of linear consecutively-connected systems withmultistate components

A linear consecutively-connected system with multistate components (LCCSMC) consists of n+2 linear ordered statistically independent multistate components C_i, i∈[0,n], and the sink C_n+1 (which is absolutely reliable in a certain sense). System failure is caused by the C_i. If C_i is in state 0 then it is failed, if it is in the state j (1⩽j⩽k_j for a given k_j) then there are paths from C_i to the next min(j,n-i+1) components. The system fails if there is no path from C₀ to C_n+1. This system generalizes the linear consecutive-k-out-of-n:F system and the consecutively-connected system of Shanthikumar (1987). The paper gives recursive algorithms for determining the LCCSMC reliability     

Reliability Bounds for Multi-State $k$-out-of- $n$ Systems

Algorithms have been available for exact performance evaluation of multi-state k-out-of-n systems. However, especially for complex systems with a large number of components, and a large number of possible states, obtaining "reliability bounds" would be an interesting, significant issue. Reliability bounds will give us a range of the system reliability in a much shorter computation time, which allow us to make decisions more efficiently. The systems under consideration are multi-state k-out-of-n systems with i.i.d. components. We will focus on the probability of the system in states below a certain state d, denoted by Q_sd. Based on the recursive algorithm proposed by Zuo & Tian [14] for performance evaluation of multi-state k-out-of-n systems with i.i.d. components, a reliability bounding approach is developed in this paper. The upper, and lower bounds of Q_sd are calculated by reducing the length of the k vector when using the recursive algorithm. Using the bounding approach, we can obtain a good estimate of the exact Q_sd value while significantly reducing the computation time. This approach is attractive, especially to complex systems with a large number of components, and a large number of possible states. A numerical example is used to illustrate the significance of the proposed bounding approach.     

Fast optimal diagnosis procedures for k-out-of-n:G systems

A k-out-of-n:G system consists of a set of components, where each component is either faulty or fault-free. The system is working if at least k components are fault-free. The problem of finding an optimal diagnosis procedure for a given k-out-of-n:G system has been considered in several research fields including medical diagnosis, redundant-system testing, and searching data-files. A polynomial-time algorithm for this problem was presented first by Salloum, and later by Salloum and Breuer, and independently by Ben-Dov. This paper implements the Salloum-Breuer-Ben-Dov algorithm, leading to an optimal diagnosis procedure that can determine the state of any given system in O(n·log(n)) time complexity and O(n) space complexity. The efficiency is achieved by using a generalized radix sorting procedure that uses a heap data structure. For some k-out-of-n:G systems, including those with equal testing costs for all components, the components along the leftmost and rightmost paths in the optimal diagnostic tree uniquely determine the other components in the tree. This property is used to devise a faster optimal diagnosis procedure than the one for the general k-out-of-n:G system. With regard to complexity, these procedures are the best solutions for the problem under consideration. This conjecture is supported by the fact that all these procedures require a sorting operation which has O(n·log(n)) as a lower bound on its time complexity     

A reliability test-plan for series systems with components havingstochastic failure rates

This paper proposes a reliability test plan for a series system, by considering the parameter λ_j of the exponential distribution to be a random variable having uniform distribution over [0, &thetas;_j], j = 1, 2,..., n. Explicit expressions are obtained for the optimal values of the t_j, when the number of components in the system is 2. The general solution, albeit implicit, has also been obtained when the number of components in a given system is ⩾3. Mathematical programming is used to find the optimal solution and to illustrate it with numerical results     

An algorithm for computing the reliability of weighted-k-out-of-nsystems

This paper constructs a new k-out-of-n model, viz, a weighted-k-out-of-n system, which has n components, each with its own positive integer weight (total system weight=w), such that the system is good (failed) if the total weight of good (failed) components is at least k. The reliability of the weighted-k-out-of-n:G system is the complement of the unreliability of a weighted-(w-k+1)-out-of-n:F system. Without loss of generality, the authors discuss the weighted-k-out-of-n:G system only. The k-out-of-n:G system is a special case of the weighted-k-out-of-n:G system wherein the weight of each component is 1. An efficient algorithm is given to evaluate the reliability of the weighted-k-out-of-n:G system. The time complexity of this algorithm is O(n.k)     

Performance evaluation of generalized multi-state k-out-of-n systems

The generalized multi-state k-out-of-n:G system model defined by Huang provides more flexibilities for modeling of multi-state systems. However, the performance evaluation algorithm they proposed for such systems is not efficient, and it is applicable only when the k/sub i/ values follow a monotonic pattern. In this paper, we defined the concept of generalized multi-state k-out-of-n:F systems. There is an equivalent generalized multi-state k-out-of-n:G system with respect to each generalized multi-state k-out-of-n:F system, and vice versa. The form of minimal cut vector for generalized multi-state k-out-of-n:F systems is presented. An efficient recursive algorithm based on minimal cut vectors is developed to evaluate the state distributions of a generalized multi-state k-out-of-n:F system. Thus, a generalized multi-state k-out-of-n:G system can first be transformed to the equivalent generalized multi-state k-out-of-n:F system, and then be evaluated using the proposed recursive algorithm. Numerical examples are given to illustrate the effectiveness and efficiencies of the proposed recursive algorithms.     

k-out-of-n:G System Reliability With Imperfect Fault Coverage

Systems requiring very high levels of reliability, such as aircraft controls or spacecraft, often use redundancy to achieve their requirements. Reliability models for such redundant systems have been widely treated in the literature. These models describe k-out-of-n:G systems, where n is the number of components in the system, and k is the minimum number of components that must work if the overall system is to work. Most of this literature treats the perfect fault coverage case, meaning that the system is perfectly capable of detecting, isolating, and accommodating failures of the redundant elements. However, the probability of accomplishing these tasks, termed fault coverage, is frequently less than unity. Correct modeling of imperfect coverage is critical to the design of highly reliable systems. Even very high values of coverage, only slightly less than unity, will have a major impact on the overall system reliability when compared to the ideal system with perfect coverage. The appropriate coverage modeling approach depends on the system design architecture, particularly the technique(s) used to select among the redundant elements. This paper demonstrates how coverage effects can be computed, using both combinatorial, and recursive techniques, for four different coverage models: perfect fault coverage (PFC), element level coverage (ELC), fault level coverage (FLC), and one-on-one level coverage (OLC). The designation of PFC, ELC, FLC, and OLC to distinguish types of coverage modeling is suggested in this paper.     

Lifetime of Combined $k$-out-of-$n$ , and Consecutive $k_{c}$ -out-of-$n$ Systems

A combined k-out-of-n:F(G) & consecutive k_c -out-of-n :F(G) system fails (functions) iff at least k components fail (function), or at least fcc consecutive components fail (function). Explicit formulas are given for the lifetime distribution of these combined systems whenever the lifetimes of components are exchangeable, and have an absolutely continuous joint distribution. The lifetime distributions of the aforementioned systems are represented as a linear combination of distributions of order statistics by using the concept of Samaniego's signature. Formulas for the mean lifetimes are given. Some numerical results are also presented.     

Reliability Analysis of the k-out-of-n:F System

A class of repairable systems known as k-out-of-n:F systems, 1 ? k ? n, consists of n units in parallel redundancy which are serviced by a single repairman; system failure occurs when k units are simultaneously inoperable for the first time. In this paper, assuming constant failure rates and general repair distributions, reliability characteristics of the k-out-of-n:F system are treated using two different methods. In Part I, a conditional transform approach is applied to the 2-out-of-n:F system. Transforms of distributions are obtained for T (the time to system failure), the time spent on repairs during (0, T) and the free time of the repairman during (0, T). In Part II, the supplementary variable technique is used to investigate time to failure characteristics of the k-out-of-n:F system for k = 2 and k = 3. A model of an airport limousine service illustrates the use of the results.     

Three messages are not optimal in worst case interactivecommunication

Let X and Y be two jointly distributed random variables. Suppose person P_X, the informant, knows X, and person P_Y, the recipient, knows Y, and both know the joint probability distribution of the pair (X,Y). Using a predetermined protocol, they communicate over a binary error-free channel in order for P_Y to learn X, whereas P_X may or may not learn Y. Cˆm(X|Y) is the minimum number of bits required to be transmitted (by both persons) in the worst case when only m message exchanges are allowed. Cˆ∞(X|Y) is the number of bits required when P_X and P_Y can communicate back and forth an arbitrary number of times. Orlitsky proved that for all (X,Y) pairs, Cˆ₂(X|Y)⩽4Cˆ∞(X|Y)+3, and that for every positive c and ∈ with ∈<1, there exist (X,Y) pairs with Cˆ₂(X|Y)⩾(2-∈)Cˆ₃ (X|Y)⩾(2-∈)Cˆ-∞(X|Y)⩾c. These results show that two messages are almost optimal, but not optimal. A natural question, then, is whether three messages are asymptotically optimal. In this work, the authors prove that for any c and ∈ with 0<∈<1 and c>0, there exist some (X,Y) pairs for which Cˆ₃(X|Y)⩾(2-∈)Cˆ₄(X|Y)⩾c. That is, three messages are not optimal either     

Optimal quaternary linear codes of dimension five

Let d_q(n,k) be the maximum possible minimum Hamming distance of a q-ary [n,k,d]-code for given values of n and k. It is proved that d₄ (33,5)=22, d₄(49,5)=34, d₄ (131,5)=96, d₄(142,5)=104, d₄(147,5)=108, d ₄(152,5)=112, d₄(158,5)=116, d₄(176,5)⩾129, d₄(180,5)⩾132, d₄(190,5)⩾140, d₄(195,5)=144, d₄(200,5)=148, d₄(205,5)=152, d₄(216,5)=160, d₄(227,5)=168, d₄(232,5)=172, d₄(237,5)=176, d₄(240,5)=178, d₄(242,5)=180, and d₄(247,5)=184. A survey of the results of recent work on bounds for quaternary linear codes in dimensions four and five is made and a table with lower and upper bounds for d₄(n,5) is presented     

Reliability analysis of a k-out-of-n:G vehicle fleet

This paper presents a reliability analysis of a k-out-of-n:G on-surface vehicle fleet. The transit system is in a failed state when (n − k + 1) vehicles failed. Laplace transforms of state probabilities and reliability of the transit system are derived. The transit system steady-state probabilities and availability formulas are also developed.     

Stochastic ordering results for consecutive k-out-of-n:F systems

A linear (circular) consecutive k-out-of-n:F system is a system of n linearly (circularly) ordered components which fails if and only if at least k consecutive components fail. We use recursive relationships on the reliability of such systems with independent identically distributed components to show that for any fixed k, the lifetime of a (linear or circular) consecutive k-out-of-n:F system is stochastically decreasing in n. This result also holds for linear systems when the components are independent and not necessarily identically distributed, but not in general for circular systems.     

一类多状态连续n中取k(G)系统的可靠性计算

为了计算多状态连续厅中取后（G）系统的可靠性,引入4个定理,将满足引理的多状态系统转换为二元状态系统。分别推导了多状态线形连续k／n（G）系统和环形连续k／n（G）系统的可靠性计算公式。证明了固定k值增加一个新部件,若部件可靠性独立同分布,线形和环形系统可靠性均增加;若部件可靠性独立但不同分布,环形系统存在一个极值,新增加部件可靠性大于这个极值时得到的新系统可靠性增加,反之系统可靠性下降。     

The nonexistence of some five-dimensional quaternary linear codes

Let n₄(k, d) be the smallest integer n, such that a quaternary linear [n, k, d; 4]-code exists. It is proved that n₄ (5, 20)=30, n₄(5, 42)⩾59, n₄(5, 45)⩾63, n₄(5, 64)⩾88, n₄(5, 80)=109, n₄(5, 140)⩾189, n₄(5, 143)⩾193, n₄ (5, 168)⩾226, n₄(5, 180)⩾242, n₄(5, 183)⩾246, n₄(5, 187)=251     

Reliability evaluation of combined k-out-of-n:F,consecutive-k-out-of-n:F and linear connected-(r, s)-out-of-(m, n):Fsystem structures

Based on a real industrial application, three new system reliability models are proposed: combined k-out-of-n:F and consecutive-k _c-out-of-n:F system; combined k-out-of-m·n:F and linear connected-(r,s)-out-of-(m,n):F system; and combined k-out-of-m·n:F consecutive-k_c-out-of-n:F and linear connected-(r,s)-out-of-(m,n):F system. Reliability evaluation algorithms are provided for these models. The computation times of the algorithms for these models are, respectively: O(n·k), O(k·n·2 ^m·s^m-r+2), O(k·n·(2k_c )^m·s^m-r+1). The algorithms are used for system reliability evaluation of furnace systems. The concept of the combined k-out-of-n:F and 1-dimensional and 2-dimensional consecutive-k-out-of-n:F systems can be extended to other variations of the consecutive-k-out-of-n:F systems, e.g., the consecutive-k-out-of-n:G system and 1-dimensional and 2-dimensional r-within-k-out-of-n:F systems. The concept of Markov chain imbeddable (MIS) systems is another excellent tool that can be used for analysis of such combined system structures     

Two formulas for computing the reliability of incompletek-out-of-n:G systems

Reliability computation of highly redundant systems most commonly uses approximate methods. Except for k-out-of-n:G systems or consecutive k-out-of-n:G systems, exact reliability formulas offering a broader range of applicability are rare. This paper gives two new formulas for this purpose: the first handles k-out-of-n:G systems of which some paths are not present; the second allows for the reliability calculation of a coherent binary system in general. Both formulas express system reliability in terms of the reliabilities of k-out-of-n:G systems. In practice, these new formulas cope with highly redundant systems with certain similarities to k-out-of-n:G systems. For example, a reliability of the control-rod system of a nuclear reactor is computed. Although the paper is directed to system reliability, the results can be used for computing the failure probability of a system which in practical applications is sometimes more convenient. In which case, the formulas are to be changed such that a system is given by its minimal cut-sets instead of minimal path-sets, and p should be a component unreliability instead of its reliability. The first proof of formula uses domination theory and, in thus contributes to the state of the art in this field     

Steady-State Availability of k-out-of-n:G System with Single Repair

This paper presents a solution and computer program for steady-state availability of a k-out-of-n:G system with single repair. Techniques and methodologies are commonly treated in text books to solve one and two element availabilities. This paper provides both the solution for k-out-of-n system availability and a FORTRAN source program for calculating the availability. The managers of mass transit and computer systems can put n elements on line with the assurance that, on the average, at least k elements will actually be available to complete the mission.     

Reliability of circular consecutively-connected systems withmultistate components

A circular consecutively-connected system with multistate components (CCCSMC) consists of a set of a components e_i, i∈[1,n] arranged in a circle. The e_i is followed by e _i+1, i∈[1,n-1]; e_n is followed by e₁ . The e_i can be in 1 of the states 0,…,k_i . If e_i is in state k∈[0,k_i], then its range is k (the k components following e_i are within its range). The system is functioning if and only if, for every component e _j, j∈[1,n] there is an e_i such that e_j is within the range of e_i. The paper gives a recursive algorithm for determining the CCCSMC reliability     

非对称多模量子叠加态光场的等幂高次和压缩

根据量子力学中的态叠加原理,构造了由多模复共轭相干态|{zj(a)*}>q和多模复共轭相干态|{zj(b)*}>q的相反态|{-zj(b)*}>q的线性叠加所组成的非对称两态叠加多模量子叠加态光场|ψ(2)>q,利用多模压缩态理论研究了态|ψ1f(2)>q的等幂高次和压缩特性,结果表明: 1)当Rj(a)=Rj(b)和ψj(a)-ψj(b)=±(2k 1)π(k=0,1,2,3……),态|ψ1f(2)>q的两个正交相位分量均处于N-H最小测不准态的结果;2)当Rj(a)=Rj(b)=Rj和ψj(a)=ψj(b)=ψj,ψ态|1f(2)>q的等幂高次和压缩与文献3的结果相似; 3)当Rj(a)≠Rj(b)=Rj和ψj(a)=ψj(b)=ψj,且和满足一定条件时,无论qN为奇数还是偶数,态|ψ1f(2)>q的两个正交相位分量均可分别呈现周期性变化的等幂高次和压缩效应,但qN为奇数时的压缩深度大于qN为偶数时的压缩深度。