排隊過程 的英文怎麼說

中文拼音 [bèiduìguòchéng]
排隊過程 英文
queueing process
  • : 排構詞成分。
  • : Ⅰ名詞1 (人排成的行列) a row of people; line 2 (具有某種性質的集體) team; group 3 (特指少年先...
  • : 過Ⅰ動詞[口語] (超越) go beyond the limit; undue; excessiveⅡ名詞(姓氏) a surname
  • : 名詞1 (規章; 法式) rule; regulation 2 (進度; 程序) order; procedure 3 (路途; 一段路) journe...
  • 排隊 : 1. (順次排列成行) form a line; line up; queue up 2. (歸類排列) classify; list
  • 過程 : process; procedure; transversion; plication; course
  1. By transforming architecture elements ( component and connector ), we can get the process view of architecture. in the end we use the method to analyze the two cases in kwic system and compare the results of architecture performance analysis

    軟體體系結構由構件和連接件組成,本文分析了構成體系結構的六種組成元素,通這些組成元素的轉化提取體系結構的進視圖,然後應用理論建立性能建模。
  2. The commitments, the first book of roddy doyle ' s " barrytown trilogy ", recounts how a band of soul music run by a group of dublin youngsters disbands with a new band being conceived

    摘要《責任》是羅迪?多伊爾「巴利鎮三部曲」的第一部作品,它以都柏林北部巴利鎮上一群年青人組建樂的經歷為敘事內容,生動描繪了樂練和演出
  3. 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軟體對費用函數進行了數值模擬。
  4. This paper mainly analyzes control delay at urban signalized intersections. based on the survey data, this paper talks about vehicles movement characteristics of arrival and depart process, then the queueing headway distribution is obtained, and the suggestion that saturated flow should be measured from the sixth queuing vehicle is offered. using random process theory analysis and computer simulation, the queuing length distribution model is obtained

    本論文針對平面信號控制交叉口的延誤問題進行了分析,在實測數據分析的基礎上,探討了車輛到達和離開的運行特性,給出信號交叉口離散車頭時距分佈模型,提出飽和流率的測量應從第六個離開的車輛算起;運用隨機理論和計算機模擬的方法得到了信號交叉口長度分佈模型,在此基礎上運用協調變換的方法改進了車輛延誤模型。
  5. In order to meet the needs of recent research in applied probability, such as finance and insurance, risk theory, random walk theory, queueing theory and branching processes and so on, the concepts of heavy - tailed random variables ( or heavy - tailed distributions ) are introduced. they are one of the important objects many scholars are concerned on. on the other hand, in a risk process, the number of these heavy - tailed variables " occurrence until the time t, i. e. all kinds of counting process, is one of the important objects, which many scholars are studying

    在應用概率的許多領域,如金融保險、風險理論、隨機游動理論、論、分支等,重尾隨機變量或重尾分佈都是重要的對象之一,另一方面,在一個風險中,到t時刻時,這些重尾變量出現的個數,即各種記數,也是人們研究的主要對象之一,本文主要對重尾分佈的控制關系與極值的跳時點的精緻漸近性進行深入的討論。
  6. Queueing theory is a greatly important kind of application stochastic processes

    在應用隨機中,論無疑是其中極為重要的一類。
  7. 3 based on the shape of conic plug, the profile modeling - annulus equipment which can make plug in a line is designed. this equipment can not only solve the plug lining - up problem in mechanizing way when plug seedlings are transplanted, but also can raise the working speed of no - tillage transplanter, and reduce the working intensity of operator

    3利用圓臺形缽體的外形特點,採用仿形導向輪式裝置,解決了栽植的缽苗機械化問題,提高了免耕栽植機的作業速度,減輕了操作人員的勞動強度。
  8. On the whole we can divide the evolution of party " s intellectual policy to three stages. in the first stage, the party put forward the policy of " solidarity, education -. renovation " for pre ? evolution intellectual and positively practiced the police from the aspect of operations arranging, political terms of employment, thought reform. . etc. along with the changing of intellectual troops " condition and completely launch of the socialist construction, the party proposed a guideline of " double 100 " and made a important modulation to the intellectual policy, which inaugurated a new situation for our intellectual performance ; in the second stage, the party ' s intellectual policy come through a zigzag process

    在第一階段,黨對舊社會來的知識分子提出了「團結、教育、改造」的政策,並從工作安、政治待遇、思想改造等方面積極落實這一政策,隨著知識分子伍狀況的改變和社會主義建設事業的全面展開,黨提出了「雙百」方針,並對知識分子政策進行了重大調整,為我國知識分子工作開創了一個新的局面;第二階段,黨的知識分子政策經歷了一個「一落一起再落」的曲折
  9. The lacks of this restoration technique is needing a complicated standard processing, and the advantages are that some normal network problems could be avoided, such as queuing delay and network congestion et al

    其缺點是,要有一個較為復雜的標準化;優點是,可以避免一些諸如延遲、網路擁塞等的常見網路問題。
  10. This paper set up the model with the queue theory, the simulation policy of event scheduling and the method of flow chart

    本文借鑒理論,採用了事件調度法的模擬策略,利用流圖法建立港口拖輪作業的模擬模型。
  11. Ever since the set - up of " situation and policies " course in some colleges and universities, a certain achievements have been obtained, and a great deal of experience has been accumulated, however, some existing problems are still worrisome, including the relatively backward teaching materials, lack of united course book, random teaching, comparatively simple and backward teaching methods, irrational teaching set - up non - standard teaching process, instability of teaching faculty and the lack of learning enthusiasm

    高校「形勢與政策」課自開設以來,取得了一定成效,積累了不少的經驗。但當前該課的效果令人堪憂,具體表現為教學資料相對滯后、沒有一本統一的教材、教學隨意性大、教學方法較單一、教學手段落後、教學時數安不合理、教學不規范,師資伍不穩定、學生的學習興趣不濃等問題。
  12. 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是本章研究的兩種特例。
  13. 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 )滿足三種不同方,並且是這些方的最小非負解,也是唯一有界解。
  14. In the past, the research on queueing system had mostly focused on stability and distribution, that is, the common ergodicity. while recently, the institute of probability and statistics in central south university has undergone a systematic research on the instantaneous distribution and all kinds of ergodicity

    以前論多是研究排隊過程的平穩分佈,即研究普通遍歷性,最近,中南大學概率論與數理統計研究所對排隊過程的瞬時分佈和各種遍歷性進行系統研究,本文在此基礎上,對m g 1和gi gi 1進行了處理,得到了如下一些結果。
  15. Based on the analysis of the calculation method of traffic lane number for the gate of container terminal, present design criteria and existing problem of the length design for buffer parking area of terminal entrance, this paper studies the arrival characteristics of container trailer and puts forward a calculation method based on random service system ( queuing theory ), for calculating the optimum traffic lane number and length of buffer parking area for the gate of container term ma1, with an explanation of the calculation procedure by an example, to serve as a reference for similar projects

    摘要通分析集裝箱碼頭大門車道數的計算方法及其停車緩沖區長度的設計現狀、存在問題,根據集裝箱碼頭大門施掛車的到達特性,提出基於隨機服務系統(論)的集裝箱碼頭大門最佳車道數及其停車緩沖區長度的計算方法,並通示例說明該方法的計算,為類似工提供參考。
  16. Without a standard way of advertising and managing this process, it s possible for some service providers to sit idle while others have massive work queues that take them inordinate amounts of time to process

    如果缺少一種發布和管理這一的標準方法,很可能會出現這樣的情況:一些服務提供者處于閑置狀態;而另外一些提供者則有大量任務在等待,需要花費大量時間去處理。
  17. Alignment fields consist of very low distortion sinusoidal waves

    排隊過程包含很低的扭曲的正弦波。
  18. It can be used to research the traffic system behavior being planned, select the best planning project, forecast the actions of traffic system under different conditions. it ' s good at dealing with the complex queue process, which affects and reacts each other

    微觀交通模擬,可以分析研究規劃中的交通系統行為,公正比選不同規劃方案,預測道路交通系統在各種情況下的行為,處理相互影響、相互作用的復雜排隊過程
  19. That is, in order to obtain a satisfied communication quality, in every group of beforehand setting channel, by means of link quality analysis ( lqa ) during two side ' s calling, answering and recognizing period, every channel will be arranged in prior order, the best communication channel can be found automatically, and the link can be set in the best frequency so as to raise the level anti - interference, and ensure our army ' s ability in fighting

    即為了獲得滿意的通信質量,在預置的各組頻道中,通雙方的呼叫、應答和確認,利用鏈路質量分析( lqa ) ,自動對電臺所預置的若干個頻率進行線路質量分析,將各頻道按優先,從而自動找出當時最佳通信頻道,並在最佳頻率上建立鏈路,提高抗干擾能力,保障我軍的指揮作戰能力。
  20. Different from other algorithms, the algorithm in this paper that adopts sliding sequencing window does not search all sequences generated by whole aircraft queue, but search possible sequences generated by some aircraft for certain positions fixing in optimized queue. so, this algorithm can break through the bottleneck of computation penalties caused by the use of cp algorithm and make it easy to reschedule the queue of more than 10 aircraft in heavy traffic

    與其它演算法不同,本文提出的序演算法引入了滑動序窗的概念,它不用對列中全部飛機的所有序可能進行搜索,而只需對那些與最終序結果中的某些特定位置相關的飛機(當前窗)所產生的序可能進行搜索,依次移動窗體就可完成對所有飛機的
分享友人