queueing theory 中文意思是什麼
-
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
本論文針對平面信號控制交叉口的延誤問題進行了分析，在實測數據分析的基礎上，探討了車輛到達過程和離開過程的運行特性，給出信號交叉口排隊離散車頭時距分佈模型，提出飽和流率的測量應從第六個離開的排隊車輛算起；運用隨機過程理論和計算機模擬的方法得到了信號交叉口排隊長度分佈模型，在此基礎上運用協調變換的方法改進了車輛延誤模型。 -
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時刻時，這些重尾變量出現的個數，即各種記數過程，也是人們研究的主要對象之一，本文主要對重尾分佈的控制關系與極值過程的跳時點過程的精緻漸近性進行深入的討論。 -
Queueing theory is a greatly important kind of application stochastic processes
在應用隨機過程中，排隊論無疑是其中極為重要的一類。 -
In the design, we make use of two eda tools max + plus ii and protel99. because of the using of complex programmable logical device ( cpld ), we can keep untuched the original hard circuit in design and realization of counting card, so it inherited the advantage of its predecessor. in order to quantitatively analyze the performance of data acquisition system with fifo cache, we introduced the queueing theory to build mathematic model to test its quality
在設計中藉助了max + plusii和protel99兩個eda設計軟體。由於採用了復雜可編程邏輯器件cpld ，使得在計數卡的設計和實現中不用更改原硬體電路，對原設計的優點有很好的繼承。在驗證系統改進性能時，引入排隊論建立了數學模型對系統的工作性能進行定量分析，證明其達到了設計要求。 -
Methods of queueing analysis in traditional theory are based on mature theory. laplace transform is a crucial mathematical tool which is used by classical methods
傳統的排隊理論中，分析排隊的方法有很成熟的理論，經典方法是利用拉普拉斯變換來處理，前提條件是拉普拉斯變換要存在。 -
The thesis present the method that first we extract the process view from architecture description and then use queueing theory to analysis the process view to build architecture performance model
本文提出先提取體系結構的進程視圖，然後利用排隊理論分析進程視圖建立體系結構性能模型的方法。 -
These likenesses are the basis to analyze the architecture performance with queueing theory that has some good conclusion to meet the analysis of architecture performance. we also debate the maximum throughput in average and average latency of software architecture
這些相似性構成了使用網路排隊理論分析體系結構的基礎，網路排隊理論有許多結論，這些結論能夠滿足體系結構性能分析的要求，文中主要分析了體系結構的平均最大吞吐量和平均響應時間。 -
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 ）滿足三種不同方程，並且是這些方程的最小非負解，也是唯一有界解。 -
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排隊系統的研究，延續了幾十年，直至上個世紀末，方得到了它的瞬時隊長分佈的積分表示，在這個積分表示中，其被積項可以由一組柯爾莫洛夫偏微分方程遞歸地確定。 -
( 3 ) proposes several strategies to improve the performance of ejb on the basis of studying and practicing others " work, and puts forward a new method to analyze the performance using stochastic processes and queueing theory from integral aspect
（ 3 ）借鑒了前人對ejb體系性能分析的研究成果，通過實踐給出了若干提高ejb性能的策略，並從服務系統的整體角度提出了一種利用隨機服務過程和排隊論分析ejb系統性能的新方法。 -
Additionally, provided that not all interarrival times distribution and ser - vice times distribution are of density function, the integral representation of the transient disribution of the queue length of these four queueing systems as indicated above is obtained by applying the theory of markov skeleton processes
此外，當到達間隔分佈和服務時間分佈不都有密度函數時，應用馬爾可夫骨架過程理論，亦可得到上述四個排隊系統的瞬時隊長分佈的積分表示。在處理上述這兩個內容截然不同的部分時，所使用的基本方法是一致的。 -
In the system, dss integrates relative kb together, especially the train routing kb, approval experience kb. at the same time, the paper constructs the relative model of the claimed train approval optimization model in railroad bureau and uses the minimal cost and maximal flow algorithm based on queueing theory to solve the problem
在本系統中， dss中集成了相關的知識庫系統，特別是車流徑路知識庫、審批經驗知識庫。同時，對鐵路請求車審批優化中的請求車審批優化問題建立了相應的模型，並利用基於排隊論的最小費用最大流求解了該問題。 -
( ii ) statistical equilibrium theory for gi / g / 1 queueing system ( 1 ) calculation of expectation and integral of a special family of func - tions of the idle - busy period for gi / g / 1 queueing system is settled. these element will be shown in the representation of the stationary distribution for the l ( t )
（二） gi g 1排隊系統的統計平衡理論（ 1 ）求出gi g 1排隊系統的忙閑周期的數學期望和特定的一族函數的積分，這些量將在隊長l （ t ）的平穩分佈的表達式中出現。
分享友人