一类并联系统的剩余寿命和平均剩余寿命

研究了n个独立但不同分布的元件构成的一类并联系统的剩余寿命和平均剩余寿命,即在t_1时刻有l个元件失效,第k个元件的寿命恰好是t_2(0≤lkn,0≤t_1t_2),系统在t_2时刻仍然工作的条件下并联系统的可靠性函数和平均剩余寿命.     

失效单调关联系统中可存活元件的剩余寿命的混合表示

本文中研究的是由$n$个独立同分布元件构成的单调关联系统,当该单调关联系统失效时得到了系统中可存活元件的剩余寿命的可靠性函数的混合表示.基于signature的概念,对两个系统的剩余寿命进行了随机比较.     

n个同型部件k个修理设备的冷贮备可修系统的可靠度研究

在设定元件的工作寿命和维修时间的分布都是负指数分布,全部随机变量都互相独立,发生故障的元件能够修成新的前提下,对由n个同种型号的元件和k(k≤n)个设备修理构成的冷贮存可修体系的可靠性方面进行分析,构建关于此体系的数学模型,获得了n个同种型号元件的冷贮存体系在k个设备修理的情况下的可靠度,且探讨在修理设备k值不相同的情况的可靠度,并针对n=3的情况下,分析修理设备数不相同情况下的可靠度。     

离散时间冲击下的k/n(G)系统的可靠性分析

研究了一类离散时间冲击下的k/n(G)系统.冲击到达间隔服从几何发布,冲击的量服从一般发布,每次冲击对系统中工作的部件独立产生影响.假设每一部件受冲击后以一定的概率发生故障,各次冲击独立地对系统造成损失,直到工作部件数少于k系统故障为止.基于上述假设,我们求得了系统的离散时间寿命的分布,进而得到系统的可靠度、平均寿命等可靠性指标.作为k/n(G)系统在k=n和k=1时的特例,还得到n部件串联、并联系统在离散时间冲击下的可靠性指标.最后,给出了数值算例.     

������ʷ�����ٽ�״̬�Ŀ�ά��n��ȡk:Gϵͳ�Ŀ��öȷ���

于一个具有历史相依临界状态的可维修n中取k:G系统, 论文给出了当系统平稳时它的可用度, 一个循环中的平均工作时间和平均失效时间. 并且和不具有年龄相依临界状态的可维修n中取k:G系统进行了比较.     

随机环境影响下系统可靠性比较

本文研究随机环境影响系统相依结构的情形下,系统可靠性的随机比较,文章采用连接函数表示系统的相依结构,研究不同随机环境因子下两个系统的象限序、弱多元失效率序、n中取k系统的寿命等的随机比较,并通过实际例子进行分析.     

故障相关的表决可修系统可用度计算

为解决k/n(F)表决可修系统中零部件的故障相关干涉问题,根据零部件工作寿命之间的正相关结构,运用Copula函数的相关性理论,提出微时间差t→t+Δt内系统一步状态转移矩阵概念,建立了故障相关的表决可修系统可靠性模型.模型全面考虑了共因故障、零件工作寿命和修复时间分布的一般性,从而突破传统独立指数型可修系统可靠性模型的三类局限性.验证了k/n(F)可修系统相关性模型的通用性,给出了Copula模型选择和估计相关程度参数的方法.     

一个有趣猜想的证明

文[1 ] 提出了下述猜想 :若自然数n使 4n+ 1为质数 ,则有且只有n个不超过 2n的不同的自然数 :k1 ,k2 … ,kn(k′1 ,k′2 ,… ,k′n为相应的不超过 2n的剩余的n个不同的自然数 ) ,使∑ni=1cos2ki- 14n + 1 π=1 + 4n+ 14,∑ni=1cos2k′i- 14n+ 1 π =1 - 4n + 14.本文给出上述猜想的证明并且指出序列k1 ,k2 ,… ,kn 的特性 .记A={x∶x是模p的二次剩余 },B ={x∶x是模p的二次非剩余 }.引理 1　 ( [2 ])设奇素数p≡ 1 (mod4) ,则( 1 ) 1 ,2 ,… ,p- 1中有且只有p - 14个偶数为模p的二次剩余 ,p - 14个奇数为模p的二次剩余 ;( 2 ) 1 ,2 ,… ,p-…     

考虑n中连续取k失效准则的树状系统可靠性求解方法

树状网络系统在管道运输,网络通信中较为常见,对其进行可靠性评估对系统设计及优化具有重要意义。针对树状冗余系统,在n中连续取k失效准则下,通过有限马尔可夫嵌入法并对其进行变形,研究了树状系统可靠性求解方法。本文对树状系统建模加以定义,提出了基于层数参数,层-节点向量,父-子节点矩阵三元参数的树状系统表示方法,研究了变形有限马尔可夫嵌入法的树状系统n中连续取k失效准则下的可靠性求解方法,给出了三个数值算例应用并分析了算法的运算复杂度。最后,本文对比讨论了基于概率母函数法的树状系统在n中连续取k准则下系统可靠性求解方法的研究,得出结论本文算法针对树状冗余系统n中连续取k失效准则下系统可靠性求解应用范围更广,求解效率较高。     

排序法计算指数寿命型元件失效率经典精确最优置信上限

设有指数寿命型元件,寿命服从参数为λ的指数分布,λ未知,设有此元件的分组数据(grouped data):对N个元件进行定时检测,0=t_0相似文献   

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².