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

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

驻留内存技术在计算机通信中的应用

对坦克电台数据传输系统做了进一步探讨,重点研究中断服务程序的设计思想及内存驻留技术在计算机通信中应用的基本方法.     

网络中心战作战效能研究与应用

随着网络信息技术的发展,计算机网络在军事斗争中应用越来越多,网络中心战已成为一种新的作战概念和作战样式,实现了从消耗型作战向更快更有效的战争方式转变。在网络中心战特征分析基础上,建立网络中心战模型,主要研究了网络中心战的作战效能。计算实例表明,所建数学模型科学合理,效能分析方法可靠。     

航测平台计算机系统软件设计

根据航测平台系统计算机的功能要求 ,采用数据流图对航测平台系统软件进行了分析 ,对系统软件各模块进行了划分 ,确定了系统软件的设计方案 ,并在此基础上 ,完成了航测平台控制计算机系统软件的设计和实现 .     

火炮随动系统射击试验射弹数的自动控制

针对火炮随动系统射击试验中射击时机和射弹数难于人工控制的特点 ,讨论了利用火炮随动测试系统进行自动控制的可行性 ,分析了射弹数自动控制的误差。     

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

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用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