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

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

基于几何法和信息融合的2D雷达目标高度估计

在由 2 D雷达组成的雷达网中 ,首先用几何方法得到了 2个目标高度估计值 ,然后利用信息融合思想 ,在最小均方误差估计准则下得到了目标高度估计融合值及其方差表示。仿真计算表明 ,基于融合方法得到的高度估计较之只用几何方法得到的高度估计 ,性能得到了明显的提高。     

基于Tornado码的复制算法

面向Internet的分布存储系统具有数据种类多、数据量大、分布广泛等特点,为了提高分布存储系统的数据访问效率,提出了一种基于Tornado码的复制算法。与传统的复制算法相比,基于Tornado码的复制算法能够提供更高的可用性、持久性和安全性,并且具有更低的存储开销和带宽开销。     

IP组播技术及其在校园网上的应用

根据IP组播的原理,分析了组播通信的优点,并在此基础上提出了在校园网上实现组播通信的具体方法与过程,列举了一些实际的应用.     

国外军事侦察卫星的发展状况

介绍了国外侦察卫星的分类和发展,分析了目前世界最先进的侦察卫星的性能和特点,指出了其未来的发展趋势.     

试论GIS在城市规划中的应用

GIS作为近年来兴起的一门信息科学 ,在许多方面有着广泛的应用。本文在论述了城市规划一般原理的基础上 ,探讨GIS在其中应用的可能性及如何应用GIS为城市规划服务     

并行工程关键使能技术及其发展趋势

介绍了并行工程(ConcurrentEngineering,简称CE)的定义、基本原则、组成、驱动力和要素等,概要介绍了CE的部分关键使能技术。基于CE的理论研究与应用实践,给出实施CE的基本模式并进一步设想了CE的发展趋势。     

关于分形插值函数的积分

用反例说明在 [1 ,2 ]中关于分形插值函数的积分公式是错误的 ,并建立了关于分形插值函数积分的正确公式。     

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     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001