动态规划在消防增援调度中的应用

由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。     

多部雷达的目标定位问题研究

现代空袭环境越来越复杂,一般部署多部雷达进行空情搜索。研究了多部雷达的目标定位问题,探讨了使残差的平方和为最小、使残差的最大绝对值为最小和使残差的绝对值之和为最小三个准则,并给出了相应的数学模型,用Matlab优化工具箱进行了计算。     

军事能力到装备系统的双层规划模型及其求解算法

阐述了基于能力的军事规划新思路,提出了从军事能力到系统项目的两层规划模型。该模型上层以效果和效果-成本比值最大化为目标,通过资本规模来约束下层决策。下层以各种能力最大化为目标,在成本约束下寻求不同系统项目的最佳组合,并将结果返回上层影响最终的决策。应用了多目标遗传算法来求解该规划模型。算例结果表明,所建立的双层规划模型及其求解算法对于国防资源分配问题是有效的。     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

任务空间概念模型VV&A研究

任务空间概念模型是现实世界军事知识的第一层抽象,是仿真系统开发的业务基础。所以任务空间概念模型的质量直接影响到仿真系统的质量,任务空间概念模型自身的VV&A是一个非常值得关注的问题。任务空间概念建模本质上看是军事领域的知识表示或者需求描述,定性描述占主要,定量成分非常少。因此,传统的通过分析输出数据的方法不能适应任务空间概念模型的特点。概要介绍了任务空间概念模型建模,并且提出了从专家法、静态校核机制、概念执行机制三个角度来考察模型质量的思路。     

云模型及其在指挥控制系统可靠性分析中的应用

根据指挥控制系统的特点及作战应用的具体情况,从指挥控制系统的可靠性出发,提出了适合指控系统可靠性分析的云模型。通过拟定性能评价指标,导出各指标的云模型及其多维加权综合云的重心,应用云重心评价方法进行分析;并通过案例,运用基于PC-L INM AP的云重心评价方法,以影响指挥控制系统可靠性的两个重要性能指标为依据,分析了未来联合作战中指挥控制系统的可靠性,比较贴近作战实际,可信度较高。     

基于整数规划的地地导弹打击目标优化选取

地地战役战术导弹火力运用中,对导弹打击目标的选取是导弹部队制定合理科学作战方案所面临的现实问题。针对给定弹量和特定作战意图对打击目标进行优化选择问题,运用0-1型整数规划,建立合理的数学模型并确定最优打击目标。通过应用实例表明,此方法简便易行,可操作性较强,具有一定的实用价值。     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

利用字节模式二维特征的ROP链智能检测方法

面向返回编程(return oriented programming, ROP)攻击是网络攻击者突破操作系统安全防护、实现漏洞攻击的一种主要手段,ROP链是ROP攻击的重要组成部分。为检测网络流量中的ROP链,提出了一种能自动提取ROP链特征、具有良好泛化性能的智能检测方法。该方法采用顺序抽取的方式将被测流量分成多个序列,利用滑动窗口和数值量化将输入的一维流量数据转换为二维特征向量,基于卷积神经网络模型实现对ROP链的检测。不同于已有的静态检测方法,该方法不依赖程序内存地址的上下文信息,实现简单、部署方便,且具有优异的检测性能。实验结果表明,模型最高准确率为99.4%,漏报率为0.6%,误报率为0.4%,时间开销在0.1 s以内,对真实ROP攻击流量的漏报率为0.2%。