新世纪自动喷水灭火系统应用技术发展探讨

探讨自动喷水灭火系统面向新世纪的应用技术,一是提出向综合性和可靠实用性方向发展,二是介绍并展望喷头技术的发展,三是提出自动喷水灭火系统应用中要解决的几个问题.     

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

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

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

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

双DSP技术在无线分组网络路由控制器中的应用

介绍了双DSP技术在无线分组网络路由控制器中的应用,阐述了双DSP间通信方案的选择及双DSP系统的实现,提出了一种双DSP对多个串行通信控制器(SCC)的设计方案,并给出了具体的硬件、软件设计方法.     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

多媒体技术在教学使用中的若干问题

多媒体技术作为一种现代化信息技术手段,已广泛应用于教育的各个领域,在高校教学中的地位日渐提高,但在实际应用过程中,由于多方原因不可避免会出现一些技术及管理方面的问题。本文立足教学实践,对多媒体技术在使用过程中存在的普遍性问题进行了分析,并进一步提出了具体的改进措施。     

HLA在C3I系统仿真中的应用

首先介绍了C3I系统仿真的特点,以及高层系统结构HLA的思想,并对其在C3I系统仿真中的应用作了初步的讨论     

按优先级分层网络路由算法

讨论了 C3I通信子网的路由算法。在提出了通信延迟量概念基础上 ,考虑到 C3I通信子网各站点的通信重要度不同 ,提出了一种路由算法。从军事指挥体制及区域划分出发 ,文中还给出通信子网采用分层管理的路由计算方法。本算法对C3I通信子网的管理设计有参考价值     

"道尔-M1"防空导弹武器系统

介绍了俄罗斯“道尔 M1”防空导弹武器系统的功能、组成、特点和作战过程 ,并从武器系统的总体需求出发 ,介绍了其两部雷达所应用的主要技术。     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998