離散搜索 的英文怎麼說

中文拼音 [lísǎnsōusuǒ]
離散搜索 英文
discrete search
  • 離 : Ⅰ動詞1 （離開） leave; part from; be away from; separate 2 （背離） go against 3 （缺少） dispens...
  • 散 : 散動詞1. （由聚集而分離） break up; disperse 2. （散布） distribute; disseminate; give out 3. （排除） dispel; let out
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 離散 : dispersed; scattered about; separated from one another; spread; debunching; straggling; fringing;...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Due to existing signal processing technology ’ s shortage such aslow measurement, narrow measurement range precision and other poor performance, we introduced a high - precise signal processing technology : firstly, to get power spectrum with hanning windowed welch modified periodogram, search its peak value frequency ; secondly, to apply zooming analysis via goertzel algorithm ; at last, to get a highly precise doppler frequency with energy centrobaric rectifying algorithm 。 the simulating result indicated that this technology introduced could get accurate doppler frequency 。 depending on above discussed technology, we designed a signal processing scheme, and developed a signal processing system. the running result showed high performance, verified the feasibility and reliability of the highly precise signal processing technology introduced. in a word, the technology improved ldv ’ s performance such as measurement precision, measurement range, dynamic response time 。 and it will have a wide application foreground

    針對存在的缺點，本文提出了一種應用於激光多普勒測速的高精度信號處理技術，即首先利用加hanning窗的welch修正周期圖演算法得到信號功率譜，搜索其譜峰值頻率，接著利用goertzel頻譜細化演算法對搜索的譜峰進行細化分析，再引入能量重心頻譜校正演算法對細化后的譜峰進行校正分析，從而將離散頻譜分析演算法、頻譜細化演算法和頻譜校正演算法三者有機結合起來，充分發揮各自的優點:通過加hanning窗的welch修正周期圖演算法快速得到功率譜及峰值頻率，通過goertzel演算法獲得分析頻帶的高解析度頻譜，然後通過能量重心校正演算法對細化后的頻譜進行高精度校正，這樣不僅保證了演算法的高效性，而且大大提高了分析的精度。
  2. In this thesis, we study the situation with stationary target in the discrete space

    本文研究的是針對離散空間中靜止目標的搜索問題。
  3. Aimed at multiple - limit, multiple - object, non - linear, discrete of voltage / var optimization and control, on account of whole evolution of evolutionary programming, no demand for differentiability of optimal function, and random search, it can obtain global optimum with mayor probability, this paper solve optimal function with evolutionary programming

    在對優化的具體實現過程中，由於進化規劃著眼于整個整體的進化，對于所求解的優化問題無可微性要求，採用隨機搜索技術，能以較大的概率求解全局最優解的特點，針對電壓無功控制模型是一個多限制、多目標、非線性、離散的優化控制問題，因此應用進化規劃演算法進行模型的求解。
  4. The three kinds of construction graph can be applied to optimization problems with different characteristics, and the two kinds of layered construction graph are more suitable for complex multi - stage dynamic decision problems ( cmsddp ) than scg. the clcg defines smaller solution building blocks and is able to perform better in large - scale cmsddps than the blcg. 2. the construction graph of aco algorithms need statically describe the whole solution space ( or discrete solution spa

    （ 2 ）蟻群優化演算法的解構造圖一般要靜態地描述整個解空間（或者是離散化了的解空間） ，對于大規劃動態決策問題，不僅存在描述解空間的困難，而且讓蟻群在迭代過程中始終在整個解空間中進行搜索，搜索性能會很低。
  5. Finally, we convert this optimal problem to a nonlinear parameter optimization problem by collocation method. these studies examine the collocation method in case of equally or non - equally spaced division points, and in case of different numbers of nodes

    本文採用直接搜索法和節點配置，將連續動態最優控制問題轉換為靜態離散的數值優化問題，並對狀態和控制變量的約束進行轉化。
  6. Concerned the discrete area of the steel shape, a method is presented : searching the best solution of continual variable first by criteria, and next searching optimal solution by the direct - searching method of mixed variable on the original point of the continual result

    慮到型鋼截面的離散化，本文對多層輕鋼框架結構優化提出一種近似的處理方法，即先用準則法求得連續變量最優點，然後將其結果作為混合變量直接搜索法的初始點進行第二步優化。
  7. The novel optimization algorithm, genetic algorithm popular these years, is introduced. genetic algorithm has the characteristics of multi - point searching, parallel computing and self - adaptive global optimization. so it is very suitable for the solution of complex engineering problems, which often have numerous variables, high dimension, highly nonlinear optimization objects, and the great solution spaces

    引入了近幾年興起的新型優化演算法? ?遺傳演算法，其具有多點搜索、并行計算和自適應全局尋優的特點，特別適用於求解離散型設計變量多、維數高、優化目標高度非線性、解空間十分龐大的復雜工程問題。
  8. A novel method of content - based image segmentation using deformable template matching is proposed. a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly. then the definitions of internal and external energy functions are given according to the image segmentation problem, and genetic algorithm is used to obtain globally optimal solutions. the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template. experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method

    本文提出一種採用可變形模板匹配技術進行基於內容的圖像分割演算法.通過預先計算出可變形模板沿著變形的正交曲線，並對模板曲線及正交曲線進行離散抽樣，建立一基於正交曲線的二維（ 2 - d ）可變形模板，針對圖像分割問題定義控制可變形模板進行變形的內、外部能量函數，本文採用遺傳演算法搜索能量函數最小的全局最優解.該新演算法比傳統的可變形模板匹配方法降低了搜索空間的維數，減少了演算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結果表明，新演算法具有良好的分割精度及穩定性
  9. We may categorize optimal search problems according to whether the space and time are discrete or continuous, and whether the target is stationary or mobile

    按照搜索空間是離散或者連續的，目標是靜止還是運動的，可以將最優搜索問題分成幾個不同的類型。
  10. In the hybrid approach, based on the global search ability, discrete artificial immune algorithm is used to search the optimal solution and simulated annealing is applied to avoid getting into a local optimum

    該方法利用離散人工免疫演算法的全局搜索能力來尋找全局最優解，利用模擬退火方法來避免陷入局部最優。
  11. Such contents were introduced as establish ment of analysis model of precision seed metering devices, seeds generation, neighborhood search & contact detection, data transfer and software integration, etc.

    介紹了精密排種器離散元法分析模型的建立、種子的生成、鄰居搜索與接觸判定、數據傳遞及軟體集成方法。
  12. Methods for optimization design of discrete variables are summarized. the tabu search algorithm and its application to the optimization design of discrete variables are presented and explained by an example

    摘要概述了離散變量優化方法，介紹了禁忌搜索演算法及其在離散優化設計中的應用，並用實例說明之。
  13. The full newton - raphson iterative method with line search is adopted for solution of the obtained discretized equations

    對導得的離散化非線性代數方程組採用帶線性搜索的完全newton - raphson方法迭代求解。
  14. Since ga could search for a global solution using multiple path and handle discrete problems naturally, it has been developed for solving rpo problem

    因能夠多路徑搜索全局最優解，並可以自然地解決離散性問題，遺傳演算法被應用到無功優化問題的求解。
  15. Finally, the method of simulation of disperse systems is analyzed, the object - oriented event activity scanning is given, the timed - a research method is given based on the traditional control algorithms, this method have the advantage of both a research and the time research. the process of the simulated software is introduced. the simulated result is analyzed

    最後分析了離散事件系統的模擬設計方法，提出了面向事件活動掃描模擬模型，分析了傳統的模擬調度演算法，在傳統模擬調度演算法的基礎上提出一種新的時間- a模擬演算法，這種演算法結合了a搜索演算法與時間最短演算法的優點。
  16. For the algorithm, the control variables are discretized firstly and the standard particle swarm optimization algorithm is used to search for the best solution of the discretized control variables

    對于該演算法，首先將控制變量離散化，用標準粒子群優化演算法搜索離散控制變量的最優解。
分享友人
分享到 Line

分享到臉書