战场损伤分析过程研究及其应用

以某型火炮为例,详细介绍了利用基本功能项目分析、损伤模式及影响分析、损伤树分析及损伤定位分析等技术进行战场损伤分析的过程,阐述了各技术在分析过程中相互支持的关系,说明了它们在损伤评估系统中的应用,最后指出了分析过程中存在的一些问题。     

关于小尺寸装药用炸药薄膜的研究

利用真空蒸镀技术对太安炸药薄膜及其在小尺寸装药上的应用进行了研究。实验表明利用真空蒸镀技术可以研制出性能优良的炸药薄膜 ;红外光谱分析证明太安在蒸镀前后没有发生质的变化 ;扫描电镜分析得出了太安薄膜的微观结构 ;太安炸药薄膜在小尺寸装药上的应用表明了该装药具有可靠的传爆功能。     

保障性分析在现役装备维修资源确定中的应用

针对我军现役装备维修保障资源建设中的弊端,分析了在现役装备维修保障资源确定中实施保障性分析的可行性,并介绍了与传统保障性分析的不同点及其主要流程,从而为我军现役装备维修保障的确定与配置实施提供了一个良好的思考方向。     

数字式相位差测量方法及精度分析

相位差变化率是最近提出的用于快速无源定位的观测量。该文研究相位差的高精度测量方法 ,提出了一种正交双通道数字式的相位差测量方法。通过对信号频谱的分析 ,计算了测量系统输出的信噪比 ,从而得出了相位差测量的理论精度 ,随后进行仿真分析验证了理论精度。理论分析和仿真实验证明 ,论文提出的方法可以实现高精度的相位差测量     

导弹制导控制与目标杀伤

采用协方差分析描述函数技术 (CADFT)对寻的导弹的制导精度进行了研究 ,提出了空气动力控制、直接侧向力控制的寻的导弹飞行末端的制导精度的一种新的解析模型 ,并研究了导弹直接碰撞杀伤目标的必要条件 ,该理论研究成果具有简单、实用、精度高的特点 ,为寻的导弹制导控制特性研究和揭示寻的理论普遍规律提供了一种新途径     

GPS双星航姿测量研究

提出用两部测量型GPS接收机 ,实时观测两颗以上GPS卫星在站心坐标系下的高度角、方位角和载波相位 ,来推算基线 (船体 )的航向和姿态 ,初步解决了整周模糊度的解算问题 .文中对影响航向和姿态准确解算的因素进行了分析 ,并提出了改进的办法 .     

燃气轮机实际简单循环熵产分析

针对燃气轮机实际简单循环,应用熵产分析,对循环各部件不可逆损失分配情况进行分析,并给出实例计算.结果表明,燃烧室不可逆损失最大,其次是排气过程.     

雷达情报特征的Bayes识别方法

根据雷达情报目标判性应用背景,对Bayes方法在该领域的应用进行了研究,初步建立了基于雷达情报特征的统计模型,并在算法的收敛速度和稳健性等方面与D-S证据理论进行了比较。仿真结果表明,Bayes方法对先验信息的精确程度要求并不十分严格,能较好地解决雷达情报综合问题。     

Network reliability assessment in a random environment

In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003