混合判断矩阵排序方法研究

本文介绍了混合判断矩阵及完全一致性混合判断矩阵的概念，提出了混合判断矩阵排序的一种最小偏差法，并给出了其收敛性迭代算法，最后通过算例说明了方法的可行性。     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

层次分析中广义最小偏差法的性质

广义最小偏差法（GLDM）是层次分析中一种重要的排序方法．本文讨论了广义最小偏差法的性质和灵敏度分析问题．     

Degradation of 4-chlorophenol in aqueous solution by γ-radiation and ozone oxidation

The application of radiation technology in the en-vironmental protection was listed as one of the mostimportant research fields by the International AtomicEnergy Agency (IAEA) for the peaceful use of nuclearenergy. It has great research value and potential appli-cation. Because of their broad-spectrum antimicrobialproperties, Cholophenols (CPs) have been used aspreservative agents for wood, paints, vegetable fibersand leather and as disinfectants. In addition, they havebeen widely employed…     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.     

An extension of Tanner's results on uncontrolled intersections

A delay formula is developed for the problem, analyzed by Tanner in 1962, where two streams of traffic have conflicting demands at an intersection. The situation is such that the major stream has absolute priority and the minor stream vehicles can only enter the intersection when sufficiently large gaps appear in the major stream. This paper extends Tanner's work by considering a generalised stochastic structure on the arrival streams. The paper also links Tanner's work to other papers of this author where the utilitarian value of this generalised model has been established in a wide range of traffic problems.     

多星测控调度问题任务优先级研究

在对多星测控调度问题工程需求进行分析的基础上,提出了多星测控问题中影响测控任务优先级的10个影响因素,并对各项因素对测控任务优先级的影响方式与影响程度进行了分析.利用功效系数法给出了设定优先级的算法,最后给出了一个算例.     

Analysis of a time-limited service priority queueing system with exponential timer and server vacations

We consider a multi-class priority queueing system with a non-preemptive time-limited service controlled by an exponential timer and multiple (or single) vacations. By reducing the service discipline to the Bernoulli schedule, we obtain an expression for the Laplace-Stieltjes transform (LST) of the waiting time distribution via an iteration procedure, and a recursive scheme to calculate the first two moments. It is noted that we have to select embedded Markov points based on the service beginning epochs instead of the service completion epochs adopted for most of M/G/1 queueing analyses. Through the queue-length analysis, we obtain a decomposition form for the LST of the waiting time in each queue having the exhaustive service.      

Scheduling networks of queues: Heavy traffic analysis of a simple open network

We consider a queueing network with two single-server stations and two types of customers. Customers of type A require service only at station 1 and customers of type B require service first at station 1 and then at station 2. Each server has a different general service time distribution, and each customer type has a different general interarrival time distribution. The problem is to find a dynamic sequencing policy at station 1 that minimizes the long-run average expected number of customers in the system.The scheduling problem is approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved, and the solution is interpreted in terms of the queueing system in order to obtain an effective sequencing policy. Also, a pathwise lower bound (for any sequencing policy) is obtained for the total number of customers in the network. We show via simulation that the relative difference between the performance of the proposed policy and the pathwise lower bound becomes small as the load on the network is increased toward the heavy traffic limit.