一种连续修正速度方向的导引方法

考虑制导炮弹由身管武器发射,其飞行控制能力和导引信息量有限,基于预测落点位置偏差量来修正速度方向并在控制时间内连续分配导引指令的思想,提出了一种新的三维末制导方法。根据非线性弹道方程组的级数解预测弹丸落点位置,得到落点与目标的偏差,并提出了两种通过此偏差解算当前速度方向修正量的方法。取剩余飞行时间为修正时间,通过将速度方向修正量分配到整个剩余导引段建立了加速度修正公式,以减小导引指令饱和的可能性。通过连续地预测落点和分配加速度指令来实时地导引飞行。仿真结果表明：该导引方法简单可行,精度高,对控制能力要求较低,且具备较好的制导效果和毁伤效果,为该体制制导炮弹的应用提供参考依据。     

连续发射脉冲功率电源用水冷模拟负载研究

针对脉冲功率电源连续循环放电吸能需求,本文提出了一种1.9MA级循环脉冲功率水冷模拟负载方案。首先,考虑水冷负载与实际电磁发射负载的相似性要求,提出了4×8钢管阵列组成的电阻网络,可方便的实现电源不同组合方式的放电考核;其次,针对1.9MA级电流产生的脉冲电磁力可能引起水冷模拟负载损坏的问题,建立了水冷模拟负载三维有限元分析模型,进行了电磁力计算和结构分析,保证了水冷模拟负载稳定性;最后,利用热网络法对模拟负载在循环脉冲模式下的强迫风冷、自然冷却和去离子水冷却等方式进行了温升分析,结果表明：模拟负载采用钢管内通去离子水冷却效果最好,循环放电时温度可以恢复到初始状态,最高温度62.5℃,满足连续放电实验的需求。利用提出的方法设计了一台水冷模拟负载样机并进行了连续2次1.9MA放电研究,试验结果与理论分析吻合较好,负载结构运行稳定,验证了本文理论分析的正确性。     

DIP引脚应变分析

为了研究双列直插式元件在振动冲击环境下的可靠性,首先通过建立其物理模型,利用莫尔积分方法对引脚的变形进行分析,可以得到引脚任意位置的变形量;而后建立元件的实体模型,利用有限元方法对其应力应变进行仿真分析,结果表明在外载荷作用下,引脚是元件的薄弱环节,尤其在引脚与其他部位连接位置处易出现应力集中使其应变量较大,导致可靠性降低;最后进行振动冲击环境下的应变测量试验,在30 g的冲击载荷下,引脚的最大变形量可达66.47×10-6,在50 g的冲击载荷下,引脚的最大变形量可达173.95×10-6,在扫频过程中,当激振频率为146.48 Hz时,引脚的变形量最大。     

基于RCS序列的助推段弹道导弹识别

在弹道导弹的助推段,通过低分辨率雷达得到RCS序列作为识别的重要信息。由于运动特性和电磁散射特性的差异,弹道导弹在助推段的RCS序列与其他目标相比具有可识别性,但需要对其RCS序列进行处理。基于目标识别技术,详细阐述能从RCS序列中提取出的特征参数,并通过直方图、N点截图等方法给出了直观的反映。最后,将弹道导弹助推段特征与飞机、燃料舱等典型目标进行对比,得到可以作为识别参量的特征参数,并通过类内类间距离验证了有效性。     

一种高速实时数据采集处理系统设计

针对目前高速数据采集中的实时性和同步性问题,提出了一种高速实时数据采集处理设计方案。根据上述方案进行了系统的硬件和软件设计,该系统以FPGA器件作为下位机控制核心,设计了时钟同步、数据采集、数据处理、数据缓存、数据通讯等功能模块;整个系统采用ARM微处理器作为上位机控制核心,基于嵌入式Linux 2.6内核进行软件编程,负责向FPGA发送设置参数和控制指令,同时对数据前端采样和处理数据进行存储、显示、统计等。经测试验证,该方案具有高速率、高精度、同步测量、实时处理、体积小、功耗低等优点。     

一类带时滞的非线性兰彻斯特战斗模型的分析

基于非线性兰彻斯特方程的一般形式和现代战争的特点,考虑到时间因素在现代战争中的巨大作用,建立并讨论了一类带时滞的非线性兰彻斯特战斗模型。通过定性分析,得到了模型的平衡点及其稳定性,证明了原模型解的存在唯一性,并给出了解的存在区域。战例分析结果表明该模型能用来描述现代战争。因此,该模型对研究现代战争的战斗进程、武器发展规划、现代军事练兵等都具有一定的参考价值。     

某飞行仿真系统虚拟教员软件研究

针对训练基地飞行模拟改装训练的特点和需求,提出了一种智能评分和虚拟教员实时提示方法。根据训练大纲建立模拟飞行课目专家库,建立分阶段优化评估模型,对不同阶段的关键评价指标进行综合评分,同时依据专家库和模拟飞行参数实时对飞行学员的操作提出虚拟建议,以文字和声音的方式发送给飞行员,最后给出评分结果。虚拟教员能对模拟训练进行实时干预、指导,方便学员进行自主训练,受到训练基地飞行员尤其是新训改装飞行员的广泛欢迎。     

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     

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