number node 中文意思是什麼
number node
解釋
已編號節點-
Motivated by this observation, this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories. two algorithms are developed based on best - first traversal paradigm, called bfp k nn and bft k nn, which handle the k nn retrieval with respect to the static query point and the moving query trajectory, respectively. both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result
例如，若已知動物的軌跡，則動物學家可能提出如下兩種查詢： i在時間區間ti ， tj內找到離一個給定的靜態點譬如食物源實驗室等最近的k條動物軌跡ii在時間區間ti ， tj內找到離一條預先指定的動物軌跡最近的k條動物軌跡。 -
Firstly, second harmonic component ratio and dead angles of two phase inrush ' s dispersion in three - phase transformes are acted as input variable. secondly, the method applies improved algorithm based on the original algorithm of multi - layer forward back propagation network, that is to say, adding last variational effect of weight value and bias value to this time and making use of variable learning rate. at the same time, this method also adopts dynamic form in the number of hidden floor node
首先，文中將三相變壓器兩相涌流差流的二次諧波含量比和間斷角作為網路的輸入變量；其次，利用對原有bp網路訓練演算法基礎上的改進型演算法（即在計算本次權值和閾值的變化時增加上一次權值和閾值變化的影響以及採用變學習率，與此同時隱含層神經元個數採用動態形式） ，通過樣本訓練使網路結構模型達到最優。 -
We deduce frondose algorithm of three layers bp neural networks which is used in common, and discuss several important issues in designing neural networks which is used to forecast, for example, number of hidden layer, nerve cell number of hidden layer, epoch of learning, embryonic power value, decision of node number about input and outputo at the same time, this dissertation sums up things that conventional bp algorithm is improved on considering disadvantages of it
3推導了常用的三層bp神經網路具體演算法，討論了實際預測應用中神經網路設計方面的幾個重要問題，如隱層數、隱層神經元數、訓練次數、初始權值、輸入節點數以及輸出節點數的確定。同時，針對傳統bp演算法存在的各種各樣的缺點，文中綜述了對其改進的情況。 -
Facilitating the configuration of protocol parameters, optimization of protocol operations, and more exact estimation of protocol performance, etc. basing on combinatorial theory and asymptotic method, we analyzed the properties of manets with nodes uniformly distributed in rectangular region. mathematical formulas of some basic properties of manets are obtained, such as the expected number of wireless links, mean node degree, the relation between network connectivity and radio range
因此本文第二章基於組合學方法和極限思想研究了矩形區域內節點均勻分佈的無線自組網的幾項基本屬性，網路中鏈路總數的期望值，網路中節點度數分佈情況，以及網路連通性與無線信號傳輸半徑的關系等，得出了其解析描述。 -
The number of descendant node levels to retrieve from the target ancestor node
要從目標祖先節點檢索的子代節點的層次數。 -
The number of ancestor node levels to traverse when retrieving the requested ancestor node
在檢索請求的祖先節點時要遍歷的祖先節點的層次數。 -
The node number is automatically appended to the path
節點號被自動附加在路徑的後面。 -
In decnet, a packet that has exceeded the maximum number of visits for the recovering node
在dec網路中，對正恢復的網點的訪問次數超過了最大值的一個分組報文。 -
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場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。 -
The sub - model for design of population density was developed according to the principle of determining boll number from target yield, fruit node from boll number, fruit branch from fruit node and population density from fruit branch by integrating the effects of sowing date, cutout date, effective temperature accumulation above 12, variety type, and fertilizer and water management levels. sowing rate was then decided by integrating the effects of different soil water and salt contents, ph, temperature and sowing style on seedling emergence rate with relative weight method
基於「以產定鈴、以鈴定節、以節定枝、以枝定苗」的原理，同時考慮播種日期、打頂日期、 12的有效積溫、品種株型特性、肥水管理水平差異等因素來確定適宜的種植密度；在此基礎上，應用相對權重法計算土壤含水量、含鹽量以及整地質量和播種方式等多個生態環境因子對出苗率的綜合影響，進而確定播種量。 -
The 00 ( object - oriented ) technique of standard template library with ansi / iso c + + is used in designing the program, and the dynamic access mechanism and the startup with zero content are realized by using the specialization and inheritance object of vector template class as the data container which can change the content itself according to the number of discretization node data of a computing practicality. so, the fact that the use of the static ems memory which is not necessary is avoided
在設計面向對象有限元程序中運用了基於ansi isoc + +標準模板庫（ stl ）的技術，以向量模板類的特化繼承對象為變容量數據容器，實現了可按計算實例的離散結點數量動態存取數據的機制和數據容器的零容量啟動，從而避免了運算時系統對靜態內存空間的超量佔用。 -
Based on this extended model, we then propose an oblivious algorithm that can route messages between any two nodes in o expected number of hops. our routing algorithm keeps only o beta 1 bits of information on each node, where 1
Kleinberg證明了如果每個節點只用local的路由信息，簡單的貪婪演算法可以在o lg n 2的期望時間內完成任何兩點間的路由過程。 -
The size, number, location and pathologic types of abscess, fistula and lymph node were also analyzed
並對膿腫、竇道，腫大淋巴結大小、個數、發生部位、病理類型進行分析。 -
The filter also specifies the number of siblings necessary to reach the comparison node
篩檢程式還指定達到對照節點所必要的兄弟節點的數量。 -
The everything - is - a - node abstraction loses some value because of the number of node types that exist, and because of the lack of uniformity present in their access methods
由於存在的節點類型數量及其訪問方法缺乏一致性， 「一切都是節點」的抽象喪失了一些意義。 -
Each line in the image represents a node, the number of times a search bot visited the node determines the length of the line
圖像中的每根線代表一個節點，爬蟲訪問節點的次數決定了線的長度。 -
The results revealed that the fresh legume total yield was con elated very significantly with the height of plants the number of node, the number of divarication, the length and the weight of per legume and the yield of per plant
結果表明：鮮豆莢總產量與主蔓長、主蔓節位數、單株分枝數、豆莢長、單莢重、單株鮮豆莢重有極顯著的相關性；四棱豆塊根的總產量與單株塊根數、單株塊根重有顯著的相關性。 -
Because it distributes interceders of different source to each node in system, lets each interceder work as controlling node in centralizing control arithmetic, it has message number of centralizing control arithmetic and load equilibrium of distributed arithmetic. characteristic of auto - transfer brings dependability of distributed arithmetic, because while a node has down, other nodes ’ requests that had been sent to it can send to other nodes by producing new interceder
該演算法將不同鎖對象（共享資源）的仲裁者分佈到了系統中的各個節點，讓每個仲裁者都像集中式演算法中的控制者一樣的工作，因此，該演算法具有集中式演算法的消息量和分散式演算法的負載均衡。 -
When planning to consolidate multiple stand - alone servers to sql server failover cluster instances, we recommend, as part of the planning process, that you verify that the cluster node hardware configuration is sufficient to support the number of instances of sql server to be hosted
計劃將多個獨立服務器合併到在故障轉移群集上的虛擬sql server實例時，我們建議在計劃進程中，確保群集節點硬體配置足以支持要承載的sql server實例數。 -
Variable - number - node element
節點數可變元
分享友人