基于SPN有限等待差错服务的火力单元排队模型

给出了一般排队模型的SPN描述,分析了防空火力单元的实际作战过程,在已有的火力单元的模型基础上,提出了有限等待差错服务的排队模型,详细分析了排队模型的运行机制,包括顾客有限等待、优先级的排队等,最后运用SPN理论对应的联系谓词公式和随机开关对模型进行了强有力的描述。是构建防空战役层面大型排队网络模型的基础。     

材料随机梁的有限元分析

提出一种以柔度为基础的具有随机刚度弯曲梁的有限元公式。在计算过程中 ,用与刚度均值有关的内力近似表示未知内力值。通过蒙特卡罗模拟可示出刚度的一维可靠性密度函数和相关函数 ,可用来估算柔度的均值和协方差函数。最后根据新的公式计算出随机梁的均值和协方差。     

The NBUL class of life distribution and replacement policy comparisons

Let X and X_τ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if X_τ is smaller than X in Laplace order, i.e., X_τ ≤_L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001.     

外加信号增强随机共振在微弱信号检测中的应用

在利用随机共振检测微弱周期信号的基本原理基础上,给出一种通过外加可控信号激励出随机共振现象,并将之应用于微弱信号检测的方法。采用仿真信号对该方法进行了验证,通过归一化尺度变换,将该方法的适用频率扩展到机械系统特征信号频段。结果表明,该方法简单可行,能把信噪比较低的周期信号从强背景噪声中提取出来,在机械故障检测中具有应用前景。     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A continuous‐time strategic capacity planning model

Capacity planning decisions affect a significant portion of future revenue. In the semiconductor industry, they need to be made in the presence of both highly volatile demand and long capacity installation lead‐times. In contrast to traditional discrete‐time models, we present a continuous‐time stochastic programming model for multiple resource types and product families. We show how this approach can solve capacity planning problems of reasonable size and complexity with provable efficiency. This is achieved by an application of the divide‐and‐conquer algorithm, convexity, submodularity, and the open‐pit mining problem. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

基于随机Petri网的维修质量管理组织结构建模与分析

简述了利用随机Petri网进行维修质量管理组织结构建模的方法。根据实际需求,建立了2种组织结构形式的仿真模型。以模型为基础,对维修质量管理组织结构的静态结构和动态行为进行了研究,解决了维修质量管理组织结构的优选问题,对组织结构设计具有一定的指导作用。     

武器系统效能评估数学模型描述

在武器系统效能评估中,武器系统的战技指标是评估武器系统效能的重要因素.对武器系统的可靠性和维修性进行了研究,并应用于可用性矩阵计算中.利用随机过程理论,建立了武器系统可信性矩阵和武器系统效能能力指数模型,最后建立了武器系统效能评估模型.     

基于随机Petri网的综合航电系统建模及分析

提出了一种利用随机Petri网对综合航电系统进行建模和性能分析的方法.首先,建立了综合航电系统数据总线传输系统的随机Petri网系统模型,通过系统模型进行综合航电系统的性能分析;其次,给出了航空电子综合系统数据总线传输基于固定主控端周期指令的总线性能分析结果;最后,通过两种分析结果的比较,得出了基于随机Petri网对航空电子综合系统数据总线传输建模分析是可行的结论.