基于PXI总线的MLS模拟器扫描角度精确测量

利用PXI总线检测技术实现MLS模拟器扫描角度的精确测量.重点对模拟器中频数字化之后的信号进行内插、滤波等处理,以提高扫描波束信号的时间分辨率和减小线性化引起的定时误差.提出了采用多基准电平的扫描角度测量方法,利用加权取平均的方法来平滑干扰噪声对定时精度的影响,并给出了加权系数的具体选取步骤.实验结果表明,内插和滤波可以减小线性化引起的扫描角度计算误差,采用多基准电平的方法可以有效克服干扰噪声对扫描角度测量的影响.     

基于加权D-S证据理论的辐射源目标识别

在目标识别中D-S证据理论应用较为广泛,该理论要求各传感器的重要程度相同,与作战使用相矛盾.就此提出了基于加权D-S证据理论的时空域目标识别方法,突出了不同传感器在目标识别中的地位和作用,使目标识别结果更接近作战实际.     

自适应旁瓣对消分析与仿真

实际中由于多种因素的存在使得对消性能下降,以最小均方准则下的旁瓣对消原理为基础,详细分析了实际中几种重要的因素对自适应旁瓣相消性能的影响,包括辅助天线中信号分量、主辅通道响应不一致、主辅天线间距的影响,最后通过仿真验证了旁瓣对消性能。结果表明,旁瓣对消系统可以有效地抑制有源干扰信号的影响。     

星空点源背景红外辐射场景生成模型

星空场景建模是空间目标识别与跟踪的关键技术之一.基于中段空间实验红外天文星表(MSX-IRAC),通过位置计算得到该星表内恒星在指定观测时刻、观测地点投影到视场所在平面的坐标,同时利用改进的光谱模板技术,生成视场内所有点源星体的红外光谱(1.2～35 μm),并对光谱积分得到指定谱段的辐射量,最后将恒星位置和辐射信息在二维图像上表现出来,从而实现了一个星空点源背景红外辐射场景生成模型,并通过实例仿真验证了该模型的正确性.     

基于GA-PSO的目标分配问题研究

防空作战中的目标分配问题属于NP完全问题,在综合考虑火力单元作战效能和防御效能的基础上,引入火力单元综合有利度,建立了一种用于大规模多火力单元对抗多轮次目标的静态目标分配模型,给出了基于GA因子的改进PSO算法,并将算法应用于目标分配模型的求解,通过VC 6.0编程和计算机仿真验证了模型的可行性和算法的有效性.     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

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     

舰载防空导弹系统的防御能力评估

反舰导弹是当今舰艇及编队面临的主要威胁。为评估反舰导弹攻防能力,以目前世界上防御能力最强的美国航母战斗群为背景,研究采用分层火力配置的航母舰队防御体系对付反舰导弹的有效性。首先分析反舰导弹飞行高度、雷达散射截面及综合效应对防御系统中雷达探测能力的影响,之后应用简化公式,对各类典型舰载对空防御武器的最大拦截距离、拦截次数和拦截效率进行量化分析,对防御反舰导弹能力做出评估。     

A stochastic model for burn‐in procedures in accelerated environment

Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006