BOS技术在流动测量中的应用

背景纹影技术是新近提出的一种流动显示技术。与纹影、干涉等传统流动显示方法相比,BOS技术不仅具有高时空分辨率,同时还可以对流场密度梯度场进行定量测量。根据BOS技术的原理,搭建了一套BOS系统,采用该系统测量了蜡烛火焰上方的热对流流场,得到了热对流流场的瞬态流动结构,验证了BOS系统的性能。在此基础上,采用BOS系统对超声速混合层进行了实验研究,得到了超声速混合层的精细空间结构和密度梯度场的定量分布,实验结果充分体现出BOS技术在流动测量中的巨大优势。     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于LMI的不确定性无尾飞行器鲁棒变增益控制器设计

无尾式飞行器是飞行器发展的方向,研究无尾式控制具有重要意义.研究了线性变参数系统的增益调度控制器的设计方法,采用多胞形进行增益调度,提出了一种简单实用的变参数顶点凸分解方法,该方法在保证系统稳定的情况下,确保系统达到最优性能指标.同时还充分考虑了系统的不确定性因素,利用线性矩阵不等式(LMI)对系统进行鲁棒控制器设计,大大减少了计算量以及对系统的约束,设计出了基于LMI的增益调度控制器,通过非线性仿真结果可以看出,该控制器在调节变量变化很大的情况下,使得系统在0.5s内收敛,而且超调量很小,论证了该方法在无尾式飞控系统中应用的可行性.     

考虑随机回放的卫星数传调度问题的一种求解方法

针对考虑随机回放的卫星数传调度问题,从置换空间到调度解空间的映射方法和置换空间的搜索算法两方面进行了研究.提出了一种时间窗优先的置换序列映射算法,并证明该映射算法可以将置换序列映射到调度解空间上的最优解.提出了一种遗传随机搜索算法,基于有记忆功能的随机邻域搜索,在置换空间上搜索产生优化调度的置换序列.仿真计算表明,遗传随机搜索算法可以增强遗传算法的局部搜索能力,在搜索结果上平均获得了2.72%的改进.     

基于信息流的武器装备体系效能模型

信息流是武器装备体系构建的重要依据,信息流过程是武器装备体系效能发挥与建模的基本框架.首先,分析了武器装备体系中信息流的种类,及包括的主要信息内容;其次,围绕信息流过程,将武器装备体系视为一个控制系统,研究了基于各装备效能的武器装备体系效能模型建模方法及相关评估指标的计算方法;最后,以一个算例说明了方法的有效性.     

考虑摩擦时环状流的空泡份额求解

在熵增模型的基础上,考虑壁面摩擦对空泡份额的影响,推导出了空泡份额应满足的方程,求得其解析解和数值解,并进行了讨论.分析表明,其结果包含了有关文献的结果,具有更大的适用范围.     

系列头型空泡特征及其对细长体阻力特性影响的试验研究

为了了解不同头型的空泡特征及其对轴对称体阻力特性的影响,在高速水洞中试验研究了6种典型头体在不同空泡数下,轴对称体上空泡的几何特征以及相对应的阻力特性,分析了空泡数对轴对称体空泡特征与阻力的影响.     

Optimal control policies in service systems with limited information on the downstream stage

Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

A note on efficient sequences with respect to total flow time and number of tardy jobs

For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016