CNG加气站与民用建筑防火间距的量化分析

对于采用储气井储存方式的CNG加气站,其与附近民用建筑的防火间距问题,在目前的规范中没有相应要求。而在《汽车加油加气站设计与施工规范》中虽有储气井与民用建筑的防火距离规定,但对民用建筑的保护类别界定在实际操作中较困难。结合实际工程,通过采用对储气井储存方式的CNG加气站各工艺设备进行火灾和爆炸危险性的量化分析,验证了其与附近民用建筑的防火间距,为此类工程设计提供了方法和依据。     

航空吊放声纳主动方式暴露距离研究

航空吊放声纳是反潜作战主要搜潜设备之一,其主动工作方式暴露范围也是搜潜战术运用的重要参数。基于均方声压声纳方程修正了相关参数,得到了声能声纳方程各项参数定义,结合高斯束射线Bellhop模型,研究了吊放声纳主动方式暴露距离估算方法,针对潜艇两种声纳类型工作特性,进行了仿真和分析。仿真结果表明,在潜艇侦察声纳工作时,吊放声纳主动方式暴露距离明显加大。     

求解武器目标分配问题的改进粒子群算法

在建立多种类型武器目标分配模型的基础上,提出了一种求解该模型的改进粒子群算法。首先,定义粒子聚焦距离变化率,使惯性权重依据聚焦距离变化率自适应调整;其次,采用速度最大值线性递减的策略平衡算法收敛精度与全局寻优能力之间的矛盾;最后,粒子替换策略使算法改善了因自适应惯性权重的引入而造成收敛速度变慢的问题。仿真结果表明,提出模型和算法合理有效,算法收敛快,适合求解各种种群规模的武器目标分配问题。     

阵列增益下的最大听觉距离及算例分析

被动声定位技术已成为战场目标定位的重要手段,人-机一体化头盔式"电子哨兵"系统能够解决阵列信号处理低信噪比性能下降及人耳听觉距离有限的缺点。作为系统研发的理论基础,从声传播方程出发,研究了考虑阵列增益条件下的最大听觉距离。基于声传播方程,分析了声传播损失的计算方法,探讨了自由场情况下和存在阵列支撑物情况下阵列常规增益和阵列超增益的算法,最后通过算例对阵列处理提高人耳听音距离进行了说明,为人-机一体化"电子哨兵"系统研发提供了理论依据。     

基于NMPC的战斗机末端机动规避策略

利用非线性模型预测控制（nonlinear model predictive control,NMPC）的思想建立了战机末端规避导弹的机动策略求解方法。根据导弹与战机的空战态势,建立了导弹与战机的相对运动微分方程;将导弹的导引律引入到导弹运动模型中,与飞机模型一起构建了系统预测模型,并对飞机和导弹的运动约束进行了分析。通过对导弹结构限制和战术特性的分析,给出了飞机机动规避导弹的性能指标,进而建立了机动规避导弹的最优控制模型。利用高斯伪谱法对模型进行求解,采用滚动优化策略实现了对机动规避策略的闭环求解。针对导弹气动参数和导航比未知以及相对测量量具有噪声的问题,利用极大似然法对导弹的气动参数和导航比进行估计,实现了对系统预测模型的反馈校正。仿真结果表明,此方法能够实现对导弹的机动规避。     

基于虚拟脱靶量预测的准闭环校射方法

针对传统高炮大闭环校射脱靶量不易检测、可校射时间短暂,提出了一种基于虚拟脱靶量预测的准闭环校射方法。首先给出了弹丸双站角度测量的初始状态估计算法;其次,结合外弹道理论建立了一种虚拟等距脱靶量的预测模型,分析了射击校正量的估计方法与准闭环校射方案的实现流程。该方法避免了大闭环校射对脱靶量的直接检测,并提高了高炮闭环校射的时效性。     

尾流自导鱼雷最小开机距离及其应用研究

基于尾流自导鱼雷的制导原理、弹道和自导开机过程,提出了最小开机距离的概念。分析指出了影响尾流自导鱼雷最小开机距离的主要因素是设定的鱼雷深度、鱼雷的航行精度和目标运动参数散布等。建立了最小开机距离的计算模型,并在不同攻击态势下进行了仿真计算和统计分析,得出了有益的结论:在一定的攻击条件下,不同的设定深度、使用不同的鱼雷速制以及不同的目标运动要素误差、鱼雷航行精度,将使鱼雷的最小开机距离不同,即鱼雷的最小开机距离实际上是关于各种因素的函数。通过最小开机距离可以进一步计算出鱼雷自导开机的最大距离,若在工程中予以实现,将对提高潜艇攻击的隐蔽性和鱼雷作战效能具有重要意义。     

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     

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     

Parametric inference for component distributions from lifetimes of systems with dependent components

In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012