Log‐concave and concave distributions in reliability

Nonparametric classes of life distributions are usually based on the pattern of aging in some sense. The common parametric families of life distributions also feature monotone aging. In this paper we consider the class of log‐concave distributions and the subclass of concave distributions. The work is motivated by the fact that most of the common parametric models of life distributions (including Weibull, Gamma, log‐normal, Pareto, and Gompertz distributions) are log‐concave, while the remaining life of maintained and old units tend to have a concave distribution. The classes of concave and log‐concave distributions do not feature monotone aging. Nevertheless, these two classes are shown to have several interesting and useful properties. We examine the closure of these classes under a number of reliability operations, and provide sharp reliability bounds for nonmaintained and maintained units having life distribution belonging to these classes. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 419–433, 1999     

离心式消防泵常见故障分析与预防对策

离心式消防泵在运行过程中常常会因各种故障而影响其正常运转,甚至不能实现水、泡沫等灭火剂的供给。因此,提高离心式消防泵运行的可靠性是紧急状态下保证火场供给能力的重要举措。结合离心泵的结构原理,综合分析了离心式消防泵在使用过程中的常见故障,给出了离心式消防泵故障的快速诊断方法,并有针对性地提出了预防和处置离心式消防泵故障的措施。     

一种确定火力单元配弹数界的方法

通过分析当空袭目标持续进攻时,防空导弹武器系统的一个火力单元配弹数对其射击效能的三方面的影响,得出火力单元的配弹数是影响其射击效能持续发挥的关键因素;以射击效能为基准,从概率的角度,以空袭目标突防时的配弹数为界限,给出了一种火力单元配弹数界的确定方法.     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015     

RCS特性辅助的CMIMO雷达功率资源分配方法

针对集中式多输入多输出(collocated multiple-input multiple-output, CMIMO)雷达在实际探测过程中,未有效结合目标雷达散射截面(radar cross section, RCS)高动态变化特性导致雷达跟踪精度不高甚至失跟的问题,提出一种基于目标RCS高动态特性的CMIMO雷达功率资源自适应分配方法。考虑到目标RCS特征的角度敏感性,利用目标运动状态的可预测性动态获取实际观测角度,从而完成跟踪帧的极化方式优选;在此基础上构建包含功率与RCS的多目标跟踪误差后验克拉美罗下界,将其作为目标函数进行优化,利用内点惩罚法求解该凸优化问题即可实现RCS高动态情况下的功率优化分配。实验结果表明:该方法可结合目标不同方向RCS动态分集特性实现功率的有效分配,相比于传统RCS模型分配方案,有效解决了分配方案与实际跟踪场景之间的失配问题,从而提升了CMIMO雷达的多目标跟踪性能。     

数组越界软件测试系统的设计与实现

软件测试系统的研制是现阶段软件测试领域研究的一个热点.首先针对C/C 语言常见数组越界错误类型进行了分析,介绍了软件测试的一些基本概念,而后给出了软件测试系统设计,对系统设计的各个阶段进行了说明,并且给出了一种错误类型检查的算法设计,它在软件测试检测中具有通用性和代表性,最后给出了软件测试的实验结果.     

舰艇编队防空火力射击冲突问题研究

从建立编队内统一的坐标系入手,利用编队中武器的位置、战术参数和来袭目标的信息,采用系统建模仿真的思想,建立火力射界冲突分析模型。借助于这个模型,通过解命中计算等方法,计算编队中武器的可抗击航路以及连续射界,进而得出其可抗击射界,与武器固有安全射界叠加,确定编队中可以参与抗击来袭目标的武器,并为进一步地探讨编队火力兼容问题,进行火力兼容控制奠定基础。     

Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems

Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

A non-myopic scheduling method of radar sensors for maneuvering target tracking and radiation control

In decades, the battlefield environment is becoming more and more complex with plenty of electronic equipments. Thus, in order to improve the survivability of radar sensors and satisfy the requirement of maneuvering target tracking with a low probability of intercept, a non-myopic scheduling is proposed to minimize the radiation cost with tracking accuracy constraint. At first, the scheduling problem is formulated as a partially observable Markov decision process (POMDP). Then the tracking accuracy and radiation cost over the future finite time horizon are predicted by the posterior carmér-rao lower bound (PCRLB) and the hidden Markov model filter, respectively. Finally, the proposed scheduling is implemented efficiently by utilizing the branch and bound (B&B) pruning algorithm. Simulation results show that the performance of maneuvering target tracking was improved by the improved interacting multiple model (IMM), and the scheduler time and maximum memory consumption were significant reduced by the present B&B pruning algorithm without losing the optimal solution.