Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于扩展H∞滤波的OFDM自适应盲信道估计算法

针对OFDM系统中的信道估计问题,提出了一种基于扩展H∞滤波的OFDM自适应盲信道估计方法。该方法通过对常规H∞算法进行改进,实现了在OFDM系统中能自适应跟踪信道的变化特征,从而使均方误差的性能随着输入信噪比的增加得到很大的提高。仿真结果也验证了该算法优于卡尔曼和H∞估计算法,具有计算复杂度低,运算量小、收敛速度快、算法灵活等特性。     

基于改进Rao-Blackwellized粒子滤波的WSN被动目标跟踪

Rao-Blackwellized粒子滤波虽然适合系统状态包含线性高斯分量的非线性状态估计,但是由于其计算量较大,不适用于实时性较高的被动目标跟踪情况。针对Rao-Blackwellized粒子滤波的不足,提出了改进的Rao-Blackwellized粒子滤波算法用于WSN被动目标跟踪。新的算法由一个粒子滤波和一个卡尔曼滤波组成,在执行过程中,粒子滤波和卡尔曼滤波相互交换信息,并行运行。计算机仿真结果表明,新的算法能够更好地减少计算量,提高跟踪的实时性。     

Duffing混沌阈值的新定量求解法及其在WSD的应用

概述了求取Duffing系统阈值的3种传统方法,分析优缺点,最终提出一种新的求取混沌阈值的定量方法。这种方法能充分反映周期序列的振荡特征,因此,定义为周期特征量法。将该特征量作为混沌阈值可以明显区别混沌序列和周期序列,由此可以用于判断Duffing系统的输出状态,是一种优于其他方法的混沌判决。最后,仿真验证了该方法的可行性并应用于检测弱周期信号的有无及其幅值。     

基于三对Bell态纠缠交换的QDKD方案

提出了一种基于三对Bell态纠缠交换的量子确定性密钥分发方案(Quantum Deterministic Key Distribution,QDKD),该方案充分利用量子纠缠交换的原理,通过对三对Bell态进行纠缠、测量操作,并辅以经典信息实现确定性密钥的分发,方案中任何窃听行为都会被及时发现。同基于两对Bell态纠缠交换的QDKD方案相比,协议利用三对Bell态并使用两种方法实现确定性密钥信息的分发。分析结果表明,方案仅用到两粒子纠缠态,没有涉及任何幺正操作,操作性强,密钥分发效率高。     

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.     

Model parameter estimation and residual life prediction for a partially observable failing system

We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015     

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     

一种基于零控脱靶量的滑模末制导律设计

基于零控脱靶量的思想,提出一种能够有效针对大气层再入目标的滑模末制导律.首先,建立纵向平面内的弹目相对运动方程;然后利用扩张状态观测器对目标机动加速度信息进行估计,并对零控脱靶量算法进行分析,提出了制导律的设计思路;接着利用滑模变结构控制理论进行制导律的推导;最后进行仿真分析,仿真结果证明,所设计的制导律能够很好地对目标弹进行拦截,并且指令的跟踪效果也很好,从而验证了算法的有效性.