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     

基于改进的投影法的目标标识定位算法研究

军事对抗中,需要准确识别目标标识,以车辆识别中车牌精确定位为例进行研究。通过结合利用跳变法和投影法,提出一种基于改进的投影法的车牌定位。由进行车牌水平定位的跳变法和进行车牌垂直定位的投影法两个步骤组成。其中,像素在车牌水平方向的区域内会产生明显跳变,先通过跳变法确定车牌的水平区域。由于车牌一般位于图像的下半部分,所以从图像的1/2高度到4/5高度,1/3宽度到4/5宽度处扫描,减少背景区干扰。然后在车牌的水平区域再进行垂直投影,得到车牌的准确位置。实验结果证明,该方法不仅可以有效提高定位速度,还能够由于减少背景区的干扰而提高定位准确度。     

纯方位定位中的“Legs”机动方式与系统的可观测性

由多个等速直线运动段组成的观察站运动方式,称为“Ｌｅｇｓ”机动方式,所谓的纯方位系统是可观测的,是指系统在纯方位观察条件下,能唯一地求解出目标的运动参数。讨论了“Ｌｅｇｓ”机动方式,对纯方位目标定位系统可观测性的影响,建立了该模式下系统可观测的必要条件。     

一种新的基于特征值分解的双站无源定位算法

在自卫式噪声干扰的条件下,地面制导雷达将无法得到目标的斜距信息,无法实现对目标的定位,此时只有采用雷达组网方式,利用2个或多个雷达站的测角信息来对空间目标进行定位。提出一种基于特征值分解的新的定位跟踪算法,该算法具有计算简单、清晰,运算量小的优点,仿真也表明该算法有较好的精度。     

基于静止标量磁强计的运动舰船定位问题的研究

建立了静止标量磁强计对运动舰船定位的模型,并给出了用遗传算法求全局较优解、然后用单纯形法进行精确局部搜索的求解参数的方法.仿真实验表明这种方法有效、可行.     

进气口位置和进气体积流量对油罐油气惰化置换效率的影响

采用机械通风方式对油罐油气进行处理,具有安全性差、通风时间长和效率低下的缺点;利用燃惰气对油罐油气进行处理,可较好地克服上述缺点。在前期研究的基础上,设计模拟实验台架,以燃惰气为介质,实验研究进气口位置和进气体积流量对燃惰气惰化置换油罐油气的影响。     

误差配准在两种纯距离定位算法的应用比较

组网雷达系统中,由于观测信息量的增加,对目标存在多种定位算法。很多情形下,误差配准公式是基于某一定位算法推导而来,误差配准的结果也相应的用来提高此定位算法的定位精度。定位算法的复杂程度不同导致基于此算法推导误差配准公式难度不一致,不同定位算法的定位精度也不尽相同。因此,对两种多距离定位算法的定位精度、误差配准推导难易程度进行了理论分析和仿真计算,给出了定位精度的解析表达式和仿真结果。利用表达式简单的定位算法推导基于最小二乘的误差配准公式,并将误差配准结果反馈给定位精度高的定位算法,以最大程度提高误差配准结果的应用效果,减轻计算复杂度,提高信息的利用度。     

排除虚假交叉定位点的新方法

多站测向交叉定位法是无源定位方法中应用较多的一种,但该方法易产生大量虚假定位点。针对这个问题,提出了一种排除交叉定位中虚假点的新方法。该方法以两个观测站为主站,其他观测站为辅站,利用辅站数据对主站数据进行筛选及反馈从而快速排除两主站中的虚假点。仿真结果表明,该算法能够快速、准确地排除虚假定位点。