concept node 中文意思是什麼
concept node
解釋
概念結點-
Congener concept was introduced into the lattice union algorithm, which was used to update each child node in less time according to the order relation of the concepts
摘要提出了同類概念的觀點，在格的合併演算法中通過利用同域概念格之間的同類概念和概念的父子關系實現對其所有子節點的快速更新，以提高概念格橫向合併演算法的時間效率。 -
The concept of otn node transmission model is introduced. the requirement of otn node transmission model is discussed. this model uses the frequency domain transmission matrix to express the otn node transport characteristics. the simplified model based on wdm and im - dd systems, the relationship between node characteristics and model parameters and measurement of model parameters are also discussed. at last a briefly discussion on how to develop the otn simulation and cad software based on our model is demonstrated
在線性時不變的假設下，提出利用頻域傳輸矩陣來表示節點傳輸特性的方法給出了oxc和oadm兩類光傳送網節點的統一的表示根據目前通用的波分復用強度調制直接檢波系統的特點對復雜的頻域傳輸矩陣進行了簡化並對通常所關心的節點主要性能指標與模型參數的關系模型參數的測量和計算模型的設計與計算機模擬輔助設計軟體開發的銜接問題進行了討論。 -
This, in turn, makes obvious the need for the concept of on - demand computing, which might be implemented on any configuration, from a simple cluster of servers to a network of 1024 - node sp2s
而這又明顯地需要按需計算的概念（ on - demand computing ） ，按需計算可能是在任何配置下實現的，從簡單的服務器集群到有1024個節點的sp2網路。 -
In order to solve problems of the distributed parallel system such as the node management and communication, this thesis designs the “ commtor ” module and proposes the concept of “ communication field ” to limit the communication range of distributed parallel systems
為了解決分散式并行系統的節點管理和節點間通信問題，本論文設計了通信子模塊，並提出了通信域的概念來限制分散式并行系統的通信范圍。 -
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節點圖表示求法的一些普遍結論。 -
3 ) to discover association rules, we present a framework based on concept lattice. first, in the light of the requirement of mining association rules, the structure of concept node is simplified, and the corresponding building algorithm is developed. then we give out the algorithms for extracting association rules from the lattice based on intent reduct, where two properties are exploited to remove the redundant rules
首先，針對關聯規則發現的需求，我們對概念格節點的結構進行了相應的簡化修改，並給出了相應的構造演算法；然後基於內涵縮減，我們給出了從格上提取關聯規則的演算法偽碼，兩個性質被用來去除冗餘的關聯規則；文中還分析了基於概念格的關聯規則發現與傳統的發現演算法相比所具有一系列的優點。 -
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
提出了光傳送網節點路由模型的概念，討論了節點路由模型應達到的要求和建立模型的意義給出了普適的矩陣表示法和針對節點具體結構的圖表示法並討論了兩種方法各自的優缺點。最後針對實際的光傳送網節點給出了幾個例子，並通過這些例子說明了路由模型矩陣表示和圖表示的求法。 -
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樹問題；最終確立了學習內容的獲取就是以樹根為學習目標，以分枝節點為相關概念組織，以樹葉節點為對應的媒體素材的邏輯聚集。 -
2 ) based on the invariability ( or approximate invariability ) of function value, we give out the definitions of intent reduct ( or approximate intent reduct ) and intent core ( or approximate intent core ) of concept node, investigate their properties in detail, and prove that the problems of computing them can be transformed into the problem of computing the minimal cover of a family of sets
2 ）在函數取值不變性（或近似不變性）的基礎上，提出了概念節點的內涵縮減（或近似內涵縮減）和內涵核（或近似內涵核）的概念，詳細地研究了它們的性質，證明了它們的計算問題都可以等價地轉化為族集最小覆蓋集的計算問題。 -
A consummate node load computing method is put forward after synthesizing various of load index literature. by using the arithmetic of dynamic adjustive load banlance and introducing the concept of double thresholds, every node can rapidly transfer load in weight load and in idlesses or light load it can rapidly transfer load
本文中在綜合各種負載指標的文獻后提出了較為完善的節點負載計算方法，並且引入雙閾值的概念提出了具有特色的動態自適應負載平衡演算法，使各節點在空閑或輕負載時能夠主動地向服務器申請，在重負載時能更快地進行負載遷移。 -
In the system, the water - source nodes the conjunction nodes and the end nodes of a certain pipeline network are designed to sourceagent tubenetagent useragent respectively. tmanageragent, designed as the manager, is selected among the agents in the same circuit. the virtue node of a multi - source pipeline network is designed to virtueagent according to the concept of " virtue circuit "
該系統將自來水管網中的水源供應點、管網相交節點和管網末梢分別設計成為水源主體、管網主體和用戶主體；還從管網中各個小環內的管網主體里選擇其中一個作為該小環的管理者，並將它設計成為管網協助者主體。 -
The node concept is implemented in kernel by using structure
節點的概念在內核中是使用
分享友人