移动式C3I系统导航定位问题的建模和仿真

未来战争是高新技术的对抗,我们要立于不败,就必须积极主动,知己知彼,避免被动挨打。为此,发展移动式Ｃ３Ｉ系统势在必行。移动式Ｃ３Ｉ系统的一个关键问题就是系统的导航定位问题的处理。作者立足实际,为移动式Ｃ３Ｉ系统建立了系统的导航定位问题的模型。针对引起系统导航定位的各种误差原因予以分析,建立了误差模型并进行了仿真,最后给出仿真结果     

基于声检测的爆炸冲击场剖面可视化技术

阐述了声发射的检测原理,研究了冲击波作用下物体的声发射特性,并利用声发射的不可逆效应(Kaiser效应),提出了一种基于测试的冲击场层析技术.给出了实现流程图及其若干关键技术,如主副鉴别、前沿鉴别等.实验结果表明该技术有一定的实用性,为冲击波作用下物体内部的位错形成和滑移机制的研究提供了一种手段.最后对下一步要解决的问题进行了说明.     

以十六大精神为指导 努力提高人才培养质量

全面建设小康社会需要“造就数以亿计的高素质劳动者、数以千万计的专门人才和一大批拔尖创新人才”。要实现这一宏伟目标 ,就必须全面推进素质教育 ,努力提高人才培养质量 ,这是历史赋予高等教育的重任。武警学院作为公安现役部队的最高学府 ,目前的中心工作是用十六大精神统一思想 ,进一步转变教育观念 ,深化教学改革 ,大力加强师资队伍建设 ,为部队培养高素质人才     

谈新时期发扬艰苦奋斗精神

艰苦奋斗精神在全面建设小康社会的新阶段有着丰富的科学内涵。新时期发扬艰苦奋斗精神有着重要的时代意义。当前 ,发扬艰苦奋斗精神必须着力解决好理想信念、创新理念、群众观点、节俭意识、领导带头五个问题。     

大力弘扬改革创新时代精神 加快建设世界一流高等教育院校

习主席在庆祝改革开放40周年大会上的重要讲话,是新时代改革开放再出发的宣言书和动员令。学习贯彻习主席重要讲话精神,关键要全面推进学校深化改革创新,深刻认清弘扬改革创新精神对于建设世界一流高等教育院校的重大意义,牢牢扭住全面深化改革创新的主攻方向,科学处理深化改革创新的重大关系,既以顽强的战略定力坚定不移深化改革,又运用科学的工作方法积极稳妥地推进改革。     

无先验信息排除无源交叉定位虚假交点的新方法

提出了一种排除无源交叉定位虚假交点的新方法,称为四边形分组法.该方法通过将无源交叉定位产生的四边形进行分组来区分真实交点和虚假交点.这种方法只需要测向信息,不需要任何其他先验信息.该方法无需先验信息.仿真结果表明,该方法是有效的,运算速度快,对水平编队目标群定位精度高.     

基于MGEKF的单站无源定位跟踪算法

单站无源定位跟踪技术具有隐蔽性强、设备简单,系统相对独立等优点,有着广阔的应用前景.为了提高定位精度和收敛速度以满足实时化需求,在现有的基于多普勒变化率的单站无源定位算法的基础上.详细推导了基于MGEKF的定位算法以解决EKF算法的不稳定性,并通过计算机仿真比较了两种算法的性能,结果表明MGEKF定位算法提高了定位精度、收敛速度和稳定度,定位结果能够满足实际需求.     

双声纳基阵二维目标联合测向交叉定位算法精度分析

主要对双声纳基阵二维目标联合测向交叉定位算法及精度进行了分析,给出了系统具体的定位公式和误差计算公式,并针对不同基线和不同基线误差、方位误差下目标GDOP的分布情况进行了仿真分析。仿真结果表明,定位误差随基线长度的增加而减小,随基线和方位误差的增大而增大,当基线增大到一定长度时．定位误差最终趋向稳定,达到最小。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010