有序搜索演算法 的英文怎麼說

中文拼音 [yǒuxùsōusuǒyǎnsuànfǎ]
有序搜索演算法 英文
ordered search algorithm
  • 有 : 有副詞[書面語] （表示整數之外再加零數）: 30 有 5 thirty-five; 10 有 5年 fifteen years
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. When refining the candidates, the author gets rid of traditional complicated geometric calculating. this thesis sets forward a new query model based on character. this model changes two - dimensional spatial object into one - dimensional string to process, and therefore turns two - dimensional disorder query into order query by using heuristic querying algorithm so that bisearch is used to improve query efficiency greatly

    在求精時，摒棄了傳統的復雜的幾何計算，本文提出了一種基於字元的查找模式，將二維的空間對象轉化為一維字元串進行處理，並利用啟發式搜索演算法將二維空間上的無序查找轉化為有序查找，從而利用折半查找法，大大提高了查詢效率。
  2. This thesis mainly discusses the techniques of channel estimation in frequency domain, which utilizes the optimized leading sequence. an enhanced method for searching optimized leading sequences is introduced based on existing documents. this method can decrease the errors and make the searching and caculating easier

    本論文主要討論用最佳前導序列在頻域中進行通道估計的問題，在前人的基礎上提出一種改進型的搜索最佳前導序列的方法，可使得估計誤差減小且便於搜索計算，模擬驗證了演算法的有效性。
  3. One method was supervised recognition, which was to take advantage of some known information to determine a given sequence whether contained some specific functional elements ; the other way was unsupervised learning, which was to utilize some measures of comparability and some search algorithm to discovery some potential signals in biosequences

    一種是有指導的識別方法，即利用已知的信息判讀一段未知的序列中是否含有某種功能元件;另一種是無指導的學習方法，即利用一些相似性指標，通過搜索演算法發現序列中可能蘊含的信號。
  4. 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

    本文提出一種分區搜索演算法，實現了相控陣雷達的自適應最優搜索.首先，研究了各區域平均發現一個目標消耗的雷達資源和目標被發現的平均時間同搜索幀周期以及目標強度的關系；然後，研究了在各區域採用兩步搜索演算法的最優參數設計，實現了局部區域的最優搜索；其次，在雷達時間資源有限和區域重要性加權的約束條件下，導出了使目標被發現的平均時間最小的區域最優幀周期；最後，討論了分區搜索演算法的自適應性.只要採用各區域的最優參數，按最優幀周期調度雷達波束，就可以自適應地實現使目標被發現的平均時間最短的波束的最優分佈和掃描順序，即自適應最優搜索
  5. Then we have searched out all of the unequal complementary sequence pairs with length up to 20. we have got some suppositions from the searching results, though the correctness of it is waiting for prove

    並由此設計了最佳二元互補序列偶的快速搜索演算法，搜索出長20以內的所有最佳二元互補序列偶的等價類。
  6. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  7. Chapter 1, making use of the technique of pivoting operation, the technique of sequential systems of linear equations of studying constrained optimization problems and the idea of strongly subfeasible directions method and, several new algorithms for systems of nonlinear inequalities are presented

    第一章，藉助于轉軸運算技術，序列線性方程組技術以及強次可行方向法思想，建立了非線性不等式組的序列線性方程組演算法，演算法的搜索方向由有唯一解的線性方程組的解及其校正產生。
  8. After analyzing typical text information extraction inductive algorithms based on wrapper model, making use of the important features of the pages, such as annotations and text pattern features, an inductive algorithm is proposed using wrapper model for information extraction. the new algorithm can add the annotations to the state sets of rule ’ s finite state machine, so it can effectively reduce the time spending on search, and can also accurately locate the target information ; the learned text pattern can be used to filter out the un - interrelated extracted information

    在分析了基於包裝器模型的文本信息抽取典型歸納學習演算法的基礎上，利用頁面的一些重要特性，例如注釋和文本模式信息，提出了一種新的歸納學習演算法，新演算法將注釋信息加入到抽取規則的有限狀態機的狀態序列中，從而能有效地降低演算法搜索時間，並能對目標信息進行充分的定位;並且新演算法能用學習到的文本模式信息對抽取結果進行必要的過濾。
  9. The executive time of the programs are dramatically shorted by searching the root of the equation and applying the iterative arithmetic

    並用根窮搜索法， bch碼的迭代演算法對程序進行優化，使程序的執行時間有量級的提高。
  10. Different from other algorithms, the algorithm in this paper that adopts sliding sequencing window does not search all sequences generated by whole aircraft queue, but search possible sequences generated by some aircraft for certain positions fixing in optimized queue. so, this algorithm can break through the bottleneck of computation penalties caused by the use of cp algorithm and make it easy to reschedule the queue of more than 10 aircraft in heavy traffic

    與其它演算法不同，本文提出的排序演算法引入了滑動排序窗的概念，它不用對隊列中全部飛機的所有排序可能進行搜索，而只需對那些與最終排序結果中的某些特定位置相關的飛機（當前窗）所產生的排序可能進行搜索，依次移動窗體就可完成對所有飛機的排序過程。
  11. Finally, genetic optimization research is summarized on several typical production scheduling problems. after expounding the general idea of genetic algorithm, the comparative advantages in contrast to the traditional algorithm, the basic characteristics of genetic algorithm and its theoretical base, the paper puts emphasis on the efficiency of genetic algorithm in the scheduling of flow shop, and puts forward an improving genetic algorithm : the ordinal genetic algorithm based on the heuristic rules. the new algorithm introduces into the initial group the solution of heuristic algorithm, and in the group structure adopts a strategy of first ordering according to the priority of the adaptive solution, and then defining a new way of choosing probability by segments, which provides more hybridizing opportunity for optimized individuals, and designs variation - control rule to prevent single population and partial optimal solution

    在論述了遺傳演算法的思想、與傳統搜索演算法的比較優勢、遺傳演算法的基本特徵和遺傳演算法的理論基礎（包括模式定理、隱含并行性、基因塊假設、欺騙問題和收斂性定理）后，重點探討了遺傳演算法在flowshop調度問題中的潛力和有效性；結合啟發式規則，提出了一個改進的遺傳演算法?基於啟發式規則的有序遺傳演算法，新演算法在初始種群中引入了啟發式演算法的解，在種群結構上採用了先按適應值優劣排序再分段確定選擇概率的新策略，使優質個體有更多的雜交機會，在變異中設計了變異控制規則，以防種群單一化，而陷入局部優化解。
  12. On the other hand, the level wise search algorithm is analyzed theoretically with level space theory based on partial order. several properties of level space are summarized and proved. the property of border theory and complexity conclusion of abstract level wise search model are also proved based on the above discuss

    另一方面，本文以基於偏序關系的層次空間< l ， >為基礎，對分層搜索演算法進行深入的理論分析，總結並證明了層次空間的幾個基本性質，並在此基礎上對已有的邊界集性質和抽象分層搜索模型的復雜度結論給出嚴格證明。
  13. Two interactive segmentation methods, snake ( active contour ) and live wire, which are very popular, have been introduced for the medical image segmentation. a snake is a spline curve, which is controlled by an energy equation. to minimize the snake ' s total energy, the finite difference and greedy algorithm have been implemented

    論文引入了snake和livewire兩種十分流行的醫學圖像交互分割方法，詳細推導snake的能量方程，實現了最小化能量方程的有限差分和greedy兩種演算法，並利用鄰近圖像的相似性，將其成功應用於圖像序列的分割； livewire是一種象素級的輪廓搜索演算法，它在方向圖中找到開始點和目標點之間的最小代價路徑。
  14. Through the analysis on the process of hydrological time - series data mining, we can find that there are many similar parts in this process in spite of the complex composition of business logic application. therefore, the process of time series comparability search is composed of three continuous phases, such as data pretreatment, characteristic mode mining and comparability measurement. there are a lot of different algorithms performing same function in every data mining phase

    經過對水文時間序列數據挖掘過程的分析，可以得到，雖然其中的業務邏輯構成比較復雜，但其基本成份卻有許多相同或相似的部分，所以，一般可以將時間序列相似性搜索的過程分為數據預處理、特徵模式挖掘和相似性度量等幾個連續的階段，而每個階段里都有許多完成相同功能的基本演算法。
分享友人
分享到 Line

分享到臉書