基于改进核极限学习机和集成学习理论的目标机动轨迹预测

为了提高目标轨迹预测的精度以及预测模型的泛化能力,提出基于改进蝙蝠算法优化的核极限学习机(Kernel Extreme Learning Machine,KELM)和集成学习理论目标机动轨迹预测模型。构建KELM模型,并采用改进的蝙蝠算法对KELM的参数进行优化;以优化后的KELM神经网络为弱预测器,结合集成学习算法生成强预测器,通过训练不断优化强预测的结构和参数,得到一种基于集成学习理论的目标机动轨迹预测模型;基于不同规模的样本,将所得预测模型与逆传播神经网络、支持向量机和极限学习机等模型进行对比分析。仿真结果表明:所提目标机动轨迹预测模型具有较好的预测精度和泛化能力。     

自然场景车标数据集的构建及其应用

车标作为车辆身份的关键特征之一,在车辆的监控与辨识中发挥着重要作用。由于自然场景复杂多变,对其中的车标进行准确识别仍具有很大的挑战性。目前公开数据库很少且存在诸多局限,导致研究缺乏可信度和实用性。本文建立了一个面向自然场景的全新数据集,包含多种采集环境下的10 324幅、67类车辆图像。基于此数据集开展应用研究,提出一个目标检测与深度学习相结合的车标识别方法,包括车标区域定位和车标种类预测两大步骤。实验表明,该方法对复杂背景有较强的适应性,在涉及30种车标的分类任务中达到89.0%的总体识别率。     

Predicting intensive care unit bed occupancy for integrated operating room scheduling via neural networks

In a master surgery scheduling (MSS) problem, a hospital's operating room (OR) capacity is assigned to different medical specialties. This task is critical since the risk of assigning too much or too little OR time to a specialty is associated with overtime or deficit hours of the staff, deferral or delay of surgeries, and unsatisfied—or even endangered—patients. Most MSS approaches in the literature focus only on the OR while neglecting the impact on downstream units or reflect a simplified version of the real‐world situation. We present the first prediction model for the integrated OR scheduling problem based on machine learning. Our three‐step approach focuses on the intensive care unit (ICU) and reflects elective and urgent patients, inpatients and outpatients, and all possible paths through the hospital. We provide an empirical evaluation of our method with surgery data for Universitätsklinikum Augsburg, a German tertiary care hospital with 1700 beds. We show that our model outperforms a state‐of‐the‐art model by 43% in number of predicted beds. Our model can be used as supporting tool for hospital managers or incorporated in an optimization model. Eventually, we provide guidance to support hospital managers in scheduling surgeries more efficiently.     

Maneuvering target tracking of UAV based on MN-DDPG and transfer learning

Tracking maneuvering target in real time autonomously and accurately in an uncertain environment is one of the challenging missions for unmanned aerial vehicles(UAVs).In this paper,aiming to address the control problem of maneuvering target tracking and obstacle avoidance,an online path planning approach for UAV is developed based on deep reinforcement learning.Through end-to-end learning powered by neural networks,the proposed approach can achieve the perception of the environment and continuous motion output control.This proposed approach includes:(1)A deep deterministic policy gradient(DDPG)-based control framework to provide learning and autonomous decision-making capa-bility for UAVs;(2)An improved method named MN-DDPG for introducing a type of mixed noises to assist UAV with exploring stochastic strategies for online optimal planning;and(3)An algorithm of task-decomposition and pre-training for efficient transfer learning to improve the generalization capability of UAV's control model built based on MN-DDPG.The experimental simulation results have verified that the proposed approach can achieve good self-adaptive adjustment of UAV's flight attitude in the tasks of maneuvering target tracking with a significant improvement in generalization capability and training efficiency of UAV tracking controller in uncertain environments.     

模型不可知的联合相互学习

主流的联邦学习(federated learning, FL)方法需要梯度的交互和数据同分布的理想假定,这就带来了额外的通信开销、隐私泄露和数据低效性的问题。因此,提出了一种新的FL框架,称为模型不可知的联合相互学习 (model agnostic federated mutual learning, MAFML)。MAFML仅利用少量低维的信息(例如,图像分类任务中神经网络输出的软标签)共享实现跨机构间的“互学互教”,且MAFML不需要共享一个全局模型,机构用户可以自定制私有模型。同时,MAFML使用简洁的梯度冲突避免方法使每个参与者在不降低自身域数据性能的前提下,能够很好地泛化到其他域的数据。在多个跨域数据集上的实验表明,MAFML可以为面临“竞争与合作”困境的联盟企业提供一种有前景的解决方法。     

Allocation of quality improvement targets based on investments in learning

Purchased materials often account for more than 50% of a manufacturer's product nonconformance cost. A common strategy for reducing such costs is to allocate periodic quality improvement targets to suppliers of such materials. Improvement target allocations are often accomplished via ad hoc methods such as prescribing a fixed, across‐the‐board percentage improvement for all suppliers, which, however, may not be the most effective or efficient approach for allocating improvement targets. We propose a formal modeling and optimization approach for assessing quality improvement targets for suppliers, based on process variance reduction. In our models, a manufacturer has multiple product performance measures that are linear functions of a common set of design variables (factors), each of which is an output from an independent supplier's process. We assume that a manufacturer's quality improvement is a result of reductions in supplier process variances, obtained through learning and experience, which require appropriate investments by both the manufacturer and suppliers. Three learning investment (cost) models for achieving a given learning rate are used to determine the allocations that minimize expected costs for both the supplier and manufacturer and to assess the sensitivity of investment in learning on the allocation of quality improvement targets. Solutions for determining optimal learning rates, and concomitant quality improvement targets are derived for each learning investment function. We also account for the risk that a supplier may not achieve a targeted learning rate for quality improvements. An extensive computational study is conducted to investigate the differences between optimal variance allocations and a fixed percentage allocation. These differences are examined with respect to (i) variance improvement targets and (ii) total expected cost. For certain types of learning investment models, the results suggest that orders of magnitude differences in variance allocations and expected total costs occur between optimal allocations and those arrived at via the commonly used rule of fixed percentage allocations. However, for learning investments characterized by a quadratic function, there is surprisingly close agreement with an “across‐the‐board” allocation of 20% quality improvement targets. © John Wiley & Sons, Inc. Naval Research Logistics 48: 684–709, 2001     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

基于深度学习的MPSK信号调制识别

为了有效实现信号调制方式的智能识别,提出基于深度学习的多进制相移键控(Multiple Phase Shift Keying, MPSK)信号调制识别方法。分析接收MPSK信号的循环谱,并通过提取MPSK信号循环谱的等高图获得二维特征信息,利用深度学习中的卷积神经网络对二维特征进行训练,使用测试样本对所设计的调制识别方法的有效性进行验证。仿真结果表明,所提方法具有良好的识别性能。     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.     

采用区分性幅相联合字典学习的低截获概率信号分离方法

为解决采用字典学习的信号分离方法存在的相位信息缺失和子字典交叉表示问题,提出一种区分性幅相联合字典学习方法。该方法针对相位信息缺失问题,构建了幅相联合字典模型;针对混合信号在联合字典上投影时存在的交叉表示问题,基于区分性字典学习思想提出在字典学习过程目标函数中加入交叉表示抑制项。仿真结果表明：幅相联合字典能够充分表示典型低截获概率信号的幅相信息,交叉表示抑制项能有效抑制信号间的交叉表示,算法具有良好的分离性能。