相鄰網格 的英文怎麼說
中文拼音 [xiānglīnwǎnggé]
相鄰網格
英文
neighboring grid-
In chapter 2, the meteorological knowledge, data and the methods of the data processing, related to the study on the atmospheric loads, are simply presented. the model for the perfect gas constant, describes by the relative moisture, is developed. the influences of the variation in the vapor component in the atmosphere on the perfect gas constant are evaluated by using the changing characteristics of the temperature on the surface, its spatial gradient and the barometric pressure
第二章：簡要介紹大氣負荷研究所需的氣象科學知識、資料及其數據處理方法；建立相對濕度表示的大氣比氣體常數模型，利用地面溫度和空間垂直溫度梯度、壓力變化的規律估算大氣水汽組分變化對比氣體常數的影響；對中國及鄰區的地面氣壓記錄進行了預處理和網格化I take into account the neighbor letters remembering that some of them may not be initialized yet when i calculate the affinity of candidate cells for that grid position
在為網格位置計算候選細胞的關聯性時，我考慮了相鄰字母（記住，它們其中的一些可能還沒有被初始化） 。A normal transform is introduced, and there are enough much grids in the region between the critical layer and the wall, where the variation of the disturbance is the quickest. the finite - difference of governing equations with fourth - order accuracy in the normal direction is utilized in full regions including points close the wall, and is very important for accurately discreting equations. the combination of global and local methods is implemented, and a new iterative formula is derived
對于曲線坐標系下的拋物化穩定性方程，文中發展了求解的高效數值方法:引進法向變換，使得在臨界層與壁面之間的擾動量變化最快的區域有更多的法向網格點;導出包含邊界鄰域在內的完全四階精度的法向有限差分格式，這對方程精確離散至關重要;採用全局法和局部法相結合的方法及其新的迭代公式，大大加速收斂並得到更精確的特徵值。A brand new method of grid nodes corresponding is proposed based on 2 - dimensional neighbor node table. 4. coordinate data visualization
獨立的提出了基於網格點相鄰關系建立二維表格的網格點匹配演算法。Click any tile adjacent to the empty location on the grid to slide that tile over
單擊與網格上的空位置相鄰的任何拼塊可將該拼塊移到這個空位置。The algorithm builds voxel between neighboring slices of volume data, then gets density of a certain substance by experience. after setting threshold for surface of the substance which we want to get, and computing triangle mould of every voxel cube by use of linearity interpolation, the algorithm represents the surface of the substance as the form of triangle mesh
該演算法通過在相鄰的體數據切片之間構建體素，根據經驗獲得某一種物質的密度值，設定待求物質表面的閾值，利用線性插值求出每一個立方體體素的三角剖分的構型，進而將整個物體表面以三角型網格的形式表示出來。423 persons answered the questionnaires and 139 out of them were identified as ecotourists. the result of classification is proved to be effective by prediction validity test, content validity test, theory validity test and convergence validity test. in addition, the ecotourists were classified as hard ecotourists, frequent ecotourists and occasional ecotourists farther according to the times they traveled to nature - based destinations every year and their new ecological paradigm grade which is used to evaluate the visitors attitude to environment. frequent ecotourists and occasional ecotourists both fall category of soft ecotourists, so the " hard - soft " classification system is founded, which will help propel ecotourist studies in china to develop towards the current international mainstream of the field
以北京市百花山自然保護區為例，在總結國外相關研究經驗的基礎上，採用k階最近鄰knn和反向傳播bp前饋型多層神經網路所構成的綜合分類器對百花山遊客中的生態旅遊者進行識別，又根據「每年去相對原始的自然區域的旅遊次數」和環境態度尺度nep得分兩項指標將生態旅遊者進一步細分為嚴格的生態旅遊者經常的生態旅遊者和偶爾的生態旅遊者，其中經常的生態旅遊者和偶爾的生態旅遊者歸為一般的生態旅遊者，從而構建起嚴格的一般的生態旅遊者分類體系。The percolation threshold value ( pp ) is not related to the size of model lattice but to near neighbor conditions. however, the fractal dimension of aggregate ( d ) is definite and independent of neighbor conditions, as p is equal to pp
3 、逾滲閾值pp只與近鄰條件緊密相關，而與模型的網格大小無關；當生長概率p等於對應的逾滲閾值時，凝聚體的分形維數d為一確定值，且與近鄰條件無關。First, it gives a snapshot of some typical self - organized routing protocols in manet. then the design of self - organized routing algorithm based on ktrp is elaborated as the main part of this dissertation, including the choosing of key nodes, the main algorithm modification of ktrp to accommodate with the interior routing in subnet, the access flow between two layers, primary packet formats, tables, and ip routing algorithm. at last, the simulation model of the self - organized routing algorithm
本文首先分析了現有的manet自組織路由協議;然後針對本信息傳輸分系統的網路結構，詳細分析了基於ktrp的子網內部以及相鄰層間的自組織路由演算法的設計，包括對多個關鍵節點的選取、為適應本課題子網內路由通信而對ktrp做出的主要演算法更改、相鄰層間接入互連的流程、自組織路由演算法中涉及的主要報文格式和表，並且舉例說明了ip選路演算法;最後對所設計的自組織路由演算法進行了模擬，以驗證演算法的有效性。In a three - dimensional ocean model with curvilinear coordinates horizontally and a coordinate vertically, the adapted grids at a layer for interpolation in the eulerian - lagrangian method ( elm ) is unreasonable over steep topography, because the vertical distance between the adjacent grids in the same a layer is too large
摘要在水平曲線坐標和垂向坐標的三維海洋模式下，歐拉拉格朗日方法的插值如果在-面相鄰網格之間進行，那麼在水深變化劇烈處，由於-面相鄰網格之間的垂向距離較大，插值依據會顯得較不合理。2 ) for making the meshes consistent on the common boundaries of adjoining surfaces, a new approach of boundary discretization is employed. 3 ) the boundary - representation structure is adopted to fulfill the mesh generation over combined surfaces. 4 ) the quality of surface meshes is improved by point creation on 3d scan lines and diagonal swapping procedure
通過引入可移動的虛邊界解決了閉合曲面的剖分問題；通過對鄰接曲面公共邊界的統一處理，保證了組合曲面拼合處網格的相容性；以邊界表示數據結構為基礎實現了三維組合曲面的全自動網格剖分；採用空間掃描線布點、診斷交換等技術，優化了網格的質量；並以autocad為支撐平臺objectarx為開發工具，開發了一個基於幾何造型的曲面三角形網格全自動生成程序。On the base of determination of corresponding points between adjacent sections, dissimilar segments are separated to construct spatial dissimilar polygons. then triangular mesh interpolating the cross sections are obtained by tiling the dissimilar polygons and similar segments
在確定相鄰層輪廓對應點的基礎上，將不相似部分分離出來並跟蹤不相似部分構成不相似多邊形，然後分別對相似部分和不相似部分進行三角化，得到三角網格模型。Only center and neighboring points are used in present scheme, so the method of forward elimination and backward substitution can be directly used to solve linear simultaneous equations obtained from the scheme
該方法僅涉及中心點及相鄰網格點，具有四階精度，並且由所提格式得到的線性方程組是三對角線型的，可以直接採用追趕法進行求解。The main research works of the dissertation are as follows : 1 ) preprocessing technology of unorganized diserete points : the relative research works were focused on two issues : boundary extracting from unorganized discrete points and generating of original surface, boundary extracting were realized on the basis of rules that disctete points are on the form of triangular mesh and the number of neighbor triangle of border points and inner points are different
論文的主要研究內容如下： 1 ）離散數據點集的預處理技術研究了離散數據點的邊界檢測和初始曲面擬合問題。離散數據點的邊界檢測是根據有限元分析所得到的三角網格離散點，利用它的特點，使用離散點的相鄰三角網格的個數判斷是否是邊界點。分享友人