格點搜索法 的英文怎麼說

中文拼音 [gédiǎnsōusuǒfǎ]
格點搜索法 英文
grid search technique
  • 格 : 格象聲詞rattle; gurgle
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. Considering of the differences of task scheduling between a grid and a distributed system, this dissertation designs a real number encoded mode that mapping every task to a random resource directly by improving the encoding mode of the traditional genetic algorithm, and gives a particular design to the encoding and decoding mode. at last, this algorithm is simulated in the grid simulator. the experiment results show that the reformative genetic algorithm not only has a holistic searching ability, but also makes a fast convergent speed, which provides a preferable performance

    本文根據網格計算任務調度的特點，提出了基於改進的遺傳演算法的網格任務調度，通過對傳統遺傳演算法的編碼方式進行改進，針對網格任務調度與一般分散式系統任務調度的不同之處，設計了資源?任務的一一對應的實數編碼方法，詳細設計了其編碼及解碼方式，最後在網格模擬器中進行了模擬，實驗數據證明了改進后的遺傳演算法即具有全局搜索能力，又具有較快的收斂速度，具有較好的性能，該實驗達到了本文以實現任務調度的最優跨度為目標的實驗目的。
  3. It supposed that the circle of sliding surface run through the foot of slide. the factor of safety is transmitted to the function of x coordinate of the intersection point of the tangent at the scrap of the circle and x axis. so, the two - dimension area of searching is changed to one - dimension

    該方法先固定潛在滑動圓弧的上、下邊界點，利用滑弧后緣處的切線與x坐標軸交點的位置確定了滑弧的曲率，將二維搜索麵域簡化為一維搜索線域，搜索的上、下限有嚴格的界定，不存在漏點問題。
  4. In this article, we use idea of turning dispersion into convergence and put all the well ' s points into the same unit net to think about it. and answer three questions of the distribution of well drilling by the way of searching for groups of points. fincite - step - searching underthe condition of translationg fcoordinate system or revolving coordinate system. to first question. we find two algo - rithms and make use of data that is given to find the solution. we seek coorlinate of net point is co. 361, 0. 461 ) and mostly four old well ' s points are utilized at the same time by first algorithim, which are no. 2, no, 4, no. 5, no. 10. by second algorithm, we rechon the coordinate of net point is co. 390, 0. 505 ). and that mostly four old well ' s points are utilizld which are no. 2, no. 4, no. 10. to second question, we turn it into the first question by angling awt the center of net point. we seek that mostly six old well ' s points are utilized at the same time, which are no. 1, no. 6, no. 7, no. 8, no. 9, no. 11, when net is angled 0. 78 radian. and net point is translated to ( 0. 75, 0. 076 ) ( at nwe coordinate system ). to third question, wefind a necessary and sufficient condition and affer algorithms, at last, we analyse algorithms

    運用化分散為集中的思想，把所有的井點都放在同一個單位網格內考慮.在坐標可平移、旋轉的條件下，利用尋找點群、有限步驟搜索法，對鉆井布局的三個問題進行了解答.對問題一，給出了兩個不同演算法.並對題目提供的數據進行了求解，演算法1得到的結點為（ 0 . 361 ， 0 . 461 ） ，最多有4個舊井點被同時利用，它們是第2 、 4 、 5 、 10個井點;演算法2得到的結點為（ 0 . 390 ， 0 . 505 ） ，最多有4個井點被利用，它們是第2 、 4 、 5 、 10個井點.對問題二，以結點為中心旋轉一定的角度后，歸結為問題一進行求解，求解結果為當網格傾斜角為0 . 78弧度（相對原坐標系） ，結點平移到（ 0 . 75 ， 0 . 076 ）點（在新坐標系下） ，可被同時利用的最多舊井點為6個，它們是第1 、 6 、 7 、 8 、 9 、 11個井點，對問題三，我們給出了充要條件，並給出了演算法.最後還分析了演算法的優劣性
  5. The chessman ' s identities are distinguished using logistic method. in the design of creating chessman ' s moves, the format of chessboard data, the rules of move, the algorithm of creating move, the evaluation algorithm and the search algorithm are designed based on the structure of chess game. the searches of negative max algorithm and alpha - beta algorithm are introduced detailedly and realized

    在機器人棋步產生部分的設計中，根據一般博弈程序的構成部分，設計實現了棋盤數據格式、走法規則、走法產生演算法、估值演算法、搜索演算法，其中搜索演算法部分重點介紹了負極大值、 alpha - beta搜索演算法的原理與實現。
  6. In generation of concept lattice, the thesis first reviews existing generation algorithms and analyzes their principles of generation, then presents a top - down algorithm based on optimal - incomplete cover. the algorithm will generate concept set and hasse diagram used width - first search of the line diagram

    在概念格的構造方面，本文總結已有的構造演算法，提出一種基於最佳不完全覆蓋的概念格構造演算法，演算法至上而下，以圖的廣度優先搜索方式生成概念節點和概念的圖表結構。
  7. After analyzing and contrasting the advantages and disadvantages of the traditional classification, and subject with the network classification and subject, the author asserts that using corresponding network information classification, establishing vocabulary list about controlling, utilizing classified subject union to organize network information resource can improve the searching rate of present engine, extremely using dc metadata to edit the network information resource, establishing topic network also is an effective method of organizing network information resource, meanwhile, introducing in detail the resource of marc and dc

    筆者在分析對比了傳統分類法和主題法與網路分類法和主題法在組織網路信息資源的優缺點后，提出採用統一的網路信息分類法、建立后控詞表、運用分類主題一體化組織法等方法來組織網路信息資源可以極大改善現有搜索引擎的檢索效率;運用元數據法對網路信息資源進行編目，創建主題網關也是組織網路信息資源的一種有效方法，並對marc格式的元數據和dc格式的元數據加以詳細的介紹。
分享友人
分享到 Line

分享到臉書