基于分簇理论的信息流优化算法研究

将导弹防御指控网络看作变拓扑结构网络,引入小世界网络中"簇"的概念,以最短作战响应时间为优化指标,提出了一种基于平均连接度自适应分簇算法的信息流优化算法。仿真结果表明,该算法在保证信息优裕度的前提下,提高了信息可达度和信息交互质量,提高了指控网络遭受打击时的重构能力。     

压力喷嘴常温下雾化特性实验研究

为了满足工程中对喷嘴雾化特性测量的高精度、低成本要求,建立了喷嘴雾化特性实验系统,以自来水为雾化工质,对蒸发冷却压力喷嘴在常温、常压下的雾化特性进行了实验研究。用容积法测量了喷嘴的流量,用最小二乘法对测量数据进行回归分析,得到了喷嘴流量、雾化压力和喷孔直径之间的关联式与流量系数;用机器视觉方法测量了喷嘴的雾化锥角与雾滴尺寸,得到了雾化锥角与雾滴尺寸随雾化压力变化的规律。结果表明:随着雾化压力的增大,喷嘴雾化锥角不断增加,雾滴尺寸不断减小;随轴向距离的增大,D0.632、D0.5、D32有不同幅度的增大,而D0.9则基本不变。     

基于STK的动能反卫作战信息流程构建

介绍了动能反卫星武器的信息系统构成及功能,对动能反卫作战过程进行了描述,提出了动能反卫作战中的信息需求,构建了动能反卫作战行动的信息流程。详细介绍了动能反卫星作战流程,并对作战信息需求进行分析。最后,利用卫星工具包(STK)实现一次对地基动能反卫星作战过程的仿真。     

System reliability based on diffusion models for fatigue crack growth

Diffusion processes are commonly used to describe the dynamics of complex systems arising in a wide range of application fields. In this paper we propose, on the basis of diffusion processes, two models concerned with the stochastic behavior of fatigue cracks in a system. They are then used to get the distribution of the failure time, the first time the crack size of at least one of the cracks exceeds a given value. Several properties of our proposed models are presented, and the unknown parameters are estimated by the method of maximum likelihood. From these an estimate of failure time distribution is obtained. In this part, contrary to common practice, we do not assume availability of failure data. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Scheduling recurrent construction

A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

临近空间飞艇内部自然对流的流场特征仿真

针对临近空间飞艇,对其内部氦气的自然对流特征进行了数值模拟。采用计算流体力学方法,并利用自编的用户自定义函数将外部的温度边界条件导入壁面网格。在不同的稳态条件下,通过对内部氦气压力、温度、速度的分布等流场特征参数的研究,分析了临近空间飞艇内部气体自然对流的运动特性及其影响规律,并对自然对流非稳态变化过程进行了初步的探索。仿真结果表明,在临近空间环境下,飞艇内部氦气的自然对流,对于内部氦气自身的热交换具有一定程度的促进作用,而对蒙皮受力和结构安全性影响很小。     

平板湍流边界层内气泡流流动实验研究

在低湍流度水槽里 ,利用片光源显示了平板气液两相湍流边界层内气泡流的流场结构 ,研究了平板安装位置、来流速度、喷气方式等参数对湍流边界层内气泡流的影响 .利用激光测速技术测量了平板水平放置时气泡流最外缘处的水平速度及厚度 .结果表明 :平板喷气减阻的原因在于喷气改变了平板湍流边界层的流动结构 ,抑制了湍流