Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results ...Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.展开更多
This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the r...This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n^-,n^+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n^-,n^+,n and departure epoch D_n).展开更多
根据蛇毒纤溶酶(A lfim eprase,ALF)氨基酸序列和大肠杆菌密码子偏爱性,设计了14条单链DNA,采用重叠延伸PCR方法人工合成了ALF基因编码区。通过克隆使其分别连接在融合标签N usA,T h ioredox-in,Skp,H is T ag和信号肽pe lB的C端,构建...根据蛇毒纤溶酶(A lfim eprase,ALF)氨基酸序列和大肠杆菌密码子偏爱性,设计了14条单链DNA,采用重叠延伸PCR方法人工合成了ALF基因编码区。通过克隆使其分别连接在融合标签N usA,T h ioredox-in,Skp,H is T ag和信号肽pe lB的C端,构建成了多种ALF表达载体p43-A lf,p25-A lf,p32-A lf,p15-A lf和pSkp-A lf,转化大肠杆菌后进行了诱导表达,并对表达产物进行了SDD-PAGE分析。实验结果表明,合成的ALF基因长度为603 bp;构建的表达载体在大肠杆菌中均获得了很好的表达,其中pSkp-A lf表达量最高,目的蛋白含量高达菌体总蛋白的45%。展开更多
This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from...This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from the initial state N（0＋） = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n＋ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n-, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered （being different from the relations given in M/G/I queueing system）. The model discussed in this paper can be widely applied in all kinds of communications and computer network.展开更多
基金Supported by the National Natural Science Foundation of China (No.70871084)Scientific Research Fund of Southwestern University of Finance and Economicsthe Specialized Research Fund for the Doctoral Program of Higher Education of China (No.200806360001)
文摘Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.
基金supported by the National Natural Science Foundation of China under Grant No.70871084The Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001a grant from the "project 211(PhaseⅢ)" of the Southwestern University of Finance and Economics, Scientific Research Fund of Southwestern University of Finance and Economics
文摘This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n^-,n^+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n^-,n^+,n and departure epoch D_n).
基金supported by the National Natural Science Foundation of China under Grant No. 70871084the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No 200806360001the Scientific Research Fund of Southwestern University of Finance and Economics
文摘This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from the initial state N（0＋） = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n＋ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n-, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered （being different from the relations given in M/G/I queueing system）. The model discussed in this paper can be widely applied in all kinds of communications and computer network.
