中远距协同空战多目标攻击决策

根据先进战斗机的技术特点和中远距协同空战发展方向,提出一种基于先敌发现、先敌发射、先敌摧毁能力的空战态势分析模型。同时,将并行遗传算法与分布估计算法相结合的并行分布遗传算法应用于上述模型,给出了求解多目标攻击决策问题的算法。最后利用具体算例进行仿真验证。结果表明空战态势分析模型能够较为准确地描述中远距多机协同空战,采用的算法具有较好的可行性和实时性,为中远距多机协同空战的多目标攻击决策提供了新的思路和方法。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

Improving series and parallel systems through mixtures of duplicated dependent components

We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

舰炮武器系统对岸射击新方法及其精度分析

在分析了传统舰炮武器系统对岸射击方法存在的问题和局限性基础上,提出了基于GPS下大地主题坐标系下Boring定位数学模型,并做了精度分析,与现有的方法相比,具有较高的定位精度。之后提出了通过解弹道方程组求解射击诸元的思想方法,与其他文献的方法相比,在迭代方法上作了改进,提高了精度,采用DSP技术,提高了解算速度,确保解的实时性。最后作了模拟仿真及精度分析,结果表明,方法可行,为舰炮对岸射击问题提供了新的思路。     

惰性气体灭火系统减压孔板设计计算方法研究

选择DN40及其三种规格孔径的IG100惰性气体灭火系统减压孔板为研究对象,采用fluent数值计算软件进行计算,得到压比-流量特性曲线及计算公式,在设计计算时可直接根据压比-流量特性曲线选择合理的减压装置,为此类设计提出了一种新的计算研究手段。     

一种面向大规模HLA仿真的并行区域匹配算法

HLA仿真中,数据分发管理实现基于值的过滤,可以有效减少盟员接收冗余数据的可能性和网络中的数据流量。大规模HLA仿真系统在仿真推进中需要大量的区域匹配计算以维护数据分发管理的正确性。现有的区域匹配算法大多需要对所有区域进行匹配计算,造成了大量计算资源的浪费;同时,主要基于串行匹配思想,难以充分发挥多核平台的并行计算优势。针对现有区域匹配算法的局限性,提出了一种面向大规模HLA仿真的并行区域匹配算法,该算法能够实现对一次仿真推进中多个改变区域的并行匹配计算,同时在匹配计算中采用基于移动相交的基本思想,利用区域范围移动前后的历史信息,将匹配限定在移动区间之内,减少了大量的无关计算。理论分析与实验结果表明该算法尤其适合基于多核计算平台构建大规模分布式仿真的应用需求。     

球谐函数法解地球扰动引力并行计算方法

随着导弹射程的增加,传统求解地球扰动引力的球谐函数法模型阶数增大,扰动引力的计算速度明显下降。为提高弹道导弹扰动引力的赋值速度,在现有条件下结合球谐函数法计算模型的特点,在并行计算平台上,应用流水线技术和任务交叉分配的方法,建立了球谐函数法的并行计算模型。通过仿真验证,该方法能有效地提高地球扰动引力的计算速度,得到较高的并行加速比和CPU利用率。     

(2015GIS)北斗静止轨道卫星信号盲区快速并行解算方法

北斗系统静止轨道卫星信号盲区解算方法复杂、串行计算耗费时间长,需在并行环境下利用更多的计算资源进行北斗盲区的快速解算。本文在分析北斗盲区解算原理与算法并行特征基础上,提出了基于动态盲区影响域的并行解算方法,并以栅格单元为并行粒度进行任务划分,实现了北斗盲区的高效并行解算。基于全国范围59景数字高程模型数据,利用8进程进行盲区并行解算,耗费时间约为5小时。实验测试结果表明：算法的并行效率随着进程数的增加有所衰减,但稳定在96%以上。基于本文方法实现的程序中间件已集成应用于高性能地理信息平台中,应用效果良好。     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

并行规约与扫描原语在ReRAM架构上的性能优化

规约与扫描是并行计算中的核心原语,其并行加速至关重要。然而,冯·诺依曼体系结构下无法避免的数据移动使其面临“存储墙”等性能与功耗瓶颈。近来,基于ReRAM等非易失存储器的存算一体架构支持的原位计算可一步实现矩阵-向量乘,已在机器学习与图计算等应用中展现了巨大的潜力。提出面向忆阻器存算一体架构的规约与扫描的并行加速方法,重点阐述基于矩阵-向量乘运算的计算流程和在忆阻器架构上的映射方法,实现软硬件协同设计,降低功耗并提高性能。相比于GPU,所提规约与扫描原语可实现高达两个数量级的加速,平均加速比也可达到两个数量级。分段规约与扫描最大可达到五个(平均四个)数量级的加速,并将功耗降低79%。