最密格子 的英文怎麼說

中文拼音 [zuìmìgézi]
最密格子 英文
closest packed lattice
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 密 : Ⅰ名詞1 （秘密） secret 2 [紡織] （密度） density 3 （姓氏） a surname Ⅱ形容詞1 （距離近; 空隙小）...
  • 格 : 格象聲詞rattle; gurgle
  • 子 : 子Ⅰ名詞1 （兒子） son 2 （人的通稱） person 3 （古代特指有學問的男人） ancient title of respect f...
  • 格子 : cell; lattice; check; chequer; treillage; grating; grid格子布 quadrille; check; checked fabric; ...
  1. Abstract : the effect of correction of self - consistent potential on electronic structure in simple cubic nanocrystal particles is calculated by means of the green ' s function method in the tight - binding approximation, taking only the nearest neighbor matrix elements into account. the numerical results show that the electronic energy spectrum is shifted, the chemical potential is not equal to the atomic energy level, the electronic density at each lattice point is changed, and the variation of electronic density at surface lattice point is the largest

    文摘:在緊束縛近似下，只計及最近鄰的矩陣元，採用格林函數計算了自洽勢修正對簡立方納米晶體顆粒的電子結構的影響，發現電子能譜發生了移動，化學勢不等於格點原子能級，各格點的電子密度也發生了變化，其中以表面格點的電子密度變化最大。
  2. It is just the difficulty that the strongly correlated electron systems can not be studied by analytical methods, a variety of simulative numerical methods come out sequentially. there are a few typical methods such as the exact diagonalization ( ed ), the qutum monte carlo ( qmc ), the variation monte carlo ( qmc ), the renormalization group ( rg ), and the density matrix renormalization group ( dmrg ) and so on

    正是強關聯系統遇到了解析研究的困難，各種數值模擬方法才相繼出現，最典型的數值方法有：嚴格對角化（ ed ） ，量子蒙特卡洛（ qmc ）模擬、變分蒙特卡洛模擬（ vmc ） 、數值重整化群（ rg ）以及密度矩陣重整化群（ dmrg ）等。
  3. Then the fortunate one must receive the tantric initiation of the mandala of either chakrasamvara, guhyasamaja or vajrabhaivara. after meeting these requirements the practitioner is qualified to enter the mandala of vajrayogini

    有資格的弟子接著接受本尊壇城勝樂金剛密集金剛或大威德金剛的灌頂最後才能進入金剛瑜珈母的壇城。
  4. The paper puts forward the clustering algorithm includes : clustering based on grid and iterative, enhanced clustering algorithm base on density and k - medoids, enhanced k - means algorithm ( optimize chooseing consult _ points in iterative process ), enhanced clustering algorithm base on distance. they can overcome many limitations ( some traditional algorithms terminate in local optimization. many results of cluster are roundness, too many times in partition iterative process ), which are related to the static architecture of traditional model

    在傳統聚類演算法的基礎上，結合我們科學數據挖掘的應用對象?分子動力學數據，提出了迭代網格聚類演算法， k -平均和基於密度結合的聚類演算法，迭代過程中優化選擇中心點的k -平均方法，以及改進型的基於距離的聚類演算法等模式識別方法，能夠解決傳統演算法帶來的諸多問題（比如一些傳統的聚類演算法常常收斂于局部最優，發現都模式都趨近於球形，劃分方法中迭代次數過多帶來的效率問題） 。
  5. Previously closed files released recently by the russian secret service reveal that the ashes of adolf hitler were scattered secretly by kgb agents in a narrow east german river to prevent his remains becoming an object of neo nazi pilgrimage

    最近俄羅斯情報機構公布的一些以前屬絕密檔案的資料表明，當年克格勃為防止希特勒的遣骸成為新納粹分子的膜拜物而將他的骨灰撒在東德一條不知名的小河裡。
  6. Secondllv in the 1 d random traffic flow model. the relation function between the correlation and the creation. disappearance. brake probabilities of the vehicles is presented. according to the statistical mechanical approach to the spatial correlation functions. the theoretical results agree with that of the computer simulation. thirdh. based on the bml model. a main - road traffic flow model with two speeds on two dimensions is designed. this model simulate the traffic situation of one main road and several branches in the cit traffic lights placed on the crossing. vehicles breaking ~ vhile running and turning to other direction while jamming. we investigate the ~ ' e1ocitv and flo ~ ~ of the model when the initial densitvthe brake and turning probabilities. the green to signal rati3. thc number of the branches and the period of the signal are changed. then the reasons causing all the kinds of phenomena are analvzed. finallv. we simulate the bml model using the method of lattice boltzmann which ~ vas brought out by liu mu - renand obtain the velocity - density graph similar to the previous result. the upper critical densiw above which there are oniv jamming configurations. and the lo ~ ver critical density below which there are only moving configurations are the same as before. the boltzmann function which is on the lattices shows the moving and jaxmning transition obviouslv. thus it proves the possibilit of this method on the traffic research

    接著，建立了和研究了二維二速的主幹道模型，該模型模擬了城市交通中一條主幹道，多條支道的交通情況，在幹道與支道的交叉路口設置紅綠燈，車輛在運行中可以有對突發事件發生反應的剎車，在發生堵塞時，路口的車輛可考慮通過轉向來緩解交通等各種實際情況的發生，給出了車輛演化的演化方程，並通過計算機模擬，研究模型在改變車輛的初始密度、剎車概率、轉向概率、支道數、紅綠燈信號的綠信比、紅綠燈信號周期等各種情況下支、主幹道車輛的速度、流量的變化，並分析在各種情況下交通狀況的成因，提出改善交通的有效措施。最後，在劉慕仁提出的用格子boltzmann方法研究一維決定論交通流的思路下，將此法推廣到對二維bml模型的模擬上，得到了與用以往方法的研究結果相類似的速度-密度圖線，且車輛從運動相到堵塞相轉變的上下臨界密度是一致的，同時分別給出車輛在處于暢通相和堵塞相時， boltzmann函數在格子上的分佈情況，進一步驗證了此法的可行性。
  7. Selective resonation design, an exclusive dsas feature, captures and delivers the sounds emanating from the subject under observation while rejecting sound from outside the selected area

    精密工程，以最新的技術規格和利用狀態採用最先進的電子元件，育空地區體育會允許你聽聲音在距離達300英尺（ 100米） 。
  8. The paper solves the saddle point, values and alterable tracks of bank nonperforming loans from optimal control theory. the eighth creative research field is as follows. shadow price ( hamiltonian multiplier ) can be got by multiplying nonperforming loans " s marginal ne

    試圖回答並且做出有創新的研究之八本文從最優控制論的角度從假設開始演繹發現了哈密爾乘子（影子價格）是銀行不良貸款的邊際負效用的倍數，倍數是由參數決定的，因為在不同的模型中，影子價格的經濟學意義是不一樣的。
  9. Closest packed lattice

    最密格子
  10. Factors that influence accurate analysis, such as deviations between batches and lots, are eliminated because of kanto s strict specifications and precise procedures

    影響分析精密性的因子，像不同批號之間的偏差性，因關東化學之嚴格監管及精密製程而降至最低。
  11. Welcome to the free registering process ! completing this quick and easy form allows you to inquire into products online and receive updated newsletters. all information is kept in strict confidentiality

    請填寫下列簡便的表格，您就可線上訂購，也可收到最新的電子報.所有資料將嚴密保護
  12. This paper introduces the development of data mining and the concepts and techniques about clustering will be discussed, and also mainly discusses the algorithm of cluster based on grid - density, then the algorithm will be applied to the system of insurance ? among the various algorithms of cluster put forward, they are usually based on the concepts of distance cluster o whether it is in the sense of traditional eculid distance such as " k - means " or others o these algorithms are usually inefficient when dealing with large data sets and data sets of high dimension and different kinds of attribute o further more, the number of clusters they can find usually depends on users " input 0 but this task is often a very tough one for the user0 at the same time, different inputs will have great effect on the veracity of the cluster ' s result 0 in this paper the algorithm of cluster based on grid - density will be discussed o it gives up the concepts of distance <, it can automatically find out all clusters in that subspaceo at the same time, it performs well when dealing with high dimensional data and has good scalability when the size of the data sets increases o

    在以往提出的聚類演算法中，一般都是基於「距離（ distance ） 」聚類的概念。無論是傳統的歐氏幾何距離（ k - means ）演算法，還是其它意義上的距離演算法，這類演算法的缺點在於處理大數據集、高維數據集和不同類型屬性時往往不能奏效，而且，發現的聚類個數常常依賴于用戶指定的參數，但是，這往往對用戶來說是很難的，同時，不同參數往往會影響聚類結果的準確性。在本文里要討論的基於網格密度的聚類演算法，它拋棄了距離的概念，它的優點在於能夠自動發現存在聚類的最高維子空間；同時具有很好的處理高維數據和大數據集的數據表格的能力。
分享友人
分享到 Line

分享到臉書