搜索長度 的英文怎麼說

中文拼音 [sōusuǒzhǎngdù]
搜索長度 英文
length of search
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 長 : 長Ⅰ形容詞1 （年紀較大） older; elder; senior 2 （排行最大） eldest; oldest Ⅱ名詞（領導人） chief;...
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  • 長度 : length; longitude; size; extent; footage
  1. The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong

    這種混合優化演算法結合了共扼梯度法和最速下降法產生搜索方向，既提高了共扼梯度演算法的收斂速度，又解決了目標函數的等值線是扁長橢球時，最速下降法下降緩慢的問題，具有收斂速度快、收斂范圍大、適應面廣等特點。
  2. You can search an individual document or window incrementally by entering a search string character by character, then observing the matches found as the search string lengthens. to activate an incremental search, choose

    通過逐字元輸入搜索字元串，然後按搜索字元串的長度來觀察找到的匹配項，可以漸進式搜索單個文檔或窗口。
  3. In the study on level wise search algorithm, the structure and character of three basic frequent set discovery algorithms ais, apriori and dhp are studied by simulation. a model of level wise search algorithm is given and its time complexity is analyzed respectively on transaction scale, item length and support parameter

    在分層搜索演算法的研究方面，本文模擬分析了ais 、 apriori和dhp三種基本演算法的結構和特點，構造了一個分層搜索演算法的時間復雜度模型，從事務規模、數據項平均長度和支持度三個方面，對分層搜索演算法的時間復雜性進行了分析和驗證。
  4. Z - tranformation augmented fasf algorithm proposed in the dissertation can reduce the search space of integer ambiguity effectively, improve the effiency and real - time processing ability of integer ambiguity resolution ; it is essential to analyse the reliability of integer ambiguity after it was fixed, the ratio test algorithm proposed in the dissertation can reduce the time to fix new integer ambiguity after wrong fixes are detected ; to reduce further the number of epochs required for ambiguity resolution, that the baseline length constraint information which acts as observables is used to do kalman filtering to speed up ambiguity resolution is proposed

    本文提出的z變換增強fasf演算法能有效的減小模糊值搜索空間，提高整周模糊值解算的速度和實時性；整周模糊值確定后，需要對整周模糊值的可靠性進行分析，本文提出的比率檢測演算法能有效的減少整周模糊值錯誤確定后整周模糊值二次解算所需要的時間；為了進一步減少整周模糊值解算所需的歷元數目，本文提出把基線長度先驗信息作為觀測量進行卡爾曼濾波輔助整周模糊值求解。
  5. Fractal image compression coding is focused attention upon by researchers for it ' s good quality of high compression ration, resolution irrelevancy and fast decoding. but it ca n ' t be put into practice for the matching search of domain and range is too difficult and the coding time is too long

    分形圖像壓縮編碼以其高壓縮比、解析度無關性、快速解碼等優越特性而引起世人矚目，但卻常因為龐大的定義域計算和煩瑣的定義域值域匹配搜索而使編碼時間過長，從而影響了其實用性。
  6. The searching area is a limit domain, therefore, the result of searching would be accurate

    且搜索的線域長度有限，因此搜索速度快，效率高。
  7. It has been deduced that the search direction remains the same but that the step length decreases in optimizing the improved cost function with the conjugate gradient algorithm from the gradient of the cost function that the fir filter apporaches the contrary point spread function ( psf ) more, and that the estimated image is closer to the original one

    從代價函數的梯度入手推導出共軛梯度演算法，其搜索方向保持不變而搜索步長變小，使濾波系數更加退近於點擴展函數逆運算元，從而使估計圖像與原始圖像更加接近。
  8. Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem

    用一個二叉搜索樹或者將串切分成長度的平方根那麼長的小段都可以解決這個問題。
  9. Optimal periodic control with the lowest operational cost by limiting total substrate discharge mass was studied. through adding new state variable and using supplement functions, the problem with restriction conditions was converted into nonrestriction problem. in addition, the dynamic searching method of optimal step coefficient was developed to modify the conventional gradient method, consequently the calculation problem of the multivariable optimal periodic control was able to be resolved better. it was found that the operational costs of optimal control under various initial states are distinctly different. a new concept of optimal control under optimal initial state was presented. it is pointed out emphatically that to the treatment system without optimal control condition, the suboptimal control with extensive practical value can be realized according to the results of optima control

    著重研究了在限制有機物排放總量時，使其運行費用最低的最優周期控制問題.通過增加新的狀態變量和用補償函數法，將本課題的有約束條件問題化為無約束條件問題，並提出了最優步長參數的動態搜索法來修改傳統的梯度法，從而較完善地解決了多變量最優周期控制的計算問題.研究中還發現了不同初始條件下最優控制所需要的運行費用也大不相同，進而提出了最優初始狀態下最優周期控制的新概念，這對保證出水質量的同時進一步降低污水處理成本來說具有更重要的意義.本文還強調指出：對于尚不具備實現最優控制條件的處理系統，可根據最優控制的研究結果實現具有廣泛實用價值的準最優控制
  10. If the array is empty, or if the array length has been exceeded, the

    如果此數組為空，或者搜索數目超出了數組長度，則
  11. The paper puts forward an iterative process to searching for the contacted zone and the distribution of contact force, in the case of the outer loading has been known. the regularization algorithm is used to evaluate the mechanical parameters of the near - boundary points in contact bodies

    列出了運用邊界元法解決靜態接觸問題的基本算式，設計了根據已知外部載荷來搜索接觸長度和接觸壓力分佈的迭代搜索方法，運用幾乎奇異積分的正則化演算法，求解了接觸體內近邊界點的力學參量。
  12. To reduce the runtime of the software, fast algorithms are adopted in the motion estimation and dct modules. moreover, this paper introduces early detection of zero motion vector and all zero coefficients to optimize the coding process

    為了提高軟體運行速度，對運算時間較長的運動估計和dct模塊採用快速演算法，並對編碼過程進行優化，採用了零運動矢量和零系數提前判決的方法，節省了很大一部分塊匹配搜索和dct運算時間。
  13. This means that according to memorial frequency information the tabu length and the number of candidates are adaptively adjusted, and multitask parallel technology is realized through the arrangement of the search assignment

    將自適應機制和并行技術引入禁忌搜索演算法中，根據記憶頻率信息自適應調整禁忌長度與候選集規模，通過搜索任務並分配安排形成多任務并行處理。
  14. Specify the length of time to search, using the

    屬性指定搜索的時間長度。
  15. And we provide a rule to set the parameter of the algorithm. a new method to solve hammerstein model using tabu search is also introduced. the conception of searching area is defined and the strategy of choosing neighboring points is given

    本文提出了一種利用改進型禁忌搜索演算法來解決hammerstein模型辨識問題的方法，定義了搜索域空間，給出了鄰點確定策略，提出演算法流程，並通過大量的模擬實驗，得出針對hammerstein模型合適的禁忌列表長度，可能解列表長度，以及合適的被劃分鄰域的數目。
  16. Combining with taaf test, reliability growth is carried out to expose and fix potential fault modes and mechanisms, normal reliability growth is adopted combining with fault diagnosis, fault diagnosis method based on eta is proposed, optimization search strategy and generalized deep priority search method are studied based on multiple objective optimization decision theory and sequential decision theory, which has great significance to find faults quickly

    結合taaf試驗，對壓塊機進行可靠性增長來暴露和確定潛在的故障模式和機理，採用一般性可靠性增長方法並結合對故障診斷技術進行研究，提出了基於fta的故障診斷方法，以多目標優化決策論、序貫決策論為理論基礎，對系統故障的優化搜索策略、廣義深度優先搜索方法進行了研究，對壓塊機可靠性增長過程中快速排除故障進行了探索。
  17. Looking up an element by value or index requires a sequential search, however, which can be slow if the list is long

    按值或者索引查找需要順序搜索，然而如果表很長則速度可能慢。
  18. Furthermore, a new dfd method was put forward. the method estimated the focused field through analyzing three images at different lens positions and then found best imaging position within the field in small steps

    同時，本文提出一種逐漸逼近的離焦深度法，先通過少量對焦位置不同的圖像計算出近似準焦位置，再用小步長在其附近搜索最佳位置。
  19. In this paper, the two - point stepsize gradient method which together with one new nonmonotone line search technique is proposed

    摘要給出一個兩點步長梯度方法，其將與一個新的非單調線搜索技術相結合。
  20. The real - time obtainment of the components of projection matrix and the substitution of constant step for optimal step in the one - dimension search in conjugate gradient were adopted to ensure the equality of reconstructed image from incomplete projections and shorten the reconstruction time simultaneously

    通過即時獲取投影矩陣分量，以固定步長替代共軛梯度法中一維搜索最優迭代步長，在確保品質的同時縮短重建時間。
分享友人
分享到 Line

分享到臉書