榴弹射表编拟新方法的试验验证

通过130加农炮射击试验,利用降阶刚体弹道方程,采用参数微分法提取阻力系数曲线,对18°射角进行编表符合计算,进而对榴弹射表编拟新方法进行了验证。     

对称螺杆流量计转子热变形的综合分析

利用有限元理论对８０ｍｍ口径的对称螺杆流量计转子的热变形进行了综合分析．整个计算程序分为平衡和非平衡两套系统．通过计算转子的热变形,推导出热变形对转子泄漏和运转等方面的影响．最后得出对生产有指导意义的具体数值和具体方法．     

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     

迟滞非线性弹性元件动力特性数学模型

描述了迟滞非线性弹性元件动态特性数学模型的发展状况．详细介绍了理想干摩檫模型、双线性模型、Bouc模型和迹法模型．提出了评判数学模型优劣的标准．     

弹炮结合防空武器系统机动生存能力模型研究

从弹炮结合防空武器系统通过机动作战提高生存能力的角度出发,结合防空武器系统机动作战过程中的战术背景,提取了该过程中决定防空武器系统生存能力的决定性要素,然后分析了该过程中影响防空武器系统生存能力的总机动时间、被发现概率、抗击成功率、被毁伤概率等各项指标的特点,在此基础上建立了用于研究该过程的数学模型,最后给出实例进行了仿真计算,通过对计算结果的分析,证明了该模型的有效性,从而为防空兵机动作战模拟提供了一定的参考.     

网络中心战中的协作及其量化模型研究

协作是网络中心战的原则之一.协作的概念及其量化模型是目前网络中心战研究中的一个热点.在详细解释了信息时代中协作的概念基础上,分析研究了协作的维以及网络中心战中的信息域和认知域的协作,指出协作既有利也有弊.进而,将协作的影响简化为协作对完成作战任务的时间上的影响.利用信息熵量化了协作带来的"正影响",利用Logistic方程量化了协作带来的"负影响",综合这两种影响给出了简化的协作量化模型.最后指出了该模型适用于量化诸如防空作战中的协作等时间关键的协作.