海洋环境中基于WVD的LFM信号检测方法

海洋环境中弱信号的谱与海杂波的谱相混叠 ,目标和背景的位置差异很小 ,经典的频域或空域处理对海杂波中弱信号的检测难以奏效。鉴于Wigner-Ville分布 (WVD)对线性调频信号 (LFM )具有时频聚集性这一特点 ,提出了一种海洋环境中基于WVD的LFM信号检测方法。利用雷达采集的真实海杂波数据 ,在不同信杂比的条件下 ,研究了该方法与经典频域法在信号检测中的差别。通过实验分析 ,与经典方法相比 ,该方法具有明显的优越性 ,且信杂比达到 -14 . 3dB时 ,其仍能很好地对信号进行检测。     

HLA联邦的桥接扩展和影响时空一致性的实例分析

随着计算机技术和仿真应用的发展 ,越来越需要组建大规模分布仿真系统 ,HLA框架的定义和应用为此提供了很好的契机。使用桥接技术把不同的联邦连接起来是构建大规模联邦的有效方法 ,其中桥接邦元更适合于不同RTI的异地连接。桥接HLA联邦会带来影响系统时空一致性和性能的新问题 ,时间推进和所有权转移是两个有代表性的例子 ,需要重点解决     

大气层内复合控制拦截弹切换时间的探讨

大气层内拦截弹采用空气动力与燃气动力的复合控制方式是当今世界防空导弹的发展方向之一。复合控制技术的分析研究是当前急需解决的重要问题。在考虑目标机动加速度大小、目标机动时刻以及目标角闪烁的条件下 ,确定了拦截弹的控制方式由空气动力切换到复合控制时的切换时间。     

DIS系统中实时通讯技术的研究

针对DIS系统实时通讯的要求 ,以UDP通讯协议为基础 ,结合采用多线程技术 ,给出了一种实时通讯方法 .经模拟试验表明该方法在WindowsNT环境下是有效的 .     

小波神经网络在装备研制费预测与控制中的应用

通过小波及小波变换的原理和方法,建立了适用于武器装备研制费用的小波神经网络预测与控制模型.结合某型装备研制费用,进行了预测与控制的数据仿真.     

镍对重力分离SHS陶瓷内衬复合管的影响

采用SHS重力分离技术制备陶瓷内衬复合管,通过改变主燃烧配系组元Ni的含量,研究分析了金属Ni对陶瓷内衬复合管制备的燃烧特性及机械性能的影响。研究发现,适量的Ni粉能促进SHS燃烧进行,提高燃烧体系的绝热燃烧温度和陶瓷层的致密度,并且有助于形成金属/陶瓷界面过渡层,这极大提高了复合管的显微硬度和抗压剪强度。当Ni粉含量为19wt％时,陶瓷层的显微硬度和抗压剪强度分别最高达1764N/mm2和36.1MPa。     

基于无线双工通信系统分组数据传输的探讨

分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网（电路交换网、分组交换网）、数字化部队单工无线电数据网互联的关键技术。     

Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model

Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008