搜索區間 的英文怎麼說

中文拼音 [sōusuǒqūjiān]
搜索區間 英文
region of search
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 區 : 區名詞（姓氏） a surname
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. And raga can steadily adjust and compress the variable changed space. the times of accelerating circle is not many, commonly, the times is under 10 times. even though the problem is very complicated, the times of accelerating circle is less than 50 times

    該方法具有處理復雜優化問題的能力，並且，它調整、壓縮搜索區間的性能也是穩健的，不易早熟收斂，加速循環的次數也不會很高，一般就在10次以下，即便是特別復雜的問題其加速循環次數也在50次以內，所以說raga的計算量很少。
  2. A further improvement is achieved in the process and reliability by using sectionalized weight and self - regulating search

    通過採用分區間加權合併技術以及自調整搜索方案，進一步提高了系統的處理速度和工作可靠性。
  3. Three steps of the method are, first, genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations ; second, the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbors according to the traverse sequence determined in the first step ; finally, the scheme which has the least cost of investment in tie lines will be taken as the ultimate scheme

    第一層優化是在整個規劃區域內，應用遺傳演算法搜索可能的變電站的遍歷順序；第二層優化是按照第一層優化確定的遍歷順序，應用綱絡圖論中的最小權匹配演算法分別對每一個變電站與其相鄰站之間的聯絡線進行優化。
  4. The support vector classifier is adopted to identify fault in the two types, and the grid search method based on cross - validation is chosen to determine model parameters

    該模型將變壓器故障分為放電性和過熱性兩大類，通過統計分析尋求特徵量區分類間的故障類型，採用支持向量機識別類內的故障類型，利用基於交叉驗證的網格搜索法來確定支持向量機的參數。
  5. At present, the running mechanism of the regional economic cooperation between the eastern and the western depends mainly on two paths : one is to hold the conference of the enterprises among provinces to realize the interregional cooperation b y leading of the officials. the other is that the enterprises make decisions independently on the basis of the market mechanism

    目前，東西部區域經濟合作的運作機制主要有兩條路徑依賴：一是以政府間經濟協作區負責人牽頭，舉行跨省區企業座談會實現區際合作；二是市場機制起基礎性作用，政府對區際利益關系進行協商，企業主要通過區際協調性組織搜索各種信息，自主決策實施具體的合作項目。
  6. At first, in order to prevent the premature convergence of genetic algorithm effectively, the author brings forward a novel dyadic floating - point supplementary mutation operator. then, simulating the natural evolution, the author presents a novel topology, unoriented - connected topology, for parallel genetic algorithm. in the end, an interval decomposed optimization method is brought forward for ipga, which can improve the optimization performance of the algorithm

    為提高演算法的性能，作者對遺傳演算法進行三種改進：首先，為克服遺傳演算法早熟收斂，作者提出一種新的二元浮點補碼變異運算元；其次，模擬生物自然進化模式，為并行遺傳演算法提出了一個新的并行拓撲結構- - - -無定向拓撲連接；最後，作者提出一種區間分解優化思想，來提高對最優解的搜索能力。
  7. Then the time penalty can be largely diminished during all the searching procedure. however, the micro - ga just reaches the near - optimal region, not the precise solution

    採用小種群遺傳演算法，搜索時間明顯縮短，但是只能找到最優解的區域，而不能精確定位。
  8. Based on the first step, modeling and solving methods as the secondly step was use to com out the final result. second, in the problem of irs observing area target, the two intentions of maximal observing time and maximal observed area are conflicting

    在實際中，不同的情況下，對空間覆蓋率與時間覆蓋率的需求也各不相同:比如說封鎖搜索問題就要求優先滿足時間覆蓋率，而對未知區域的觀測問題則需要首先滿足空間覆蓋率。
  9. The search space is divided into many small areas, and each area is given a certain pheromone value. according to the state transition rules, the artificial ants move to the next solution which is generated randomly or calculated by particle swarm optimization. local search strategy is also added into psaco so that the search speed and precision is enhanced

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  10. Pso find optimal regions of complex search spaces through the interaction of individuals in a population of particles

    它利用一個粒子群搜索解空間，每個粒子表示一個被優化問題的解，通過粒子間的相互作用發現復雜空間中的最優區域。
  11. To pick up the convergence speed of traditional genetic algorithm, a modified genetic algorithm is presented, which is based on subsection integer coding, combining stable - state selection strategy with inequality individual and scaling, adaptive recombination according to gene sufficiency, self - adaptive variable step and multi - gene mutation

    將兩幅圖象重疊區域的歸一化差圖象作為搜索空間，定義一個與圖象高相等維數的向量作為染色體，染色體的基因表示每一行圖象中的最優拼接點，採用常用的最小值搜索適應度函數作為視差圖像拼縫搜索的適應度函數。
  12. And the main contents of this dissertation are : ( 1 ) the engineering geological features of discontinuities in surrounding rock mass were analyzed on the basis of field geological survey and the preferred orientation of the main discontinuities were derived. then the displaceable blocks distributing on the roof and sidewalls of main chamber were searched out taking the intersecting relationship of discontinuities into consideration. then the failure mode and the coefficient of stability of the displaceable blocks were studied respectively

    主要內容包括：在野外地質調查基礎上，通過統計分析得到地下廠區結構面的優勢方位；對結構面工程地質特性進行了分析；根據結構面的空間組合關系，搜索出可能在主廠房洞室的頂拱和邊墻部位出露的塊體，並分析了各塊體的可能滑移方式及其穩定性系數。
  13. A multisensor convex linear statistic fusion modal for optimal interval estimation fusion is established. a gauss - seidel iteration computation method for searching for the fusion weights is suggested. in particular, we suggest convex combination minimum variance fusion that reduces huge computation of fusion and yield approximately optimal estimate performance generally, moreover, may achievers exactly optimal performance in some cases

    建立了一種最優區間估計融合模型? ?多傳感器凸線性組合，並給出搜索最優權系數的gauess - seidel迭代演算法，另外，給出了一種近似的區間估計融合? ?凸線性組合的最小方差融合，它能減少大量的計算量。
  14. In this paper ， an optimal search strategy by dividing the whole surveillance area into regions is presented so that the optimal search can be adaptively implemented in phased array radar. firstly ， the inherent relationship among average discovering time ， radar resources consumption ， search frame period and target distribution density is studied. secondly ， parameters for the region search are optimized to achieve the optimal search performance inside regions. then ， the optimal search frame period for each region is derived to minimize the average discovering time of targets ， where the constraint of radar time resource and the importance of each region are taken into account. finally ， the adaptability of this search strategy is discussed. only if the optimal parameters for each region are utilized and the beams are scheduled according to the optimal frame period under the radar time constraint ， the optimal distribution and the optimal scanning sequence of beams can be implemented adaptively. thus ， optimal search is adaptively implemented in the whole surveillance area

    本文提出一種分區搜索演算法，實現了相控陣雷達的自適應最優搜索.首先，研究了各區域平均發現一個目標消耗的雷達資源和目標被發現的平均時間同搜索幀周期以及目標強度的關系；然後，研究了在各區域採用兩步搜索演算法的最優參數設計，實現了局部區域的最優搜索；其次，在雷達時間資源有限和區域重要性加權的約束條件下，導出了使目標被發現的平均時間最小的區域最優幀周期；最後，討論了分區搜索演算法的自適應性.只要採用各區域的最優參數，按最優幀周期調度雷達波束，就可以自適應地實現使目標被發現的平均時間最短的波束的最優分佈和掃描順序，即自適應最優搜索
  15. According to the basic idea of p - grid, peers exchange their information and split the search space when they meet each other. at last, each peer is only responsible for an interval of the whole search space and ma kes responses to the query requests for the data in this interval

    根據p - grid基本思想，節點間每次相遇就交換雙方的信息，對搜索空間不斷進行分割，使每個節點負責管理某一區間上數據信息並負責響應針對這些數據的查詢請求，最終搜索空間的劃分狀態在邏輯上可以用一棵二進制搜索樹表示。
  16. The mutual excitation between the local stimuli satisfying the rules of curve distribution ( position and orientation continuity ) called curve self - excitation is a useful method to discover and enhance curves and to inhibit noise. the present approaches used parallel connection structure division which did not acquire satifactory effect. this paper presents the idea of random time division and dynamic self - excitation, for different curves performing random time - division searches, time coincidence filtering, and self excitation accumulation. the principle is given

    利用空間分佈滿足曲線規則（位置和定向連續性）的局部刺激之間的相互激勵，稱為曲線自激，這是發現視覺邊界曲線和抑制局部噪聲的有效手段.過去的工作均採用并行結構區分的計算方式，曲線自激並沒有達到滿意的效果.本文提出隨機時分動態自激的計算方案，對不同的曲線實施隨機時分的搜索、時間一致性濾波、和自激積累等機制.本文給出了實現的原理方案
  17. After making skew rectification, we do the image registration. based on several hypotheses about image ' s overlapping area, we deduce that the minimal overlapping area in one image can act as the template, the maximum overlapping area in the other image can act as the searching area, the pwfm is used to establish the correspondence of the template ' s coordinates in two images, namely obtain the shift parameters tx and ty. we also provide a multiple images " registration method

    在對圖象進行偏斜糾正以後，本文對圖象重疊區域歸納出幾條基本假設，在此基礎上推導出了最小重疊區域作為模板，最大可能重疊區域作為搜索區域，應用參數維納匹配濾波進行模板匹配，確定圖象之間的平移參數t _ x和t _ y ，完成了兩幅圖象的拼接。
  18. In the algorithm, a real - coded genetic algorithm ( rga ) is firstly adopted to globally search for the optimal solution to the optimization problem for some steps, and then a specially designed local optimization algorithm named modifiable search space random search algorithm is adopted to intensify the search for the optimal solution in the local region determined by the rga so as to improve the search efficiency and the solution quality

    該演算法首先採用實值編碼遺傳演算法對優化問題進行全局最優搜索若干步，在此基礎上，採用一種專門設計的變搜索空間隨機搜索局部優化演算法加強對重點區域的搜索，以提高搜索效率和改善解的質量。此外，為了提高遺傳演算法的搜索效率，改進了一種自適應交叉概率和變異概率的計算方法。
  19. Another distinct difference between mechanical and architectural drawings is, the aim of architectural drawing understanding is to recognize one type of the given components, for improving the validity of drawing understanding, reducing the search scope, in chapter 4, the concept of " engineering feature class " is put forward, which is hoped for separating drawings information related to engineering quantity, expressing the drawing information in object oriented mode

    建築圖樣和機械圖樣的另一個顯著區別是：建築圖樣的理解要從建築物視圖中識別出某類特定的功能部件，為了提高圖形理解的有效性，減小圖形信息的搜索空間，論文第四章提出了工程特徵類的概念和基於工程特徵類的工程量信息獲取方法。
  20. Because of communities divided by category tree, when users wants to search some commodity, he only needs to send his search requests to special community, which reduces the search range, improves search effect and decreases the search time

    本文提出一種基於分類樹的搜索演算法，基於分類樹所劃分的社區，用戶要查詢相應的商品的時候，只要到特定的社區中進行搜索就可以，減少了搜索的范圍，提高了搜索的命中率，縮短了搜索時間。
分享友人
分享到 Line

分享到臉書