一种基于SVM的炮位校射雷达弹道外推新方法

SVM是一种理论依据充分的机器学习新算法,主要用于对有限个样本的分类识别和回归建模.将一条弹道视为一个训练样本,利用SVM回归方法在不同弹道之间归纳弹道落点的规律,从而可以对未知弹道的落点进行预测.将SVM引入弹道外推是重要创新,构建具有代表性的训练样本,以及统一样本空间维数等是技术创新.仿真实验表明,SVM可以提高弹道外推精度,同时缩短外推时间.     

基于UML的兵力机动辅助决策软件设计

首先简要介绍了UML的建模体系,然后在使用UML对兵力机动辅助决策软件进行功能需求分析的基础上,进行了问题领域分析,建立了软件的静态和动态模型,并将该软件系统的各种要素、事件和活动,分别在时间和空间上进行了描述,方便开发人员之间的交流,为系统的分析、设计、维护及扩展提供了有利的支持,为兵力机动辅助决策软件系统的研制奠定了基础.     

潜艇兵力作战方案选优软件的设计与实现

对联合封锁中潜艇兵力作战方案选优问题进行了研究,针对在只有一个选优指标时,人们通过比较分析法能够容易地准确判别方案优劣的特点,综合采用了改进的层次分析法、模糊综合评判等方法设计并实现了方案的选优。通过验证,该软件在应用于作战方案多目标决策等复杂系统时是适用的和可靠的,并且此软件较为简便,可操作性强。     

油料装备中发动机与油泵的匹配设计探讨

油料装备中发动机与油泵的合理匹配是设计中需解决的一个重要问题。介绍 了油料装备发动机与油泵的匹配原则,分析了油泵和发动机工作时所需的动力,发现发动机 在驱动油泵时具有一定的功率储备,尤其是共用发动机具有较大的功率储备,提出利用发动 机万有特性曲线进行匹配设计。     

基于改进整型遗传算法的稀疏矩形平面阵列优化

为了降低固定稀疏率、固定孔径的稀疏矩形阵列的峰值旁瓣电平,提出一种改进整型遗传算法。该算法在整型遗传算法的基础上,提出了等间隔采样的交叉策略、多点变异策略以及优良基因重组的策略。采取等间隔采样的基因交叉方式,可以有效发挥整型编码的优势,从而提高算法的运行效率;为了提高种群的多样性,防止算法陷入局部最优,采用了多点变异策略;采用优良基因重组技术,加快了算法的收敛速度。仿真结果表明,相比传统的二进制和实数编码,整型编码更为直接高效;与用于稀疏矩形阵列优化的相关算法相比,本文所提算法获得了更优的旁瓣电平,证实了算法的有效性和优越性。     

2014nccet:基于SI仿真的高密度存储服务器高速链路设计

针对高密度存储服务器中高速链路结构复杂、信号速率高、链路长度长等特点,在高速链路PCI-E3.0和SAS3.0设计过程中引入全面的SI仿真。通过对高速PCB设计中拓扑结构、材料类型、PCB结构等关键项目进行仿真设计,获得成本最低、性能达标的最优方案;通过全链路有源仿真,预估系统性能,降低系统投产风险;通过系统实际信号测试,验证系统性能完全满足相应规范要求,仿真结果有效可靠。     

地基雷达探测临近空间高超声速目标优化部署方法

为提高地基雷达对临近空间高超声速目标的探测能力,探讨了一种实用高效的地基雷达优化部署方法,对地基雷达探测临近空间高超声速目标的难点和数学模型进行了分析,提出了地基雷达探测临近空间高超声速目标的部署原则和量化指标,建立了地基雷达优化部署模型,并进行了信息素引导性控制的蚁群算法设计。仿真结果表明,该方法可实现多种程式地基雷达的优化部署,提高了地基雷达优化部署效率和可操作性,为地基雷达探测临近空间高超声速目标的优化部署提供了一种新思路。     

Pricing and inventory management during new product introduction when shortage creates hype

In this study, we analyze the joint pricing and inventory management during new product introduction when product shortage creates additional demand due to hype. We develop a two‐period model in which a firm launches its product at the beginning of the first period, before it observes sales in the two periods. The product is successful with an exogenous probability, or unsuccessful with the complementary probability. The hype in the second period is observed only when the product is successful. The firm learns the actual status of the product only after observing the first‐period demand. The firm must decide the stocking level and price of the product jointly at the beginning of each of the two periods. In this article, we derive some structural properties of the optimal prices and inventory levels, and show that (i) firms do not always exploit hype, (ii) firms do not always increase the price of a successful product in the second period, (iii) firms may price out an unsuccessful product in the first period if the success probability is above a threshold, and (iv) such a threshold probability is decreasing in the first‐period market potential of the successful product. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 304–320, 2015     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015     

GPU上高光谱快速ICA降维并行算法

高光谱影像降维快速独立成分分析过程包含大规模矩阵运算和大量迭代计算。通过分析算法热点,设计协方差矩阵计算、白化处理、ICA迭代和IC变换等关键热点的图像处理单元映射方案,提出并实现一种G-Fast ICA并行算法,并基于GPU架构研究算法优化策略。实验结果显示:在处理高光谱影像降维时,CPU/GPU异构系统能获得比CPU更高效的性能,G-Fast ICA算法比串行最高可获得72倍加速比,比16核CPU并行处理快4~6.5倍。