搜弧 的英文怎麼說

中文拼音 [sōuhú]
搜弧 英文
sohu
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 弧 : 名詞1. [數學] （圓周的任意一段） arc2. （古代指弓） bow
  1. 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坐標軸交點的位置確定了滑弧的曲率，將二維搜索麵域簡化為一維搜索線域，搜索的上、下限有嚴格的界定，不存在漏點問題。
  2. A combined neural network and genetic algorithm with solving stability safety of homogeneous slope was proposed and the finite element method is applied to analysis the progressive failure process of the slope and the maximum equilibrium theory, requests out stability safety of homogeneous slope with the smooth arc radius of difference with the difference below the level coordinate of arc peak, utilizing the neural network algorithm to establish slidng the nonlinear mapping relationship between level coordinate of arc radious and arc peak, being adapted the neural network algorithm to look for along the minimal stability safety of homogeneous slope and corresponding arc radious and arc peak

    提出了求解邊坡穩定性安全系數的神經網路與遺傳演算法。該方法採用有限元分析和極限平衡理論，求出不同的滑弧半徑和不同的弧頂水平坐標下的邊坡穩定性安全系數，利用神經網路演算法建立滑弧半徑和弧頂水平坐標與安全系數之間的非線性映射關系，採用遺傳演算法搜索邊坡的最小穩定性安全系數及相應的滑弧半徑和滑弧中心坐標。
  3. Combined with the practical situiation in distribution network, it ' s suitable to select graph algorithm as the theoretical algorithm base. based on structure variable dissipated network theory, this thesis detailedly discusses the transforms of base - to - shape, shape - to - base, vertex - to - arc, arc - to - vertex, over - heated arc dectection, load allotting, load balancing and optimum restoration

    本論文基於變結構耗散網路理論，詳細討論了基形變換、形基變換、點弧變換、弧點變換、過熱弧搜尋、負荷分配、負荷均衡化以及優化恢復非故障停電區域供電等一系列與饋線自動化功能相關的處理演算法。
  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. Firstly, a simple and practical representing method of the tooth edge tangential vector is applied to replace the traditional differential formula, the simple solving technique of edge contact problem makes the geometric edge contact analysis of the complex curve surface realize. secondly, using numerical searching and mathematical programming method solves the contact directions and loaded contact problem. finally, whole numerical simulation method is provided for loaded tooth contact analysis of high contact ratio spiral bevel gears

    首先以一種簡單實用的輪齒邊緣切矢量的數學表示方法取代了經典的微分表達式，大大簡化了幾何邊緣接觸的求解，使復雜曲面的幾何邊緣接觸分析得以實現；其次又採用數值搜索與數學規劃法求解了邊緣接觸的主方向和承載接觸問題，為高重合度弧齒錐齒輪承載嚙合全過程的數值模擬提供了完整的方法。
  6. For circle failure surface, this paper uses ga ' s theory to search the center of a circle and the radius of it separately, and based on simple bishop method to compute the safety factor ( f ), and compiled program successfully

    針對圓弧形滑動面法，採用嵌套式的遺傳演算法分別對滑動圓弧的圓心、半徑進行遺傳進化搜索，基於簡化bishop原理進行穩定系數的計算，成功的編制了程序。
  7. The algorithm makes use of the node - arc structure of graph and depth - first - search, have realized the retrieval of optimum path in virtual navigation

    該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。
  8. The seismic response is analyzed with total stress method ; and it ' s found that the positions of the most dangerous slide surfaces are fairly stable though the precision for searching is very high. the idea of newmark method is induced to calculate permanent deformation on circular sliding surfaces. the precision is increased and the complexity of searching is lessened

    本文採用總應力法分析了填埋場在地震作用下的動力響應，通過計算發現，在滑弧搜索的精度相當高的情況下，最危險滑弧的位置仍然比較固定；在這一發現的基礎上，引入newmark地震永久變形的思想，並將其運用於圓形滑動面從而提高了該方法的精度並減少了試算的繁復性。
  9. An algorithm for distribution fault management is introduced, which is on the basis of tabu search theory. the algorithm is high efficiency and high search speed

    採用禁制搜索進行故障處理，提出以弧為變量的搜索方法，避免了大量不可能解的出現，提高了故障處理的效率和速度。
  10. At the basis of analyzing different boundary tracking algorithms, boundary point estimate algorithm based on angle and boundary point searching algorithm based on circumferential neighborhood extending were advanced to avoid tracking trap and to improve the robust of the boundary tracking algorithm

    通過分析不同演算法的特點，提出了基於已知點夾角的邊界點預估計演算法和基於圓弧鄰域擴展的邊界點搜索演算法，以避免跟蹤進入搜索陷阱，提高邊界跟蹤對邊界變化的魯棒性。
分享友人
分享到 Line

分享到臉書