node number 中文意思是什麼
node number
解釋
節點編號-
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
並對膿腫、竇道，腫大淋巴結大小、個數、發生部位、病理類型進行分析。 -
According to the characteristic of the distribution network, based on thenewton - raphson method, used the object - oriented thought, bring forward an unite load node method for power flow calculation, and making a improvement of the node number method which is suitable for newton - raphson method, obtained a rapid convergence calculation method for power flow calculation
根據配電網的特點，基於牛頓?拉夫遜法運用面向對象的思想，提出了負荷節點合併的潮流計算方法，並引入了改進的，適合於牛頓拉夫遜法的節點編號方案，得到了一個快速收斂的潮流演算法。 -
The scheme determined the node number of the networks automatically and resulted in an optimal network structure under bic rule
該演算法權衡網路的規模和精度兩方面因素，自動地確定網路的節點數目，可以得到在bic準則下最優的小波神經網路。 -
The synchronization control algorithm for entity set in ciao ( collaborative immersive architectural layout ) is amended. within the amended algorithm, semi - optimistic locking mechanism in ciao is replaced by token mechanism, and receiver - reliable multicast based on the father node number is proposed to enhance robustness of system. entities and avatars in scene are organized the structure of tree
西南交通大學博士研究生學位論文第11頁改進了ciao （ collaborativeimmersivearchitecturallayout ）中實體組同步控制演算法，用令牌機制替換ciao中半樂觀鎖機制，並提出了基於父節點記錄的收端可靠多播演算法，即在每個實體的espdu （ entitystateprotocol ? dataunits ）中增加父節點的節點號，接收端根據父節點的節點號調整本地場景樹的結構。 -
By the method of optimizing node number, the storage technology of one - dimension changing bandwidth and the solver utilizing block - to - block technology, the sgscad has a high speed of calculating and efficiently reduces the size of memory requested
通過對結構節點編號優化方法的研究，以及採用一維變帶寬存儲技術和分塊求解技術，大大加快了計算速度，減小了內存要求。 -
After designing the hidden - layer structure of network, the neural network data - mending program is developed with matlab, and with the contrast of results gained from single and double hidden - layer the number of hidden - layer is selected. after the training algorithm is studied, using the visual application - designing tool, visual basic, the application adopting the designed algorithm is developed. with plenty of experimental study, the node number of the hidden - layer is decided and the rational algorithm is designed, which can advance the speed of training network, and decrease the probability of running into the local teeny value
在研究網路隱層結構后，用matlab編制了神經網路修補程序，對比單雙隱層結構的修補結果，確定了修補用bp神經網路的隱層數；在研究網路訓練演算法后，利用可視化應用程序開發工具visualbasic ，編制了相應的應用程序，通過大量的實驗研究，確定了網路隱層節點數，設計了合理的網路訓練演算法，提高了網路的訓練速度，減小了網路訓練陷入局部極小的可能性。 -
When using bp neural network deals with the data of the big numerical value like cost, using common methods of changing concealed node number etc. do n ' t improve the things that the simulated curve is low precision or transpires. so data processing course of network is investigated. a new data processing method is advanced to apply graphics zoom theory
在用bp神經網路進行建模的過程中，發現對處理費用這種大數值數據時，採用通過改變隱層節點數等常用方法，都無法改善擬合的曲線精度低或出現發散這樣的情況，為此通過研究網路的數據處理過程，提出了一種在網路運行前後應用圖形圖像縮放原理來對數據進行處理的新方法，實例證明了該方法的可行性和有效性。 -
The location of this directory is based on information provided by the user the database path and information determined from the environment the instance name and the partition node number
該目錄的位置取決于用戶提供的信息（數據庫路徑）和環境信息（實例名和分區/節點號） 。
分享友人