基于神经网络的库存枪弹储存寿命预测研究

对某型单基发射药库存枪弹的理化性能、内弹道性能变化规律和储存寿命进行了初步研究。分析了库存枪弹储存寿命的影响因素 ,建立了库存枪弹储存寿命和影响因素变化规律的神经网络模型 ,并用此模型预测了库存枪弹的储存寿命。     

用相位梯度法校正超宽带雷达系统的相位误差

线性调频 (LFM)信号体制的超宽带雷达 (UWBR)系统的相位误差 ,会影响雷达系统脉冲压缩的结果。本文提出的相位梯度 (PG)算法 ,能够有效地估计系统相位误差 ,改善脉冲压缩的性能。     

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     

动圈式永磁直线直流电机的精英保留多种群遗传优化算法

为了实现陆基无人机电磁弹射器高机动性及其直线弹射电机的高功率密度,针对动圈式永磁直线直流电机,提出精英保留的多种群遗传算法(Multi-Population Genetic Algorithm with Elite Retention, MPGAER)的电机最大功率密度优化方法。以磁通密度和电流密度为约束条件,利用其搜索能力强、收敛速度快的特点优化电机的结构参数,并与磁路法初始设计结果和传统遗传算法优化结果进行比较。结果表明:与磁路法初始设计相比,MPGAER能使电机质量减少6.25%,功率密度提高10%,电机动态性能得到提高;MPGAER优化设计的电机功率密度高于遗传算法设计结果,所提方法有效地解决了在优化过程中出现易收敛于局部最优点和寻优效果差的问题。     

压水型核反应堆功率控制系统的优化设计

在分析了压水型反应堆功率控制系统的前提下,针对其特殊的控制要求,运用基于输出反馈的次最优控制的设计方法和Matlab中的NCD模块,最终实现了系统的优化设计,并对系统进行了某一功率水平下的仿真试验和其它工况下的鲁棒性试验.结果表明,改进后的系统性能有了较大改善.