源節點 的英文怎麼說

中文拼音 [yuánjiédiǎn]
源節點 英文
originating node
  • 源 : 名詞1. （水流起頭的地方） source （of a river）; fountainhead 2. （來源） source; cause 3. （姓氏） a surname
  • 節 : 節構詞成分。
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 節點 : [電學] panel point; hybrid; packing; node; nodal points; joint of framework; pitch point; point pitch
  1. As a bonus, understanding the simple identity transform is key to proficiency with several xslt idioms, including

    這樣做的還有一種好處，理解這種簡單的恆等變換是熟悉和掌握幾種xslt短語的關鍵，包括將源節點復制到輸出中的
  2. Then, an improved genetic algorithm is proposed to solve this problem. this algorithm makes trees with the source and all destinations are the space of operation and filter operation. with hybrid selection operator, competition among brothers, greedy operation, filter operation

    然後給出了一種基於遺傳演算法的實時多播路由選擇方法，並用改進的遺傳演算法進行了求解，該演算法採用包含源節點和目的節點的樹作為交叉和變異的空間的方法，通過加入混合選擇、小范圍競爭擇優的交叉變異操作，提高了全局搜索能力和收斂速度。
  3. This problem refers to constructing minimum - cost spanning trees constrained by delay, which is known to be np - complete

    該問題的目標是創建一棵覆蓋源節點和目的節點的代價最小樹，且滿足端到端時延要求。
  4. The main purpose of multicast routing is to construct a tree rooted at the source and spanning all destinations, while the quality of services ( qos ) be satisfied

    組播路由演算法的目標是尋找一棵連接源節點和多個目的節點的組播樹，同時滿足各種服務質量需求。
  5. Multicast routing is a network - layer function that constructs paths along which data packets from a source are distributed to reach many, but not all, destinations in a communication network

    組播實現了同一信息從源節點傳送到網路中多個目的節點（並不一定是所有節點） 。
  6. Lastly, we select bounded paths satisfying delay variation from them to develop a delay and delay variation constrained multicast tree. we compare the proposed algorithm with some exists algorithm in system running time and success rate

    然後，從得到的若干路徑中選取滿足時延差別約束的源節點到各目的節點的路徑，從而得到一棵滿足時延和時延差別約束的組播樹。
  7. With regard to the flow regulation of the best - effort traffic, the controllable traffic in high speed computer communication networks, the present paper proposes a novel control theoretic approach that designs a proportional - integrative ( pi ) controller based on multi - rate sampling for congestion controlling. based on the traffic model of a single node and on system stability criterion, it is shown that this pi controller can regulate the source rate on the basis of the knowledge of buffer occupancy of the destination node in such a manner that the congestion - controlled network is asymptotically stable without oscillation in terms of the buffer occupancy of the destionation node ; and the steady value of queue length is consistent with the specified threshold value

    本文從控制理論的角度出發，針對計算機高速網際網路中最大服務交通流即能控交通流的調節問題提出了一種基於多速率采樣的具有比例積分（ pi ）控制器結構的擁塞控制理論和方法，在單個節點的交通流的模型基礎上，運用控制理論中的系統穩定性分析方法，討論如何利用信終端節點緩沖佔有量的比例加積分的反饋形式來調節信源節點的能控交通流的輸入速率，從而使被控網路節點的緩沖佔有量趨于穩定;同時使被控網路節點的穩定隊列長度逼近指定的門限值。
  8. Multicast routing is a network - layer function that constructs paths along which data pachets from a source are distributed to reach many, but not all, destinations in a communication network, a fundamental issue in multicast communication is how to determine an efficient message route ( multicast routing )

    網路中的通信由單一的兩點間的通信向多點間的通信發展，因此對多播和群播（是多播的一種推廣）技術的研究也成為網路通信領域中的一個重要研究課題。多播是一個源節點將同一信息傳送到多個目的節點（但不是所有節點）的通信方式。
  9. 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

    為此本文在無線傳感器網路中研究了基於自適應的路由演算法，主要工作如下:針對傳感器節點能量及傳輸范圍有限等特點，提出了一種基於延遲的自適應洪泛路由演算法，首先通過源節點在網內用較小的路由請求報文和路由回復報文來建立路由，路由建立的過程中自適應地確定等待時間以使更優的路由請求報文得到轉發，然後源節點再沿著建立好的路徑轉發較大的數據報文。
  10. Every command transmitted in the short message gateway system has a sequence number, which is generated by the command source node and marks a command exclusively ; i. e., the sequence numbers of any two commands in the gateway systems are different

    短消息網關系統之中傳輸的每一條命令都有一個序列號，序列號由命令源節點產生並唯一標記一條命令；也就是說，網關系統中任何兩個命令的序列號都不相同。
  11. Abstract by setting up a network model of data aggregation and using a bit - hop metric to quantify energy costs in wireless sensor networks, we formally analyze the problem of area - based data aggregation and obtain that data aggregation will definitely be energy efficient when the relative difference between the average lengths of the two shortest paths, which are from source sensor nodes to the sink and to the aggregation node respectively, is not less than the ratio of data correlation to the number of source sensor nodes

    摘要通過抽象出無線傳感器網路中區域數據回傳的網路模型，定量研究了區域數據聚合的節能條件，證明了先聚合再回傳比直接進行數據回傳所節省的相對路徑長度，如果大於等於數據相關性與源節點個數的比值時，區域數據聚合一定可以節省能耗，並進一步給出了當數據聚合點在網路的不同位置，或數據的空間相關性不同時，區域數據聚合的節能條件。
  12. Through the analysis of the reliability and the validity of rdab algorithm, we can affirm that the rdab algorithm is a valid flooding broadcast algorithm. simulation results show that rdab strategy outperforms the ordinary flooding broadcast method ( obm ) for the ad hoc networks

    該演算法是一種典型的按需路由演算法，它利用路由回復分組給源節點反饋回正向路徑上總的排隊分組數，動態的選擇最佳路徑。
  13. The transparency of network ffi ill n remf4 % r $ x # isr % lr # { tritx connection often results in the dependency of the souxce node and the dependency of ipc communication has the great opposite effect on the performance of migrant

    網路連接的透明性要求常常導致進程的源節點剩餘相關性， ipc通信源節點剩餘相關性對遷移進程的性能有著巨大的負面影響。
  14. The migration algorithm proposed by this paper allow that the execution of process migrating and process going is concurring to the most degree. the migration algorithm speeds up the migration, reduces the communication overhead and avoids residual dependencies

    本文基於進程遷移的三個條件提出的進程遷移演算法，最大程度地將進程狀態遷移和進程的運行并行起來，從而提高了遷移速度，網路通信量也較小，而且也沒有對源節點的殘余依賴性。
  15. In computer networks, multicasting is becoming increasingly important. tree construction is a commonly used approach arises from the ability to potentially share many links in transmitting the message to destination set

    實現多播的一般方式是建立多播樹，多播樹是根為源節點，且覆蓋所有多播成員的一棵樹。
  16. Firstly, by selecting and defining the resource load indexes rationally, lbmr take into consideration the effect on the resource usage of source node and destination node by the migrant. by means of vector operations, lbmr can use multiply resources in harmony. secondly, lbmr adopts the smallest k - subset random algorithin, and the load index information is provided by the information cache

    Lbmr演算法的主要思想有三點：第一，基於合理選擇和定義的資源負載向量，綜合考慮進程遷移對源節點和目標節點資源利用率的影響，通過向量運算協調多種資源的平衡使用；第二，基於最小k子集隨機演算法，採用信息cache提供的負載信息作為負載平衡演算法位置策略的選擇依據；第三，基於進程生命時間的概率分佈，根據遷移進程減速（ slowdown ）數學期望值的改善程度，選擇適合於遷移的進程。
  17. Many advantages make optical fiber suitable used as transmission medium of high - rate broadband services, such as broad transmission band, large capacity, low loss, strong immunity to interference etc. among optical access network, passive optical network ( pon ) is paid more attention throughout the world. it offers easily upgraded and low cost of lay, ope ration and maintenance. especially passive optical network based on atm ( atm - pon ) integrates the capability of supporting multiple qos services with atm and transparent transmission with pon

    在光纖接入網中，無源光網路（ pon ）由於不採用有源節點、敷設和運行維護成本低且成本共享、對業務透明、易於升級等優點而備受世界各國的關注，特別是以atm為基礎的無源光網路（ atm - pon ） ，由於結合了atm多業務、多比特率的支持能力和pon的透明寬帶傳送能力，將成為實現未來寬帶接入乃至最終實現ftth的重要方式。
  18. That identifies the source node or nodes to which the rule applies

    標識應用規則的源節點的
  19. From the source node set, the predicate creates another node set with exactly

    從源節點集，謂詞創建另一個正好有
  20. By default, all of the source nodes are added to this list, but you can remove one or more by adding them to the

    預設情況下，所有源節點都被添加到該列表，但可以通過將一個（或多個）元素添加到
分享友人
分享到 Line

分享到臉書