两种解相关算法的DOA估计性能研究

MUSIC算法能对独立信号的波达方向（DOA）进行有效估计,但该算法对相干信号或强相关信号进行DOA估计时,算法性能会随着相关系数的增加而急剧恶化甚至失效．针对该问题,利用前后向空间平滑技术与修正MU—SIC算法进行去相关,研究了它们去相关的基本原理及优缺点;利用MUSIC算法通过实验仿真对相关信号的波达方向估计性能进行了研究,分析了信号间相关系数对前后向空间平滑算法与修正MUSIC算法的测向性能的影响,并验证了算法去相关的有效性．     

雷电流数学模型分析

雷电流模型是自然雷电流的数学表达。通过雷电流数学模型可以得到建筑物防雷研究所关心的参量,它是建筑物雷电防护的基础。雷电流频谱分析对确定适合的雷电防护措施,消除或减弱雷电对建筑物弱电系统的破坏作用具有重要意义。选取双指数函数模型和霍德勒函数模型进行对比仿真分析和频谱分析,研究结果表明:霍德勒函数模型与BERGER等人的观测测量结果是一致的;雷电流所含频率丰富,且集中在低频部分。     

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

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

Carlitz 定理的一个注记

置换多项式一直是一个热门的研究课题,事实上,研究有限域上的置换多项式相当于研究有限域上的一一映射.所以它在编码密码、组合设计、代数曲线等许多领域有重要的应用.Carlitz曾经对一些置换多项式有一个刻画,证明了如果f(x)是一个系数在F0的多项式满足f(0)=0,f(1)=l,并且对任意a,b ∈Fq有η(f(a)-f(b))=η(a-b),这里η是Fq的乘法群Fq*的二次特征,则存在某个非负整数j使得对任意χ ∈F0,有f(x)=xpj.本文给出了这个结果的推广.     

屏蔽数据在新型截尾样本下系统的可靠性分析

当系统含有屏蔽数据时,在具有随机移走逐步增加型截尾模型下,讨论了部件寿命服从双参数指数分布的串联系统可靠性估计问题。设随机移走系统数服从二项分布,利用极大似然方法,Bayes理论及方法,推导出双参数指数部件参数、系统可靠性函数、失效率函数及移走概率的极大似然估计和Bayes估计。并利用Monte Carlo方法对两种估计结果进行了比较,表明Bayes估计较极大似然估计效果更优。     

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

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

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

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用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     

设备管理系统的排队论分析

该文应用排队论的理论分析了设备损修系统中最优设备的解法。