基于0-1规划的弹种决策与发射时序优化

对于身管发射武器系统,同一发射单元使用不同弹种完成作战任务时,需要确立合适的弹种决策与最佳的发射时机.提出用O-1变量来描述弹种决策变量.通过时弹种发射机制及武器系统控制特点进行分析,构造多种0-1变量用以描述武器系统作战时序之间的约束关系,建立了弹种发射时序的0-1规划模型,并用LINGO软件实现了0-1规划的求解.给出了典型应用实例,进行了仿真计算,结果表明,该方法简单可行.     

可判定条件下的零知识证明

零知识证明是密码学关注的问题之一。在可判定条件下,运用代数学中群的共轭性质进行零知识证明,其实例就是数学中关于寻找共轭子的困难性问题。     

基于多目标多维模糊决策的装备战场损伤等级评定方法

针对装备战场损伤等级评定中具有较大的模糊性和随机性问题,应用多目标多维模糊决策的基本原理,提出一种带有信息熵和调控系数的目标函数,得到新的模糊决策识别矩阵和目标权重的计算模型,为装备战场损伤等级评定提供了一种有效方法。该方法根据3种不同情况,给出了相应的计算步骤,计算结果较准确地反映了装备战场损伤程度。新的计算模型不仅对多目标多维模糊决策理论模型的发展进行了尝试,而且丰富了装备战场损伤等级评定方法。     

基于不确定语言多属性决策的目标威胁度排序

针对影响不同类目标威胁度的因素建立了目标威胁度指标体系,并在此基础上,利用不确定语言多属性决策模型对不同类目标威胁度进行排序。该方法不仅充分体现了不同类目标威胁度的影响因素,还充分利用了专家和决策人员的经验,能较好地反映现代战场中目标威胁度的实际情况,利于提高智能化程度;模型适应性较强,计算量小,符合军事系统实时性的特殊要求,使评估结果更具有可信性和实用性。     

基于熵权多目标决策的雷达网战损装备抢修排序方法

分析了熵权的理论基础,给出了一种基于熵权多目标决策的雷达网战损装备抢修排序方法。其中,采用熵权与决策者的主观权重相结合的方法确定综合权重,使权重的确定更加合理。最后通过实例对该方法的可行性和实用性进行了说明。     

基于区间数TOPSIS法优选空军战役作战计划

针对战役作战计划优选中的不确定性,运用区间分析和TOPSIS(Technique for Order Preference by Similarity to Ideal Solution)法探索空军战役作战计划优选问题.通过引进区间数乘法运算,将区间数多指标决策问题转变为指标为区间数的多指标决策问题,进而给出区间数多指标决策问题的TOPSIS法,对空军战役作战计划进行排序选优.与传统方法相比较,该方法较好地解决了评价指标为不确定值时的多指标决策问题.     

基于模糊综合评判法的敌空袭主攻方向预测研究

针对主攻方向预测的主要特点,运用模糊理论探索解决其主观推理、决策问题。应用隶属函数及变权重模糊综合评判方法分析,建立了评估模型,得到了类似人主观判断的结果,最后通过示例说明应用模糊综合评判法预测主攻方向的可行性。     

Analysis of artillery shoot‐and‐scoot tactics

Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy.     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

基于大数据的战区联合作战装备保障决策

大数据技术在决策领域的不断应用,将给装备保障决策方式带来重大变革。本文研究基于大数据的战区联合作战装备保障决策问题,提升信息化条件下装备保障准确、高效的决策方式等方面发挥重大作用。阐述了大数据的基本内涵,在决策领域的应用价值。通过系统推理的方法对战区联合作战装备保障决策的分析,提出基于大数据的战区联合作战装备保障决策基本构想,画出科学决策过程示意图,构建大数据战区联合作战装备保障辅助决策系统。结合研究大数据在战区联合作战装备保障决策领域的现实情况,提出相对应的措施建议。