Waypoint analysis for command and control

Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

大型舰船电力系统网络重构研究

大型舰船电力系统的出现使供电方式由原来的辐射状向环形发展,其网络重构是一个崭新的问题.文中给出了大型舰船电力系统的网络拓扑结构并综合考虑了线路容量限制、节点电压约束及供电负荷优先性的重构数学模型,保证了各种情况下最大限度地给负荷供电.将规划遗传算法应用于所建模型的求解,并应用算例验证了此解法的可行性.     

太空目标监视装备作战试验设计研究

按照现行装备试验鉴定体制的要求,装备作战试验是新研太空目标监视装备在正式交付使用单位前必须完成的一类试验。太空目标监视装备具有精密昂贵、价值高、单台套、集成度和复杂度高等特点,开展作战试验与普通的侦察探测装备和常规兵器区别较大。本文介绍了太空目标监视装备作战试验的对象与要求,分解了太空目标搜索发现、监视管理、目标识别、信息共享等实战能力和实战能力的生成与保持要求,构建了作战试验评估指标体系,并依据太空目标监视任务剖面和环境剖面设计了作战试验项目,基于作战试验指标考核评估确定了评估数据采集需求,紧贴太空目标监视装备实际使用面临的环境条件构设了逼真的作战试验环境条件。这些研究可为太空目标监视装备作战试验实践提供支持。     

A reusable planar triggered spark-gap switch batched-fabricated with PCB technology for medium-and low-voltage pulse power systems

Triggered spark-gap switch is a popular discharge switch for pulse power systems. Previous studies have focused on planarizing this switch using thin film techniques in order to meet the requirements of compact size in the systems. Such switches are one-shot due to electrodes being too thin to sufficiently resist spark-erosion. Additionally, these switches did not employ any structures in securing internal gas composition, resulting in inconsistent performance under harsh atmospheres. In this work, a novel planar triggered spark-gap switch (PTS) with a hermetically sealed cavity was batched-prepared with printed circuit board (PCB) technology, to achieve reusability with low cost. The proposed PTS was inspected by micro-computed tomography to ensure PCB techniques meet the requirements of machining precision. The results from electrical experiments demonstrated that PCB PTS were consistent and reusable with lifespan over 20 times. The calculated switch voltage and circuit current were consistent with those derived from real-world measurements. Finally, PCB PTS was used to introduce hexanitrostilbene (HNS) pellets in a pulse power system to verify its performance.     

Automated integration of real-time and non-real-time defense systems

Various application domains require the integration of distributed real-time or near-real-time systems with non-real-time systems.Smart cities,smart homes,ambient intelligent systems,or network-centric defense systems are among these application domains.Data Distribution Service(DDS)is a communi-cation mechanism based on Data-Centric Publish-Subscribe(DCPS)model.It is used for distributed systems with real-time operational constraints.Java Message Service(JMS)is a messaging standard for enterprise systems using Service Oriented Architecture(SOA)for non-real-time operations.JMS allows Java programs to exchange messages in a loosely coupled fashion.JMS also supports sending and receiving messages using a messaging queue and a publish-subscribe interface.In this article,we pro-pose an architecture enabling the automated integration of distributed real-time and non-real-time systems.We test our proposed architecture using a distributed Command,Control,Communications,Computers,and Intelligence(C4I)system.The system has DDS-based real-time Combat Management System components deployed to naval warships,and SOA-based non-real-time Command and Control components used at headquarters.The proposed solution enables the exchange of data between these two systems efficiently.We compare the proposed solution with a similar study.Our solution is superior in terms of automation support,ease of implementation,scalability,and performance.     

线性方程组二级迭代法的收敛速度

二级迭代法由内、外迭代和内迭代次数三部分组成。给出了线性方程组二级迭代法R1-收敛因子的一个上界,这个上界由内、外迭代的R1-收敛因子和内迭代次数所决定,其主部为外迭代的R1-收敛因子。在矩阵单调性条件下,对于任何内迭代方法和任意内迭代次数,证明了外迭代的R1-收敛因子也是二级迭代法R1-收敛因子的下界。所得结果反映了内、外迭代的收敛速度以及内迭代次数对于二级迭代法收敛速度的综合影响。     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Production/distribution system design with inventory considerations

This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012     

基于联合作战能力的武器装备体系需求研究

从基于联合作战能力的核心思想入手,分析了该思想在武器装备体系需求分析中的重要作用,探讨了基于联合作战能力的武器装备体系需求研究新模式,并提出了该需求研究中需要解决的问题．有关结论对于开展武器装备体系需求研究工作具有积极地指导意义．     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012