Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management

In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997     

基于Petri网的近程防空武器射击建模

提出一种扩展时延Petri网,新提出的Petri网与以往高级时延Petri网的不同之处在于它允许个体的个性与共性同样得到考虑。这种方法被用来对装备多跟踪装置、多种对空武器的防空系统对多目标进行射击过程进行建模、分析、模型的正确性在文章最后的仿真中得到了验证。     

DFT的Z变换算法

文中讨论了用Z变换计算DFT的方法。对于N=2~t的DFT,本算法所需的加法及乘法量分别为:(?),与Cooley-Tukey基-2算法比较,乘法量与加法量均减少25%,文中还讨论了本算法在微机上的实现,给出流程图。在运算时间上,本算法与通用FFT算法程序进行比较:节省时间30%。     

不确定信息下反导拦截效果评估

针对不确定信息下反导拦截效果评估过程中指标信息和权重信息都不确定,传统评估方法很难加以解决的问题,使用区间数和随机多属性可接受性分析(SMAA)相结合的方法对反导拦截效果进行了评估。首先,根据来袭弹道导弹目标的毁伤程度划分了拦截效果等级;然后,针对观测信息的不确定性,采用区间数和隶属函数对特征指标进行了表示;在此基础上,通过引入SMAA方法,计算和比较拦截效果为各拦截等级的可接受性指标和信任因子,对不确定信息下反导拦截效果进行了评估。实例计算结果表明所介绍的不确定信息下反导拦截效果评估方法是可行的。     

Statistical analysis for masked system life data from Marshall‐Olkin Weibull distribution under progressive hybrid censoring

This paper considers the statistical analysis of masked data in a series system, where the components are assumed to have Marshall‐Olkin Weibull distribution. Based on type‐I progressive hybrid censored and masked data, we derive the maximum likelihood estimates, approximate confidence intervals, and bootstrap confidence intervals of unknown parameters. As the maximum likelihood estimate does not exist for small sample size, Gibbs sampling is used to obtain the Bayesian estimates and Monte Carlo method is employed to construct the credible intervals based on Jefferys prior with partial information. Numerical simulations are performed to compare the performances of the proposed methods and one data set is analyzed.     

改进IAHP-CIM模型的雷达组网探测能力评估方法

针对雷达组网探测能力的评估问题,采用鱼骨图法对影响雷达组网探测能力的多种因素进行梳理,得到结构层次清晰的指标评价体系。采用改进的区间层次分析—控制区间和记忆模型对该指标体系进行评估,具体方法是:运用区间层次分析法构造区间判断矩阵;利用蛙跳算法求解区间判断矩阵中满足最小一致性的确定性矩阵;利用控制区间和记忆模型来确定各指标的风险概率,实现指标体系的评估。以具体的案例为对象进行仿真实验,结果表明,所提评估方法有效,评估结论相对客观、可信,对雷达组网探测能力评估具有一定参考价值,从而为雷达组网的优化部署奠定良好基础。     

反潜机采用阿基米德螺旋线搜潜问题研究

反潜机是重要的反潜力量,根据反潜机搜潜情况,建立了反潜飞机采用阿基米德螺旋线样式搜潜的数学模型和目标运动模型,讨论了螺旋线采用的三种轨迹间隔,通过仿真验证,确立了反潜机搜潜最优轨迹间隔,以达到提高发现目标潜艇概率、优化反潜效能的目的,为反潜飞机采用阿基米德巡逻线搜潜样式搜潜时提供战术参考。     

Constructing a strict total order for alternatives characterized by multiple criteria: An extension

The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014     

远程火炮密集度试验多组数据的处理方法

远程火炮密集度试验需要进行多次射击,同一试验条件下的多组数据通常认为来源于同一分布,但却未见于证明。利用统计检验方法,给出了对试验数据方差齐性及均值相等性的检验方法,并在多组试验数据一致性的基础上给出了试验数据均值、方差的无偏估计,同时在既定置信度下给出了其置信区间,为远程火炮精度检测提供了工具。