大流量气体减压器振动问题研究

对大流量气体减压器工作过程中的振动故障进行分析,建立了减压器系统动态数学模型,进行了故障数值仿真,找到了简单有效的提高减压器输出响应稳定性的方法--减小控制腔入口面积,并得到试验验证.仿真结果还表明,大流量气体减压器的振动问题不仅和减压器本身设计参数有关,还和下游管路容积有关.     

社会计算实验动态仿真引擎的研究与实现

应对新形势下非常规突发事件的严峻挑战是各国政府亟待解决的问题,综合人工社会-计算实验-平行执行的ACP方法,是解决非常规突发事件应急管理问题的有效方法.本文引入ACP方法,阐述构建高性能社会计算实验动态仿真引擎的作用;按照层次化模块化思想设计动态仿真引擎D-PARSE的体系结构,详细描述各组成部分的具体功能,并基于并行...     

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     

一种空气加热器的三维流场数值仿真

为进行超燃冲压发动机试验,设计了空气加热器,对其内部流场进行了仿真并与热试车结果进行了比较验证;计算结果表明,所设计的加热器在结构方案和总体性能方面基本满足设计要求,喷注器喷入的空气降低了冷却面板的温度,燃烧室轴向入口空气能有效保护燃烧室内壁,仿真结果对于加热器的改进设计也起到一定的指导作用.     

HF化学激光器燃烧室中燃料配比的数值分析

利用最小自由能法及质量流量守恒原则,对HF化学激光器的NF3-D2-He体系的化学平衡组分进行了计算,提出了F原子摩尔流量密度参量,分析了各输入气流的流量调节对燃烧室总温、总压、F原子产率等的影响.在燃料配比不变的情况下,总流量的增加使得F原子流量也成比例增加,而由此带来的总压升高引起的F2解离度、绝热燃烧温度、F原子...     

基于参数稳态判定的两阶段序贯仿真分析策略

两阶段序贯分析方法是仿真(模拟)实验研究中的一种常用方法,它虽然可以通过控制实验给出符合精度要求的结果数据,但以其现有形式有时却无法避免冗余计算的存在和实验过早终止的可能.在回顾了现有终态仿真解算终止策略特点的基础上,分析了所需样本总数的估计值与当前可用样本间的变化关系,提出了一种基于参数稳态判定的改进两阶段序贯方法....     

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     

数学模拟中产生正态随机数的方法研究

针对在火灾烟气和其他气态物质扩散的模拟研究中经常遇到正态分布的随机数的产生问题进行研究,探讨了特殊分布随机数的产生方法。特别给出了正态分布随机数的产生算法及其代码,并进行了验证。结果表明了所述产生正态随机数算法的可行性和可靠性。     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007