Advancing “Defence-in-depth”: intelligence and systems dynamics

This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain.     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

Missile Strategy in a Post-Nuclear Age

While the arrival of nuclear weapons coincided roughly with the development of short, medium, intermediate, and eventually intercontinental missiles, the contribution of missile technology to the deterrence equation is often lost. If nuclear weapons were eliminated, even new generation missiles with conventional payloads could struggle to render effective deterrence. But some of the physical and psychological effects commonly ascribed to nuclear weapons could still be in play. And in a world without nuclear weapons, thinking about the use and control of force from the nuclear age would also deserve renewed attention.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Strategies for managing the flexible capacity in the airline industry

The ability to effectively match supply and demand under uncertainty can result in significant revenue benefits in the airline industry. We study the benefits of a Demand Driven Swapping (DDS) approach that takes advantage of the flexibilities in the system and dynamically swaps aircraft as departures near and more accurate demand information is obtained. We analyze the effectiveness of different DDS strategies, characterized by their frequency (how often the swapping decision is revised), in hedging against demand uncertainty. Swapping aircraft several weeks prior to departures will not cause much disturbance to revenue management and operations, but will be based on highly uncertain demands. On the other hand, revising the swapping decision later will decrease the possibility of bad swaps, but at a higher cost of disrupting airport services and operations. Our objective is to provide guidelines on how the flexible (swappable) capacity should be managed in the system. We study analytical models to gain insights into the critical parameters that affect the revenue benefits of the different swapping strategies. Our study determines the conditions under which each of the different DDS strategies is effective. We complement our analysis by testing the proposed DDS strategies on a set of flight legs, using data obtained from United Airlines. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于预警时间窗口的空天反导预警体系构建

如何构建一个完善的反导预警体系并确保反导预警时间充足是当前的一个研究热点,创新性地应用反导预警时间窗口分析各类预警系统的性能,并为反导预警体系构建给出相关决策依据。首先结合预警时间窗口的概念,给出天基支援下预警时间窗口的数学描述;然后,建立了反导预警过程中攻防双方的数学模型及仿真方法;接着,对反导预警时间窗口的计算进行了具体分析;最后,结合具体仿真实例,分析了天基预警卫星对反导预警时间窗口的扩展作用,得出了一些较为实用的结论。     

圆柱体内线缆电磁脉冲耦合特性分析

针对具有孔缝圆柱腔体中线缆的强电磁脉冲耦合问题,提出了基于时域有限积分法和Agrawal传输线方程的混合方法.该方法利用时域有限积分法求解腔体中的场分布,采用Agrawal传输线方程计算腔体内线缆的感应电压,提高了孔缝腔体中线缆耦合特性分析的效率.以圆柱腔体中双导线为例,通过计算双导线终端感应差模电压的耦合系数,分析孔缝、导线、腔体和入射电磁脉冲对耦合特性的影响.     

一类二次微分系统在三次多项式扰动下的极限环估计

计算了一类二次Hamilton微分系统的一阶Mel’nikov函数,通过此方法对该系统在三次多项式扰动下分岔的极限环个数进行了估计。     

单兵系统数据模型

讨论了单兵系统的体系结构和信息要素,并结合单兵系统在联合作战中的应用例子,对其业务过程和信息流进行初步分析。然后通过IDEF1X方法,设计单兵系统基于关系数据库的数据模型。最后讨论了模型的规范化问题,并给出检验数据模型的方法。