On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

Technical note: Finite-time regret analysis of Kiefer-Wolfowitz stochastic approximation algorithm and nonparametric multi-product dynamic pricing with unknown demand

We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ₁, κ₂ are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.     

多波束卫星网络的物理层安全性能指标研究

安全性是卫星通信网络充分发挥其优势的必要保证。将物理层安全传输技术引入多波束卫星通信网络,可望有效提高卫星通信系统的抗截获和抗侦测能力。分析了卫星通信的物理层安全应用需求,设计了一套波束成形和功率控制相结合的多波束卫星下行链路物理层安全传输策略,建立了信道模型和信号模型,构建了一套多波束卫星网络下行链路的物理层安全性能评价指标,并对指标进行了定性和定量的分析。     

一种快速评定通信设备战损等级的方法

为解决通信设备战损等级评定中存在的问题,快速且准确地做出评定,提出了利用BP神经网络进行战损等级评定.在总结战损等级影响因素的基础上,建立了通信设备战损等级评定神经网络模型.经检验,该模型用于战时通信设备战损等级评定准确度高,具有很强的军事意义.     

应急装备保障多阶段长途运输模型研究

通过对应急装备保障实际场景的分析，提出装备应急运输过程应分2个不同的阶段进行研究。重点讨论了第1阶段涉及的运输问题，并建立相应数学模型。通过数学软件matlab实现了模型的求解，最后通过算例分析证明了模型的有效性。为相关运输问题的解决提供了一种有效的方法。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

The lobbies’ network at the EU policy level: the case of security and defense

Lobbyists may not share the same interests, but they usually agree to form a link in a network which could eventually be used to spread information, to search for potential partners, to speak with one voice to decision makers. In other words, social links represent value for lobbyists because they may ultimately facilitate access. In this article, we explore the network of the Security and Defense lobbies in the EU and we describe its structure.     

相依网络研究综述

网络相依性和相依网络研究已经成为近年来复杂网络领域的热点,但是目前对相关研究进展进行综合归纳的文献却不多见。在对国内外相关文献进行系统分析的基础上,简要介绍相依网络研究涉及的渗流理论;描述该类型网络的级联失效过程;从相依网络的子网络特性、相依边的方向和类型、子网络组合方式等三个角度对相依网络鲁棒性的研究成果进行总结;并从理论和应用两方面对未来相依网络研究的发展方向进行展望。     

“过渡衔接词语”在大学英语短文写作中的作用

短文写作是大学英语四级考试的一个重要组成部分 ,短文写作的成功与否将直接影响到是否通过四级。本文将从三个方面归纳、分析三段式短文中常用的过渡衔接词语在英语短文写作中的“闪光”点作用。旨在帮助学生认识过渡衔接词语的重要性 ,从而提高写作水平     

F—K理论在堆积固体自燃火灾调查中的应用

堆积固体自燃火灾是常见多发火灾，由于其规模庞大、着火延迟期长等特点，难以进行全尺寸的模拟实验，为火灾预防和调查工作带来了一定的难度。基于F—K（Frank—Kamenetskii）理论，将小规模实验结果外推，从而预测或判断一定尺寸的堆积固体在一定的环境温度下自燃起火的危险性。