目的節點 的英文怎麼說
中文拼音 [mùdejiédiǎn]
目的節點
英文
destination node- 目 : Ⅰ名詞1 (眼睛) eye 2 (大項中再分的小項) item 3 [生物學] (把同一綱的生物按彼此相似的特徵分為幾...
- 的 : 4次方是 The fourth power of 2 is direction
- 節 : 節構詞成分。
- 點 : Ⅰ名詞1 (液體的小滴) drop (of liquid) 2 (細小的痕跡) spot; dot; speck 3 (漢字的筆畫「、」)...
- 目的 : purpose; aim; goal; objective; end
- 節點 : [電學] panel point; hybrid; packing; node; nodal points; joint of framework; pitch point; point pitch
-
This type of approximation is made at a finite number of points.
這種近似法是在有限數目的節點處來進行的。Naked news, which features anchors and reporters who disrobe during newscasts, launched its risque take on current affairs in japan
有傷風化的" * *新聞"近日在日本推出時事新聞服務,這檔節目的特點就是主持人和記者一邊播報新聞一邊脫光衣服。In power system full dynandc simulation software, the adndttance matrixes of fault branches are adopted in the fault models to simulate arbitrary symmetrical and unsymmetrical faults, by use of contraction technique for adndttance matrix the multi - faults and the randomly occurred faults can be processed. the feature of this method is that the arbitrary multi - fault occurred in a branch can be simulated without any additional branches or buses to be added, thereby, the ca1culation efficiency and the expedience of usage are improved
本文提出採用故障支路導納陣處理復故障計算,該演算法可以對一條支路發生任意重故障進行處理,而不需要增加支路或節點,克服了目前常用的電力系統機電暫態程序在處理復故障時,一般要按照事先預想的故障類型以及故障和操作發生的位置增加新的節點和小開關支路的問題。A security enhancement scheme is proposed to encounter the black hole attacks in aodv protocol. this scheme may solve the black hole problem and prevent personating the destination node to some degree. 3
針對移動adhoc網路aodv協議中所存在的黑洞攻擊,提出了一種增強安全性的解決方案,該方案能在一定程度上解決黑洞問題並可防止假冒目的節點攻擊。Because of the different function of roads and the difference of region, the form of intersections and connections between them is different with each other. at present, the types of nodes adopted in china and abroad include uncontrolled intersections, all - way stop - controlled intersections, two - way stop - controlled intersections, signalized intersections, roundabouts, grade - separated junctions and their combinations. each type of nodes has different characteristics and adapts to different function demands
城市道路是以網路形態分佈於城市區域內的地面交通設施,由於道路的功用不同以及地域的差異,各道路間的交叉和連接方式各不相同,目前國內外所採用的節點形式有無控制平交節點、全停牌控制平交節點、二路停牌控制平交節點、信號燈控制平交節點、平面環行節點、立體交叉節點以及它們的組合形式,各種節點具有各自的特性,適合於不同的功能需求。The paper has introduced water - saving ideas of the water project funded by the world bank loan and relative measures for realizing water - saving and implementation results, and looked into the future replication of achievements by this water - saving irrigation project
摘要重點闡述了世行貸款節水灌溉項目的節水理念、介紹了為實現節水目標而採取的節水措施和執行成效,並展望了推廣世行節水灌溉項目成果的前景。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
然後給出了一種基於遺傳演算法的實時多播路由選擇方法,並用改進的遺傳演算法進行了求解,該演算法採用包含源節點和目的節點的樹作為交叉和變異的空間的方法,通過加入混合選擇、小范圍競爭擇優的交叉變異操作,提高了全局搜索能力和收斂速度。This problem refers to constructing minimum - cost spanning trees constrained by delay, which is known to be np - complete
該問題的目標是創建一棵覆蓋源節點和目的節點的代價最小樹,且滿足端到端時延要求。A fundamental issue in multicast communication is how to construct low - cost trees that will satisfy the quality of service ( qos ) requirements and spanning all destinations
組播問題關鍵是在於建立一棵滿足qos約束條件且覆蓋所有目的節點的最優組播樹。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
組播路由演算法的目標是尋找一棵連接源節點和多個目的節點的組播樹,同時滿足各種服務質量需求。Optimization of the network cost can reduce network resources consumed by communication, while optimization of the delay can reduce the delay from source to receivers
優化網路代價將減少通信過程消耗的網路資源,而優化網路時延將減少從源點到目的節點的時間。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
組播實現了同一信息從源節點傳送到網路中多個目的節點(並不一定是所有節點) 。Combined with the qos based initial route setup algorithms and destination node leaving algorithms, the qos guarantees for distributed multimedia dynamic group applications could be supported
該演算法同初始路由建立演算法及目的節點退出演算法相結合,可以提供對分散式多媒體動態組應用服務質量保證的支持。Abstract : in this paper, with the support of the qos - based initial route setup algorithms, a destination node initiated and qos - based algorithm, which can support the member to join in the group dynamically, is presented
文摘:文中在基於服務質量的動態組多媒體通信初始路由建立演算法基礎之上,提出了一種由目的節點啟動的基於服務質量的支持成員加入動態組的演算法。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
然後,從得到的若干路徑中選取滿足時延差別約束的源節點到各目的節點的路徑,從而得到一棵滿足時延和時延差別約束的組播樹。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 )
網路中的通信由單一的兩點間的通信向多點間的通信發展,因此對多播和群播(是多播的一種推廣)技術的研究也成為網路通信領域中的一個重要研究課題。多播是一個源節點將同一信息傳送到多個目的節點(但不是所有節點)的通信方式。To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost
通過分析影響網路的鏈路負載均衡的因素,比如源-目的節點間的最大流,通過每條鏈路的最大流,源-目的節點間的路徑數目,通過每條鏈路的路徑數目,以及鏈路的剩餘容量等,提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ,通過模擬,與最小跳演算法( mha ) 、最寬最短路徑( wsp )演算法、最小干擾路由演算法( mira )相比較,提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。And then based on this modal, some classic algorithms such as a * algorithm, are analyzed. in the process of the realization of the a * algorithm, an appropriate function, which can find the best route in according to the flow time and the length is always playing the great role. lastly, the essay concludes what have done mainly during this development process and the effectiveness of the study
文中從城市道路網路的特點出發,分析了道路路段間的連通關系,建立了一個合理的網路拓撲模型,然後分析這個網路拓撲模型以及一些經典的演算法,依據a *演算法的思想,構造了合理的啟發函數,從而根據流量、時間、距離等參數求出源點到目的節點的最優行車路線。Secondly, optical nodes usually do not possess the ability of wavelength interchange for the restriction of cost and technology, optical network brings out so - called wavelength continuity constraint because connection must be established on the path that be carried by the same wavelength between source and destination nodes
再者,波長轉換技術和成本限制使得網路節點一般沒有波長轉換能力,源目的節點間的通信連接必須始終承載在同一波長通道上,產生了所謂的波長連續性限制。In this thesis, routing protocol and wireless resource management are combined for the voice service in the communication network. session triggers the source node to build the bandwidth reserved routing to the destination. for the data service, aodv protocol is used to find the shortest route between source and destination, and the data is transmitted hop by hop
本文將路由協議與無線資源管理相結合,對于通信網路中的話音業務,每次會話觸發源節點發起建立預留帶寬的路由;對于數據業務,採用aodv路由演算法按需尋找從源節點到目的節點的最短路徑,然後逐跳進行預約傳送數據。分享友人