基于数据补偿的雷达系统误差估计

建立了多雷达情况下的系统误差观测模型,分析了系统的可观测度,得出系统可观测度和观测数据的空间分布有关的结论.在此基础上,通过数据补偿的方法,产生一个使系统可观测度较大的补偿观测集,用于误差估计.仿真结果显示,使用补偿观测集估计雷达的系统误差,能够获得更优越的估计性能.     

地炮营通信系统载波监听／碰撞检测仿真分析

给出某地炮营通信系统信息传输的CSMA／CD(Carrier Sense Multiple Acces／Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案     

依据噪声能量变化提取目标运动信息的方法

在对被动噪声声纳接收的噪声能量随时间的变化规律分析的基础上,从理论上分析噪声能量的变化与目标运动参数关系,给出了其中所含目标运动信息的提取方法.     

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

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

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种基于移动基站的无线传感器网络数据收集方法

针对传统的无线传感器网络数据收集协议大多受制于发生在基站周围的热点问题,提出了一种使用移动基站的数据收集方法.将数据收集问题转化为支配集构造和旅行商问题,并提出了一种分布式的支配集构建算法,结合旅行商问题的近似算法生成基站的移动路线.仿真结果表明,所提出的方法减少了通信消耗,且能使负载均衡地分布.     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

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     

Optimal sample size allocation for tests with multiple levels of stress with extreme value regression

In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007