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     

频域加权LQR控制器改进设计

基于线性二次型调节器(Linear Quadratic Regulator,LQR)控制方法,设计一种频域加权LQR控制器;通过对其常用滤波器进行改进,提出一种新型滤波器设计思路.当振源频率低于执行器下限响应频率,导致执行器输出减小时,通过改变滤波器参数、增大低频部分权重及控制力,可提高低于执行器响应下限频段的控制性能...     

卫星激光防护技术

从两方面探讨轨道卫星激光防护技术.介绍卫星光电探测器激光防护设计原理及新型防护技术.对提高卫星结构材料的抗激光损伤能力提出几种实用方法.     

加强党性党风建设 提高党员干部的整体水平

党性党风建设历来是我党高度重视的一个问题。高校领导干部亦不例外。目前 ,高校基层党员干部普遍存在政治理论水平不高 ,道德修养变形 ,党的意识淡薄等现象。要想提高高校基层党员干部党性党风建设的整体水平 ,就必须加强对其进行政治理论教育和道德教育 ,同时加强制度建设。唯有此 ,才能提高基层管理者的管理水平和整体办学层次     

有约束的Hartley域自适应算法的应用研究

通过对有约束的Hartley域自适应算法、频域自适应算法及时域自适应算法用于自适应降噪系统的计算机仿真研究 ,认为在自适应通信降噪中采用基于Hartley变换的自适应算法较频域自适应算法及时域自适应算法性能更优、降噪效果更好 ,并在高速信号处理器TMS32 0C30上开发实现了该算法 .实验结果表明 ,将Hartley域自适应算法应用于通信降噪系统 ,方法实际可行     

EP/PVB半-互穿聚合物网络的动态力学谱

制备了EP/PVB半 互穿聚合物网络 .动态力学谱结果表明 ,适量的PVB对环氧树脂有较好的增韧作用 ,而环氧树脂对PVB的增硬作用不明显 .     

幅度信息辅助的多机动目标跟踪算法

针对密集杂波下现有的多机动目标跟踪算法计算量大且性能严重衰退的问题,提出了联合幅度信息的多模型标签多伯努利(AI-MM-LMB)滤波器。首先,对目标状态进行扩展,引入幅度信息;然后,建立幅度信息及位置信息的联合量测似然函数;最后,基于MM-LMB滤波器框架,给出新的更新方程。仿真实验结果表明:低杂波下,AI-MM-LM算法同MM-LMB算法跟踪性能相当;高杂波下,AI-MM-LMB算法性能明显优于MM-LMB算法。     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

卫星遥测数据相关性知识发现方法

为快速发现海量遥测数据中的相关关系,提出一种基于改进最大信息系数(Maximal Information Coefficient, MIC)的遥测数据相关性知识发现方法。以Mini Batch K-Means聚类算法为前驱过程对数据进行网格划分;计算该网格划分下的互信息,并以信息熵代替原有最大熵对互信息进行归一化矫正得到信息系数;选择不同网格划分下MIC作为变量相关性的测度。采用量子卫星遥测数据进行试验,结果表明:与基于动态规划算法的MIC方法相比,所提方法可有效解决MIC测度偏向多值变量的问题,时间复杂度从O(n~(2.4))下降为O(n~(1.6)),是一种适用于大规模遥测数据相关性分析的有效方法。