An optimized gas chromatographic determination of priority pollutant phenols

Priority pollutant phenols are determined by gas chromatography on an SE-30 WCOT column using hydrogen carrier and flame ionization detection with dual internal standards. Linear responses over ranges ca. 12–125 ng per component are achieved and detection limits at or below 1 ng are obtained. Carrier flow and temperature program are optimized to maintain baseline resolution while affording an analysis time of less than 15 minutes.     

基于MSM输入输出排队交换结构的调度算法研究

信息网络的传输宽带化和业务多样化需求给交换结构的可扩展性及性能提出了更高的要求.基于MSM(Memory-Space-Memory)输入输出排队交换结构进行研究,通过对交换网络内部拥塞调度机制进行深入分析,在保障调度公平性的基础上,提出一种严格匹配输出调度过程的SM-RR(Strict Matching algorithm based onRound-Robin)算法.与现有典型算法相比,该算法无需加速比即可获得较高的性能.     

Mean queue size in a queue with discrete autoregressive arrivals of order <Emphasis Type="Italic">p</Emphasis>

We consider a discrete time single server queueing system where the arrival process is governed by a discrete autoregressive process of order p (DAR(p)), and the service time of a customer is one slot. For this queueing system, we give an expression for the mean queue size, which yields upper and lower bounds for the mean queue size. Further we propose two approximation methods for the mean queue size. One is based on the matrix analytic method and the other is based on simulation. We show, by illustrations, that the proposed approximations are very accurate and computationally efficient.     

On the Analysis of the Virtual Waiting Time in Open Queueing Networks

The model of an open queueing network in heavy traffic has been developed. These models are mathematical models of computer networks in heavy traffic. A limit theorem has been presented for the virtual waiting time of a customer in heavy traffic in open queueing networks. Finally, we present an application of the theorem—a reliability model from computer network practice.     

Almost sure comparison of birth and death processes with application to M/M/s queueing systems

Given conditions, which concern the infinitesimal parameters of two birth and death processes, the processes are constructed on the same probability space such that one process is almost surely larger than the other. Application is made to M/M/s queueing systems. Stochastic comparisons of queue length and virtual waiting time in two M/M/s systems are obtained.     

GI／G／1系统队长的极限分布

关于GI／G／1排队系统队长的极限分布存在的一个充分条件被建立．     

Analytic study of multiserver buffers with two-state Markovian arrivals and constant service times of multiple slots

In this paper, we study the behavior of a discrete-time multiserver buffer system with infinite buffer size. Packets arrive at the system according to a two-state Markovian arrival process. The service times of the packets are assumed to be constant, equal to multiple slots. The behavior of the system is analyzed by means of an analytical technique based on probability generating functions (PGF’s). Explicit expressions are obtained for the PGF’s of the system contents and the packet delay. From these, the mean values, the variances and the tail distributions of the system contents and the packet delay are calculated. Numerical examples are given to show the influence of various model parameters on the system behavior.     

Stability of a priority queueing system with customer transfers

This paper is concerned with the stability of a preemptive priority queueing system with customer transfers. Conditions for the queueing system to be stable/unstable are found. An interesting result is that the stability/instability conditions are independent of the service rates of lower priority customers and the transfer rates.