突发事件处置经验对军队战时管理的启示

战时管理是关系作战全局的基础性工作,是保持和释放战斗力的重要举措,是确保军队高度集中统一、能打胜仗的重要支撑。有效提升军队战时管理能力是现代战争中部队管理工作亟待研究的重要课题。本文梳理了近期我国突发事件处置中的经验教训,从战时支前物资管理、战时人力资源管理及战时舆情信息管控三个方面提出：战时支前物资管理应完善机制、改造模式、畅通网络;战时人力资源管理应紧贴任务实际、突出岗才一致、彰显精简程序;战时舆情信息管控应统一机构、正确导向、纯洁队伍、严管舆论等措施,以期给未来战时管理决策提供可选方案,实现管理服务作战,保障打赢之目的。     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

Optimal source placement for point coverage in active multistatic sonar networks

The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment.     

考虑非线性退化与随机失效阈值的剩余寿命预测

针对广泛存在的非线性退化设备,现有方法尚未考虑随机失效阈值对剩余寿命预测结果的影响。因此,通过对设备性能退化过程进行分析,提出了一种综合考虑非线性退化与随机失效阈值的剩余寿命预测方法。基于Wiener过程构建了考虑个体差异与测量误差的非线性退化模型;基于卡尔曼滤波算法建立状态空间模型以实现对退化状态的在线更新;基于极大似然法估计失效阈值分布系数估计方法,得到随机失效阈值的概率分布;基于随机失效阈值推导出剩余寿命的概率分布,实现对剩余寿命的在线预测。算例研究表明,所提方法可以有效地提升剩余寿命预测的准确性,具备一定工程应用价值。     

超连续谱激光光源研究进展

高非线性光纤制造技术的成熟和光纤激光器性能的提升,极大地促进了超连续谱光源的快速发展,以光纤为非线性介质的超连续谱的产生成为当前研究热点。从可见光、近红外和中红外3个不同波段,综述了超连续谱产生的技术方案与最新进展。当前,可见光和近红外波段的超连续谱光源输出功率已经突破百瓦量级,并出现了多芯光子晶体光纤、光纤放大器和随机光纤激光器产生超连续谱等众多新方案;以氟化物光纤和亚碲酸盐光纤为非线性介质的中红外超连续谱,输出功率也突破了十瓦量级;在光谱拓展方面,以硫系光纤为非线性介质的超连续谱,输出光谱已扩展到12μm以上。     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

基于反正切函数的测试性分配方法

针对现有主流测试性分配方法存在的分配指标过低和过高等不合理问题,分析认为其根源在于现有方法采用线性分配函数,而该函数不符合测试性指标提升规律,为此,构造了一种基于反正切函数的测试性分配函数,设计故障检测率与故障隔离率指标的分配算法,开展案例应用并与经典故障率分配法和综合加权分配法进行对比分析,结果表明随着分配权重(故障率)的变大,本方法分配指标的增幅逐渐减小,不会出现极低指标和超1指标的不合理情形。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008