服務時間分佈 的英文怎麼說

中文拼音 [bìwùshíjiānfēnbù]
服務時間分佈 英文
service time distribution
  • 服 : 服量詞（用於中藥; 劑） dose
  • 務 : Ⅰ名詞1 （事情） affair; business 2 （姓氏） a surname Ⅱ動詞1 （從事; 致力） be engaged in; devote...
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 分 : 分Ⅰ名詞1. （成分） component 2. （職責和權利的限度） what is within one's duty or rights Ⅱ同 「份」Ⅲ動詞[書面語] （料想） judge
  • 服務 : give service to; be in the service of; serve
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. Among them, the cell input is taken the extended method for input queue switch. the arrival of cells is restricted by threshold in the model of shared memory switch. the arrival and service of cells have geometric distribution in the model of output queue switch

    其中輸入排隊交換機中信元的輸入採用擴展方法，共享存儲排隊交換機中信元的到達受到門限的限制，輸出排隊交換機中信元的到達和服務時間服從離散分佈。
  2. Based on the analyses of scheduling strategy and scheduling framework of tao ( the ace orb ), this paper studies the real - time scheduling and management of global priory in droce : how to determine the global priory of the dro ( distributed real - time object ) according to its timeliness and level of importance ; logical presentation and transparent transfer of the global priory ; the consistent mapping from global priory to local server priory ; the prevention of priory inversion, etc.

    本文在分析tao調度服務的調度策略和調度框架的基礎上，研究了分佈實時環境下的全局優先級調度和管理：即如何根據分佈實時應用的時間特性和重要程度確定分佈實時應用對象的全局優先級別；全局優先級的邏輯表示與透明傳遞；全局優先級與服務器局部優先級的一致性映射；防止優先級反轉等問題。
  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. It is the heavy - tailed distributions that may not possess all of their moments, and, therefore certainly not their laplace transforms that brings the difficult to analyzing heavy - tailed distribution service time

    重尾分佈的拉普拉斯變換不存在，這給重尾分佈服務時間的分析帶來了很大的困難，因此需要用新的方法解決這個問題。
  5. Based service time distribution difference, we obtain distribution of packet number and queue of frame in system through queue theory

    根據服務時間的分佈不同，用排隊論的方法分析了系統中包數的分佈和隊列長度的分佈。
  6. 3, 4, 5 and ? 6 of this chapter deal respectively with the transient distribution of the queue length of these four queueing systems. such results are obtained as follows : under the condition of the interarrival times distributions and service times distributions of these queueing models which have density function, their transient distribution of the queue length can be represented as an integral, and the integrated term of this integral can be recursively obtained

    在這一章的誇3 、芬4 、縣5和號6中，分別針對這四個排隊模型，討論了瞬時隊長的分佈，最終得到了以下的結果:在這幾個模型的到達間隔分佈和服務時間分佈均具有密度函數的條件下，它們的瞬時隊長分佈可以表示為一個積分，該積分的被積項可以遞歸地求取。
  7. In this paper, the repairable queuing system with police is studied. some important queuing quantities and reliability quantities are in detail discussed as follows : ( 1 ) using the renewal process theory and the method of stochastic decomposition, both the transient and equilibrium distributions of the queue length from any state are discussed, and the recursion expression of the equilibrium distribution is given by furthermore, the generating function of equilibrium queuing length distribution is given by ( 2 ) the distribution of waiting time is discussed, and the mean waiting time is given by ( 3 ) the departure of the system is discussed, and the mean value of departure customers when is given by

    具體如下： （ 1 ）利用更新過程理論和隨機分解方法，討論了從任意初始狀態出發隊長分佈的瞬態解和穩態解，得到了隊長平穩分佈的遞推公式：並進一步求得了系統的穩態隊長分佈的母函數（ 2 ）討論了穩態等待時間分佈，求得了平均等待時間： （ 3 ）討論了系統的輸出過程，求得了長期單位時間內離去顧客的平均數： （ 4 ）討論了服務臺的不可用度，得到了穩態不可用度: （ 5 ）討論了內服務臺平均故障次數，求得了長期單位時間內的平均故障次數
  8. According to the number of processors, scheduling problem can be grouped as single - machine scheduling problem and multi - machine scheduling problem. according to whether the job ' s processing time, released time and the surroundings of the processors are deterministic or stochastic, scheduling problem can be grouped as deterministic scheduling problem and stochastic scheduling problem. according to whether the parameters of the jobs are given before - hand, scheduling problem can be grouped as static scheduling problem and dynamic scheduling problem

    按處理機個數將排序問題分為：單機排序問題和多處理機排序問題；根據任務加工時間和到達時間以及處理機的工作環境等數據是確定的或服從某種隨機分佈可分為：確定性排序問題和隨機排序問題；根據所有任務的參數是否是預先給定的可分為：靜態排序問題和動態排序問題。
  9. 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

    此外，當到達間隔分佈和服務時間分佈不都有密度函數時，應用馬爾可夫骨架過程理論，亦可得到上述四個排隊系統的瞬時隊長分佈的積分表示。在處理上述這兩個內容截然不同的部分時，所使用的基本方法是一致的。
  10. Some important fields such as modern national defense and aviation present much higher request for the real - time and reliability of computer. the tenth - five ( year national defense pre - research pro j ect - " embedded real - time distributed system " ) requires real - time correspondence, accomplishing fault - tolerant of server ( redundance of three processors, inserting and pulling out when the processors are powered, loose synchronization among processors ), fault - tolerant of network ( redundance of double circuit ), fault - tolerant of tasks

    現代國防、航空等重要領域對計算機的實時性和可靠性提出了更高的要求，十五國防預研項目「嵌入式實時分佈系統」要求實時相應，實現服務器容錯（三個處理器冗餘、處理器可以帶電熱插撥、處理器之間鬆散同步） 、網路容錯（雙迴路冗餘） 、任務容錯。
  11. Publish / subscribe scheme based on the event model ( also called event notification scheme ) supports many - to - many communication and provides the loose coupling of interaction in the aspects of time, space, and synchronization required in the large - scale distributed event services

    基於事件通信的發布訂閱（ publish subscribe ）模型是支持大規模分散式系統的有效通信方式。該模型支持發布者和訂閱者在時間、空間和同步方面的非耦合以及多對多的通信模式，從而滿足大規模分佈事件通知服務的基本要求。
  12. Meanwhile, in the aspect of regional economics, the distribution characteristic of kisi in the different space of region is studied, and the certainty and necessity that it gathers in the regional central city are discussed emphatically, then the relation between them is stressed

    同時，從區域經濟角度，研究了知識密集型服務業在不同地域空間的分佈特徵，並著重分析了知識密集型服務業在中心城市集聚的必然性和必要性，突出了兩者的關系。
分享友人
分享到 Line

分享到臉書