一类非线性问题的数值分析

利用Ｌａｐｌａｃｅ方程的基本解,将变系数非齐次Ｈｅｌｍｈｏｌｔｚ偏微分方程的边值问题化为积分方程问题。再用边界无法进行离散,并对区域结点及边界结点的方程耦合求解。文末算例表明本文方法能够达到较高精度。     

装备采购与部署的系统动力学模型

在研究装备采办全过程的基础上,利用系统动力学仿真方法和“龙格-库塔”(Runge-Kutta)基本算法,重点对采购与部署子系统进行了建模和计算机仿真,在具体仿真结果输出的基础上,分析了影响装备采购与部署效率的因素,对装备如何尽快形成新的战斗力进行了简要的分析。     

压力容器裂纹寿命预测的概率分析方法

本文在文献的基础上,进一步考虑材料性能分散性和使用环境随机性的影响,用概率分析方法对有裂纹的压力容器进行安全性分析,阐述了其可靠度指标和失效概率的分析计算步骤。并用Monte-Carlo方法预测裂纹扩展寿命,从而为正确确定压力容器的运行方式及合理的修理间隔期提供了重要的技术依据。算例证明了该方法的合理性、可行性。     

The quadratic minimum spanning tree problem

This article introduces a new optimization problem that involves searching for the spanning tree of minimum cost under a quadratic cost structure. This quadratic minimum spanning tree problem is proven to be NP-hard. A technique for generating lower bounds for this problem is discussed and incorporated into branch-and-bound schemes for obtaining exact solutions. Two heuristic algorithms are also developed. Computational experience with both exact and heuristic algorithms is reported.     

透平叶片的可靠性安全系数设计法

本文基于目前的蒸汽透平叶片振动强度设计准则,提出了可靠性安全系数设计法,给出了一些计算公式,并简要介绍了该方法在叶片设计中的应用。     

一种电路模块故障诊断的实现方法

在分析电路模块故障诊断特性的基础上,本文利用表结构表示推理规则,以框架结构组织规则库,为快速孤立故障,将症状按其检测的难易程度划分类别,并由检测点的选择准则确定下一个能有效孤立故障的检测点,该方法在“电子装备模块级故障诊断系统”和某装备测距系统与搜索系统的实际故障处理中得到了应用,并证实了其有效性。     

一类非正态误差下的AR模型定阶研究

对一类非正态误差的AR模型,在待定阶数P的情况下,给出误差项中未知实函数依概率有界的定理,可把非正态误差转化为正态情况。最后运用正态误差下AR模型的方法确定阶数和参数,并给出一个算例。     

军用软件产品评价的工程化实现方法

根据目前军用软件产品的评价需求,探讨了第三方评测机构在实施软件测试后,按照软件的自身特点,利用军用软件质量模型进行评价的可行性方法。通过确立评价需求、规定评价、设计评价、执行评价、做出评价结论等步骤详细描述了该方法,并给出软件的评价实例。该方法能对软件做出较为客观的评价,较好地满足了军用软件产品的评价需求。     

电子对抗环境下飞机编队突防能力模型

现代战争通常在电子对抗的复杂环境下进行,对电子对抗环境下飞机编队突防能力进行建模研究.首先运用模糊数学的方法对雷达电子对抗的效果进行了分析,重点从干扰频率、干扰功率、干扰时机、干扰样式、信号环境因素5个方面研究了雷达电子对抗的干扰效果,然后运用解析法对飞机编队在雷达电子对抗环境下对地空导弹、防空高炮防御体系的突防能力进行计算,得到了关于飞机编队在电子对抗环境下突防能力的定量结果.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010