环境水平不变的水声环境参数盲估计与实验验证

为秘密、隐蔽地获取非常时期或非合作海区的水声环境参数,提出了水声环境参数盲估计的概念,分析和研究了水声环境参数盲估计理论,并对其中的目标函数进行了详细探讨,同时利用SWelIEx-96海试的部分数据对基于水平不变的水声环境参数盲估计方法进行了实验验证.实验结果表明,基于环境水平不变的水声环境参数盲估计技术是可行和有效的.     

坦克搭乘输送平台海上射击目标决策方法

通过粗糙集方法分析影响坦克对岸滩目标射击效果的各种因素,建立坦克搭乘输送平台海上射击的知识表达系统,将射击效果作为决策属性,将已有数据或作战经验作为条件属性,依粗糙集理论方法挖掘射击决策规则,最后约简得到一些简单的射击决策规则,为单坦克射击决策提供依据。     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

EHW实现过程中VHDL程序自动生成研究

论述了在基于FPGA的EHW内进化实验中特定格式的染色体编码表示和相应的VHDL程序自动生成的基本概念,制定了具体规则和方法,奠定了硬件进化及评估过程实现全自动运行的基础,并对自动生成的结果予以实际验证。该方法能在使用不同的FPGA芯片作为演化载体时,避免对不同的数据流进行格式分析,以便在通用的EDA环境中,直接实现以二进制数串表示的染色体自动处理和相关配置文件的形成。按此方式可在很大程度上摆脱对某些固定类型FPGA芯片的依赖,有助于建立方便、实用的EHW环境。     

基于遗传算法反舰导弹航路规划研究

航路规划作为提高反舰导弹作战能力的重要措施,目前正逐渐被反舰导弹所应用。结合反舰导弹自控飞行特点,系统分析航路规划过程中各个航路点的约束条件,并运用遗传算法进行数学建模和计算机编程,顺利实施了导弹航路的最优求解和航路的自动标绘,为指挥员实施导弹攻击提供辅助决策。     

基于二阶锥规划的MIMO雷达任意形状旁瓣波束设计

针对MIMO雷达非均匀布阵引起的高旁瓣问题,提出一种基于二阶锥规划的任意形状旁瓣设计算法.算法通过在旁瓣区域附加多个二次不等式约束,从而有效抑制干扰、保持期望方向天线增益的同时,获得了期望的、可以任意控制的旁瓣波束响应.通过将优化模型转化为凸二阶锥规划问题,利用内点法可以得到有效求解.仿真试验表明:算法能够获得任意形状期望旁瓣波束设计的同时,有效提高了波束形成器的输出信干燥比.最后计算机仿真结果证实了算法的有效性和可行性.     

并行程序中同步瓶颈的检测和优化方法

针对并发程序中锁的不当使用可能导致性能瓶颈的问题,提出检测和优化并发程序中同步瓶颈的方法IdeSync。IdeSync使用静态分析方法获取同步方法和同步块,构建静态同步依赖图,采用基于执行路径的动态分析技术进行同步依赖关系分析,构建同步依赖图。为了暴露性能瓶颈,在同步依赖图上通过增加程序工作负载的方式,监测临界区的性能变化,并针对检测到的同步瓶颈给出优化建议。在实验中通过HSQLDB、SPECjbb2005和RxJava等12个大型实际应用程序对IdeSync的有效性进行验证,共检测到72个同步瓶颈,根据优化建议进行优化后程序性能均有所提升。实验表明,IdeSync能够有效地检测和优化同步瓶颈。     

冰河事故救援处置对策研究

针对目前冰河事故救援存在的问题,通过对冰河事故救援的危险性及难点作简要介绍,提出了针对性的处置程序和措施,并根据实际处置过程中出现的问题总结出注意事项。通过对冰河事故采取针对性的处置措施,可以提高冰河救援的成功率和安全性,为消防部队的实际救援工作提供参考。     

以强军目标为统领 深化武警院校学科建设

针对学科建设在院校发展、人才培养中的重要作用,结合武警院校学科建设实际,探讨了如何以强军目标为牵引,把握武警院校学科建设着力点应关注的问题。强军目标指向清晰,决定人才培养目的,必须突出学科发展重点;强军目标内容完整,提出人才培养要求,必须优化学科体系架构;强军目标任务繁重,需要人才培养支撑,必须加大学科建设力度。     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014