南宋钓鱼城城池防御初探

针对古代战争研究与当今国防建设缺乏关联的问题,首次就钓鱼城保卫战经典战例对我国现代国防建设的启示意义作了研究。分析钓鱼城城池选址"独"与"险"的地理关系、筑城布局内容和多层综合防御体系这三者对战争胜利的关键影响,提出在当前国防工程规划与建设中借鉴其成功经验的观点,并从工程宏观选址、多城池防御的联防体系及军民联合的防御模式等三方面就其经验和启示意义进行归纳与总结。     

Are non‐lethal weapons a viable military option to strengthen the hearts and minds approach in Afghanistan?

Commanders of the International Security Assistance Force (ISAF) have repeatedly stressed the hearts and minds approach in Afghanistan, in saying that the human terrain is decisive for a successful outcome of the mission. Avoidance of civilian casualties is considered of strategic importance, and by nature highly dependent on the management of tactical level Escalation of Force (EoF) situations. Non‐lethal weapons (NLWs) are expected to enable tactical commanders to avoid innocent civilian casualties in such situations. This article considers a selected NLW on its potential to accomplish this requirement. It uses a defence technology assessment approach to analyse EoF situations experienced by Dutch ISAF forces in which the NLW is inserted. The analysis demonstrates that a range of contextual factors in the Afghanistan high‐risk environment tend to narrow down the window of opportunity for the NLW to help defuse the risk of unintended civil casualties.     

雷达干扰效能评估指标体系的构建方法

建立合理的干扰效能评估指标体系是实现雷达干扰效能综合评估的前提,首先分析了影响雷达干扰效能的要素,提出了一种由雷达受到干扰后的战术性能变化、干扰机主要战术性能参数和电磁环境因素建立雷达干扰效能评估指标集的方法。然后应用粗糙集属性约简算法对该指标集进行约简,删除了冗余属性,并对约简后的指标体系进行了有效性检验。仿真结果表明,该指标体系具有较好的完备性和独立性。     

无人机使用助力现代联合登岛(礁)作战

无人机已经广泛使用军事领域各个方面,但就其助力现代联合登岛(礁)作战,还少有研究。本文从无人机助力联合登岛(礁)作战特性分析、具体表现和实现途径三个方面进行了探讨,以期对现代联合登岛(礁)作战有所借鉴和帮助。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Dynamic capacity reservation and due date quoting in a make‐to‐order system

We consider a make‐to‐order manufacturer facing random demand from two classes of customers. We develop an integrated model for reserving capacity in anticipation of future order arrivals from high priority customers and setting due dates for incoming orders. Our research exhibits two distinct features: (1) we explicitly model the manufacturer's uncertainty about the customers' due date preferences for future orders; and (2) we utilize a service level measure for reserving capacity rather than estimating short and long term implications of due date quoting with a penalty cost function. We identify an interesting effect (“t‐pooling”) that arises when the (partial) knowledge of customer due date preferences is utilized in making capacity reservation and order allocation decisions. We characterize the relationship between the customer due date preferences and the required reservation quantities and show that not considering the t‐pooling effect (as done in traditional capacity and inventory rationing literature) leads to excessive capacity reservations. Numerical analyses are conducted to investigate the behavior and performance of our capacity reservation and due date quoting approach in a dynamic setting with multiple planning horizons and roll‐overs. One interesting and seemingly counterintuitive finding of our analyses is that under certain conditions reserving capacity for high priority customers not only improves high priority fulfillment, but also increases the overall system fill rate. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

饱和系统的线性最优容错不变集

针对饱和系统的容错控制问题,提出了一种D稳定约束下系统吸引域的估计方法。分别以不变集和参考集的容量为优化目标,给出了两个优化容错不变集的充分条件。为解决不变集优化中出现的双线性矩阵不等式(BMI)问题,通过构造包含线性矩阵不等式(LMI)的目标函数,将它转化为非线性规划的形式进行求解。通过一个仿真实例对该方法进行验证。     

省部共建高校的服务定位：打造区域经济社会发展的核心动力源

省部共建高校是我国高等教育的重要组成部分，其服务应立足区域经济建设和社会发展的需要，一方面推进区域自主创新，另一方面实现学校自身又好又快的发展。该文从人才培养、科技创新、社会服务、文化辐射四方面分析了省部共建高校的服务定位，提出力争将其建设成为推动区域经济社会发展的核心动力源，成为地方高校发展的示范集群。     

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     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010