節點延遲 的英文怎麼說

中文拼音 [jiédiǎnyánchí]
節點延遲 英文
delay, node
  • 節 : 節構詞成分。
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 遲 : Ⅰ形容詞1. （緩慢） slow; tardy; dilatory 2. （晚） late; delayed 3. （遲鈍） slow; obtuseⅡ名詞（姓氏） a surname
  • 節點 : [電學] panel point; hybrid; packing; node; nodal points; joint of framework; pitch point; point pitch
  1. ( 3 ) the optimized strategy analysis on retrieval of gps water vapor the optimized strategy analysis on retrieval of gps water vapor has been carried out under different data processing schemes by using gps observation. the parameters selection problem has been resolved in gps water vapor retrieval process such as the optimum number of adopted igs stations, the relation between single station processing and united station processing, network layout, cut - off angle, zenith delay parameter, period, knot position and so on

    （ 3 ） gps水汽反演優化策略分析利用gps觀測數據，使用多種數據處理方案，進行gps水汽反演優化策略分析，初步解決了進行gps水汽反演中引入igs站的最佳個數、單站解算和聯合解算的關系、網路布局、截止高度角、天頂延遲參數、時段長度、節點位置等選擇問題。
  2. For the self - magnetic field mid with relatively simple structure, the stability of self - magnetic field generated by electron flow is obtained by adjusting the diode gap and the delay time of bipolar pulse. under the combined effect of self - magnetic field and electrical field in the diode, stable and dense anode plasma was produced

    對于具有簡化結構優點的自磁絕緣離子二極體，通過調節陰陽極間距保證電子流造成的自磁場穩定形成，同時控制合適的雙極脈沖延遲時間，電磁場共同作用形成了穩定的稠密陽極等離子體。
  3. Traditional delay estimation based on ica requires the trail sequences to initialize the receiver, but the new algorithm based on ica does not need the trail sequences. it is based on the channel character of downlink, using the ica algorithm to estimate the multi - path mixture matrix, then, find the delay information which is embodied by the column vector of the mixture matrix. the simulation results show that it does enhance the performance of traditional detector without wasting the invaluable frequency resource

    傳統的通道估計演算法需要訓練序列使接收端的參數調整到理想狀態，而本文提出的基於ica的通道估計的多用戶檢測演算法不需要訓練序列，它是利用下行通道的固有特點，用ica的盲源分離法估計出多徑通道的卷積矩陣，從而從中提取出通道的延遲信息，模擬實驗結果證明這種方法在節省了頻譜資源的同時取得較好的估計效果，使得傳統的接收機的誤碼性能得到了很大的提高。
  4. In the protocol, a hierarchy is currently used to manage the peers in the system, and a multicast path, which adapts to the request of delay and bandwidth, is constructed for the data transfer of media streaming

    協議中利用分層拓撲結構來組織和管理應用層組播網路中的節點，在此基礎上構建滿足流媒體數據傳輸對延遲、帶寬要求的組播路徑。
  5. There are many plants that have the character of time - varying, large delay, large inertia in the process of production of modern power station such as the superheated steam temperature, the reheated steam temperature, the water treatment of boiler and the load regulation. some of them have the strong character of nonlinear and some of them are multivariable coupling systems it is very difficult to obtain good effect of control by conventional pid control. it is necessary to set up the mathematics models of controlled plants if applying control means of modern control theory such as self - adaptive control, optimal control ， decoupling control and predictive control. and these control systems have large calculation and bad character of real time in general. these disadvantages make them be not able to meet the need of real production process and limit the application of them in modern power station. now the generator units are developing towards large capacity and high parameters. many new kinds of generating electricity means are coming into being. the characers of production units of power station become more and more complex but the demand to quality of control becomes more and more strict. the new control means are in bad need to control them effectively

    現代電站的生產過程中存在過熱汽溫、再熱汽溫、鍋爐水處理、負荷調節等許多大遲延、大滯后、特性時變的對象，它們中有些還是具有強非線性特性的對象或多變量耦合系統，採用常規的pid控制手段很難取得良好的控制效果。若應用現代控制理論中的自適應控制、最優控制、解耦控制、預測控制等控制手段，則需要建立被控對象的數學模型，而且往往控制系統的計算量大、實時性差。這些缺點使其很難滿足實際生產過程的需要從而極大地限制了其在現代電站中的應用。
  6. It induces logic and delay to waveform, and describes the continuous states of nodes in netlist by waveform. it can realize simulating continuous states for integrated circuits by computing waveforms

    它把邏輯和延遲有機地結合起來歸納為波形，並用波形來描述電路網表中節點的連續時間狀態，通過對波形的計算實現整個電路的連續時間狀態模擬。
  7. Considering the limited energy and transmission range of sensor nodes in sensor networks, an innovative routing algorithm named self - adaptive flooding based on delay is proposed. in this algorithm, sources deliver route request packets ( rreq ) and sink answers route reply packets ( rrep ) to build routes. in order not to miss optimum routes with the best metrics, the algorithm is to wait a specific amount of time to ensure that almost the rreq near the best metrics is received

    為此本文在無線傳感器網路中研究了基於自適應的路由演算法，主要工作如下:針對傳感器節點能量及傳輸范圍有限等特點，提出了一種基於延遲的自適應洪泛路由演算法，首先通過源節點在網內用較小的路由請求報文和路由回復報文來建立路由，路由建立的過程中自適應地確定等待時間以使更優的路由請求報文得到轉發，然後源節點再沿著建立好的路徑轉發較大的數據報文。
  8. Basing on the study of the current routing algorithm, it proposes a new sd - anycast routing protocol algorithm. according to the character of this protocol, it implements this new protocol by adding additional packet header, routing maintaining and node dealing modules. lastly, according to creating prototype system and designing four comparing experiments, it gets the experiment statistical data, and makes a conclusion that this routing protocol algorithm has a better performance on one way delay, output, load balance and etc

    本文首先介紹了anycast服務的概念、特點以及研究現狀;在分析了路由協議的一些相關知識和當今anycast路由協議的研究現狀的基礎上，深入研究了當前的路由協議演算法，提出了一個sd - anycast協議演算法，並在網路模擬軟體ns2設計平臺中根據該協議的特點，通過設計數據包報頭、路由表維護和節點處理等功能模塊，實現了該協議演算法;最後通過建立原型系統並設計四個對比實驗，得出實驗統計數據，定量地測定了該路由協議演算法在單程路徑延遲、吞吐量和負載平衡等方面所具有的優越性。
  9. The material job and main conclusion are as follows : ( 1 ) a simple boundary orthogonalization procedure independence grids generation method is put forward on the base of algebraic grid generation method ; data structure and computational model on interface are established aiming at blocks of structured grids. ( 2 ) simple procedure is established in nonorthogonal grids by use of the finite volume method and in - depth discusses on special topic such as boundary condition in nonorthogonal grids, deferred correction method and grads compute on calculational nodes, and so on

    本文完成的具體工作和主要結論如下： 1 ）以代數網格生成方法為基礎提出了一種簡單的、可獨立於網格生成方法之外的邊界正交化技術；針對分區結構網格系統建立了分區交界面處的數據結構與計算模型； 2 ）利用有限體積方法在非正交同位網格系統中建立了simple求解演算法，對非正交網格系統中的邊界條件、延遲修正技術及計算節點的梯度計算等專題進行了深入討論。
  10. The mobile internet is becoming hot spot. when a mobile node is far away from home network, registration at its home agent can cause a long handoff delay that leads to significant packet drop and throughput reduction

    根據現有的ietf移動ip規范，當移動節點駐留在遠離家鄉網路的外地網路時，每次切換，將會產生嚴重的注冊延遲，從而引起嚴重的包丟失和通信吞吐量下降。
  11. When we say “ best route ” we consider parameters like the number of hops ( the trip a packet takes from one router or intermediate point to another in the network ), time delay and communication cost of packet transmission

    我們所說的最優路徑需要考慮到的參數包括最優路由路徑（信息包從在網路中一個路由器或中間節點傳輸到另一個路由器或中間節點）的數量，延遲時間和信息包傳輸過程中的消耗等等。
  12. Abstract : in a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time

    文摘:在網路系統中，節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失，對于限時令牌網路，節點消息發送時間和消息緩沖容量的分配是影響消息實時性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制，說明了消息緩沖容量的確定與網路帶寬分配方法的關系，並提出了消息緩沖容量的確定方法，導出了避免消息覆蓋或溢出所需的最大發送和接收緩沖容量余度.指出在消息的產生間隔大於該消息的最大允許的延遲時間和接收節點響應時間的條件下，發送和接收端的消息緩沖容量等於被緩沖消息的長度
  13. In a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time

    在網路系統中，節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失，對于限時令牌網路，節點消息發送時間和消息緩沖容量的分配是影響消息實時性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制，說明了消息緩沖容量的確定與網路帶寬分配方法的關系，並提出了消息緩沖容量的確定方法，導出了避免消息覆蓋或溢出所需的最大發送和接收緩沖容量余度.指出在消息的產生間隔大於該消息的最大允許的延遲時間和接收節點響應時間的條件下，發送和接收端的消息緩沖容量等於被緩沖消息的長度
  14. Its main characteristics include the following parts : ( 1 ) the trait of matching of network, as it manages the information of peers by grouping according to their location in the internet ; ( 2 ) easy to implement, as it distributes the video data according to the need of peers, and does not have to maintain a complex global structure ; ( 3 ) robust and resilient, as it can adapt the complex and dynamic environment of network very well ; ( 4 ) good expansibility, as it has better performance with the increase of users ; ( 5 ) high utilizing of bandwidth, as it can control the peers according to the change of bandwidth of them and make good use of their bandwidth ; ( 6 ) low delay of peer to peer, as it considers the delay among peers sufficiently besides the bandwidth, and makes the delay of peer to peer is low

    該視頻流媒體網路模型在網路帶寬效率、延遲和可靠性之間做出了很好的平衡，它的主要特點有: （ 1 ）網路匹配特性，使用終端用戶的網路位置信息來對節點進行分組管理，對節點間的鄰近度進行優化; （ 2 ）易於實現，根據數據的流向來分發視頻流媒體數據，不需要維護復雜的數據結構; （ 3 ）適應性強，能很好的適應復雜變化的網路環境; （ 4 ）擴展性好，加入視頻流媒體網路中的用戶越多，性能越好; （ 5 ）帶寬利用率高，及時對每個節點的帶寬變化情況進行控制，充分利用空閑帶寬; （ 6 ）端對端延遲小，通過在帶寬和延遲之間達到平衡使得端對端延遲減小。
  15. As the application of distributed computing is used much more widely ， distributed database becomes a significant part of information management it avoids a lot of disadvantages of conventional centralized database ， and is applicable to many situations distributed database is a set of data which is the unity logic ， but in fact these data is located on different sites it is of high availability ， easy expansibility ， high concurrency ， high efficiency and etc in distributed system ， data redundancy is a method to improve the speed of query and the availability of system distributed query should shield the lower level details of data redundancy from end users ， distributed transaction should ensure data from disaccord this paper introduces basic conceptions of distributed database firstly ， discusses distributed transaction and concurrent control ， describes the development prototype mysql ’ s characters ， architecture and executive mechanism ， then shows the skeleton model of dpsql and exposes the strategy and algorithm of distributed query and distributed transaction ， at last analyzes the extra expenses and response delay of distributed processes this paper exposes the implementation mechanism of distributed query and distributed transaction emphatically distributed query uses the strategy of “ read one ， write a11 ” s0 in such a system if user ’ s requests are read - - only for the most part and the distribution of data redundancy is plausible ， efficiency is very high distributed transaction uses two - 。 phase commit protocol to ensure the consistency of global data ， which has less communication overhead

    分散式查詢需要向用戶屏蔽數據冗餘分散的底層細節，分散式事務處理要保證全局數據完整，這都是傳統集中式數據庫不曾面臨的問題。本文首先介紹了分散式數據庫的概念性問題；接著討論了分散式事務涉及的定義及演算法；然後描述了dpsql的原型mysql的特性、結構和執行機制；繼而給出了dpsql的梗概模型，闡述了實現分散式查詢和分散式事務處理的策略及演算法；最後分析了進行分散式處理給系統增加的額外開銷和客戶端的額外響應延遲。本文重點描述了分散式查詢和分散式事務處理的實現機制，分散式查詢採用」讀一個寫全部」的本地優先策略，在讀操作頻繁的系統中，只要庫的分佈合理，單機效率極高，幾乎無任何附加開銷和延遲，而以整個系統的角度看來，吞吐量就更是優于單機系統；分散式事務處理採用兩階段提交協議，通信次數較少並能確實保證副本一致。
分享友人
分享到 Line

分享到臉書