多无人机协同试飞试验模式

联合作战概念的出现和无人机多任务使命的实际运用,使得无人机联合作战成为世界各国研究发展的重点。基于协同作战和联合作战的内在联系及国内多无人机协同作战有关理论上的研究情况,分析了无人机协同试飞试验的条件和主要特点,总结归纳了无人机协同试飞试验的主要内容,提出了无人机编队的设计依据和关键问题,介绍了集中式、集散式、分布式控制的基本概念,论述了3种控制模式下的无人机协同试飞试验的实现方法和各控制模式之间的关系。     

某型滑翔增程靶弹方案弹道设计

针对某滑翔增程靶弹的无动力特性,综合各方面因素,提出一种具有近似平飞段的方案弹道。选择相关参数,设计了一种具有近似平飞段的高度变化律,提出了改进的攻角表达式,得到无动力靶弹三自由度铅垂平面的运动模型。数字仿真证明,这种方法合理可行,满足了靶弹各项战技指标,实现靶弹的近似平飞,方案弹道能较好地追踪给定高度变化,具有较高的工程应用价值。     

飞行控制系统的重构技术研究

飞行控制系统的重构技术可以有效地提高飞行器的生存能力和任务效能,已成为现代飞行器综合设计领域的热门研究专题之一.介绍了飞控系统重构技术的发展历史及现状,对目前几种重要的飞行控制系统重构方法进行了概述和分析,总结了飞控系统重构技术领域里的一些热点问题,最后展望了未来飞控系统重构技术的发展趋势.     

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.     

批量独立可修件的备件需求预测仿真算法

利用Monte Carlo随机仿真技术,采用事件调度法的仿真策略对可修件的使用与维修过程进行仿真,给出了在给定备件和维修分队数量下批量独立可修件的备件保障概率仿真算法,并用一系列计算实例证明了算法的可行性和正确性,该算法能有效解决安装在不同装备上,具有不同已工作时间、不同故障间隔时间分布、不同修复时间分布的可修件的备件保障概率计算问题,为备件的科学储备提供了有力的决策依据。     

基于坐标转换的卡尔曼交互式多模型滤波算法

为解决舰炮火控系统中在笛卡尔坐标系中测量信息的互相关性,分析了目前舰炮火控系统中所用到的坐标系及其坐标变换,在瞄准线坐标系内建立了自适应滤波的交互式多模型算法,能够充分利用跟踪传感器的量测信息,在卡尔曼滤波中具有较强的自适应能力,通过与标准交互式多模型算法的对比验证,自适应交互式多模型算法在计算精度上明显好于标准交互式多模型算法。     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

侵害企业家常见犯罪及其防范

近年来,刑事犯罪居高不下,侵害企业家的犯罪持续上升,企业家被侵害的常见犯罪尤以绑架、敲诈勒索最为突出。企业家要思想上高度重视,搞好自身防范;做好企业内部的安全防范;教育好自己的子女,以防成为被侵害目标;加大技防投入;宽以待人,为自身安全创造一个良好的环境;慎于交友;保持良好的生活方式。     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005