脉冲等离子体推力器羽流的粒子模拟

目前微小卫星正在积极地发展中,脉冲等离子体推力器是其推进系统的一个重要发展方向,为了能够将PPT成功地运用于空间,需对其羽流进行研究.将DSMC(Direct Simulation Monte-Carlo)/PIC(Particle in Cell)流体混合算法与一维MHD放电模型相结合,一体化模拟NASA Glenn PPT羽流,对不同出口偏转角的羽流场进行模拟,并与实验结果进行了比较.计算结果显示引入出口速度的偏转角提高了模型的羽流扩散能力,羽流的扩散角是影响羽流的一个主要因素.     

基于DSP+FPGA的导航计算机数据采集与处理硬件设计

根据捷联惯导系统中数据采集和运算处理的要求,提出了以高性能DSP为核心,由FPGA构成主要外部输入输出接口的导航计算机硬件设计方案;设计了I/F转换电路;给出了各电路的硬件结构框图和各器件的特性、选择与应用。从硬件方面分别讲述了FPGA和DSP的工作过程和功能。利用本方案,对实现军事和工程领域中导航系统微小型化、降低系统成本和体积具有重要意义。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

Spalart-Allmaras湍流模型在高超声速气动加热计算中的应用

将AUSM+格式与LU SGS隐式迭代相结合,采用一方程的Spalart Allmaras湍流模型和二阶迎风MUSCL格式,研究了火星"探路者号"实验模型在10马赫来流条件下的气动热问题。采用量热完全和热完全两种气体模型的计算结果与实验数据进行了比较。热完全气体模型模拟的热流分布规律与实验吻合较好,但是对分离区的热流估计过高。在网格合理划分,尤其是满足近壁面的网格分辨率要求的前提下,该方法能够合理反映高超声速流场除分离区以外的气动热特性。     

姿控发动机脉冲工作的管路瞬变特性

采用有限差分格式的特征线方法 ,对某姿控推进系统发动机真实推进剂管路在脉冲工作情况下的瞬变特性进行了数值研究 ,对影响发动机多次脉冲启动的重要参数进行了定量计算 ,对比分析了试验结果与计算结果的一致性。说明该方法可方便地对包括许多管路、阀门和推力室的复杂系统进行动态性能分析 ,所得结果对于液体火箭发动机管路工程设计具有重要参考价值     

地炮营通信系统载波监听／碰撞检测仿真分析

给出某地炮营通信系统信息传输的CSMA／CD(Carrier Sense Multiple Acces／Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案     

信息战战场分析模型

根据区域攻防的不同战场信息行动,建立3个非线性微分方程模型.以防御方的总射击速率和战斗力消耗率作为评价指标,着重探讨了进攻方的指挥控制系统、侦察监视系统、战毁评估系统和火力系统之间的性能匹配关系.     

Performance analysis of queue length monitoring of M/G/1 systems

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, d_u) and (lower control limit, d_l), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011