有耗媒质中目标体散射特性的TSNU-PSTD模拟

结合PML边界条件的傅立叶时域伪谱(PSTD)算法已被广泛用于模拟电磁波传播和目标散射,但传统的PSTD方法在每个坐标方向上需要均匀分布的空间坐标网格点,因而不能够很好地模拟曲面目标和与网格空间尺寸不一致的目标,基于变空间非均匀网格的PSTD(TSNU-PSTD)方法可以很好地克服这些不足。将CFS-PML边界条件应用在PSTD算法中,并将其与TSNU-PSTD方法相结合模拟了大范围有耗媒质中介质体目标的电磁散射,部分计算结果与FDTD计算结果进行了比较。仿真结果表明,TSNU-PSTD算法只需平均每波长分成3个网格就可以得到令人满意的计算结果,可高效地分析大范围有耗媒质中曲面形状目标体的散射特性。     

A dynamic allocation heuristic for centralized safety stock

An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Optimal control of a capacitated inventory system with multiple demand classes

This article studies the optimal control of a periodic‐review make‐to‐stock system with limited production capacity and multiple demand classes. In this system, a single product is produced to fulfill several classes of demands. The manager has to make the production and inventory allocation decisions. His objective is to minimize the expected total discounted cost. The production decision is made at the beginning of each period and determines the amount of products to be produced. The inventory allocation decision is made after receiving the random demands and determines the amount of demands to be satisfied. A modified base stock policy is shown to be optimal for production, and a multi‐level rationing policy is shown to be optimal for inventory allocation. Then a heuristic algorithm is proposed to approximate the optimal policy. The numerical studies show that the heuristic algorithm is very effective. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 43–58, 2011     

Fashion products with asymmetric sales horizons

In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

空降扼守战斗中传感器网络部署

为了全面、合理地度量空降扼守战斗中传感器网络部署的优劣,建立了一种新的评价指标体系,给出了指标的具体确定方法;在此基础上建立传感器网络部署的数学模型,给出了算法流程.通过仿真实验证明,模型是有效的.     

基于间接互惠理论的合作生成算法研究

在快速变化的战场环境下,时间是制约作战效果的因素,能否尽快地寻找到最佳的合作伙伴是协同作战的关键。通过对现代战场时限的需求分析,建立了以时间为量化指标的战场作战单元合作模型。为了解决名誉值机制的合作生成算法产生的“马太效应”问题,运用合作博弈理论和间接互惠理论,提出了一种“好”“坏”直接评判机制的合作生成算法。仿真结果表明,“好”“坏”直接评判机制的合作生成算法比名誉值机制的合作生成算法稳定性更高。     

基于VR的虚拟火炮行为仿真

针对虚拟武器装备行为仿真过程中存在的运动仿真复杂、多部件协调操作仿真困难等问题,本文基于虚拟现实建模工具构建了某型传统火炮的三维模型-虚拟火炮,为行军行为仿真过程中运动轨迹选取、运动姿态控制、碰撞检测及响应等问题提供了合理的解决方法;在用炮和收炮行为仿真过程中,重点设计了时间驱动算法来解决多部件之间的协调操作仿真问题。通过对虚拟火炮的特定行为进行可视化仿真,验证了文中行为仿真研究方案的合理性及算法设计的正确性。     

用伴随方程研究烟幕施放的优化问题

从描述烟幕扩散的基本方程出发,提出了一类烟幕施放的优化问题．文中指出,这类问题由于约束条件为复杂的偏微分方程,计算量很大,难以直接求解．为了解决这一问题,引入了一种伴随方法以降低计算量．推导了三维非平坦地形下大气平流一扩散方程的伴随方程,利用伴随方程和原方程的关系,对优化问题进行了等价变形,大大降低了计算量．最后通过一个算例,对这一方法的有效性进行了演示。     

美军军事转型及其启示(下)

三、美国军事转型的主要特性(一)顶层设计,追求“跨越一代”的规划效果美国军事转型的最显著特点就是谋求跨越时代的超前性,这种谋求超前性的强烈欲望,一方面来自美国人强烈的时代感和机遇意识,另一方面来自他们居安思危的忧患意识。信息技术群的迅猛发展,深刻改变着社会生活的