对空向量瞄具设计

给出了对空向量瞄具的设计计算方法,并对一个实例进行了详细的分析。     

稳像式火控系统实车训练装置的研制

该训练装置可以在安装稳像式火控系统的坦克上完成射击基础练习的训练与考核.它以单片机为核心,在射击操作与实车相同的条件下,具有自动检靶,自动记录发射数、命中数,自动变换目标,自动报警,自动评定和显示成绩等功能.射手可独自在坦克内操作,自行开始练习,自我检查操作结果.     

防空兵武器装备发展论证专家系统的开发

首先阐明了防空兵武器装备发展论证专家系统开发的目标任务和建造原则,然后建立了专家系统的一般结构,并论述了系统开发过程中的问题定义与系统分析、知识获取、知识表示、软件实现、系统测试与评价等各个环节所应完成的任务,指出了在专家系统开发过程中潜在的主要问题。对于建立一个完备的、权威的防空兵武器装备发展论证专家系统有一定的指导意义。     

相似系统间调整因子的量化方法

探讨一种便于操作、系统而量化的方法 ,以预计新研系统的可靠性参数。在相似设备法的基础上 ,提出了利用可量化的调整因子对相似系统的可靠性参数进行转换的方法 ,有效地提高了相似设备法的可操作性和分析精度 ,对研究相似设备法在工程技术领域的应用也具有一定的参考价值     

建立和完善武器装备采办监督约束机制

分析了当前我军装备采办过程中采办监督机制存在的主要问题 ,讨论了建立有效装备采办约束机制所应遵循的一些基本原则 ,并就建立有效的装备采办监督约束机制所应开展的工作提出了比较全面的观点。     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

应用虚拟检测技术开发的舰艇机电设备通用测试分析仪

针对舰艇机电设备复杂 ,需要监测的参数数量大、种类多等实际情况 ,研制了一种通用测试分析仪 .该仪器采用虚拟检测技术 ,功能全面、携带方面、经济可靠 ,具有较高的推广价值和应用前景 .     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

论装备保障信息资源管理

根据信息资源管理的基本理论给出了装备保障信息资源管理的定义和基本要求 ,针对我军装备保障信息资源管理中存在的问题 ,提出了初步的改进设想