基于LOG算子的激光雷达图象边缘检测算法改进

针对LOG算子的不足之处,提出了一种激光雷达图像的边缘检测改进LOG算子算法:用二维自适应Wiener滤波代替Gaussian滤波。仿真结果表明:对于含有高斯噪声和乘性噪声的激光雷达图像,该算法能够有效提高LOG算子的边缘检测能力。     

通用装备维修机具设备集成设计研究

随着新型通用装备加速列装部队和维修保障模式的变革,现有的维修机具设备无法满足装备维修保障需求,目前对维修机具设备进行优化与集成设计显得尤为重要.为了缩短研制开发周期,降低寿命周期费用,充分利用已有的设计历史数据对维修机具设备进行集成设计将成为研制开发的重要途径.在研究设计重用的基础上,提出了基于重用设计元置换的维修机具设备集成设计方法,给出了集成设计过程,并对维修机具设备集成设计中的关键技术进行了论述,认为在维修机具设备集成设计中采用基于重用设计元置换是一种充分利用现有数据、缩短研制开发周期、降低研制费用的好方法.     

大口径舰炮将重展雄风

由于浅水战争和不对称威胁,要求在中短距离上攻击各种目标,但这种条件常常严重地阻碍了反舰导弹性能的发挥。同反舰导弹相比,大口径火炮要便宜得多,能更加即时地使用,且快速灵活,所以现在各大军事强国都在加紧研制新型大口径舰炮,重新考虑使用大口径火炮来代替反舰导弹,并且提供海上火力支援,使大口径舰炮重新登上战舰的舞台。为此,介绍了美国、德国、英国、意大利、俄罗斯、法国的大口径火炮研制情况。     

基于查找表的像素处理器新算法

本文在基本的像素处理算法的基础上，提出了一种基于查找表的快速平滑插值算法。该算法不仅运算量小、精度较高，而且易于硬件实现，适合于高速显示处理系统中。     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc.     

航天器编队飞行构形保持与重构的继电型控制

研究小偏心参考轨道航天器编队飞行构形保持与重构控制的工程实现技术。首先给出相对运动状态转移矩阵,并推导出常推力控制情况下相对运动状态递推的解析表达式;进而给出脉冲推力、连续变推力和继电型推力三种发动机的推力模型和示意图。分别将等速度冲量的三种推力模型代入相对运动状态转移矩阵中,比较相同条件下相对运动控制作用效果的差异,理论推导结果表明:在一阶意义上,三种推力模型对相对运动控制作用等效,因而航天器编队构形保持与重构控制可以基于继电型推力模型来实现。     

基于SADRC的四旋翼飞行器姿态解耦控制方法

针对线性自抗扰(Linear Active Disturbance Rejection Control,LADRC)在四旋翼飞行器姿态控制中存在初始状态误差较大时可能产生"峰值"现象的问题,提出了一种基于线性/非线性自抗扰切换控制(Switch in linearnonlinear Active Disturbance Rejection Control,SADRC)四旋翼飞行器控制方法。以实验室现有的3-DOF四旋翼飞行器平台为研究对象,建立了其姿态的数学模型,引入SADRC对其基本原理进行了介绍;基于SADRC设计了四旋翼飞行器姿态解耦控制器,并对系统单通道的稳定性进行了分析;对控制方法进行了实验验证。结果表明,SADRC控制器可有效避免LADRC控制器因为初始状态误差引起的"峰值"问题,抗干扰性能进一步提高。     

舰艇生命力线图在舰炮射击效力评定中的应用

射击效力评定是武器使用和论证的基础理论,针对舰炮射击效力评定方法问题,在分析常用的射击效力指标基础上,提出一种基于生命力线图的计算毁伤定律的理论分析方法,并对计算毁伤定律的方法进行进一步改进,计算结果表明,改进的计算方法合理、可行、有效,可为舰炮的使用和论证提供理论支撑。