电子时间引信时间精度分析及试验研究

介绍了影响电子时间引信定时精度的诸因素,包括时基振荡源精度、电源启动时间、复位延时、环境温度、电路参数的变化及装定器精度等。结合某型电子时间引信的生产定型试验,对该引信进行了定时精度的试验,并按照国军标的要求将试验数据分析处理,试验结果达到了预期目的。     

一类具有免疫时滞和病毒颗粒的HIV模型的动力学性态分析

考虑感染细胞的治愈和未感染细胞吸收作用的影响,研究一类具有免疫时滞和病毒颗粒的HIV模型,通过分析特征方程研究平衡点的局部稳定性,利用规范型理论和中心流行定理得到确定Hopl分支方向和分支周期解稳定性的计算公式,并通过构造Lyapunov泛函,讨论未感染平衡点的全局稳定性．     

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     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

环形区域极点/协方差约束下的模型简化设计

提出离散随机系统模型简化的一种新方法,即环形区域极点／协方差约束下的模型简化方法。这种设计方法的基本思路是构造指定维数的降阶模型,使其匹配给定的环形区域极点和稳态协方差参数,在系统的动态特性和稳态特性方面逼近给定的满阶模型。文中导出了期望的简化模型的存在条件及解析表达式,并提供了一个数值算例。     

一类伴随型非线性系统的快速变结构控制

基于反馈线性化、时间次优控制及变结构控制理论,针对一类伴随型不确定非线性系统,提出了一种快速鲁棒变结构控制方案。这种控制方案在控制有约束的条件下,其中一部分用来把非线性系统反馈校正成线性系统,另一部分则用来为线性系统实现时间次优控制。仿真结果表明：这种控制器不仅动态响应快,而且从初始时刻开始就可产生滑模运动,从而增强了系统鲁棒性。     

火场中A3钢的晶粒度与燃烧时间和温度关系的研究

本文模拟典型火灾温度－时间曲线,对热轧成的Ａ３钢进行受热处理,测定在不同燃烧时间和温度下Ａ３钢的晶粒度,给出了Ａ３钢的晶粒度与燃烧时问和温度之间的定量关系,提出了通过测定Ａ３钢晶粒度的大小来鉴定火场中不同部位的燃烧时间和温度的科学方法     

“打击时敏目标”任务的Petri网建模方法

对武器装备体系而言,作为现代战争中的重要样式"打击时敏目标"任务可分为获取时间窗口和利用时间窗口打击目标两个阶段。首先分析了打击时敏目标任务的过程,然后提出使用广义随机Petri网(GSPN)描述时间窗口的获取过程的方法,引入了负位置和负令牌的概念,最后提出用改进的GSPN描述利用时间窗口打击目标的过程的方法,并建立了一个"打击时敏目标"任务的Petri网模型。     

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

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

态势估计中的二维模糊空间知识处理

空间推理是态势估计中的一个重要组成部分。针对海战态势估计的要求,建立了模糊确定性下二维空间点、区域,以及几种对态势估计中常用的空间关系的数学模型和用来确定空间关系的计算方法。