一个组合对策问题的解

本文求解如下的组合对策问题:设有一堆棋子,总数N 是奇数,甲乙两人轮流取子,每人每次可取一颗、二颗,最多可取s 颗,但不能不取,直至取完后分别来数甲乙两人所取棋子的总数,总数为奇数者获胜。站在甲的立场上考虑获胜的策略,文中解决了如下两个问题:(Ⅰ)总数N 应是什么样的奇数,甲才有获胜策略;(Ⅱ)当N 一定时,甲应采取什么样的策略取子,才能获胜。     

C~3I系统分析的分层策略

通过对Ｃ３Ｉ系统体系结构的多维多层次性特征的分析,表明Ｃ３Ｉ系统分析的分层策略是一种突出系统整体性,体现系统相关性,实现从定性到定量综合集成的有效方略,可以应用于Ｃ３Ｉ系统分析的各个阶段。     

火力使用策略的集对分析与评价

对不确定理论──集对分析理论［１］中关于联系度的算法作了修改,给出了更有实际意义的联系度公式。应用此公式采用同异反决策分析的方法,首先对“火力使用策略”进行定性分析,把影响火力使用的７对主要矛盾看作７个集对,定义每集对的同异反三属性的测量要素。通过求各集对的联系度所在问题的解,达到择优最佳“火力使用策略”的目的,从而对战役行动起到指导或辅助决策的作用。     

时序逻辑的并行描述与隐含遍历

随着电路规模的迅速增长,设计验证越来越复杂,从而需要高速的数据处理系统。基于总线型多机系统环境,研究电路网表和布尔表达式的BDD（Binary Decision Diagram）并行构造方法,并通过隐含遍历任务的动态调度设计有效地完成时序逻辑的状态遍历。     

Slow failure: Understanding America’s quagmire in Afghanistan

ABSTRACT

The United States government has no organised way of thinking about war termination other than seeking decisive military victory. This implicit assumption is inducing three major errors. First, the United States tends to select military-centric strategies that have low probabilities of success. Second, the United States is slow to modify losing or ineffective strategies due to cognitive obstacles, internal frictions, and patron-client challenges with the host nation government. Finally, as the U.S. government tires of the war and elects to withdraw, bargaining asymmetries prevent successful transitions (building the host nation to win on its own) or negotiations.     

智能搜救机器人在障碍地形的自主构型规划

为了解决带有辅助摆臂的智能搜救机器人自动规划构型以实现自主越障的难题,提出一种能够适应复杂地面形状的搜救机器人越障构型规划新方法,其核心是一种高适应性、高效率的机器人姿态预测算法。通过将地形表示为离散的点集,建立了搜救机器人的单侧姿态预测数学模型;进一步提出了快速求解该问题的算法,每秒可预测1 000～1 500个姿态。基于此,设计了机器人越障过程中状态、动作的评价指标,运用动态规划算法与滚动优化思想构建了具有优化能力的、能够实时运行的构型规划器。仿真与实物实验的结果表明,该方法能够使机器人自主调整构型穿越复杂地形,且相较强化学习算法和人工操作具有更平稳的越障效果。     

改进BAS-TIMS算法在空战机动决策中的应用

针对当前空战机动决策精确度低、实时性差的缺点,对天牛须搜索-战术免疫机动系统(Beetle Antennae Search-Tactical Immune Maneuver System, BAS-TIMS)算法进行改进,并应用于空战机动决策中。增加左爬升、右爬升、左俯冲、右俯冲4种机动,对传统的机动策略库进行扩充,设计了11种基本机动策略并给出了相应的控制方法。基于距离、高度、速度、角度和战机性能优势函数,利用非参量法构造战机机动决策综合优势函数。针对天牛须搜索算法在全局搜索和收敛速度上存在的缺陷,引入蒙特卡洛概率迭代的方法对算法进行改进,并和战术免疫机动系统进行融合,将改进的BAS-TIMS算法用于空战机动决策。设计算例进行仿真分析,并将结果和博弈论法、改进共生生物免疫进化算法、传统BAS算法和传统TIMS模型的计算结果进行对比,验证所提算法的有效性。仿真结果表明:改进BAS-TIMS算法在空战机动决策的收敛精度、收敛速度和全局搜索能力上更加具有优势。     

【邀请论文】军队审计应用区块链技术面临的机遇、挑战及推进策略

区块链技术是一种融数据库技术、计算机科学、网络技术、数学及密码学等为一体的现代信息技术,是未来信息化发展的核心技术之一,具有去中心化、公开透明、不易篡改及开源共治等特点。军队审计要坚定不移地贯彻科技强审战略,加强审计信息化建设,将大数据、区块链等现代信息技术与审计业务深度融合,大力推行在线审计、联网审计,促进审计力向保障力和战斗力聚焦。本文在系统阐述区块链技术给军队审计在控制审计风险、提高工作效率、实现审计全覆盖等方面带来机遇的同时,分析了可能面临的应用意识不足、应用经验不足、应用安全存在隐患、应用法规缺乏等挑战,在此基础上提出了区块链技术应用的推进策略,以期更好地推动军队审计信息化的进程。     

Military Off the Shelf Procurements: A Norwegian Case Study

Buying off the shelf procurements (OTS) has become an important part of the national acquisition strategy in several countries, and this paper seeks to bring empirical evidence on OTS as the preferred acquisition strategy by use of data from 2015 to 2022 investment portfolio of the Norwegian Armed Forces. We develop definitions for three categories of procurement – OTS, modified OTS and development projects – as well as a method to classify projects into these categories. Our first finding is that the characteristics of OTS projects correspond to modified OTS and development projects. Our second finding indicates that OTS projects perform better when it comes to the completion of projects according to the initial schedule, compared to development projects.     

Optimal control policies for an inventory system with commitment lead time

We consider a firm which faces a Poisson customer demand and uses a base‐stock policy to replenish its inventories from an outside supplier with a fixed lead time. The firm can use a preorder strategy which allows the customers to place their orders before their actual need. The time from a customer's order until the date a product is actually needed is called commitment lead time. The firm pays a commitment cost which is strictly increasing and convex in the length of the commitment lead time. For such a system, we prove the optimality of bang‐bang and all‐or‐nothing policies for the commitment lead time and the base‐stock policy, respectively. We study the case where the commitment cost is linear in the length of the commitment lead time in detail. We show that there exists a unit commitment cost threshold which dictates the optimality of either a buy‐to‐order (BTO) or a buy‐to‐stock strategy. The unit commitment cost threshold is increasing in the unit holding and backordering costs and decreasing in the mean lead time demand. We determine the conditions on the unit commitment cost for profitability of the BTO strategy and study the case with a compound Poisson customer demand.