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

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

潜艇耐压壳动力学响应和声辐射研究概况与趋势

论述了流场中潜艇耐压壳自由振动、受简谐力或力矩作用和受冲击载荷情况下的动力学响应和声辐射研究概况 ,讨论了带有阻尼材料的复合潜艇耐压壳的动力学和声辐射研究情况 ,以及阻尼材料的破坏研究概况 ,并指出了今后的研究方向     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

钢丝绳联轴器的性能试验及数学模型

对钢丝绳联轴器进行了动刚度性能实验 ,在此基础上建立了数学模型 ,并进行了参数辨识 ,指出钢丝绳联轴器具有强非线性 ,对减小轴系扭转振动具有良好的效果     

坦克抢救车数量的确定方法

在对装甲团典型战斗的特点进行分析的基础上,应用概率论的数学方法,提出了在典型战斗中后送战损坦克所需坦克抢救车数量的新的确定方法,该方法为装备保障指挥员的有效指挥提供了技术基础.     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

环形串联直缸发动机配气系统设计

环形串联直缸发动机具有功率密度高、惯性力小等诸多优点,但其运行时气缸转子始终绕输出轴周向转动,使得传统发动机静态的配气方法不再适用。因此,研究设计一种能够满足该型发动机进排气需求的新型配气系统意义重大。针对该型发动机独特的环形串联结构和差速运动特性,研究了各转子气缸的容积变化规律,分析了各转子气缸进排气相位与转子转角之间的关系,创新设计了一种基于气道复用的动态位置配气系统。根据二冲程发动机配气方案设计加工了配气系统零部件,并通过高压气动实验完成了对该型发动机的动态进排气过程。实验结果表明,当给定外加驱动气压0.25 MPa时,发动机能够以约200 r/min的速度稳定运转,有效验证了该配气系统的可行性。