Log‐concave and concave distributions in reliability

Nonparametric classes of life distributions are usually based on the pattern of aging in some sense. The common parametric families of life distributions also feature monotone aging. In this paper we consider the class of log‐concave distributions and the subclass of concave distributions. The work is motivated by the fact that most of the common parametric models of life distributions (including Weibull, Gamma, log‐normal, Pareto, and Gompertz distributions) are log‐concave, while the remaining life of maintained and old units tend to have a concave distribution. The classes of concave and log‐concave distributions do not feature monotone aging. Nevertheless, these two classes are shown to have several interesting and useful properties. We examine the closure of these classes under a number of reliability operations, and provide sharp reliability bounds for nonmaintained and maintained units having life distribution belonging to these classes. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 419–433, 1999     

A search game with a protector

A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is a protector who can also allocate resources to the points; allocating these resources makes it more difficult for the searcher to find an object. We model the situation as a two‐person non‐zero‐sum game so that we can take into account the fact that using resources can be costly. It is shown that this game has a unique Nash equilibrium when the searcher's probability of finding an object located at point i is of the form (1 − exp (−λ_ix_i)) exp (−μ_iy_i) when the searcher and protector allocate resources x_i and y_i respectively to point i. An algorithm to find this Nash equilibrium is given. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:85–96, 2000     

Stability in a general oligopoly model

We analyze a general but parsimonious price competition model for an oligopoly in which each firm offers any number of products. The demand volumes are general piecewise affine functions of the full price vector, generated as the “regular” extension of a base set of affine functions. The model specifies a product assortment, along with their prices and demand volumes, in contrast to most commonly used demand models. We identify a fully best response operator which is monotonically increasing so that the market converges to a Nash equilibrium, when firms dynamically adjust their prices, as best responses to their competitors' prices, at least when starting in one of two price regions. Moreover, geometrically fast convergence to a common equilibrium can be guaranteed for an arbitrary starting point, under an additional condition for the price sensitivity matrix.     

基于事故树和贝叶斯的军民航飞行冲突风险研究

为充分了解当前军民航飞行冲突、危险接近事故征候的成因,并对其发生原因进行有重点的预防和对事件发生概率的精确预测,首先建立事故树模型,对其原因进行分析;总结导致其发生的基本事件,计算事故树模型的最小割集和各个基本事件的结构重要度;其次对军民航飞行冲突、危险接近事故征候的发生概率进行合理的取值,得出基本事件的概率重要度,指出基本事件发生概率对顶事件发生概率的影响;最后构建军民航飞行冲突、危险接近事故征候贝叶斯网络模型,计算中间事件的条件概率和顶事件发生概率,并与实际结果进行对比,验证方法可行性。     

多元气体化学爆炸的超压安全泄放设计

压力容器在气液二相共存的情况下 ,采用UNIFAC法预测液相活度系数进行气液平衡计算 ,得到多元系统的气液平衡浓度 ,结合燃爆模拟实验数据 ,对容器危险工况下的超压进行安全泄放设计。     

一类军事竞争系统的非线性分析

应用非线性系统的定性理论方法,对一类军事竞争系统进行了定性分析,研究了系统平衡点的性态,证明了系统在全平面不存在闭轨线。     

基于大规模贝叶斯网络的安全性分析算法

贝叶斯网络计算量随着节点数增多呈指数增长,限制了大规模贝叶斯网络在安全性分析中的应用。为此,利用独立性条件分解整个网络,压缩推理时显式表达的项数,给出了计算顶事件发生概率及割集的算法,并分析了算法复杂性。在满足工程需要情况下,将提出算法与基于BDD算法相比,该算法表现出占用内存少、运行速度快的良好性能。     

高功率密度柴油机智能化冷却系统控制策略

简要分析了未来坦克装甲车辆柴油机智能化控制冷却系统的必要性和可行性,提出了智能化冷却系统设计方案,阐述了其组成及工作原理,重点对智能化冷却系统控制策略进行了研究。针对某型柴油机,通过对其散热需求分析,提出了基于发动机工况的开环控制策略,同时,结合以发动机出口冷却水温度为控制目标提出了基于PID算法的闭环反馈控制策略。应用该策略可保证发动机在不同的环境和工况下冷却强度适宜,降低冷却系统的功耗。     

基于贝叶斯网络的潜艇攻击决策研究

BN(贝叶斯网)被认为是人工智能研究中不确定性知识表示和推理的重要工具,广泛应用到复杂系统的建模等领域。贝叶斯网络高效的推理算法非常适合解决不确定性军事决策问题,分析了潜艇攻击决策问题的复杂性和不确定性,提出了构建贝叶斯网络进行攻击决策的步骤,通过具体实例,对用贝叶斯网络推理解决潜艇攻击决策问题进行了初步探讨。     

装备采办中一级密封招标的博弈均衡分析

针对装备采办中的一级密封招标问题,分析了招标过程中的博弈特点,给出了一维贝叶斯均衡的求解方法和解析表达式,论证了在军工企业的最优战略是选择博弈的贝叶斯均衡,军方的选择是增加竞标者的人数。然后,重点分析了招标过程中的多维博弈问题,给出了多维贝叶斯均衡的一般求解方法,并针对特定的事例进行了多维均衡分析。最后,在多维博弈的框架下对一维博弈和多维博弈的均衡结果进行比较分析,结果表明：在一级密封招标过程中,多维博弈均衡是军工企业的最优战略。