基于循环频域滤波及Schmidt正交对消的单通道信号分离算法

单通道盲信号分离是信号处理领域中的研究热点和难点.分析了循环频域滤波用于单通道时频重叠信号分离的可行性,提出了基于循环平稳频移滤波器及Schmidt正交对消的信号分离方法.利用频移滤波器提取一个源信号,通过Schmidt正交化法从观测信号中消去已提取的源信号获得另一个源信号.仿真表明,本文算法可有效分离时频重叠的雷达通信信号,相比时域维纳滤波,分离性能提高了10dB以上.     

F—K理论在堆积固体自燃火灾调查中的应用

堆积固体自燃火灾是常见多发火灾，由于其规模庞大、着火延迟期长等特点，难以进行全尺寸的模拟实验，为火灾预防和调查工作带来了一定的难度。基于F—K（Frank—Kamenetskii）理论，将小规模实验结果外推，从而预测或判断一定尺寸的堆积固体在一定的环境温度下自燃起火的危险性。     

雷达干扰资源一对多分配方法

在对雷达干扰资源分配的一般优化模型和求解算法进行分析的基础上,从提高资源利用效率的角度出发,提出了目标雷达分群思想,并建立了一种新的基于一对多策略的雷达干扰资源分配模型,通过对目标雷达群的一对一分配实现对单部雷达的一对多分配.最后,对该模型中一些关键性问题进行了探讨,如任务整合、新任务参数确定、任务优先级排序、干扰机位置部署以及单目标雷达群干扰效益评估等.     

基于干涉仪测向的电子侦察卫星单星定位精度分析

针对信息化战场面临的复杂电磁环境,研究基于二维干涉仪测向方法的电子侦察卫星单星定位体制。分析了电子侦察卫星单星定位原理及定位算法,提出了电子侦察卫星单星测向定位精度GDOP算法,通过仿真定量计算卫星测角误差、卫星姿态误差和卫星位置误差对卫星定位精度的影响程度。结果表明电子侦察卫星测角精度、姿态控制精度和位置测量精度越高,单星定位精度越高。     

H2O2/HTPB固液混合发动机点火试验研究

利用H2O2催化分解原理,设计了烃类燃料在催化分解的90%H2O2中能燃烧的点火器,然后采用该点火器进行H2O2/HTPB固液混合发动机点火试验研究.试验结果表明,该点火器能够成功启动H2O2/HTPB固液混合发动机,且当混合比偏离最佳混合比后,发动机的燃烧效率降低.     

稳像式火控系统实车训练装置的研制

该训练装置可以在安装稳像式火控系统的坦克上完成射击基础练习的训练与考核.它以单片机为核心,在射击操作与实车相同的条件下,具有自动检靶,自动记录发射数、命中数,自动变换目标,自动报警,自动评定和显示成绩等功能.射手可独自在坦克内操作,自行开始练习,自我检查操作结果.     

基于敏感性分析和准稳态假设简化详细反应机理

发展了一套基于敏感性分析和准稳态假设来简化复杂化学动力学机理系统的方法。采用等压均相反应器燃烧模型和详细化学动力学机理计算特定工况下的自燃过程。通过对详细机理计算结果的敏感性分析后删除其中的冗余组分和冗余反应,简化得到基干反应模型。再找出基干机理中反应速率较快,浓度较低的组分假定为稳态组分,使用准稳态假设方法简化得到总包反应模型。最后以甲烷燃烧的GriMech1.2详细机理为例分析得到了简化机理并计算了着火延迟时间,与详细机理所得的结果进行比较验证,得到了较好的结果。     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000