Investigating the Desirability of Navy Aircraft Service Life Extension Programs

Building on prior work on optimal replacement of aging aircraft, this paper presents three methodologies to evaluate prospective aviation Service Life Extension Programs (SLEPs) and applies these methodologies to US Navy F/A-18E/F data. While considerable uncertainty remains as to the values of key parameters (e.g. the cost of F/A-18E/F SLEPs), the preponderance of the evidence available at this juncture favors undertaking SLEPs on F/A-18E/Fs rather than replacing them with new Joint Strike Fighters.     

基于FEM/SPH算法的弹丸侵彻土体数值模拟

基于有限元法(FEM)和光滑粒子流体动力学(SPH)结合的算法,用数值模拟了钢质弹丸对钢筒约束土体的侵彻过程。基于ANSYS/LS-DYNA显式动力分析和LS-PrePost后处理软件,形象再现了钢质弹丸冲击作用下土体飞溅形成漏斗坑和直线通道的物理过程。侵彻深度计算结果与实验数据吻合较好,钢质弹丸的速度和加速度时程曲线图与理论分析一致,体现了FEM/SPH算法的精确性。研究结果表明FEM/SPH算法在模拟侵彻土体方面具有可行性和有效性。     

N2O/C7H8单喷嘴燃气发生器试验研究

以基于N2O/C7H8的燃烧驱动混合型气动CO2激光器点火试验为研究背景,设计了液态N2O供应系统及N2O/C7H8单喷嘴燃气发生器.对液态N2O供应系统、N2O/C7H8的点火及燃烧性能进行了研究.试验结果表明:设计的N2O供应系统能够实现液态N2O的稳定供应;在设定的时序下,两个设计工况(余氧系数分别为0.3和0....     

低温推进剂供应管道系统充填过程的动力学模型

研究了低温推进剂液体火箭发动机供应管道系统充填过程的建模问题。低温推进剂的充填相变过程采用均相模型,对推进剂充填管道系统进行有限元分割,应用基本守恒定律于充满推进剂的单元和充满气体的单元,两相单元采用等效流容方程,建立了低温推进剂管道充填过程的有限元状态变量模型。充填的容腔视为两相单元,建立了其动力学模型。利用本文的模型,对液氢、液氧推进剂的管道充填过程进行了仿真计算,给出了有关计算结果。     

红外/雷达传感器协同跟踪算法研究

通常情况下 ,主动传感器在检测到目标之前就暴露了携带它的飞行器 ,因此 ,在作战环境下 ,限制主动检测设备的使用是必要的。被动传感器工作时具有隐蔽性 ,在现代军事跟踪系统中起着重要作用。研究了红外 /雷达的协同跟踪 ,以满足跟踪精度和隐蔽性双重要求     

综合飞行/火力控制系统性能评价

详细介绍了综合飞行 /火力控制系统 (IFFCS)性能评价的方法。该方法把评价过程分为单元评价、组合评价和系统性能评价 ,将系统性能指标逐层分解 ,以保证闭合系统最终能完成自动攻击任务。以高性能控制系统仿真软件MATTRIXX6 .0为平台 ,按此方法开发的评价软件获得了用户的认可     

IP组播技术及其在校园网上的应用

根据IP组播的原理,分析了组播通信的优点,并在此基础上提出了在校园网上实现组播通信的具体方法与过程,列举了一些实际的应用.     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998