Failure Probability of Strict Consecutive-k-out-of-n:F Systems

A system with n components in sequence is a strict consecutive-k-out-of-n:F system if and only if it fails when at least k consecutive components are failed, but isolated strings of component failures of length less than k do not occur. This paper gives the failure probability function of a strict linear consecutive-k-out-of-n:F system in a closed form. The calculation of the failure probability of a strict circular consecutive-k-out-of-n:F system is reduced to the linear case.     

Direct Computation for Consecutive-k-out-of-n: F Systems

A consecutive-k-out-of-n: F system has n i.i.d. components; the system fails if any k consecutive components fail. This paper gives a simple, direct combinatorial method for determining the system failure probability.     

Failure Distributions of Consecutive-k-out-of-n:F Systems

Most literature on consecutive-k-out-of-n:F systems gives recursive equations for computing the system reliability. This paper gives a formula for computing the system reliability directly. Using this formula, the system failure distribution is derived. Upper and lower bounds for the system reliability or the system failure distribution are given. Some numerical examples are included.     

Exact Reliability Formulas for Linear Consecutive-k-out-of-n: F Systems

1　ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒａｔｅｌｅｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍｗｉｔｈｎｒｅｌａｙｓｔａｔｉｏｎｓ (ｅｉｔｈｅｒｓａｔｅｌｌｉｔｅｓｏｒｇｒｏｕｎｄｓｔａｔｉｏｎｓ) ,ｗｅｗｉｌｌｎａｍｅｔｈｅｓｔａｔｉｏｎｓｃｏｎｓｅｃｕｔｉｖｅｆｒｏｍ 1ｔｏｎ .ＳｕｐｐｏｓｅａｓｉｇｎａｌｅｍｉｔｔｅｄｆｒｏｍＳｔａｔｉｏｎ 1ｃａｎｂｅｒｅ ｃｅｉｖｅｄｂｙｂｏｔｈＳｔａｔｉｏｎｓ 2ａｎｄ 3 ,ａｎｄａｓｉｇｎａｌｒｅｌａｙｅｄｆｒｏｍＳｔａｔｉｏｎ 2ｃａｎｂｅｒｅｃｅｉｖｅｄｂｙ…     

Consecutive-k-out-of-n: F Networks

This paper develops a counting scheme for determining the reliability of a consecutive-k-out-of-n:F network. An example of such a network, a set of tables, and a comparative example are provided.     

Lifetime Distribution of Consecutive-k-out-of-n:F Systems With Exchangeable Lifetimes

Algorithms for computing the lifetime distributions of consecutive-k-out-of-n:F systems with statistically independent, and statistically exchangeable component lifetimes are presented. A load-sharing model for statistically exchangeable component lifetimes and the effects of minimal repair on system lifetime are considered.     

Con/k/n:F系统可靠性计算方法研究的最新进展

本文综述了近二十年来多态线性相邻连接表决系统模型中Con/K/n:系统可靠性计算方法研究的进展.着重介绍了几种具有典型应用价值的可靠性计算方法,算法的思想及其复杂度分析,并且利用最新的一个算法,予以对例题给出了具体解.     

Exact Reliability Formulas for Linear & Circular Consecutive-k-out-of-n:F Systems

A consecutive-k-out-of-n:F system, with n linearly or circularly arranged i.i.d. components is examined. The system reliability has an exact formula which is straight forward and more effective than those given elsewhere; the two formulas are given.     

Optimal Consecutive-k-out-of-n:F Component Sequencing

A consecutive-k-out-of-n:F system is an ordered linear arrangement of n components that fails if and only if at least k consecutive components fail. Suppose that all components are interchangeable, that component failures are s-independent, and that component failure probabilities need not be equal. When k = 2, a certain ordering of the components minimizes the probability of system failure regardless of the particular component failure probabilities. This paper characterizes all other values of k and n for which such an optimal configuration can be determined without knowledge of the component failure probabilities.     

Fast Solutions for Consecutive-k-out-of-n: F System

The previous literature on consecutive-k-out-of-n: F systems gives recursive equations for the system reliability only for the special case when all component reliabilities are equal. This paper gives recursive equations for the more general case when the component reliabilities can be different from each other. Furthermore, reliabilities can be computed more quickly from these recursive equations than those previously given.     

Consecutive-k-out-of-n:F System With Sequential Failures

For consecutive-k-out-of-n:F systems in which failures occur one at a time, a time-to-failure model is developed.     

Reliability of a Large Consecutive-k-out-of-n:F System

The system reliability and some bounds are obtained for a large consecutive-k-out-of-n:F system with equal component failure probabilities.     

Reliability of a Consecutive-k-out-of-n:F System for Markov-Dependent Components

We examine a consecutive-k-out-of-n:F system, where the probability of failure of a component depends upon the state, (good or failed) of the preceding component; ie, the states of the components form a Markov chain. We compute the reliability of such a system, via a recurrence relation.     

Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F System

A recursive algorithm computes the reliability of a consecutive-k-out-of-n:F system with unequal component failure probabilities.     

On Reliability of a Large Consecutive-k-out-of-n:F System with (k - 1)-step Markov Dependence

This paper studies the reliability of a large consecutive-k-out-of-n:F system when the component failure states have (k - 1)-step Markov dependence.     

Periodic, Strict, and Quasi-Invariance in Linear Systems

This brief deals with shift invariance in linear systems (LSs), using a group theoretical approach. The group approach is necessary to obtain general definitions, which can be applied to continuous-time, discrete-time, multirate and also multidimensional LSs. Thus, a unique definition is given for periodic invariance and strict invariance (SI) and also for quasi-invariance (QI), a new concept, intermediate between periodic and SI. The importance of QI relies upon the fact that it is comprehensive of practically all multirate LSs     

用于光通信系统的BiCMOS F/V转换器

设计了一种由3运放A_1、A_2和A_3组成的BiCMOS频率/电压(F/V)转换器,其中A_1、A_2设计成共源一共源CMOS运放,而低通滤波器(LPF)中的A_3采用BiCMOS运放.优选了整个F/V转换器的元器件参数,并采取了提速和降耗等措施.实验结果表明,所设计的转换器输入至LPF的脉冲信号频率f_2与输入信号频率f_i相等,且该转换器输出电压平均值U_o与f_i成正比;它可在4 Hz≤f_i≤10 kHz的范围内工作,其综合性能指标--延迟-功耗积约为1.09 nJ,转换线性度仅为1.7×10~(-2),因而特别适用于低功耗、高线性度的光纤通信和光电检测系统中.

Abstract：

A BiCMOS F/V converter including 3 operational amplifiers A_1, A_2 and A_3 was designed, in which A_1 and A_2 were double common-source CMOS operational amplifiers and the low-pass filter (LPF) A_3 was a BiCMOS one. The parameters of the entire converter were optimized and some measures were adopted such as raising speed and reducing power-consumption. The experimental results show that the its input pulse signal frequency f_2 to the LPF is equal to the input signal frequency f_i, and its average-output-voltage (U_o) is in direct proportion to f_i. The designed converter can work properly within 4 Hz～10 kHz, and its delay-power product is about 1.09 nJ, and the conversion linearity is only 1.7 X 10~(-2). With these characteristics, the designed converter is very suitable for low-consumption and high-linearity fiber-optic communications and photoelectric detection systems.     

电磁导弹的严格解

电磁导弹一直是作为Maxwell方程的渐近解来研究的,它是否可以严格分析还不得而知。本文根据辐射源的电流分布,仅用矢量位A表述电磁场,给出电磁导弹辐射线上的严格场解,包括电场、磁场和能量的频域解与时域解,为严格分析任意激励波形的传播特性和理解电磁导弹的慢衰减机理提供了数学基础。     

Strict convexity of the feasible log-SIR region

The feasible log-SIR region is defined as a set of all signal-to-interference ratios (SIR) expressed in logarithmic scale that can be supported in a wireless network by means of power control and with all users being active concurrently. Recently, the feasible log-SIR region was shown to be a convex set, which is a key ingredient in the development of some power control strategies for wireless systems. In this paper, under the assumption of a noiseless channel, we strengthen these results by proving a necessary and sufficient condition for the feasible log-SIR region to be a strictly convex set. The strict convexity property is of interest since it is closely related to the problem of the existence and uniqueness of a so-called log-SIR fair power vector.