信息中心网络缓存节点位置选择算法

信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。     

一种精确打击下桥梁毁伤视景仿真系统设计实现

目前,在桥梁毁伤仿真领域采用的数值仿真方法虽具有精确性高的优点,但是仿真过程不直观、形象,整体性不强。采用视景仿真技术进行精确打击下桥梁毁伤仿真,在保证精确性要求的基础上,利用Unity3D软件以三维画面的形式进行展示,仿真过程形象、直观、明了。给出的精确打击下桥梁毁伤视景仿真系统的设计方法,能够满足真实性和实时性的要求,利用Unity3D自带的物理引擎完成了桥梁模型的物理特性建模和爆炸仿真分析,通过全过程仿真,能够分析得出相应的毁伤结论,达到了预期效果。     

基于干涉仪测向的电子侦察卫星单星定位精度分析

针对信息化战场面临的复杂电磁环境,研究基于二维干涉仪测向方法的电子侦察卫星单星定位体制。分析了电子侦察卫星单星定位原理及定位算法,提出了电子侦察卫星单星测向定位精度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     

导航精度对某型电视制导无人攻击机攻击性能影响

针对电视制导无人机的作战使用方式,分析了影响其攻击性能的因素;建立了导航精度与攻击无人机捕获目标概率之间的关系;基于捷联惯导的误差分析,对无人机中制导末段的导航精度进行了计算。构建了对无人攻击机目标捕获概率进行仿真计算的方案,建立了方案航迹,对其进行了中制导精度分析和目标捕获概率计算,结果表明导航精度和捕获概率直接相关。     

一种基于几何特征的虹膜定位算法

虹膜定位是虹膜识别中基础性环节,其精度和速度决定了虹膜识别系统的性能。为提高虹膜定位的速度,提出一种基于圆几何特征的虹膜内边缘定位算法,利用内外边缘中心的耦合特性缩小微积分方法搜索外边缘的范围。实验结果表明,与经典虹膜定位算法相比,提出的算法快速、精确、鲁棒。     

空基平台无源定位精度分析

针对三维空间内的空基平台对海面目标的无源定位问题,在考虑了多种测量误差因素的条件下,建立了定位模型,分析了各种测量误差对最终定位精度的影响.仿真实验表明,所采用的定位精度分析方法能够有效的分析空基平台的定位精度.从仿真实验结果中得到了各种测量误差对定位精度影响的一些指导性结论,为提高空基平台无源定位的测量精度提供了依据.     

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

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

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

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