基于流程仿真的物资接收系统可靠性预计方法

针对船舶物资接收时间计算的问题,新增加了对设备发生故障的考虑,通过引入接收时间可靠性的概念,将其转换为船舶物资接收系统的可靠性预计问题。为了解决上述可靠性预计问题,提出了基于流程仿真的系统可靠性预计方法。分析了物资接收系统的工作流程,依据工作流程实现了仿真程序,用蒙特卡洛法对物资接收系统的可靠性进行了求解,并分析了设备不同的可靠性水平对物资接收系统可靠性的影响。仿真结果表明,增加了对设备故障的考虑后,对物资接收时间的估计更加接近实际;基于流程仿真的系统可靠性预计方法的模型更容易理解,所得结论更加具体。     

光流算法研究

光流的测量是视频序列处理和视频挖掘中的基本问题。首先简述了光流法的基本原理,即物体亮度不变特性;然后阐述了计算光流的4类算法:微分方法、区域匹配方法、基于能量的方法和基于相位的方法,并对当前主流的能量算法进行了详细探讨;最后对各种光流算法的评测方法与测试集进行了说明。     

An exact network flow formulation for cell‐based evacuation in urban areas

In the literature two common macroscopic evacuation planning approaches exist: The dynamic network flow approach and the Cell–Transmission–Based approach. Both approaches have advantages and disadvantages. Many efficient solution approaches for the dynamic network flow approach exist so that realistic problem instances can be considered. However, the consideration of (more) realistic aspects (eg, density dependent travel times) results in non‐linear model formulations. The Cell‐Transmission‐Based approach on the other hand considers realistic traffic phenomena like shock waves and traffic congestion, but this approach leads to long computational times for realistic problem instances. In this article, we combine the advantages of both approaches: We consider a Cell‐Transmission‐Based Evacuation Planning Model (CTEPM) and present a network flow formulation that is equivalent to the cell‐based model. Thus, the computational costs of the CTEPM are enormously reduced due to the reformulation and the detailed representation of the traffic flow dynamics is maintained. We investigate the impacts of various evacuation scenario parameters on the evacuation performance and on the computational times in a computational study including 90 realistic instances.     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

潜艇应急上浮六自由度运动及黏性流场数值模拟

为揭示潜艇应急上浮过程中的强非线性运动及水动力作用规律,基于RANS方程及流体体积模型,针对Suboff标模建立了潜艇应急上浮数值预报方法。通过开展不同纵倾攻角及斜航漂角下全附体模型的水动力计算,验证了该计算方法的有效性,确定了其适用范围,进而结合整体动网格技术模拟了潜艇的应急上浮过程,获得了艇体六自由度运动的时历参数及流场细节信息。数值模拟结果表明该方法能够较合理地描述潜艇上浮的运动规律,也证明了该方法在潜艇上浮多自由度运动及水动力性能研究中的潜力和适用性。     

Numerical simulation of base flow with hot base bleed for two jet models

In order to improve the benefits of base bleed in base flow field, the base flow with hot base bleed for two jet models is studied. Two-dimensional axisymmetric Navier–Stokes equations are computed by using a finite volume scheme. The base flow of a cylinder afterbody with base bleed is simulated. The simulation results are validated with the experimental data, and the experimental results are well reproduced. On this basis, the base flow fields with base bleed for a circular jet model and an annulus jet model are investigated by selecting the injection temperature from 830 K to 2200 K. The results show that the base pressure of the annular jet model is higher than that of the circular jet model with the changes of the injection parameter and the injection temperature. For the circular jet model, the hot gases are concentrated in the vicinity of the base. For the annular jet model, the bleed gases flow into the shear layer directly so that the hot gases are concentrated in the shear layer. The latter temperature distribution is better for the increase of base pressure.     

天基预警系统资源调度问题分析

在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。 关键词：天基预警系统、资源调度、形式化描述     

移动式排烟在公路隧道火灾救援中的应用探讨

近年来我国公路隧道的建设迅速发展,然而公路隧道由于空间相对封闭,发生火灾情况下的烟气排除成为了难点。结合公路隧道通风排烟方式,探讨临界风速在隧道火灾排烟时的应用,并分析了公路隧道纵向空气流对火灾烟气流动的影响,指出不同流速的空气流对火灾烟气的影响效果不同,同时阐述了隧道内移动风机的气流环流现象。最后提出了基于不同火灾位置的排烟方案,为消防部队隧道火灾的排烟战术提供参考。     

高超声速飞行器中若干气动难题的实验研究

回顾了近几年本研究团队在高超声速飞行器若干气动难题方面的实验研究进展。在边界层转捩方面,测量了边界层转捩现象,研究了攻角效应对圆锥边界层转捩的影响,获得了边界层转捩的脉动特性以其对飞行器表面热流和摩阻的影响。在激波-边界层干扰方面,分析了突起物形状变化对流动特性的影响,研究了复杂外形的流动特性。     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014