algo

"algo"的翻譯和解釋

"查查詞典"手機(jī)版

千萬人都在用的超大詞匯詞典翻譯APP

例句與用法

On the basis of our lab ' s previous achievements , the author has studied three kinds of digital signal processing methods - the method based on a digital phase locked loop , the method based on quadrature demodulation , and the method based on adaptive funnel filter ( aff ) and sliding goertzel algo rithm ( sga ) . the author has also studied the cmf driving principle , various analog driving circuits , driving waves , and digital driving methods
主要研究了三種科氏流量計(jì)的數(shù)字信號處理方法：基于數(shù)字鎖相環(huán)的方法、基于正交解調(diào)的方法和基于自適應(yīng)funnel濾波器和滑動goertzel算法的方法；以及科氏流量計(jì)驅(qū)動的原理、各種模擬驅(qū)動的波形、電路以及數(shù)字驅(qū)動的方法等。
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
運(yùn)用化分散為集中的思想,把所有的井點(diǎn)都放在同一個單位網(wǎng)格內(nèi)考慮.在坐標(biāo)可平移、旋轉(zhuǎn)的條件下，利用尋找點(diǎn)群、有限步驟搜索法，對鉆井布局的三個問題進(jìn)行了解答.對問題一，給出了兩個不同算法.并對題目提供的數(shù)據(jù)進(jìn)行了求解，算法1得到的結(jié)點(diǎn)為（ 0 . 361 , 0 . 461 ） ,最多有4個舊井點(diǎn)被同時利用，它們是第2 、 4 、 5 、 10個井點(diǎn);算法2得到的結(jié)點(diǎn)為( 0 . 390 , 0 . 505 ) ,最多有4個井點(diǎn)被利用,它們是第2 、 4 、 5 、 10個井點(diǎn).對問題二，以結(jié)點(diǎn)為中心旋轉(zhuǎn)一定的角度后，歸結(jié)為問題一進(jìn)行求解，求解結(jié)果為當(dāng)網(wǎng)格傾斜角為0 . 78弧度（相對原坐標(biāo)系），結(jié)點(diǎn)平移到（ 0 . 75 , 0 . 076 ）點(diǎn)(在新坐標(biāo)系下) ，可被同時利用的最多舊井點(diǎn)為6個，它們是第1 、 6 、 7 、 8 、 9 、 11個井點(diǎn)，對問題三，我們給出了充要條件，并給出了算法.最后還分析了算法的優(yōu)劣性