Efficient budget allocation strategies for elementary effects method in stochastic simulation

This paper focuses on extending the Morris' elementary effects method (MM) for sensitivity analysis/factor screening originated in the context of deterministic computer experiments to the stochastic simulation setting. Given a fixed simulation budget to expend, the main objective is to provide efficient and accurate estimates of main and interaction (or nonlinear) effects coined by the standard MM for characterizing the importance of each factor, despite the impact of simulation errors. Taking into account both the factor/input sampling uncertainty rooted in MM and the random errors inherent in a stochastic simulation, we develop efficient budget allocation strategies for implementing MM in this new context. Under each strategy proposed, we derive its corresponding optimal budget partition and optimal budget allocation rules. Numerical results corroborate the practical effectiveness of the proposed budget allocation strategies.     

基于Fuzzy DEMATEL的军民融合后勤保障制约因素研究

现代后勤就是军民融合后勤。从思想性禁锢、体制性障碍、结构性矛盾和政策性瓶颈4个维度,系统地分析军民融合后勤保障存在的矛盾问题,构建军民融合后勤保障制约因素体系。引入Fuzzy DEMATEL方法,定量分析制约因素间的影响关系及作用机理,遴选出制约军民融合后勤保障深度发展的关键因素,为促进军民融合后勤保障健康有序发展,提供一定的理论依据和实用的操作方法。研究表明,迫切需要找到化解制约因素的有效途径,推动军民融合后勤保障向更高层次、更广范围、更深程度发展。     

美军地理空间工程对陆军作战支援主要问题研究

近年来,由于编制的调整、技术的进步和最佳准则的出现,美军地理空间工程支援保障能力有了大幅提高。文章剖析美军地理空间工程的内涵、力量构成、支援陆军作战的主要能力和主要内容。研究表明,美军地理空间工程对陆军的作战支援是成体系的且高度融合,其先进的保障模式值得借鉴。     

Optimal inventory and dynamic admission policies for a retailer of seasonal products with affiliate programs and drop‐shipping

This article investigates the optimal inventory and admission policies for a “Clicks‐and‐Bricks” retailer of seasonal products that, in addition to selling through its own physical and online stores, also sells through third‐party websites by means of affiliate programs. Through postings on partners' webpages, an affiliate program allows a retailer to attract customers who would otherwise be missed. However, this retailer needs to pay a commission for each sale that originates from the website operators participating in the program. The retailer may also refer online orders to other sources (such as distributors and manufacturers) for fulfillment through a drop‐shipping agreement and thus earns commissions. This would be an option when, for example, the inventories at the physical stores were running low. Therefore, during the selling horizon, the retailer needs to dynamically control the opening/closing of affiliate programs and decide on the fulfillment option for online orders. On the basis of a discrete‐time dynamic programming model, the optimal admission policy of the retailer is investigated in this paper, and the structural properties of the revenue function are characterized. Numerical examples are given to show the revenue impact of optimal admission control. The optimal initial stocking decisions at the physical stores are also studied. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

UTD应用中椭圆柱面反射点的解析求解

射线寻迹是应用一致性绕射理论(UTD)分析电大尺寸目标电磁辐射和散射特性的关键步骤.结合费马原理及反射定律,推导了椭圆柱面反射点的解析表达式,并给出了应用此表达式得到的部分椭圆柱反射点及翼型模型的远场方向图结果.经与FEKO仿真比较证明结论是正确的,并能提高场值计算的速度和精度.     

小波包变换和支持向量机模拟电路故障诊断方法

为提高模拟电路故障诊断效率,将小波包变换和支持向量机结合起来,提出了一种完整的模拟电路故障快算检测和准确定位的方案.利用小波包变换对电路输出电压信号进行多层分解,提取各频带的能量作为故障特征,给出了具体的特征提取方法;利用支持向量机的多分类一对一方法,完成电路的故障定位,同时实现了小波函数的选择.在一模拟电路的故障仿真实验中,通过与BP,RBF和PNN等神经网络对比,结果显示该方法的诊断效率是很高的.     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

纯方位跟踪问题研究及算法性能

针对纯方位跟踪系统的特点,对修正增益扩展卡尔曼滤波、伪线性滤波、基于无迹变换的卡尔曼滤波、修正球坐标系下的扩展卡尔曼滤波、直接对角度信息建模的卡尔曼滤波等被动目标跟踪算法予以详细的讨论,并在满足可比性的条件下,对各个跟踪算法进行了仿真实验,比较和分析了仿真结果,指出了修正增益扩展卡尔曼滤波的算法优势,对实际工程应用中算法选择问题提出了参考性建议.     

Relaxation method for the solution of the minimax location-allocation problem in euclidean space

A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius r_p (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported.     

复合导引头多源异步信息融合精确拦截算法

针对单一制导体制难以满足现代战场作战需求且多传感器数据更新率不同步的问题,建立一种新的微惯导/毫米波/红外复合制导体制,研究了该体制下多传感器异步信息融合的时间同步和空间配准问题;提出一种自适应无迹卡尔曼滤波算法,该算法采用预测残差构造状态模型误差统计量,通过自适应因子调整状态模型信息对状态参数估值的贡献,有效控制状态模型噪声异常对状态参数估值的影响。将提出的算法应用到微惯导/毫米波/红外复合制导系统中进行仿真验证,结果表明,提出的自适应无迹卡尔曼滤波算法的解算精度高于标准扩展卡尔曼滤波和无迹卡尔曼滤波算法,能有效提高导弹的制导的解算精度。