排隊系統 的英文怎麼說

中文拼音 [bèiduìtǒng]
排隊系統 英文
queue system
  • : 排構詞成分。
  • : Ⅰ名詞1 (人排成的行列) a row of people; line 2 (具有某種性質的集體) team; group 3 (特指少年先...
  • : 系動詞(打結; 扣) tie; fasten; do up; button up
  • : Ⅰ名詞1 (事物間連續的關系) interconnected system 2 (衣服等的筒狀部分) any tube shaped part of ...
  • 排隊 : 1. (順次排列成行) form a line; line up; queue up 2. (歸類排列) classify; list
  • 系統 : 1. (按一定關系組成的同類事物) system 2. (有條理的;有系統的) systematic
  1. Meanwhile, in consideration of the self - similar nature of traffic in communication networks, the queueing system of an on / off traffic source with heavy - tailed distribution is discussed, because the aggregating traffic of a mass of such traffic sources exhibits self - similarity. the main research works and results are listed as follows

    同時,考慮到網路業務具有自相似性,而且大量具有「重尾」特性的信源產生的業務疊加后可以生成自相似業務,本文對這類信源的排隊系統進行了探討。
  2. In the chapter two we discussed that the server would first use speed - 1 to serve customers when the system entered the busy state from the empty state, but when the server found the number of customers in the system exceeded the thresh - n during serving, after finishing the service of current customer it would use speed - 2 to serve the next customer till there is no customer. by the method of supplementary variable, l - transition and constructing vector markov, we attained the distribution of the queue length, the distribution of wait - time, the distribution of stay - time, the utility and etc. in the last part of this chapter, we discussed the optimal n * for thresh n which minimizing the cost function and we illustrate the cost function behaves for various parameter selections by a numerical study

    在本文第二章討論了當從空閑進入忙期時是服務臺以速度1進行服務,但一旦對某顧客服務完畢時如發現中的顧客數超過n值時就以速度2服務后續顧客直到變空的可修排隊系統,通過構造各種向量馬氏過程和吸收向量馬氏過程,獲得了瞬態、穩態長分佈、等待時間分佈、逗留時間分佈、更新周期分佈等一指標以及可用度、可靠度等一些可靠性指標,在本章最後又從如何更好節省費用角度出發討論了門限n的最優取值問題,並利用mathematic軟體對費用函數進行了數值模擬。
  3. The gi / g / 1 queueing system is the most typical and the most important queueing model among all the queueing systems

    Gi g 1排隊系統論中的一個最主要最典型的模型。
  4. Weak convergence of the gi g 1 queue with priority feedback and interruptions

    服務中斷的帶優先反饋排隊系統弱極限定理
  5. Queueing system with general operation and vacation time

    1重試可修排隊系統
  6. Stochastic comparison on queueing system with batch arrival

    成批到達排隊系統的隨機比較
  7. Finite source retrial queue with negative customers

    1有限源重試排隊系統
  8. Optimal control of a type of m g 1 queueing system

    1排隊系統的最優控制
  9. Design and research on queuing system

    排隊系統的設計與探討
  10. The new advance of g - networks

    網路排隊系統的研究新進展
  11. Sensitivity estimate and simulation of performance for m g 1 queuing systems

    1排隊系統的性能靈敏度估計與模擬
  12. The m g 1 queue with vacation threshold m, customer loss and general retrial times

    顧客丟失且一般重試時間的排隊系統
  13. The expected number of customers in a busy period of a class of polling system

    一類排隊系統在一個忙期內的平均顧客數
  14. In the chapter 3, we discussed the repairable m / g ( m / g ) / 1 queuing systems whose discipline of speed change is that if the number exceeds the threshold n at the moment of a customer leaving the system the speed - 2 should be used to serve the next customer otherwise the speed - 1 should be used

    在本文第三章討論了服務臺在對某顧客服務完畢時依此刻中的顧客數是否超過門限n值而分別採用不同的服務速度服務后續顧客的可修m g ( m g ) 1排隊系統
  15. Lots have been done concerning repairable m / g / 1 queuing systems and many important results have been gotten. in this paper we make a further research about this system. by setting a n - threshold in the queuing we considered repairable m / g ( m / g ) / 1 queuing systems with two service speeds changing according the number of the customers in the system. we separately make a particular deep discussion to different disciplines of the service speed change

    當今對可修m g ( m g ) 1排隊系統已作了大量研究,獲得了許多漂亮的結果;本文對此作了進一步的推廣,通過對中的顧客數設置門限n值,首次考慮研究了服務臺具有兩種服務速度且會隨著中顧客數的多少而發生轉移地可修m g ( m g ) 1排隊系統,就服務速度的不同轉變規則分別進行了詳細深入的討論。
  16. In the chapter 4, we make an extension to the model of the chapter - 2. the service speed change is instant, that is say, during the service using speed - 1 to serve, if the number exceeds the threshold n, then the server should immediately use speed - 2 not speed - 1 to serve current customer and the next till entered the empty state. we especially point out that the classical m / g / 1 queuing model and the m / g / 1 queuing with n - policy are the particular cases of model discussed in chapter - 4

    第四章對第二章討論的模型進行了進一步的擴展,其服務速度1到速度2的轉移規則是瞬間轉移,也即當服務臺以速度1服務顧客的過程中如發現中的顧客數已超過門限n值時就即刻調整為以速度2服務當前顧客和后續顧客直到變空的可修m g ( m g ) 1排隊系統,並指出經典的m g 1和具有n -策略的m g 1是本章研究的兩種特例。
  17. By analyzing the features of metro entry gate ( eng ) queuing system, a computer simulation model is established

    摘要通過對城市軌道交通進站檢票機排隊系統特徵的分析,建立了進站檢票機模擬
  18. The transient distribution of the length of gi g 1 retrial queue with negative customers and repair

    1重試可修的排隊系統長瞬時分佈
  19. In this dissertation, we first state briefly the developmental history, the present condition of queueing theory, the markovization of queueing system and the research situation for several types of ergodicity, and induce the preliminary knowledge of markov processes and markov skeleton processes, and then the dissertation discusses mainly focus on several problems which exist in researching gi / g / l queueing system, which are categoried as follows : ( i ) non - equilibrium theory for gi / g / 1 queueing system ( l ) we present the equation which satisfies the transient distribution of l ( t ) for the three special cases m / m / 1, gi / m / 1 and m / g / 1 queue of gi / g / 1 queueing system, and proves that the length l ( t ) of gi / g / 1 queueing system satisfy three types of equation, and their minimal nonnegative solution are unique bounded solutions

    歸納了馬爾可夫過程和馬爾可夫骨架過程的有關的初步知識。然後,本文重點討論了當前在gi g 1排隊系統中待研究的如下幾個問題: (一) gi g 1排隊系統的非平衡理論( 1 )給出gi g 1排隊系統及其三個特例m m 1 , gi m 1和m g 1排隊系統長l ( t )的瞬時分佈所滿足的方程。證明gi g 1排隊系統長l ( t )滿足三種不同方程,並且是這些方程的最小非負解,也是唯一有界解。
  20. In queueing theory, the research on gi / g / l queue have been continued for decades of years. by the end of last century, the integral representation of its transient distribution of the queue length has been obtained. in this integral representation, the integrated term can be determined recursively by a system of kolmogorov differential equation

    理論中,關于gi / g / 1排隊系統的研究,延續了幾十年,直至上個世紀末,方得到了它的瞬時長分佈的積分表示,在這個積分表示中,其被積項可以由一組柯爾莫洛夫偏微分方程遞歸地確定。
分享友人