搜索基點 的英文怎麼說

中文拼音 [sōusuǒjīdiǎn]
搜索基點 英文
search datum
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. The procedure functions in the compare between partial image of dynamic collection and corresponding image of the airscape. in chapter 5, basing on the analysis of correlative theory of digital image, we introduce the improved fasted - down algorithm and simulative anneal algorithm, which applies to nn calculation, an d bring forward the unique and effective means, correlative original value evaluation. basing on the combination of correlative arithmetic, a stable, high - speed and exact correlative arithmetic is formed, which makes it possible to apply computer vision detection of single - needle quilting in industrial production

    本文展開研究並取得一定成效：構建了基於pci總線的微機實時圖像採集系統；在採集的布料總圖（鳥瞰圖）的基礎上，通過數字圖像的數字濾波、圖像增強、邊緣檢測等處理，提取布料圖像的邊緣，對輪廓的矢量化的象素點進行搜索，得到相應的圖案矢量圖，從而確定絎縫的加工軌跡，生成加工指令；在進給加工過程中，主計算機對動態局部圖像與總圖（鳥瞰圖）的對應部分進行圖像相關的匹配計算，應用數字圖像理論，結合神經網路計算的改進最速下降法和模擬退火演算法，提出獨特而有效的相關迭代初始值賦值方法，形成穩定、高速和準確的相關運算，實現單針絎縫視覺測量和自動控制。
  2. Under the strategic m & as, the merging company can identify significant features of the target company, therefore lessen the circumscription of search ; after completion of first selection of target company, the merging company should analyze its fundamental information carefully ; moreover, as open messages of listed - company, financial statements should be analyzed carefully too. though principal components analysis the merging company can evaluate the operating result of the target company so synthetically as to master its operating condition precisely

    在戰略性並購中，主並公司可以利用logistic模型識別出目標公司的顯著性特徵，從而縮小搜索范圍；完成目標公司的初選后，對其基本情況作詳實的分析，此外，財務報表作為上市公司對外公開的資料，也作了重點分析；利用主成份評價方法可對目標公司經營業績進行綜合評價，更能準確地掌握其經營狀況。
  3. Experiments show that the efficient motion estimation algorithm proposed can further reduce block matching distortion computations relative to conventional fast motion estimation algorithms with neglectable coding efficiency loss ( within 0. 1db )

    提出一種基於節點模型的可變形塊匹配運動估計演算法來搜索最佳運動矢量。實驗表明，在編碼性能損失很小的條件下，可以使得運動搜索塊匹配的運算量在通常快速運動搜索演算法的基礎上下降61 % 。
  4. Experiments are performed and results show : 1 the popular retrieval models the okapi s bm25 model and the smart s vector space model with length normalization do not perform well for document similarity search ; 2 the proposed model based on texttiling is effective and outperforms other models, including the cosine measure ; 3 the methods for the three components in the proposed model are validated to be appropriately employed

    我們通過實驗驗證了以下三點： 1 trec中的常用信息檢索模型不能很好地解決文檔相似搜索2我們提出的基於texttiling技術的模型是有效的，性能優于其他模型3我們提出的模型中所採用的方法是有效的，包括利用texttiling技術進行文本子主題分割，利用餘弦公式來計算文本塊之間的相似度，以及利用最優匹配方法來求解文檔之間的總體相似度。
  5. In order to use the merits of these two detectors synthetically, the hybrid detector has been proposed, which uses the part of reduced detector to pretreat the data and the part of shnn to search the most likelihood sent datas

    綜合利用幾種檢測器的優點，文中提出一種基於隨機hopfield網路和精簡檢測器的混合多用戶檢測器。該檢測器利用精簡檢測器對待檢測數據進行預處理，然後利用隨機hopfield網路進行搜索。
  6. Comparing the output images, i select canny operator as optimizing edge detection operator. this paper emphasizes on stereo matching. firstly, selecting objects " edge pixels as matching elements

    應用canny邊緣檢測后得到的圖像邊緣點作為匹配基元，在另一幅邊緣圖像中搜索對應點。
  7. It supports a composable set of porttypes that define membership rules, property - based searches, and queries that return endpoint references eprs of compliant web services

    它可以支持porttypes的組合，用來定義成員關系規則，基於屬性的搜索，以及返回兼容web服務的endpoint reference （端點引用， epr ）的查詢。
  8. It can save the information near lips, which may be deleted by the method based on two points. ( 2 ) based on the analysis of current methods, a new multi - pose facial feature location algorithm is developed, which is based on the analysis of multi - feature and integral projection, the combination of an iterative search with a confidence function and template matching. the algorithm not only improves the location accuracy, but also speeds up a great deal. ( 3 ) based on the analysis of the advantages and disadvantages of current feature extraction methods, an adaptive facial feature selection criterion is developed, which is based on facial local feature protrusion consisting of several aspects, such as face image resolution and image quality

    其後研究了人臉特徵提取，一、討論了適合於多姿態人臉識別的基於三點仿射變換的人臉圖像歸一化方法，以克服基於兩點仿射變換會引起較大圖像信息損失的缺陷；二、在分析現有器官定位演算法的基礎上，提出了新多姿態人臉器官特徵定位技術，將多特徵和直方圖分析、基於置信度函數的迭代搜索和模板匹配相結合，既提高了器官定位精度，又提高了定位速度。
  9. All the connected units in the page are detected by search algorithm of connected region. the row - column mergence of the character is defined by fuzzy connectedness of the connected units at four orientations. the combination of punctuation we adopt the method of combination behind recognition due to great effect of mergence

    版面圖文分割主要採用自底向上的辦法，利用連通域搜索演算法檢測出文本頁面上的所有連通基元，通過對連通基元的四個方向上的連接度進行模糊化處理來決定文字行、列的合併，並對在文字行合併時影響較大的標點符號採用先識別后合併的方法。
  10. Once i have identified these phrases i start building additional pages, or even microsites ( for purposes of a / b, funnel, and conversion testing ) and i target the 3, 4, 5 or even 6 word long tail phrases

    通常來說， 「少的關鍵詞數量是好的」這是一般的概念，因為人的本性是用最小的路徑來完成他們的目標，觀點還是不變，但是人們開始使用更長的搜索關鍵字（基於我的分析） ，知道他們在找什麼，因為這樣的人群正在以明顯的趨勢增長。
  11. Considering of the differences of task scheduling between a grid and a distributed system, this dissertation designs a real number encoded mode that mapping every task to a random resource directly by improving the encoding mode of the traditional genetic algorithm, and gives a particular design to the encoding and decoding mode. at last, this algorithm is simulated in the grid simulator. the experiment results show that the reformative genetic algorithm not only has a holistic searching ability, but also makes a fast convergent speed, which provides a preferable performance

    本文根據網格計算任務調度的特點，提出了基於改進的遺傳演算法的網格任務調度，通過對傳統遺傳演算法的編碼方式進行改進，針對網格任務調度與一般分散式系統任務調度的不同之處，設計了資源?任務的一一對應的實數編碼方法，詳細設計了其編碼及解碼方式，最後在網格模擬器中進行了模擬，實驗數據證明了改進后的遺傳演算法即具有全局搜索能力，又具有較快的收斂速度，具有較好的性能，該實驗達到了本文以實現任務調度的最優跨度為目標的實驗目的。
  12. 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三種基本演算法的結構和特點，構造了一個分層搜索演算法的時間復雜度模型，從事務規模、數據項平均長度和支持度三個方面，對分層搜索演算法的時間復雜性進行了分析和驗證。
  13. 1, the mjpeg, dv can provide the precision to the compression data code for of with machine visitting, but, mpeg2 the is according to i, p of or i, p, b of, can t attain this point. this at not the line edit can cause the material the dilatoriness that search for the etc.

    1 mjpeg dv都能提供精確到幀的隨機訪問，但是， mpeg2的壓縮數據碼流是基於i p幀的或i p b幀的，就不能做到這一點。這在非線性編輯時會引起素材搜索的遲緩等。
  14. The visualization objects include the power flow animation, each customer ' s use rate of transmission line, the power supplying paths. a novel method is developed using power flow tracing method for finding all the directed paths between two designed nodes in the directed graph with loops

    鑒于目前還沒有高效的供電路徑搜索的數值方法，發展了一種新的基於潮流跟蹤的供電路徑搜索新方法，該方法可以通過簡單的運算來獲得帶環路網路指定兩節點間的所有供電路徑。
  15. A integrated algorithm of ambiguity resolution is proposed. by using triple carrier phase, integer gauss transformations, qr factorization, cholesky factorization, and geometry constraint, the correlation between ambiguity components is reduced, and more error ambiguity can be discarded, also process of ambiguity searching getting rapidly. the ratio test combining constraint of baseline is used to fix ambiguity rapidly

    利用三差最小二乘求解模糊度浮點解，然後採用整數高斯變換降低模糊度分量間的相關性，再根據qr分解和基線幾何約束減少需搜索的模糊度組合，採用cholesky分解在搜索過程中及早淘汰不正確的模糊度組合，最後利用ratio檢驗與基線幾何約束條件相結合檢驗模糊度組合，盡快固定正確的模糊度。
  16. In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local

    本文首先對聚類分析的遺傳演算法進行了研究，討論了聚類問題的編碼方式和適應度函數的構造方案與計算方法，分析了不同遺傳操作對聚類演算法的性能和聚類效果的影響意義。然後對k - means演算法中初值的選取方法進行了分析和研究，提出了一種基於遺傳演算法的k - means聚類改進（混合聚類演算法） ，在基於均勻采樣的小樣本集上用k值學習遺傳演算法確定聚類數k ，用遺傳聚類演算法的聚類結果作為k - means聚類的初始聚類中心，最後在已知初始聚類數和初始聚類中心的情況下用k - means演算法對完整數據集進行聚類。由於遺傳演算法是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用的能力，所以新的改進演算法具有較強的穩健性，可避免陷入局部最優，大大提高聚類效果。
  17. Then, an improved genetic algorithm is proposed to solve this problem. this algorithm makes trees with the source and all destinations are the space of operation and filter operation. with hybrid selection operator, competition among brothers, greedy operation, filter operation

    然後給出了一種基於遺傳演算法的實時多播路由選擇方法，並用改進的遺傳演算法進行了求解，該演算法採用包含源節點和目的節點的樹作為交叉和變異的空間的方法，通過加入混合選擇、小范圍競爭擇優的交叉變異操作，提高了全局搜索能力和收斂速度。
  18. The algorithm can be applied to connection routing in pcbs with various pad geometry and pad sizes, with different wire widths and variable distances between wires. the basic element in routing is the search line with a given destination. the main features of the router are the target orientation of the search lines, the routing efficiency is guaranteed by rationally designed data structures and by the ability of searching around obstacles, the small amount of working storage and the reasonably short routing time

    該布線演算法適用於焊盤外形尺寸不一，線寬及線間距離可變的印刷電路板布線，其基本要素是帶有預定終點的探索線，特點是線探索具有目標針對性，設計合理的數據結構及靈活的繞障探索方式可大大提高搜索效率，所需存儲量小，布線速度快。
  19. The paper ’ s main works are as follow : ( 1 ) several methods of getting pitch period are researched in details. according to the real - time demand for the systems, the methods for pitch searching are simplified as follow : after searching the peak value point every third point within pitch range, search the peak value point every point near the current peak value point

    （ 1 ）研究了基音周期的求取方法，並根據系統的實時要求，將逐點搜索基音周期的方法簡化為粗細法，即在基音周期范圍內隔點搜索相關函數最大峰值點，然後在此時得到的最大峰值點附近繼續搜索，將最後得到的峰值點作為基音周期值。
  20. The main idea is to search for feasible panels made of vertex and edges according to the elemental principles of 3d object, and reconstruct 3d object from feasible panels

    本文給出的基於線框模型重構三維實體求解演算法，從三維實體的基本原則出發搜索由點、線組成的可行面，然後計算由可行面構成的三維實體。
分享友人
分享到 Line

分享到臉書