20世纪六七十年代中国战备的回顾与思考

20世纪六七十年代,新中国面对严峻的国家安全形势,曾进行了一场大规模的战备.这次战备以"早打、大打、打核战争"为指导思想,将战备工作在一个相当长的时期内摆在全党、全军乃至全国各项工作的中心地位,并制约国家各项工作的安排和开展,与一般意义上的战备相比显示出特殊的复杂性.因而,这一时期的战备备受争议,可谓众说纷纭、褒贬不一.     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic evacuation routes for personnel on a naval ship

We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

在线电路测试仪在装备维修中的应用

在线电路测试仪在工业仪器和军事装备的电路测试中应用广泛,其关键技术是利用后驱动技术实现在线元器件的隔离.阐述了电路中器件的常见故障形式,详细研究了后驱动技术的理论和应用,在此基础上,分析了后驱动技术对电子器件安全容限的要求.最后,对在线电路测试仪在装备维修中的应用进行了展望.     

一种改进的卫星导航系统效能评估模型

建立卫星导航系统效能评估指标体系,在原有模糊综合评判法的基础上,引入定量指标的实际测量值,采用将评语集量化的方法,建立效能评估模型,并用实例验证该模型的可行性,给出系统综合效能评估值,避免了原有方法存在的问题,为卫星导航系统的效能评估和研制开发提供了一定的参考.     

层次分析法用于战术互联网路由协议选择

选择合适的路由协议是战术互联网建设的一个关键问题,目前的选择方法大多缺乏定量、系统的分析,无法对路由协议的整体性能进行很好的评价.建立了战术互联网路由协议性能评价层次模型,给出实例说明了利用层次分析法对战术互联网路由协议进行选择的方法.对结果的分析表明方法直观、有效,可以实现合理的决策,具有实用价值.     

20世纪六七十年代中国战备指导思想浅析

新中国成立后,一直面临着帝国主义的封锁、包围和战争威胁.特别是进入20世纪60年代中期以后,随着中国周边安全环境的日益恶化,新中国领导人开始强调要准备打仗,提出并确立立足于"早打、大打、打核战争"的战备指导思想.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016