node of graph 中文意思是什麼

node of graph 解釋
圖的節點
  • node : n 1 節;結;瘤;【蟲類】結脈。2 【植物;植物學】莖節;【醫學】硬結腫;結,節結;【天文學】交點。3...
  • of : OF =Old French 古法語。
  • graph : n. 1. 【數學】曲線圖;坐標圖,圖表。2. 統計曲線。vt. 用圖表表示,把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. In the process of arithmetic design, newton " method is used to compute power flow of network. graph theory knowledge is used to determine all paths from generator to load. to improve efficiency, thesis use branch expunction method to optimize the node order

    在演算法設計過程中,採用牛頓拉夫遜法進行潮流計算得到系統潮流分佈,利用圖論原理中的路徑搜索演算法確定了發電機對負荷的供電路徑,此外為了提高潮流跟蹤的計算效率,利用了支路消去法進行節點順序的優化。
  2. On the basis of familiar with can bus and gsm communication, considering hev ( hybrid electric vehicle ) battery administrative system ' s demand for the host pc monitoring system, i have designed can - rs232 converter gateway to realize transmission the real - time data from can node to rs232 serial port, which is carried out by the project of at89c52 mcu + sja1000 can controller + 82c250 can controller interface. host monitoring software has accomplished real - time datas display, storage, historical datas graph analysis and storage fashion change from access to excel, at the same time, realized important datas transmission remotely with tc35 short message module. system software programs in assembly and vb

    Can - rs232轉換網關採用at89c52微處理器+ sja1000can控制器+ pca82c250can控制器介面實現對can總線節點通訊的監聽,並將其轉換成rs232串口電平發送到pc機串口,同時用siemens公司的tc35模塊和at指令實現現場採集系統重要數據和錯誤信息的短消息通訊。在上位pc機監控系統中,主要完成的是對串口設置的選擇控制、現場採集數據的實時刷新顯示、歷史數據的圖表分析及數據的access數據庫存儲和excel電子表格的轉換。系統軟體採用匯編語言和vb實現。
  3. To analyze some key technologies of optical network relative with rwa in detail, such as transmission, switching and internetworking ; to emphasize on the research of function, fabric and performance of optical cross - connection ; to carry out numerical simulations for crosstalk introduced by optical cross connect and to present measurements for suppressing it such as doubly filtering, fixing optimum decision threshold and appropriately choosing the number of multiplexed wavelengths ; 3. to research the fundamental principle and some problems relative with rwa, including the type of optical network, the type of traffic, the type of service, the survivability of optical network ; to classify and compare rwa algorithms and particularly research some dynamic rwa algorithms ; 4. to present reserved light - path and classify network resource such as used, unused and reserved status, to emulate establishment of all - optical connection in optical network through modified rwa algorithm and show effectively reducing setup time of all - optical connection utilizing reserved light - path ; to research rwa algorithms of multi - fiber network, to present new link weight functions dependent on node degree, unused fiber ( s ) per wavelength - layer and routing policies, to perform emulation of rwa based wavelength layer graph applying new link weight functions and show them make algorithms better performance and network lower blocking rate ; 5

    詳細分析了與rwa相關的光網路關鍵技術,包括傳輸、交換、組網等,重點研究了光交叉連接的功能和結構、性能,對其引入的串擾進行了詳細分析,選擇恰當的器件參數進行了數值模擬,並提出了抑制措施(如雙重濾波、優化判決門限、選擇恰當的復用波長數) ; 3 .研究了光網路的r認叭的基本原理、與r認叭的幾個相關問題(光網路類型、業務類型、流量類型、光網路生存性) 、 r認人演算法的分類和比較,具體研究了幾種動態r場人演算法; 4 .研究了以全光連接建立時間為優化目標的r認認演算法,提出預置光路的概念,對網路資源進行狀態分類(佔用、未佔用、預置) ,利用改進的r認叭演算法模擬,預置光路可為部分新到的連接請求快速建立連接,從而提高網路性能;研究了以多光纖網路連接阻塞率為優化目標的r認城演算法,提出了以節點度數、每個波長分層的空閑光纖數以及路由策略決定的幾種鏈路權重函數,利用基於波長分層圖模型的并行r場人演算法模擬,利用新的鏈路權重函數使得演算法具有更優的性能,使網路具有更低的連接阻塞率。
  4. 4 ) an algorithm for reliability upper bound assessment of large - size network is presented, which is based on the principle of topological classification of node - set ; and the lower bound can be also obtained by dual graph of oriented network.

    應用圖論的點集拓撲分類原理,提出一個計算大型復雜網路可靠度上界的類分法,並應用對偶理論求解網路可靠度的下界。
  5. To ensure the well - formed of wscg model, we have developed an algorithm to check the type - safety of wscg model, in which data edges of wscg model can be used to check whether the export messages of an edge ' s source node is matched with the import messages of the edge ' s target node, and to determine whether the import messages of a node is self - contained. we also develop another algorithm, which is based on wscg dependence graph that simulates the wscg dynamic behaviors, to eliminate the deadlock of wscg model

    在wscg模型的基礎上,針對目前web服務復合模型缺乏良構性驗證的問題,在wscg模型的靜態特性驗證方面,我們定義了wscg模型的類型安全性,並給出了相應的wscg模型全局類型安全性的驗證演算法,解決了驗證wscg模型中輸入輸出消息集合的類型是否匹配以及輸入消息是否是完備的問題;在wscg模型的動態特性方面,我們主要分析了wscg模型的可達性、活鎖和死鎖問題。
  6. The algorithm makes use of the node - arc structure of graph and depth - first - search, have realized the retrieval of optimum path in virtual navigation

    該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。
  7. The concept of the graph form of a blocking optical cross - connector is introduced so as to investigate the blocking situation. the principle is that the blocking node can be replaced by a graph which is composed of nonblocking nodes and capacity limited edges. three graphs of typical optical cross - connector nodes are demonstrated. several uniform result are derived from these examples

    該方法的基本思想是用圖來替代交換能力受限制的節點,而此圖由交換能力不受限制的節點和容量受限的邊組成。文中以典型的阻塞oxc節點為例,給出了它們的圖表示,並通過例子得出一般的oxc節點圖表示求法的一些普遍結論。
  8. Fault subcode indicating that the soap message was rpc - encoded and the type name property of an encoded graph node was not specified

    錯誤子代碼,用於指示soap消息採用了rpc編碼並且未指定編碼圖形節點的類型名稱屬性。
  9. It is introduced that the concept of otn node route model. it is also discussed that on the requirements of the otn node route model and why we define this concept. the matrix and graph forms of the model are demonstrated. the two forms are compared with each other. at last, it is given that several examples and explain how to find the matrix and graph forms through these examples

    提出了光傳送網節點路由模型的概念,討論了節點路由模型應達到的要求和建立模型的意義給出了普適的矩陣表示法和針對節點具體結構的圖表示法並討論了兩種方法各自的優缺點。最後針對實際的光傳送網節點給出了幾個例子,並通過這些例子說明了路由模型矩陣表示和圖表示的求法。
  10. This thesis transforms the composition of learning content into the logic cluster of correlative concepts in the concept layer, and proposes the idea of learning content hierarchy graph. by means of the and / or graph of artificial intelligent theory, we can transform the learning content into the problem of and / or tree further. hence, we conclude that the learning content is a tree, the root is learning goal, the branch node is correlative concept, and the leaf is media material

    本文將具體的學習內容組織轉化成在概念層上相關概念的邏輯聚集,提出了學習內容層次圖思想;經過分析發現學習內容層次圖的組織方式和人工智慧理論中的and / or圖之間存在著相似性,將學習內容的獲取轉化為and / or圖中的and / or樹問題;最終確立了學習內容的獲取就是以樹根為學習目標,以分枝節點為相關概念組織,以樹葉節點為對應的媒體素材的邏輯聚集。
分享友人