空战机动决策方法研究

在阐述空战机动决策作用的同时 ,分析对比了几种常用空战机动决策方法 :矩阵对策法、专家系统法、神经网络法和微分对策法等 ;在此基础上引入了一种新的空战机动决策方法——决策影响图法 ,并对其具体应用作了探讨。     

多属性模糊决策对舰炮射击目标优选

舰炮在现代高科技条件下海战中承担着重要的作战使命和任务,它能否完成被赋予的作战使命和任务,射击目标的优选起着决定性作用.为解决舰炮射击目标优选、决策问题,研究分析了多属性模糊决策方法,以及影响舰炮射击目标优选的因素,提出了多属性模糊决策方法的数学模型和求解最优射击目标排序的新方法.该方法在舰炮射击目标优选中的应用实例表明:通过定量和定性相结合,专家判断和信息处理相结合的多属性模糊决策方法对舰炮射击目标优选、决策具有一定的借鉴意义.     

A sequential partial information bomber-defender shooting problem

A bomber carrying homogenous weapons sequentially engages ground targets capable of retaliation. Upon reaching a target, the bomber may fire a weapon at it. If the target survives the direct fire, it can either return fire or choose to hold fire (play dead). If the former occurs, the bomber is immediately made aware that the target is alive. If no return fire is seen, the true status of the target is unknown to the bomber. After the current engagement, the bomber, if still alive, can either re-engage the same target or move on to the next target in the sequence. The bomber seeks to maximize the expected cumulative damage it can inflict on the targets. We solve the perfect and partial information problems, where a target always fires back and sometimes fires back respectively using stochastic dynamic programming. The perfect information scenario yields an appealing threshold based bombing policy. Indeed, the marginal future reward is the threshold at which the control policy switches and furthermore, the threshold is monotonic decreasing with the number of weapons left with the bomber and monotonic nondecreasing with the number of targets left in the mission. For the partial information scenario, we show via a counterexample that the marginal future reward is not the threshold at which the control switches. In light of the negative result, we provide an appealing threshold based heuristic instead. Finally, we address the partial information game, where the target can choose to fire back and establish the Nash equilibrium strategies for a representative two target scenario.     

一种基于Wallace树的分散式DCT/IDCT体系结构

提出了一种新的基于Wallace树的分散式DCT/IDCT体系结构。它不依赖于ROM和乘法器,用面积开销低的加法器、移位器和4-2压缩器,实现了乘法密集的DCT/IDCT算法。该体系结构在SMIC 0.18μm工艺上进行了设计和综合,可以达到100Mpixels/s的吞吐率,只消耗了36 141个晶体管和1024bits转换存储器,时序—面积性能较已有的体系结构有了显著的改善。     

地空导弹C3I决策系统的Petri网建模与性能分析

对地空导弹决策系统的结构和性能进行了研究.对基于旅营两级决策组织导出的库所/变迁系统进行了描述,建立了较为完善的决策系统的Petri网模型.并引入了决策时延这一反应指挥决策系统能力的重要性指标.这些问题的解决对提高C3I决策系统的实时性和准确性具有十分重要的意义.     

基于数学形态学的三维空间聚类

分析了各种空间聚类的方法,研究了炮阵地地形分析和选取原则,实现了炮阵地选取决策支持系统,提出了基于数学形态学的三维空间聚类新算法,并将该算法运用到开发的炮阵地选取决策支持系统中,实验结果表明,该算法效果较好.     

Dynamic policy for idling time preservation

This study aims to determine and evaluate dynamic idling policies where an agent can idle while some customers remain waiting. This type of policies can be employed in situations where the flow of urgent customers does not allow the agent to spend sufficient time on back-office tasks. We model the system as a single-agent exponential queue with abandonment. The objective is to minimize the system's congestion while ensuring a certain proportion of idling time for the agent. Using a Markov decision process approach, we prove that the optimal policy is a threshold policy according to which the agent should idle above (below) a certain threshold on the queue length if the congestion-related performance measure is concave (convex) with respect to the number of customers present. We subsequently obtain the stationary probabilities, performance measures, and idling time duration, expressed using complex integrals. We show how these integrals can be numerically computed and provide simpler expressions for fast-agent and heavy-traffic asymptotic cases. In practice, the most common way to regulate congestion is to control access to the service by rejecting some customers upon arrival. Our analysis reveals that idling policies allow high levels of idling probability that such rejection policies cannot reach. Furthermore, the greatest benefit of implementing an optimal idling policy occurs when the objective occupation rate is close to 50% in highly congested situations.     

杂波环境下多目标跟踪数据关联的快速算法

数据关联是实现杂波环境下多目标跟踪的关键问题,目前公认较好的方法是联合概率数据关联（ＪＰＤＡ）,但是其计算和存储量很大,故在实际中寻求一种快速或近似的算法是十分必要的。本文提供一组有效快速算法,并在我们有关课题中得到初步验证。     

高性能炸药综合性能的多维评估

基于欧几里得几何距离的概念,给出了一种炸药综合性能的多维空间评估方法。这种方法在确定炸药理想方案和最差方案的基础上,综合考虑了各种炸药方案与理想方案和最差方案的欧几里得几何距离,以此评估炸药综合性能。     

基于混合建模方法的三维彩色树木快速模拟算法

在对多种模型进行研究的基础上，提出了一种快速模拟三维彩色树木的高效算法。该算法不仅合理简化了树木的几何拓扑结构和生长规律特性，而且引入了特性良好、计算简单、参数易于控制的随机函数。因此生成树木的种类较多、图形逼真、速度很快，在普通微机上达到了实时的模拟效果。