基于改进平方根UKF双向滤波的单站无源定位算法

针对单站无源定位可观测性弱、观测噪声大而导致的定位精度低、稳定性差和收敛速度慢等问题,在结合平方根无迹卡尔曼滤波(Square-Root Unscented Kalman Filter,SRUKF)以及后向平滑思想的基础上,提出了一种改进SRUKF的双向滤波算法。该算法采用Q-R分解的形式,使用误差协方差的平方根代替协方差参与递推运算,提高了算法的稳定性与运算效率。同时,该算法对状态向量进行扩维,将过程噪声与观测噪声通过非线性系统传播,降低了噪声对滤波精度的影响,并利用当前时刻滤波结果通过Rauch-Tung-Striebel(RTS)后向平滑得到再次前向滤波更高精度的起始值,提高了算法的定位精度与收敛速度。仿真结果表明,新算法在保证实时性的基础上改善了单站无源定位的性能。     

无源时差定位系统的模糊无解问题

本文对平面三站无源时差定位系统的定位过程中可能出现的无解和模糊现象进行了探讨,找出了无解分布与布站以及观测噪声方差大小之间的规律,得出了模糊分布与布站之间的关系,并提供了一些解决方法。     

2014nccet：一种新的用于减少远程Cache访问延迟的最后一次写访问预测方法*

为减少远程Cache访问延迟,提高共享存储系统的性能,提出了一种新的基于程序内在写突发特性的最后一次写访问预测方法,并对一个具体的目录协议进行了改造,以支持该预测方法。通过预测Cache块的最后一次写访问并提前对其进行降级,处理器能直接从主存中读取数据,从而减少了远程Cache访问所需的一个网络跳步数。与当前基于指令的预测方法相比,该方法能极大减少存储开销。基准测试程序的评测结果表明,该方法能获得83.1%的预测准确率,并且能提高8.57%的程序执行性能,同时与基于指令的预测方法相比,该方法能分别减少历史踪迹表69%的存储开销和签名表36%的存储开销。     

推进工程大学转型发展要把握三个关键点

实现武警工程大学的转型发展,一是要有准确的目标定位,充分认识大学地位作用的独特性、人才培养的层次性、科研与教学的并重性;二是要确立先进的办学思想,突出武警特色,坚持内涵发展,追求忠诚卓越;三是要有科学的建设举措,以深化改革推动转型,以搞好“合训”促进转型,以狠抓管理保证转型。     

基于安全库存的战时应急弹药储备库选址建模研究

为了更好适应战时弹药需求的不确定性,必须做好对战时应急保障系统的管理工作,应急弹药储备库的选址问题就是应急保障系统的关键环节．首先依据战时弹药需求特点,从库存策略的角度出发,引入安全库存概念;其次,建立了以建设成本和运输总距离为目标函数的战时应急弹药储备库选址模型;最后,运用Matlab对模型进行了仿真,验证了该模型的有效性．     

基于定位原理的雷达与ESM航迹关联算法

雷达与ESM传感器的数据关联是典型的异类传感器数据关联。将交叉定位原理引入到航迹关联算法研究中,将定位原理与统计双门限航迹关联思想结合起来,提高了正确关联率。最后,对该算法进行仿真实验,证明了该算法的正确性和有效性。     

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     

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     

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

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

测量TOA和DOA的单站无源定位跟踪可观测条件

单站无源定位跟踪技术中,可观测性分析是一个关键问题,但是由于TOA测量方程的非线性程度太高,直接通过计算Jacobin矩阵得到的可观测矩阵形式非常复杂,很难得出明确的分析结果。采用新的思路推导了一种TOA测量方程的线性化方程,分析了测量TOA和DOA单站无源定位的可观测条件。最后给出了计算机仿真结果。