警戒雷达被干扰时探测范围的实时计算方法

目前对警戒雷达抗干扰能力的研究大多以效能评估为主,具体探测范围要通过雷达抗干扰实验实际测量获得,不仅成本高、测量数据量大.而且不易实现.针对现代战争中警戒雷达所处的复杂电子干扰环境,给出了机动警戒雷达被多个远距离支援干扰机干扰时探测范围的实时仿真计算方法,对警戒雷达的威力范围或者干扰的压制范围作出定量估算,在这对于研究远距离支援干扰的时机方法和评估雷达的抗干扰性能均具有重要意义.该方法已应用于模拟训练系统中,并获得了令人满意的效果.     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

军事云环境下基于动态博弈的资源调度方法

针对军事云环境下联合指挥资源调度优化问题,综合考虑了多部队任务需求,多目标优化,多部队资源竞争等约束条件,运用动态博弈理论及方法,建立并提出了一种基于完全信息扩展博弈的资源调度模型及方法,提高了资源调度效率,兼顾了多部队利益,增加了联合作战效益。最后通过实验验证了其有效性及准确性。     

基于Pareto排序法的战时装备维修任务多目标调度方法

针对战时武器装备维修保障问题,建立了包括最大完工时间、延迟时间和维修单元负荷在内的多目标优化调度模型。为提高解的多样性和收敛性,构建了一种基于Pareto排序法和小生境技术相结合的遗传算法用于模型求解,引入Pareto排序和拥挤距离进行适应度计算,通过混沌系统随机生成权重系数,并使用小生境技术改进选择方式。通过实例验证表明,该方法能够有效地解决装备维修多目标调度问题。     

基于视频监控的人的异常行为系统设计

"视频监控"是一种可实现夜间检测的视频监控系统,普遍用于沿街商铺、仓库、郊区独户别墅以及小区等场所。传统的视频监控对摄像头的要求较高,并且需要多人值守,对人力、财力的要求较高。针对传统视频监控存在的不足,设计了一种智能检测系统,能实现对非法入侵、物品盗移等异常状况的实时检测和及时报警,还针对夜间图像的特点设计增强算法,使普通摄像头可实现夜间监控,大大降低了视频监控的应用成本并提高了监控效率。     

基于时间窗的宽带阵列多目标干扰资源调度

随着宽带数字阵列技术和有源干扰技术的不断发展和成熟,舰载有源干扰设备的未来发展方向将是宽带数字阵列有源干扰系统。针对多目标干扰问题,提出了目标干扰时间窗概念和两种时间窗的处理方法,并建立干扰资源调度模型,通过仿真计算和对比分析,得出基于模糊时间窗的资源调度模型性能优于基于硬时间窗的资源调度模型,能够对干扰资源进行合理的调度,提高宽带阵列多目标干扰能力。     

一种用于区分服务路由器的crossbar调度算法

宽带路由器一般采用crossbar交换开关。Crossbar交换开关对QoS (QualityofService)的支持十分重要。提出一种支持IETF区分服务 (DifferentiatedService)服务模型的crossbar调度算法———OSP (OutputSerialPolling) ,该算法带宽利用率高 ,支持报文优先级。与目前存在的同类算法相比 ,具有硬件实现简单的优点     

基于信息损失最小的预警卫星传感器调度模型

科学合理地调度预警卫星传感器资源是提高弹道导弹预警作战效能的重要手段.在预警卫星传感器资源(主要是凝视探测器)有限而进攻弹道导弹目标数量较多时,利用最小信息损失准则,将传感器调度问题转化为最优访问路径问题进行建模研究,满足了导弹预警资源调度的需要,仿真结果验证了模型的可靠性和可用性.