基于最少谓词思想的可达路径选择

对于结构测试中的不可达路径问题,仅仅使用传统的不可达路径排除方法存在很大的限制性,应用效果一般.积极选择可达路径的思想可有效减少不可达路径的产生.目前,基于最少谓词思想的路径生成方法得到广泛的认可.了解可达路径选择思想后,主要介绍一种基于数据流信息的,具体应用基本程序切片技术来生成可达路径的方法,该方法可生成几乎有最少谓词的路径,有较好效果.     

Designing acceptance sampling schemes for life testing with mixed censoring

Mixed censoring is useful extension of Type I and Type II censoring and combines some advantages of both types of censoring. This paper proposes a general Bayesian framework for designing a variable acceptance sampling scheme with mixed censoring. A general loss function which includes the sampling cost, the time‐consuming cost, the salvage value, and the decision loss is employed to determine the Bayes risk and the corresponding optimal sampling plan. An explicit expression of the Bayes risk is derived. The new model can easily be adapted to create life testing models for different distributions. Specifically, two commonly used distributions including the exponential distribution and the Weibull distribution are considered with a special decision loss function. We demonstrate that the proposed model is superior to models with Type I or Type II censoring. Numerical examples are reported to illustrate the effectiveness of the method proposed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于MapGIS的突发事件应急指挥系统设计与实现

针对当前突发事件处理过程中人为因素过多,容易出现错误决策的不足,设计实现了基于MapGIS的突发事件应急指挥系统。系统包括地图操作、突发事件应急决策、突发事件模拟等功能,并以应急决策模块为例说明了系统实现。     

基于种群多样性测度的PSO算法及其应用研究

针对基本粒子群算法(particle swarm optimization,PSO)易局部收敛的缺陷,设计了一种根据种群多样性测度动态调整惯性权重的改进粒子群算法,通过仿真测试函数与基本粒子群算法、自适应粒子群算法(adaptive particle swarm optimization,APSO)、带收缩因子的粒子群算法(contractive particle swarm optimization,CPSO)进行比较,改进的PSO算法在提高算法的综合搜索能力方面具有优越性。将改进的PSO算法运用到作战飞行器航迹规划中,并进行了仿真实验,仿真结果验证了改进算法的有效性。     

Inventory pooling games for expensive,low‐demand spare parts

We consider several independent decision makers who stock expensive, low‐demand spare parts for their high‐tech machines. They can collaborate by full pooling of their inventories via free transshipments. We examine the stability of such pooling arrangements, and we address the issue of fairly distributing the collective holding and downtime costs over the participants, by applying concepts from cooperative game theory. We consider two settings: one where each party maintains a predetermined stocking level and one where base stock levels are optimized. For the setting with fixed stocking levels, we unravel the possibly conflicting effects of implementing a full pooling arrangement and study these effects separately to establish intuitive conditions for existence of a stable cost allocation. For the setting with optimized stocking levels, we provide a simple proportional rule that accomplishes a population monotonic allocation scheme if downtime costs are symmetric among participants. Although our whole analysis is motivated by spare parts applications, all results are also applicable to other pooled resource systems of which the steady‐state behavior is equivalent to that of an Erlang loss system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于IEEE 802.11的无线多跳网络路径容量分析模型

旨在建立一个适用于无线多跳路径性能研究的闭合分析模型。首先对导致多跳路径中流内竞争现象的干扰问题进行了详细分析并给出了定量计算方法,然后通过将多跳路径建模为排队网络,利用扩散近似法建立了路径性能分析模型,最后在网络稳定性约束条件下对多跳路径的容量问题进行了研究。利用该模型可以在无线多跳网络中分析网络传输的吞吐能力,同时有助于研究网络对QoS业务的支持能力。通过仿真实验结果与数值分析结果的对比,验证了分析模型的准确性。     

舰艇编队导弹航路规划仿真系统设计与实现

通过分析火力分配、区域划分、航路规划三者的关系,提出了舰艇编队导弹航路规划三位一体战术决策的思想.设计了一个以此为背景,基于高层体系结构(HLA)的可扩展、开放式仿真体系结构.依据HLA/RTI规范,设计开发了仿真联邦的联邦/仿真对象模型.基于系统的离散事件仿真特征,采用事件调度的仿真策略,利用Petri网建立了系统的...     

自动化电弧喷涂路径偏移间距的优化模型

基于电弧喷涂沉积丘的轮廓呈高斯分布的假设,并结合实验结果,建立了电弧喷涂沉积丘轮廓的数学模型,由此推导出了自动化喷涂过程中平行路径偏移间距这一重要参量的优化模型。该模型为合理规划自动化喷涂的路径提供了依据。     

Aircraft routing under the risk of detection

The deterministic problem for finding an aircraft's optimal risk trajectory in a threat environment has been formulated. The threat is associated with the risk of aircraft detection by radars or similar sensors. The model considers an aircraft's trajectory in three‐dimensional (3‐D) space and represents the aircraft by a symmetrical ellipsoid with the axis of symmetry directing the trajectory. Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, a solution to this equation is expressed by a quadrature. A network optimization approach reduces the original problem to the Constrained Shortest Path Problem (CSPP) for a 3‐D network. The CSPP has been solved for various ellipsoid shapes and different length constraints in cases with several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact of variable RCS on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006