中子增殖研究

导出了一个新的中子增殖公式,公式简明,计算量小.经与传统的增殖公式进行比较,后者由于未考虑缓发中子效应,只能用于定性分析.新导出的中子增殖公式较精确地描述了中子的增殖过程,可用于定量计算与分析.     

基于模糊时间序列的时变动态系统模糊建模

要想建立结构不确定、参数时变的动态系统的模型是很困难的。改进了Song Chisson的模糊时间序列方法,并成功应用于时变动态系统的辨识与建模和自适应控制。仿真结果表明该方法计算量小,实时性好,能很快地跟踪系统的变化。     

MS860动态测姿试验精度分析

为了评估动态MS860型GPS姿态测量性能,将其安装在某船上进行系统测试.采用动态滤波的方法采集MS860姿态信息,同时同步采集某型平台罗经的数据.在此基础上,用误差统计方法评估姿态测量系统的精度性能.结果表明GPS姿态测量系统可以满足舰船姿态测量的需要,其航向的测量精度优于平台罗经系统.     

复波速在挠性胶管动态特性研究中的应用

针对挠性胶管管壁的粘弹性,提出了复波速的概念,并将其应用于挠性胶管现有的动态特性理论中,分别建立了挠性胶管瞬态响应和频率响应的模型,说明了挠性胶管衰减管中液体介质压力脉动和流量脉动的原理并解释了现有的现象,得出了一些新的结论.此外,还指出了该方法目前存在的不足及今后的研究方向.     

提高负重轮橡胶动态性能的研究

介绍了提高负重轮橡胶动态性能的研制情况,在传统的胎面胶配方基础上,通过试验确定主体生胶类型,通过调节补强填充体系和硫化体系的不同,研究混炼胶的物理性能和动态性能。结果表明,采用软、硬质炭黑并用的胎面胶,其力学性能可满足使用要求,定伸应力和抗疲劳性能有较大提高,动态生热明显降低,耐老化性能也有较大提高。     

结合动态时间弯曲与决策树方法的液体火箭发动机故障诊断

对某大型液体火箭发动机的热试车数据及通过发动机模型仿真得到的故障数据进行动态时间弯曲分析,得到弯曲路径集,然后结合决策树方法进行了故障检测和诊断。对于故障试车没有出现漏报警和误报警,对于正常试车没有出现误报警。通过与神经网络、支持向量机等方法所得结果的对比,证明该方法可以成功地应用于火箭发动机的故障检测和诊断。     

动态拉伸实验数据处理方法的改进及应用

通过对反射式霍普金森拉杆实验技术进行分析,发现加载杆和承压环之间配合不够紧密时,在加载波到达承压环处可能出现影响实验结果的干扰信号。为了修正实验测试结果,编写了带有修正功能的实验数据处理程序对实验数据进行修正处理。利用带修正功能的数据处理程序对一种铝合金的动态拉伸实验结果处理,结果表明,新的数据处理程序得到的结果是合理的。     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006