Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

The Downs-Thomson Paradox: Existence, Uniqueness and Stability of User Equilibria

Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate     

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.     

建立湖州广电网络信息业务平台的设想

叙述在数字电视平台上建立广电网络信息业务平台的设想,并提出建立湖州广电网络信息业务平台的几点看法。     

达县广电城域网运行状况及故障分析

对达县广电城域网运行状况进行了检测，认为不能满足用户上网需要的原因除了网内病毒感染之外，设备与设备之间链路层协商及连接线出现故障。改进措施主要有两点：解决NE08E与S8505的连接问题，解决S8505上的DHCP服务器不能分配IP地址问题。     

闭排队网络中性能势与无穷小实现因子之间的关系

In this paper,the concept of the infinitesimal realization factor is extended to the parameter-dependent performance functions in closed queueing networks. Then the concepts of realization matrix (its elements are called realization factors) and performance potential are introduced,and the relations between infinitesimal realization factors and these two quantities are discussed. This provides a united framework for both IPA and non IPA approaches. Finally,another physical meaning of the service rate is given.     

局域网服务器缓冲区容量的Petri网设计方法

本文在分析局域网服务器信息缓冲区、数据包接受和发送缓冲区的相互关系基础上提出一种新的局域网服务器缓冲区设计方法─—广义随机Ｐｅｔｒｉ网方法，并给出了局域网服务器信息缓冲区的广义随机Ｐｅｔｒｉ网模型。该设计方法理论完备、严谨实用，且不再局限于追求某一边界值（上限或下限），并且避免了排队理论处理多级服务的繁琐公式。最后本文用一例题说明了这种方法的应用。     

激光二极管端面抽运的棒状Yb：YAG激光器

分析了影响激光二极管抽运Yb：YAG激光器调Q效率的参量，推导了激光二极管端面脉冲抽运Yb：YAG晶体的速率方程，解出了双程抽运情况下的净抽运量子产率。利用数值计算方法，模拟了净抽运量子产率与晶体长度，抽运光脉冲宽度等关系，得出晶体长度的优化可以提高Yb：YAG激光器输出效率。计算了词Q Yb：YAG激光器的最大增益、最大储能，分析了放大自发辐射对于Yb：YAG能量存储的影响。同时给出了激光二极管端面抽运调Q Yb：YAG优化设计方法。这些分析和计算为实际器件的研制提供参考。     

精密陶瓷部件近净成型技术的发展

重点介绍了近十年发展起来的陶瓷部件的近净成型技术 ,主要包括直接凝固注模成型、凝胶注模成型、陶瓷注射成型、陶瓷无模成型和微注入成型。对这些新的成型方法的原理、工艺过程及应用特点进行了较全面的分析与比较。     

Transversal-Free Translation Nets

Translation planes of order q ² containing non-Desarguesian Baer subplanes are used to construct transversal-free translation nets with very small deficiencies. Also, a generalization of the ideas of Bruen shows that any non-Desarguesian spread in PG(3, q) produces a transversal-free net of small deficiency.