A general model of heterogeneous system lifetimes and conditions for system burn‐in

Burn‐in is a technique to enhance reliability by eliminating weak items from a population of items having heterogeneous lifetimes. System burn‐in can improve system reliability, but the conditions for system burn‐in to be performed after component burn‐in remain a little understood mathematical challenge. To derive such conditions, we first introduce a general model of heterogeneous system lifetimes, in which the component burn‐in information and assembly problems are related to the prediction of system burn‐in. Many existing system burn‐in models become special cases and two important results are identified. First, heterogeneous system lifetimes can be understood naturally as a consequence of heterogeneous component lifetimes and heterogeneous assembly quality. Second, system burn‐in is effective if assembly quality variation in the components and connections which are arranged in series is greater than a threshold, where the threshold depends on the system structure and component failure rates. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 364–380, 2003.     

布尔函数的Walsh谱绝对值分布及其性质研究

提出并研究了布尔函数的Walsh谱绝对值分布.指出布尔函数Walsh谱绝对值分布在仿射变换下的不变性,计算了n(n≤5)元布尔函数的Walsh谱绝对值分布,研究了Walsh谱绝对值分布与Walsh谱支撑和Walsh谱中非零取值个数以及其他一些密码学难题的联系,最后研究了布尔函数的Walsh谱绝对值分布的大小.     

海面空-空无线信道特征

针对海上远距通信场景,基于无人机之间的无线通信链路,对接收功率进行实际测量。在大尺度路径损耗方面,采用对数距离线性模型进行拟合,分析海上远距空-空无线信道特征,获取路径损耗指数,并采用射线跟踪方法进行仿真验证,通过仿真所得信道冲激响应在多径时延和功率方面分析产生接收功率快速变化的原因。分析结果表明,近岸的多径反射会造成接收功率的波动,并且会造成路径损耗的升高。利用三种分布函数对测量数据进行分布拟合,分析海面和近岸两种通信条件下空-空无线信道的小尺度分布特征。测量分析结果表明,小尺度特征受陆地反射影响明显,在距离陆地较远的海面呈现高斯分布特征,而在近陆地处未呈现典型分布特征。     

基于改进遗传算法的防空火力优化分配方法

结合地空导弹部队防空作战的特点,提出了基于改进遗传算法的防空火力优化分配模型,给出了模型求解的方法和步骤,详细阐述了改进遗传算法在防空火力分配中的应用,通过在计算机上仿真运行实例得出了火力分配方案,通过仿真证明本方法运算速度较快,结果精度较高,对地面防空火力分配决策研究具有一定的参考价值。     

无人机的协同侦察航路规划

无人机将成为侦察卫星、有人驾驶侦察机的重要补充与增强手段 ,成为未来战场上广泛应用的一种侦察工具。为了提高无人机 (U AV)的侦察效率 ,在执行侦察任务前必需规划设计出高效的无人机侦察飞行航路。针对这一问题 ,提出了一种侦察效率指标评估的计算方法 ,解决了航路规划中的侦察效率量化问题。考虑在大范围任务区域内进行侦察航路优化存在计算的复杂性和收敛等问题 ,采用遗传算法对侦察航路进行了优化处理。通过该方法得到的侦察航路可以有效地提高无人机的侦察效率。     

基于遗传算法的目标方位角估算

针对某型武装直升机加装微光电视瞄准系统后 ,提出了采用遗传算法进行微光电视图像的识别和提取 ,然后与模型基元进行图像匹配 ,来研究目标方位角的估算问题。经分析计算 ,能较好地满足需求 ,为微光电视瞄准原理的实现打下一定的基础。     

基于遗传算法的涡轮增压器叶轮优化设计

提出了一种基于遗传优化理论的涡轮增压器叶轮的优化设计方法,论述了以涡轮增压器叶轮能量损失最小为目标函数,以叶轮叶片进口角、进口直径、进口宽度、出口直径、叶片数、出口角为设计变量的涡轮增压器叶轮的优化设计模型及优化计算的方法,数值计算表明,这种算法可以方便地求得具有最小涡轮损失的涡轮叶形参数.     

平面二自由度并联执行机构的设计与实现

介绍了作者研制的一种用于半导体制造设备上的x-y并联执行机构。通过增加一个冗余运动链 ,使得该机构在工作空间内没有奇异点。该机构的最大特点是可以大大减少现有机构的体积 ,并具有较高的刚度 ,可以在高速运动条件下具有较高的运动精度和跟踪性能。实验结果表明 ,该系统的轨迹跟踪误差均低于 0 5mm。     

The NBUL class of life distribution and replacement policy comparisons

Let X and X_τ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if X_τ is smaller than X in Laplace order, i.e., X_τ ≤_L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001.     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000