Facility location models for immobile servers with stochastic demand

This paper presents several models for the location of facilities subject to congestion. Motivated by applications to locating servers in communication networks and automatic teller machines in bank systems, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. We consider this problem from three different perspectives, that of (i) the service provider (wishing to limit costs of setup and operating servers), (ii) the customers (wishing to limit costs of accessing and waiting for service), and (iii) both the service provider and the customers combined. In all cases, a minimum level of service quality is ensured by imposing an upper bound on the server utilization rate at a service facility. The latter two perspectives also incorporate queueing delay costs as part of the objective. Some cases are amenable to an optimal solution. For those cases that are more challenging, we either propose heuristic procedures to find good solutions or establish equivalence to other well‐studied facility location problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于空频域信息的单站无源定位可观测分析

对利用空频域信息的单站无源定位方法进行可观测性分析。针对非线性系统的可观测性理论需要计算复杂的雅克比矩阵的问题,提出把观测方程先经过伪线性化处理,然后运用线性系统的可观测性分析的理论,对匀速、匀加速直线运动进行了具体分析,得出只要目标不朝观测站作径向运动都是可以对其进行观测的。实验结果也验证了分析结论的正确性。     

基于递归扩展直方图的辐射源时差分选方法

多站电子侦察系统中,脉冲信号到达两个接收站的时间差信息可以用于信号分选。针对高重频辐射源引起的虚假聚类和超低重频辐射源累积脉冲数少给时差分选带来的困难,提出一种基于递归扩展直方图的时差分选方法。该方法将时差数据转换成扩展直方图的结构,采用递归的方式序贯地对每个辐射源进行检测和分选,通过扩展运算,同步消除虚假聚类,逐步降低直方图噪声水平,提高了分选正确率。仿真结果表明了该方法的有效性。     

多核处理器验证中存储数据错误快速定位机制

提出并实现的一种数据错误快速定位机制(Fast Fault Location Mechanism,FFLM)面向多核处理器存储系统的功能验证,FFLM基于硬件仿真器构建多端口存储器黄金模型,通过在仿真过程中实时监控存储系统与处理器核之间的访存报文,在线比较被测系统访问真实存储器的数据与黄金模型中的对应数据是否一致,在错误数据从存储系统送入处理器核的时刻就能够发现数据错误。与传统方法相比,FFLM具有仿真速度快、硬件资源代价低以及定位错误时间短的优点。对自主设计的CMP-16多核处理器进行仿真时的统计数据表明:使用FFLM后定位数据错误的速度能够比未使用FFLM时平均提高6.5倍。     

基于CDMA蜂窝网的定位算法

基于TDOA的经典定位Chan算法主要针对地面移动台,针对中低空飞行器,将Chan算法推广到三维空间,并与飞行器上的惯导系统进行实时组合导航定位。主要思想是根据CDMA蜂窝网导频信号的到达时差(TDOA)两次使用加权最小二乘解算,吸收taylor算法的递推思想,得到飞行器位置的两组解。利用惯导系统提供的位置信息进行解模糊,从而得到飞行器的实时位置信息。仿真结果表明,在相同条件下,与其他经典算法相比,此算法定位精度高,定位运算速度快,其均方误差逼近克拉美罗界(CRLB),对中低空飞行器定位具有一定的参考价值。     

基于网络雷达的目标定位跟踪

网络雷达实现了有源与无源探测一体化及雷达情报与电子对抗情报一体化,具有良好的目标定位跟踪性能。首先分析了网络雷达工作在有源无源一体模式的目标定位原理及定位的CRLB,并通过仿真说明了网络雷达的定位优势。然后根据网络雷达的特点,提出了一种基于目标状态和属性联合最近邻的数据关联算法,该算法合理地利用了目标的电子属性信息(如载频、重频、脉宽和脉内特征等)。对小角度交叉运动目标进行了跟踪仿真试验,该算法得到了很好的关联跟踪效果。     

多径环境下平面时差定位精度分析

从多径环境下时差测量误差的概率分布模型入手,研究了该环境下基于测量误差概率分布的时差定位精度模型,给出了时差定位误差椭圆的位置与大小的计算方法.通过计算机仿真,分别得出了等腰三角形布站和直角三角形布站情况下的定位误差椭圆分布,结果表明:该模型能较为直观准确地反映出多径效应对时差定位精度的影响.     

Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A branch and bound algorithm for sector allocation of a naval task group

A naval task group (TG) is a collection of naval combatants and auxiliaries that are grouped together for the accomplishment of one or more missions. Ships forming a TG are located in predefined sectors. We define determination of ship sector locations to provide a robust air defense formation as the sector allocation problem (SAP). A robust formation is one that is very effective against a variety of attack scenarios but not necessarily the most effective against any scenario. We propose a 0‐1 integer linear programming formulation for SAP. The model takes the size and the direction of threat into account as well as the defensive weapons of the naval TG. We develop tight lower and upper bounds by incorporating some valid inequalities and use a branch and bound algorithm to exactly solve SAP. We report computational results that demonstrate the effectiveness of the proposed solution approach. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种基于球坐标系的四站三维时差定位算法

提出了一种在球坐标系下的无源时差定位算法,该算法解决了参变量法中难于解决的模糊和无解问题,计算量小,定位结果可信。当布站接近平面时,本算法可独立进行定位,当站址高度差较大时本算法可以与参变量法相配合解决模糊和无解问题,适合于工程应用。