硅整流无刷发电机供电系统动态性能的研究

分析了坦克的供电系统中采用硅整流无刷发电机时的工作特点,建立了这种系统的数学模型,举例说明了计算方法,并在文章的最后进行了评价.     

ET:一种能耗有效的高性能嵌入式处理器

随着标准和算法的不断演进,高端嵌入式应用对性能和能耗提出了越来越高的要求.然而,能耗问题成为将VLSI潜力转换为实际应用需求的最大挑战,基于此,提出ET( Embedded Tera-scale Computing)处理器设计.ET以众多轻量级处理器(称为小核)来搭建目标处理器,每个小核都是一个基于显式数据和指令管理的...     

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

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

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

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

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     

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

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

核磁共振研究溶胀AB-交联聚合物中的分子运动

测定了溶胀的PPU/PSAB 交联聚合物中链段和侧基的13CT1和NOE ,用VJGM模型和三等价位跃迁内旋转、扩散内旋转以及等价、不等价两位置跃迁内旋转模型分析了其中的主链链段运动和侧基内旋转运动 ,求出了主链和侧基的运动相关时间、扩散系数和活化能等参数 .结果表明PS含量对PPU运动的影响极小 ,PS主链运动活化能与PPU含量存在线性关系 .丙烯酸与苯乙烯共聚对PPU的运动几乎无影响     

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

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

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