基于BP网络的BTT导弹逆控制方法

运用BP神经网络结构和Levenberg-Marquardt算法,对导弹动力学特性进行动态逆模型辨识,并以辨识模型为控制器与BTT导弹控制系统串联构成动态伪线性系统,进而应用逆系统方法设计了一种用于解决BTT导弹非线性控制问题的经典控制与神经网络在线自学习控制相结合的控制方法.从理论上证明了该控制方案可以实现对导弹三通...     

基于逆向分层的工作流时间-费用优化方法

针对效用网格下基于优先级因子的工作流时间-费用优化问题,基于工作流的同步完成特征对任务进行分层并提出三种实时调度算法:基于逆向分层的sufferage(BLSuff)、基于逆向分层的min-min(BLMin)及基于逆向分层的min-max(BLMax)。算法设计基于优先级因子的衡量标准对时间与费用同时进行优化,并为任务设置期望完成时间以达到充分利用费用优化空间进行费用优化的目标。实验结果表明这三种算法在各种优先级因子下都能对工作流的执行时间与执行费用进行较好的优化。     

多核数字信号处理器并行矩阵转置算法优化

矩阵转置是矩阵运算的基本操作,广泛应用于信号处理、科学计算以及深度学习等各种领域。随着国防科技大学自主研制的飞腾异构多核数字信号处理器(digital signal processor, DSP)在各种领域中的推广应用,对高性能矩阵转置实现提出了强烈需求。针对飞腾异构多核DSP的体系结构特征与矩阵转置操作的特点,提出了一种适配不同数据位宽(8 B、4 B以及2 B)矩阵的并行矩阵转置算法ftmMT。该算法基于DSP中向量处理单元的Load/Store部件实现了向量化,同时基于矩阵分块实现了多个DSP核的并行处理,通过隐式乒乓设计实现了片上向量化转置与片外访存的重叠以及访存性能的大幅提升。实验结果表明,ftmMT能够显著加快矩阵转置操作,与CPU上的开源转置库HPTT相比,可获得高达8.99倍的性能加速。     

基于遗传算法的防空兵群最优火力分配模型研究

结合战场目标价值分析,根据防空兵火力分配情况,运用遗传算法建立了最佳火力分配模型,使防空武器最大限度的发挥火力单位效能,达到最大毁伤效果。采用了实数编码方案,对选择,交叉,变异等操作进行了改进。最后通过计算,验证了方案的可行性和优越性.     

光栅型波前曲率传感器原理与相位恢复研究

对一种新型的基于扭曲衍射光栅的波前曲率传感器原理进行了数值模拟,应用基于Gesrchberg-Saxton(GS)算法的误差减少法对这种波前传感器进行了相位恢复数值模拟。当畸变波前幅度变大时,恢复残差变大;当迭代精度变大时,恢复残差也会变大。     

基于舰船磁场模型的离线磁定位研究

目前,海上舰船磁场测量试验获得的数据一般为时间通过曲线,不能直接用于舰船磁场建模。为了解决上述问题,利用遗传算法良好的全局搜索能力,在目标舰船运动参数未知、磁探头存在姿态角的情况下,实现了一种基于单旋转椭球体磁场模型的离线磁定位算法.计算结果表明,该方法效果良好。     

基于改进量子遗传算法的有源噪声控制方法

提出了一种基于改进量子遗传算法的格型IIR滤波器结构的有源噪声控制方法——改进的量子遗传算法(IQGA)。其核心是在对量子门更新过程进行改进的基础上,引入群体灾变和自适应搜索网格的策略。IQGA不仅收敛速度快,还可以改变基本遗传算法(GA)的局部搜索能力,克服基本遗传算法存在的未成熟收敛问题。仿真结果表明,该算法可以有效地实现噪声控制。     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Modeling and analysis of a mixed‐model assembly line with stochastic operation times

We consider a mixed‐model assembly line (MMAL) comprised a set of workstations and a conveyor. The workstations are arranged in a serial configuration. The conveyor moves at a constant speed along the workstations. Initial units belonging to different models are successively fed onto the conveyor, and they are moved by the conveyor to pass through the workstations to gradually generate final products. All assembling tasks are manually performed with operation times to be stochastic. An important performance measure of MMALs is overload times that refer to uncompleted operations for operators within their work zones. This paper establishes a method to analyze the expected overload times for MMALs with stochastic operation times. The operation processes of operators form discrete time nonhomogeneous Markov processes with continuous state spaces. For a given daily production schedule, the expected overload times involve in analyzing the Markov processes for finite horizon. Based on some important properties of the performance measure, we propose an efficient approach for calculating the expected overload times. Numerical computations show that the results are very satisfactory. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007