基于累积损伤过程的不完全预防维护决策

基于累积损伤过程研究旧系统的不完全预防维护策略,冲击服从非时齐Poisson过程,并产生随机的损伤量,损伤量是加法累加的.系统在累积损伤量达到k或系统运行年龄达到T时进行计划内预防维护.在两次计划内预防维护之间,当累积损伤量达到预定水平K (k K)时,对系统进行计划外维护,其费用高于计划内预防维护,利用再生过程理论得到单位时间维护成本,讨论在时齐Poisson过程下的时间预防维护策略与水平预防维护策略,同时给出算例.     

多项选择题测验信度的一个估计方法及其应用

在多项选择题测验分数等于真实分数和猜测分数之和的假设模型下，本文得到了一个多项选择题测验信度的理论公式，并由此给出了测验信度的估计方法。最后，通过两个例子，说明了本文提出的方法在测验信度分析中的应用，并将这种方法与教育测量中常用的库德——理查逊方法（Ｋｕｄｅｒ－Ｒｉｃｈａｒｄｓｏｎ）进行了比较     

无失效数据的Bayes和多层Bayes分析

本文推广了文献[6]的结果，对指数分布无失效数据的失效率，给出了Bayes估计、Bayes置信上限以及多层Bayes估计，从而可以得到无失效数据可靠度的估计，最后，结合实际问题进行了计算。     

（Φ，Δ）型概率收缩与Menger PN－空间中非线性算子方程的解

本文在Ｍｅｎｓｅｒ概率赋范空间中引入了（Φ，Δ）型概率收缩的概念，研究了Ｍｅｎｇｅｒ概率赋范空间中具有这类概率收缩的非线性算子方程的解的存在性与唯一性．发展和改进了引文［１］、［４～８］的相应结果．     

Fast computation of a rational point of a variety over a finite field

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.

     

带缓冲串行生产系统预防性维护建模及运行参数优化研究

为了保证串行生产系统的产能和提高系统可靠性,提出了带缓冲区的串行生产系统预防性维护决策模型。首先,分析了生产线各执行单元可靠性和运行参数之间的关系,建立了考虑执行单元运行参数和缓冲库存的维护模型。在此基础上,结合串行生产线的特点,建立综合考虑维护成本、有效运行速度和缓冲库存的多目标优化函数。最后,构建启发式算法求解目标函数,并以串行包装生产线为例进行仿真实验分析,结果表明本文所建模型是有效且实用的。     

Reliability bounds in DFRA class with known mean and variance

ＲＥＬＩＡＢＩＬＩＴＹＢＯＵＮＤＳＩＮＤＦＲＡＣＬＡＳＳＷＩＴＨＫＮＯＷＮＭＥＡＮ　ＡＮＤ　ＶＡＲＩＡＮＣＥＣＨＥＮＧＫＡＮ（程侃）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ,ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅ,Ｂ...     

Bayesian sequential reliability for Weibull and related distributions

Assume that the probability density function for the lifetime of a newly designed product has the form: [H(t)/Q()] exp{–H(t)/Q()}. The Exponential(), Rayleigh, WeibullW(, ) and Pareto pdf's are special cases.Q() will be assumed to have an inverse Gamma prior. Assume thatm independent products are to be tested with replacement. A Bayesian Sequential Reliability Demonstration Testing plan is used to eigher accept the product and start formal production, or reject the product for reengineering. The test criterion is the intersection of two goals, a minimal goal to begin production and a mature product goal. The exact values of various risks and the distribution of total number of failures are evaluated. Based on a result about a Poisson process, the expected stopping time for the exponential failure time is also found. Included in these risks and expected stopping times are frequentist versions, thereof, so that the results also provide frequentist answers for a class of interesting stopping rules.This research was supported by NSF grants DMS-8703620 and DMS-8923071, and forms part of the Ph.D. Thesis of the first author, the development of which was supported in part by a David Ross grant at Purdue University. The authors thank the editors and a referee for insightful comments and suggestions.     

Retrieval and chaos in extremely dilutedQ-Ising neural networks

Using a probabilistic approach, the deterministic and the stochastic parallel dynamics of aQ-Ising neural network are studied at finiteQ and in the limitQ. Exact evolution equations are presented for the first time-step. These formulas constitute recursion relations for the parallel dynamics of the extremely diluted asymmetric versions of these networks. An explicit analysis of the retrieval properties is carried out in terms of the gain parameter, the loading capacity, and the temperature. The results for theQ network are compared with those for theQ=3 andQ=4 models. Possible chaotic microscopic behavior is studied using the time evolution of the distance between two network configurations. For arbitrary finiteQ the retrieval regime is always chaotic. In the limitQ the network exhibits a dynamical transition toward chaos.     

An investigation of the reliability of the Galerkin-Petrov method

It is shown that the Galerkin-Petrov method if applied in a controlled way yields reliable results for excited states of the same symmetry classifications as the ground state. Computations are performed for the 2¹ S and 3¹ S states of He. The problem of optimizing nonlinear parameters of the basis functions by means of the GP method is discussed. A special optimization scheme is suggested and numerically illustrated for someS states of He.