一个组合对策问题的解

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

论防空火力配系的评价问题

本文提出了对弹炮结合防空火力配系的定量化评价的思路,并探讨了火力配系指标的应用方法。     

雷达至指挥仪基线修正研究

综合诸元是指挥仪解算精度较高的一种工作方式,但存在一个雷达至指挥仪间的基线误差,就这一误差进行了分析并提出了修正方法。     

军事虚拟仓库组织结构的博弈分析

简要介绍了军事虚拟仓库及其组织结构形式．以及博弈论的相关知识。结合军事后勤系统的特点,采用完全信息静态博弈纳什均衡的方法分析了军事虚拟仓库的组织结构模式,在假设的合理的条件下模拟3种组织形式的博弈过程。通过各个模型的最终纳什均衡,指出了3种组织结构形式运作的结果和其积极因素、消极因素、噪声构成．结合我军现有的后勤保障体制,提出现行保障体制的合理与不合理的地方,并给出了改进方案,对优化全军后方仓库布局及管理和战备物资储备及应急保障有着重要意义,可以为总部决策提供咨询建议。     

新一代人工智能在国防科技领域发展探讨

新一代人工智能技术已经成为当前研究的重点和热点,并逐渐成为提升国防力量、军事能力和国家竞争力的有效途径。本文在总结人工智能概念的基础上,给出了新一代人工智能的定义和发展的重要意义,从掌握未来战争主动权、支撑军工装备研制生产模式转型和保障国防科技先进性三个方面梳理了国防科技领域发展新一代人工智能的必要性,并从基础技术支撑和国防特色应用两个方向提出了国防科技领域发展新一代人工智能涉及的基础软硬件、标准规范、智能装备/系统、辅助作战指挥、智能研发等重点内容,在此基础上给出了相关的发展建议。以上研究可为新一代人工智能技术在国防科技领域的研究、应用和发展提供参考。     

基于SWOT分析的我国海上方向空中安全形势及对策措施

海上方向是强敌对我实施战略围堵和遏制的主要方向。随着美国国防战略重回大国竞争,其遏制中国的手段推陈出新,尤其是在海空方向对我施压强度频度与日俱增。文章运用SWOT方法对我国海上方向空中安全形势进行了全面分析,认为优势体现在联合作战指挥体制、国防动员能力、列装新型防空武器等方面,劣势体现在战场建设滞后、预警探测拦截打击能力不足等方面,机遇体现在中美共识与相对稳定的周边环境,威胁体现在强敌对我的侦察威慑、空天打击、海空封锁。通过构建我国海上方向空中安全的SWOT分析矩阵,提出要进一步深化改革,加强军队与地方、平时与战时、作战力量和作战环节的“三个统筹”,发展新型防空、预警装备,以及加强沿海防空战场建设等。     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.