导弹制导控制与目标杀伤

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

普通物理实验CAI的制作设想

普通物理学实验是公共必修课,随着电子技术迅速发展,多媒体已被广泛的运用,使人机交互能力大大提高,它正作为一种重要的教学媒体迅速应用于教学过程中,对促进教学现代化起着十分重要的作用.因此,制作CAI课件使学生由被动学习变主动学习,并能加深学生对实验内容的理解,对实验现象的观察和规范学生的实验操作技能,从而达到有效提高教学质量和教学效率的目的.     

GPS双星航姿测量研究

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

燃气轮机的实时仿真及数据预处理

讨论了燃气轮机实时仿真及相应的数据预处理方法 ,利用容积惯性法建立了某型燃气轮机的实时仿真模型 ,在 5 86PC实现了超实时仿真 ,仿真结果和试验数据相符     

高速方尾水面舰船兴波问题计算方法研究

将Dawson型兴波阻力计算方法推广用于高速方尾水面舰船兴波问题计算,在计算中同时计入了尾封板0静压力、尾倾与下沉等因素的影响.以两高速方尾水面舰船为例计算了兴波问题,将兴波阻力计算值与剩余阻力模型试验值进行了比较,求出了相应的相关系数.结果表明,本方法可较好地求解高速方尾水面舰船的兴波问题,兴波阻力相关系数可用于修正理论计算结果,以提高计算精度.     

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

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

ARMA谱估计在导弹仿真系统数学模型验证中的应用

针对反坦克导弹系统动态过程仿真的输出具有短时序、低信噪比的特点 ,研究了应用ARMA谱估计验证导弹系统仿真模型有效性的方法 ,并结合某型号滚转稳定的反坦克导弹系统复杂模型的仿真数据和简化模型的仿真数据给出ARMA谱估计的应用结果。     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

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