环形区域极点/协方差约束下的模型简化设计

提出离散随机系统模型简化的一种新方法,即环形区域极点／协方差约束下的模型简化方法。这种设计方法的基本思路是构造指定维数的降阶模型,使其匹配给定的环形区域极点和稳态协方差参数,在系统的动态特性和稳态特性方面逼近给定的满阶模型。文中导出了期望的简化模型的存在条件及解析表达式,并提供了一个数值算例。     

潜射反舰导弹武器系统作战效能指标体系设计初探

根据潜射反舰导弹武器系统作战使用情况,在借鉴ＷＳＥＩＡＣ系统效能分析方法基础上,结合作战运用效能分析方法,初步探讨了该武器系统作战效能指标体系的设计过程。     

C~3I系统的决策时延分析

决策是C~3I 系统的核心问题之一。用Petri 网理论研究C~3I 系统的决策问题已取得了长足的进展。根据决策过程各阶段之所需时间具有随机性及不独立性的特点,以变迁发射时间不独立的随机Petri 网作为决策时延的建模与分析工具,并给出了这种随机Petri 网模型的一般分析方法。     

On lifetimes in random environments

For a component operating in random environment, whose hazard rate is assumed to be the realization of a suitable increasing stochastic process, conditions are found such that its lifetime is increasing in likelihood ratio (ILR). For the lifetimes of two components of the same kind some comparisons based on partial stochastic orders are presented. Some applications to the case of repairable components are finally provided. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 365–375, 1998     

On gamma estimation via matrix kriging

In financial engineering, sensitivities of derivative prices (also known as the Greeks) are important quantities in risk management, and stochastic gradient estimation methods are used to estimate them given the market parameters. In practice, the surface (function) of the Greeks with respect to the underlying parameters is much more desired, because it can be used in real‐time risk management. In this paper, we consider derivatives with multiple underlying assets, and propose three stochastic kriging‐based methods, the element‐by‐element, the importance mapping, and the Cholesky decomposition, to fit the surface of the gamma matrix that can fulfill the time constraint and the precision requirement in real‐time risk management. Numerical experiments are provided to illustrate the effectiveness of the proposed methods.     

Analysis of artillery shoot‐and‐scoot tactics

Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy.     

What you should know about simulation and derivatives

Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Investment in production resource flexibility: An empirical investigation of methods for planning under uncertainty

We examine several methods for evaluating resource acquisition decisions under uncertainty. Traditional methods may underestimate equipment benefit when part of this benefit comes from decision flexibility. We develop a new, practical method for resource planning under uncertainty, and show that this approach is more accurate than several commonly used methods. We successfully applied our approach to an investment problem faced by a major firm in the aviation information industry. Our recommendations were accepted and resulted in estimated annual savings in excess of $1 million (US). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

一种基于估计熵的自适应模糊滤波器及其在箭遥信号处理中的仿真应用

介绍了一种基于估计熵的自适应模糊滤波器 ,并将其应用于宽带噪声中火箭遥测速变信号的数字滤波。讨论了自适应模糊滤波算法 ,给出了应用实验结果。分析和实验表明 ,这种新型滤波器能根据信号的复杂程度自动调节其参数 ,对宽带噪声中非平稳随机信号有较好的滤波效果