一种循环队列的判定定理

首尾相接的循环队列是一种动态的数据结构。本文给出了在并发进程环境下,使用循环队列的判定定理,本定理已在银河机软件实现中得到应用。     

The effects of information on a queue with balking and phase‐type service times

This article generalizes the models in Guo and Zipkin, who focus on exponential service times, to systems with phase‐type service times. Each arriving customer decides whether to stay or balk based on his expected waiting cost, conditional on the information provided. We show how to compute the throughput and customers' average utility in each case. We then obtain some analytical and numerical results to assess the effect of more or less information. We also show that service‐time variability degrades the system's performance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于1553 B总线的半实物仿真系统

1553 B总线在半实物仿真系统中得到了广泛的应用。通过研究半实物仿真原理及1553 B总线协议,设计了1553B总线控制器与远程终端软件,提出了一种能很好地节省总线资源的消息帧设计方法。通过实例讨论了基于1553 B总线的半实物仿真系统的建模方法。     

Problem of the reference height of the projectile trajectory as a reduced meteo-ballistic weighting factor

This paper deals with the issue of preparation of the aiming angles with the use of tabular firing tables and needed determination of the ballistic elements μ_B (ballistic wind w_B, w_xB, w_ZB, ballistic (virtual) temperature τ_B, ballistic density ρ_B) from the standardized met messages. The weighting factors are used for the calculation of ballistic elements μ_B that are incorporated into the trajectory calculations characteristics of weapon and ammunition. Two different methodologies practically used in the praxis are analysed and compared. For the comparison of the two methodologies the reference height of trajectory determined from the weighting factor functions is employed. On the basis of the analyses conducted, the potential for further increase in accuracy of these aiming angles preparation methods is pointed out.     

Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

工作站网络并行计算的性能分析

本文介绍了异构工作站网络环境下一种新的并行计算性能评价标准。应用该标准分析了在四台异构的ＳＧＩ工作站上浅水波方程并行计算的性能     

多目标通道地空导弹武器系统抗击效率模型

针对多目标通道地空导弹武器系统的战术技术使用特点,基于地空导弹射击原理和随机服务系统理论,给出了多目标通道地空导弹武器系统抗击(服务)过程的排队模型,建立了多目标通道地空导弹武器系统抗击效率运算的数学模型,并进行了实际的算例分析。     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

Note: Minimizing the variability of the waiting times in a globally gated elevator polling system

A polling system comprising n queues and a single server is considered. Service is performed according to an elevator scheme under the globally gated regime. The problem of arranging the channels to minimize a measure of the variability of the waiting times is addressed. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 605–611, 1997