基于相位差变化率方法的单站无源定位技术

无源定位技术有着广阔的应用前景 ,文中在现有单站无源定位方法的基础上 ,介绍了相位差变化率定位法。该方法利用观测平台上两个相互正交的相位干涉仪接收目标辐射电磁波的相位差获取目标的方向信息 ,利用对应的相位差变化率获取目标的径向距离信息 ,从而实现对目标的实时高精度交叉定位。还给出了观测平台水平直线匀速飞行且无飞行姿态变化条件下的定位表达式。仿真结果表明 ,该方法是一种极具发展前途的单站无源定位方法     

移动通信网络位置群体节点的挖掘方法

对移动通信网络的位置群体节点进行了优化定位和挖掘,优化移动通信网络的覆盖度和可靠度,传统的位置群体节点挖掘算法采用信息度增益控制挖掘算法,算法不能自主感知节点信息数据的变化,无法实现数据信息的实时传递和决策。提出基于位置群体节点信息融合和滤波控制的移动通信网络位置群体节点的挖掘方法。构建移动通信网络节点的分布模型和信道模型,采用多径信道均衡设计实现位置群体节点信息融合,采用自适应滤波控制方法实现对通信节点挖掘的干扰抑制。仿真结果表明,采用该方法进行通信节点挖掘,信标定位准确,信号的覆盖度较合理,实现了信道空间的合理高效利用,实现了信道均衡和干扰抑制,有效降低了通信的误比特率。     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

三维被动定位AOA融合算法

三维被动定位是ESM系统的重要内容,在军事上是侦察定位、监视监测的重要方面。AOA是被动雷达普遍采用的一种定位方法。基于安装于不同运动平台上的两个传感器的AOA测量,给出了ILS融合算法。仿真结果显示采用AOA融合算法,使定位精度得到有效提高。     

A stochastic gradual cover location problem

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于盲分离的非合作信号定位技术

无源定位是电子战系统的一个重要组成部分,基于非合作信号(如广播、电视信号)的定位技术相比传统的无源定位具有很大的优势,但该定位方法目前还存在一些技术问题.为此,提出采用基于典范相关分析的盲分离方法,来完成对强直达波环境下反射波的分离、提取和延迟时间的计算,再结合方位估计,就可将这种定位问题转换为时差-方位定位.用这种方法可获取优良的定位性能,实现起来也相对容易,同时计算量少.仿真试验结果表明,该方法能有效地解决这种新颖定位技术的相关问题,并为其工程实现打下基础.     

利用多基地雷达实现目标的无源定位

对利用多基地雷达实现目标的无源定位功能所涉及到的系统关键技术进行了研究。如针对多基地雷达不同的系统结构提出了相应的无源定位方法和时间同步方案,并对接收机的一体化设计和脉冲分选方法做了简要论述。     

Equivalent accelerated life testing plans for log‐location‐scale distributions

Accelerated life testing (ALT) is widely used to determine the failure time distribution of a product and the associated life‐stress relationship in order to predict the product's reliability under normal operating conditions. Many types of stress loadings such as constant‐stress, step‐stress and cyclic‐stress can be utilized when conducting ALT. Extensive research has been conducted on the analysis of ALT data obtained under a specified stress loading. However, the equivalency of ALT experiments involving different stress loadings has not been investigated. In this article, a log‐location‐scale distribution under Type I censoring is considered in planning ALT. An idea is provided for the equivalency of various ALT plans involving different stress loadings. Based on this idea, general equivalent ALT plans and some special types of equivalent ALT plans are explored. For demonstration, a constant‐stress ALT and a ramp‐stress ALT for miniature lamps are presented and their equivalency is investigated. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Partitioning of biweighted trees

A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003     

Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010