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

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

舰空导弹设计方案评价

舰空导弹设计方案评价是一项复杂的系统工程。因其涉及到的因素众多,有些因素易于量化,有些因素难以量化,往往给决策者带来诸多困难。在建立舰空导弹设计方案评价指标体系的基础上,采用熵权法和理想点法相结合的方法对舰空导弹设计方案评价问题进行研究,以期降低决策的主观随意性,使决策更加科学合理。     

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

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

线导加尾流自导鱼雷保持距离导引法

依据线导加尾流自导鱼雷捕获和跟踪目标尾流的特殊要求,分析了现有导引方法的不足。利用鱼雷位置点与目标方位线之间的几何关系,提出了"保持距离导引法"的概念、建立了线导加尾流自导鱼雷的导引模型,从根本上消除了通过估计目标距离而确定目标方位修正量的困难,并通过仿真计算分析了这种方法的特点及作战应用的可行性。     

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

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

分段函数在分界点求导的一种简单的方法

介绍了用多项式根的性质与导数极限定理求分段函数在分界点的导数的简单方法。从而拓广了用导数定义求分界点导数的传统方法     

机载激光雷达数据的三维深度学习树种分类

针对传统基于激光雷达(Light Detection And Ranging,LiDAR)数据的树种分类方法难以直接且全面地利用点云的三维结构信息的问题,提出一种基于三维深度学习的机载LiDAR数据的树种分类方法.该方法直接从三维数据中抽象出高维特征,而无须将点云转化为体素或二维图像.以塞罕坝国家森林公园内白桦和落叶松...     

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     

几类特殊多叶函数的极值点和支撑点

设S(p,α)、C(p,α)及K(p,α)分别表示α阶的p 叶星像、凸像和近于凸函数族。本文对这些函数族的支撑点和S(p,α)的从属函数族的极值点和支撑点进行了研究,推广了Grassmann 和Perera 等人的结果。