基于Hankel范数近似的磁悬浮控制系统模型降阶

对于磁悬浮系统而言,忽略轨道的弹性进行控制算法设计,是一种常见的方法。但是,当轨道的刚度较小时,这种方法的控制性能较差。考虑轨道弹性所设计的控制算法,理论上能确保系统的良好性能但是会使得系统复杂度增加。本文采用Hankel范数近似法对基于弹性轨道的模型进行降阶。针对刚性轨道系统模型和降阶模型设计控制算法,利用仿真结果验证降阶模型的可行性。     

图像配准参数的自适应求取方法

提出了一种可见光和红外图像的自动配准方法 .针对多数配准过程需人工干预的问题 ,建立二维仿射变换模型 ,以图像边界为特征 ,以目标边界互相关函数最大为原则 ,对二维仿射变换模型自适应搜索求取最佳配准参数 .给出了实际可见光和红外图像配准的实验结果     

双绝热近似下磁流体力学线性稳定性原理

本文得出了双绝热近似的磁流体力学能量积分关系式。分析表明这种磁流体力学系统是保守的,可以采用运动方程或能量原理方法分析系统的稳定性特性。本文从控制方程组出发讨论了线性稳定性的基本原理,指出纵向压力增值有助于系统的稳定性。     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998     

超图约束和改进归一化互相关方法相结合的图像配准算法

为提高图像配准算法的精度和适应能力,将超图约束和改进归一化互相关方法应用于图像配准。利用Hessian-Affine检测得到的仿射不变区域代替固定窗口来改进归一化互相关方法,获得初始匹配点对;通过马氏距离计算超边间的相似度,采用超图约束计算匹配分数对匹配对进行排序;利用分数高的部分匹配点对初始化变换矩阵,通过过滤匹配对来循环更新得到最优变换矩阵实现配准。实验结果表明,该方法具有较好的匹配和剔除错误匹配的效果,在不同类型的图像配准中也有较好的配准效果。     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

AES密码的三种等价形式

分离了AES密码中S盒的仿射变换,得到了与原密码S盒不同的三种等价密码.研究发现列混合矩阵在很大程度上影响仿射变换的提取,在这种意义上提出了对列混合变换的改进建议.