一种基于神经网络的磁性目标定位方法

磁性目标定位问题可归结为一类非线性规划问题的求解 .该问题的最大特点就是其目标函数的计算过程极为繁琐 .而目标函数计算的快慢对磁定位的实时性有很大影响 .在详细研究了目标函数之后 ,给出了目标函数的一种神经网络结构实现 .由于该网络结构易于并行计算和VLSI实现 ,从而可使磁定位的实时性得到改善 .     

基于时序打击的空地弹药消耗预测模型

空地弹药是打击地面目标的重要武器,科学预测其作战弹药消耗量十分重要.针对预测方法存在的目标函数构建不合理、约束条件设置不全面、时间要素缺乏等问题,提出了基于时序打击的空地弹药消耗预测模型.在火力分配方法的基础上,将作战过程分为多个阶段,综合考虑各种因素影响,以目标集合阶段指标完成度、出动架次数、飞机损失数和弹药消耗量的最小值作为目标函数,设置弹药储备、可用架次、飞机最大损失等约束条件,计算最优飞机-弹药-目标分配方案.定义的多要素目标函数有效解决了目标价值难以确定和目标函数组成单一的问题,提出的目标修复、架次损失、目标毁伤效果评估对弹药消耗影响的计算方法,使得预测模型更贴近作战实际.仿真算例结果表明:该方法合理有效、可操作性强,符合空地弹药打击特点,可为作战计划、弹药保障计划的制定提供有益借鉴.     

空中目标敌我识别空域关联函数算法

空中目标敌我识别需要根据多信源、多因子综合判断目标属性.空域关联函数的计算是其中的一个关键问题,其实质是用数学方法判断平面内给定的一个点是否位于给定的单连通区域内部.解决此问题常用的方法有几何法、网格法和射线法等.针对此问题,基于复变函数理论,提出了环路积分算法,并推导出了针对任意多边形的环路积分算法的计算公式.     

新型多目标遗传算法及其在导弹射击效能优化中的应用

多目标规划是一类重要的优化模型,有着广泛的实际应用,但其求解至今仍是运筹学的一个难点.针对一般约束多目标优化问题,在设计了新的适应度函数和选择算子的基础上,提出一种新型多目标遗传算法.将其应用于导弹对集群目标射击效能优化问题,验证了算法的有效性.     

基于扩展卡尔曼滤波的机动目标航迹跟踪

针对高速飞行目标航迹跟踪问题,进行了扩展卡尔曼滤波的曲线拟和仿真试验研究.首先建立目标跟踪的数学模型,确定了系统对应的参数及状态方程,进而将线性卡尔曼滤波器进行扩展,将函数形式的滤波模型在函数自变量估计值附近进行泰勒级数展开,求导获得相应雅克比矩阵,在获得观测及系统误差的基础上,得到针对此问题的扩展卡尔曼滤波方程.仿真结果表明该方法的有效性.     

蚁群算法的多目标识别模型

现代海战中,我面临的威胁目标复杂多样,正确识别敌目标是做出准确的军事决策的前提.基于蚁群算法的并行最优化特点,引入近邻函数,将目标识别问题转化为最优化聚类问题,提出了一种新的多目标识别算法.实验结果表明此方法是有效的,具有一定的军事现实意义.     

基于混合优化算法的单分量磁性定位方法

为解决现有磁定位方法的定位精度较大程度上依赖于定位参数初始值估计精度的问题,提出了基于混合优化算法的单分量磁定位方法.首先利用舰船垂向磁场的衰减特性构造了相关系数函数,该函数与测量面上磁场的拟合误差函数共同组成了一种新的多目标规划函数,然后将微分进化算法与方向加速法相结合形成了混合优化算法,再利用该算法通过多目标规划函数确定最优的定位参数解.实验证明,对于未安装定位系统的半合作舰船,该定位方法利用磁传感器所测目标的垂向磁场,能较准确地确定舰船相对于磁传感器的位置,定位结果稳定可靠,定位精度较高.     

自航式鱼雷发射装置发射管长度优化研究

基于某型鱼雷自航发射的内弹道数学模型,选择自航管的总长度作为优化目标,讨论了约束函数的取值,确定了优化问题的数学表达.采用惩罚函数法进行寻优计算,针对约束函数具有不可微和非线性的特点,采用模式搜索算法进行了无约束优化的求解,给出了优化结果并进行了比较.     

一类多目标模糊系数线性规划问题

讨论了一类所有系数均为模糊数的多目标线性规划问题 .通过对模糊数的比较 ,将模糊多目标线性规划模型转化为清晰的多目标模型 ,并应用一种基于线性隶属函数的模糊规划算法求其协调解 .最后给出了一个数值例子 .     

基于遗传算法的武器目标分配模糊多目标规划

针对武器目标分配（WTA）问题中存在的模糊性，提出了一种基于遗传算法的WTA模糊多目标规划模型。建立了wTA多目标规划模型以及目标函数和约束条件，并在此基础上基于目标函数和约束条件的模糊性结合梯度隶属函数建立了WTA模糊多目标规划模型，给出了遗传算法进行求解的方法，通过一个实例分析表明，基于遗传算法的模糊多目标规划模型解决wTA问题具有较好的效果，验证了该模型的合理性，对于有效解决WTA问题具有指导作用。     

Another manifestation of cyber conflict: attaining military objectives through cyber avenues of approach

Cyberspace is an avenue of approach through which a military force can attain objectives of value. Through these cyber avenues of approach, military forces can engage, vet, organize, and direct human agents to accomplish specific activities. Although the objectives of these activities could differ from traditional military objectives, they still have military relevance. This particular manifestation of cyber conflict is neither a new domain of war nor something outside of warfare. Rather, it can be viewed as an emerging avenue of approach in the larger context of military operations, auguring benefits in the integration of cyber activities with operations.     

INTEGRATING NUCLEAR WEAPONS STOCKPILE MANAGEMENT AND NUCLEAR ARMS CONTROL OBJECTIVES TO ENABLE SIGNIFICANT STOCKPILE REDUCTIONS

In his 2009 Prague speech and the 2010 Nuclear Posture Review, President Barack Obama committed the United States to take concrete steps toward nuclear disarmament while maintaining a safe, secure, and effective nuclear deterrent. There is an inherent tension between these two goals that is best addressed through improved integration of nuclear weapons objectives with nuclear arms control objectives. This article reviews historical examples of the interaction between the two sets of objectives, develops a framework for analyzing opportunities for future integration, and suggests specific ideas that could benefit the nuclear weapons enterprise as it undergoes transformation and that could make the future enterprise compatible with a variety of arms control futures.     

The multiplicative representation for multiple objectives optimization with an application for arms procurement

Multiple Objectives Optimization is much seen in combination with linear functions and even with linear programming, together with an adding of the objectives by using weights. With distance functions, normalization instead of weights is used. It is also possible that together with an additive direct influence of the objectives on the utility function a mutual utility of the objectives exists under the form of a multiplicative representation. A critical comment is brought on some representations of this kind. A full‐multiplicative form may offer other opportunities, which will be discussed at length in an effort to exclude weights and normalization. This theoretical approach is followed by an application for arms procurement. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 327–340, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10014     

装备维修保障的多目标优化模型研究

通过对装备维修保障问题进行分析,针对目前研究的目标单一,就修复后的加权作战时间和装备尽可能短的延误双重目标加以研究,建立了维修保障的多目标优化模型,并给出了模型的求解算法,从而弥补了这些不足,使维修保障更加合理。最后,算例表明模型的求解方法简单,计算时间较短,是一种便于实现的好算法。     

Multi-objective design optimization of composite submerged cylindrical pressure hull for minimum buoyancy and maximum buckling load capacity

This paper presents the design optimization of composite submersible cylindrical pressure hull subjected to 3 MPa hydrostatic pressure. The design optimization study is conducted for cross-ply layups [0s/90t/0u], [0s/90t/0u]s, [0s/90t]s and [90s/0t]s considering three uni-directional composites, i.e. Carbon/Epoxy, Glass/Epoxy, and Boron/Epoxy. The optimization study is performed by coupling a Multi-Objective Genetic Algorithm (MOGA) and Analytical Analysis. Minimizing the buoyancy factor and maximizing the buckling load factor are considered as the objectives of the optimization study. The objectives of the optimization are achieved under constraints on the Tsai-Wu, Tsai-Hill and Maximum Stress composite failure criteria and on buckling load factor. To verify the optimization approach, optimization of one particular layup configuration is also conducted in ANSYS with the same objectives and constraints.     

多目标决策的特殊坐标系求解方法

在多目标决策问题中,满意解常常要在非劣解中寻找。一般来讲,对于两个目标(二维)的解的判别并不困难,但遇到多个目标(n维),且有多个可行解时,对非劣解的判别就显得有些繁复了。因此,采用直观容易的特殊坐标系来判别"非劣解",从而给出求解多目标决策问题满意解的方法。     

关于构建模块化军事素质培养体系的思考

模块化军事素质培养体系的核心和特色是既相对独立又密切联系的6个“模块”;这6个“模块”分别在人才培养的不同阶段实施,达到阶段教育目的,并有机地整合成为一个整体,使人才达到最终的培养目标。     

The Deutch commission report: An overview

The threat posed by the proliferation of weapons of mass destruction is real and urgent. Combating this threat requires a new and comprehensive approach by the federal government. It requires sustained leadership at the top and an organizational structure that can set policies and objectives for combating proliferation; develop integrated, government‐wide plans to implement those policies and objectives, including plans for acquiring necessary technology; make appropriate decisions regarding how resources should be allocated to carry out those plans; and regularly evaluate the effectiveness of our policies, programs, and operations. There is no such comprehensive approach today.     

基于BP神经网络的防空保卫目标分类

提出用BP神经网络模型对防空保卫目标进行分类的一种新方法。该方法建立分类评价的指标集,将分类的划分等级作为训练样本集,以指标的各等级标准值作为样本的输入特征值,建立多参数的BP神经网络防空保卫目标分类评价模型,然后用实例训练神经网络,得出了较合理的结论。     

Modeling and analysis of multiobjective lot splitting for N‐product M‐machine flowshop lines

Lot splitting is a new approach for improving productivity by dividing production lots into sublots. This approach enables accelerating production flow, reducing lead‐time and increasing the utilization of organization resources. Most of the lot splitting models in the literature have addressed a single objective problem, usually the makespan or flowtime objectives. Simultaneous minimization of these two objectives has rarely been addressed in the literature despite of its high relevancy to most industrial environments. This work aims at solving a multiobjective lot splitting problem for multiple products in a flowshop environment. Tight mixed‐integer linear programming (MILP) formulations for minimizing the makespan and flowtime are presented. Then, the MinMax solution, which takes both objectives into consideration, is defined and suggested as an alternative objective. By solving the MILP model, it was found that minimizing one objective results in an average loss of about 15% in the other objective. The MinMax solution, on the other hand, results in an average loss of 4.6% from the furthest objective and 2.5% from the closest objective. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010