基于混合优化的前馈—反馈复合控制器最优设计

为了解决传统PID控制器在电动舵机系统设计中难以满足控制要求的问题,首先设计了一种规范化前馈-反馈控制系统,然后利用混沌优化算法和共轭梯度方法相结合的混合优化算法对前馈-反馈控制器参数进行了优化.仿真结果表明:基于混合优化算法的前馈-反馈控制器具有很好的动态和静态性能,增强了系统的稳定性和鲁棒性,降低了学习参数选择的盲目性和对经验的高度依赖性.     

一种面向应用的NOC缓冲区分配算法

片上互连网络是片上通信问题的有效解决方案,但其存在严重的资源限制.输入缓冲区占据片上网络总面积的显著部分,同时其容量大小对不同应用映射后获得的性能有重要影响.给出一种面向应用数据负载的NOC缓冲区分配算法,针对不同的应用映射,该算法可以根据数据流量分布特征实现各个路由器输入通道上缓冲区资源的定制分配.实验结果表明,使用该算法后,系统缓冲区资源得到了更有效的利用.与均匀分配缓冲区的NOC系统相比,采用该算法实现的缓冲区分配方案使系统在保持性能变化不大的情况下,能够节省约50%的缓冲区总容量.     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

大规模代谢网络分解的生物信息学研究

随着大规模分子相互作用数据的不断涌现,生物学网络方面的研究正日益得到重视.代谢网络处于生物体的功能执行阶段,其结构组成方式不仅反映了生物体的功能构成,也直接影响代谢工程中的途径分析和研究.作为代谢网络研究的重要环节,实现网络的合理分解不仅对于基因组范围内分子网络的结构和功能研究具有重要意义,也是代谢工程的途径分析和优化得以顺利进行的前提之一.在回顾代谢网络宏观结构和拓扑特征研究成果的基础上,通过对现有分解方法的深入分析,指出缺乏合理且有针对性的模型评估准则是目前网络分解研究中亟待解决的问题之一.今后的研究趋势在于如何整合更多的信息和发展更先进的分析方法,建立更合理的模型,并进一步拓展网络分解的应用范围.     

As-IPDA算法的天波超视距雷达目标跟踪研究

天波超视距雷达(OTHR)具有低数据率、低检测概率和低量测精度特征对目标跟踪提出挑战.针对OTHR在低检测概率下跟踪目标存在失跟率高的问题,将As-IPDA算法应用到OTHR目标跟踪中,通过大量的仿真实例验证了As-IPDA算法在超视距雷达目标跟踪应用中的可行性,并分析了平滑步长、航迹存在性转移参数、目标检测概率对算法性能的影响,给出了算法参数选择建议,为工程应用提供理论参考.     

器材分层集装问题的遗传算法应用研究

从缩小搜索区域、增强算法的收敛性,以及缩短计算时间的角度出发,提出了解决器材分层集装问题的遗传算法。根据实际情况论述了解决该问题的3步法,并建立了优化的数学模型,构造了适合遗传算法求解的目标函数。实验表明,遗传算法具有很好的全局收敛性,能有效地解决器材分层集装问题。     

卡尔曼滤波的心动阵列实现研究

基于Faddeeva算法可以实现各种矩阵运算 ,并且可以方便地映射到心动阵列结构上这一事实 ,提出了一种基于Faddeeva算法的卡尔曼滤波心动阵列实现方法 ,并在此基础上设计了两种处理器拓扑结构。分析结果表明 ,这两种处理器结构具有效率高、规整性好和易于扩展等特点。     

一种新的时频分析方法

首先分析了传统时频分析方法的特点及其局限性,而后评述了一种最新的适用于非平稳、非线性信号的通用的时频分析方法--基于经验的模式分解及希尔伯特变换谱,指出了该方法需进一步研究的有关问题