一种多方位一距离目标定位的最小二乘伴随估计器

对纯方位最小二乘估计器,在已知某时刻一个观测距离的情况下,导出了一种伴随型的目标速度估计器．该算法嵌入原最小二乘估计器之中,计算简单且便于工程应用．     

影响《轻武器射击》教学效果的几个问题及对策

从素质教育的角度出发,结合几年来从事轻武器射击教学的实践,针对轻武器教学中存在的问题,从心理训练、教学方法、关键环节等3个方面,论述了问题产生的原因及基本对策,对于改进实践课教学,具有积极的现实意义。     

一类拟线性周期抛物边值问题

研究了一类带有小扩散系数的拟线性周期抛物混合边值问题。给出当扩散系数趋于零时其非平凡解的渐近性。     

双谱特征在水下目标自动识别中的应用

非高斯信号处理是信号处理的一个新领域。以舰船辐射噪声为主的噪声具有很强的非高斯性和非线性性。由此可利用信号双谱,提取舰船辐射噪声信号的非高斯成份。实验结果表明,高阶谱在声纳目标识别方面具有很大的发展潜力     

导弹电子设备电源线传导敏感度测试研究

采用ＣＳ０１测试法对导弹武器系统的电子设备进行电源线传导敏感度测试,由于测试指标和测试方法的限定要求,将不仅影响受试电子设备的正常工作,而且还会对ＣＳ０１设备本身产生不利影响。在分析产生上述影响原因的同时,有针对性地提出了有效的解决措施,使由于限定要求带来的不利影响降低到最低限度,以使导弹电子设备电源线传导敏感度测试能按国军标规定要求正常进行。     

被动导引头对噪声调频源镜像目标抑制技术

研究了相位干涉仪体制被动导引头对噪声调频干扰源地面镜像目标抑制技术,分析了地面镜像目标对相位干涉仪测角的影响,给出了一种相位干涉仪体制被动导引头抑制噪声调频干扰源地面镜像目标影响的方法。     

一种RetinaNet与SE融合的航空取证目标检测算法

针对在开展航空侦察取证时缺乏自动化、智能化取证手段的情况,提出了一种基于Reti-naNet与SE融合的航空取证目标检测算法,解决目标尺度变化大、数据集中类别不均衡的问题,并通过SE (squeeze-excitations)模块引入注意力机制进一步改进性能.该改进算法中的特征金字塔网络FPN可有效应对目标尺寸变化较大...     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007