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     

A parallel cell‐based DSMC method on unstructured adaptive meshes

A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd.     

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

基于ATM的网络互连方式

ＡＴＭ技术能否在数据通信网中广泛采用取决于其是否能高效地支持现有业务，其中主要为非连接业务。本文介绍了几种基于ＡＴＭ 的非连接业务支持方式和协议体系结构，对其进行了评述并对ＩＰ分组到ＡＴＭ信元的封装效率进行了分析。     

Commutative idempotent residuated lattices

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct.     

单小区模型的掉话率分析

掉话率是无线通信网络中最重要的关键性能指标(KPI)之一,本文分析了中国移动在讨论网络性能评估方法时提出的3个不同的掉话率计算公式,通过建立一个单小区的模型,使用一些合理的假设和分析,从理论上确定了一个最为准确的计算公式.     

运动目标声信号的时频特征研究

提高声被动目标定位精度需要研究运动目标在有风条件下目标声信号的特征。本文从声学波动方程出发，对无风和有常速风情况下的波动方程进行了求解，得到了运动目标声信号的延迟关系；分析了解的主要影响项，并得到了其解析信号；用解析信号对运动目标声信号的延迟特性和时频特征进行了仿真计算。     

基于数字CATV的超宽带技术研究

如何利用现有的数字CATV系统开展各种增值业务已成为一个重要课题.首先简要介绍了数字CATV和超宽带技术,然后给出了两种超宽带技术在现有数字CATV系统中的应用方案,利用这些方案可以有效地开展各项增值业务.     

《无线电频率划分规定》学习心得

主要介绍学习新的《无线电频率划分规定》的目的，《无线电频率划分规定》的特点，作了哪些重要修改和划分表的主要内容及如何贯彻执行《无线电频率划分规定》。