搜尋基點 的英文怎麼說

中文拼音 [sōuxúnjīdiǎn]
搜尋基點 英文
search datum
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 搜尋 : search for; look for; seek
  1. The bvdv nadl strain is cytopathogenic. searching fromgenbank several cp strains " sequence of e2 gene about deer - n21, sh9, newyork - i and so on were found. according to the homologous sequence they were designed and synthesised a pair of primers by the biology software primer 5 and added bal i and nco i site to the 5 " end which can be used for the application of e2 gene and subcloning

    從genbank中搜尋出deer - n _ （ 21 ） 、 sh9 、 newyork -等cp型毒株的e _ 2基因序列，根據其同源性用生物學軟體primer5設計引物，並在引物的兩端加入bal和nco兩個酶切位點，酶切位點的存在易於對e _ 2基因進行克隆操作。
  2. Combined with the practical situiation in distribution network, it ' s suitable to select graph algorithm as the theoretical algorithm base. based on structure variable dissipated network theory, this thesis detailedly discusses the transforms of base - to - shape, shape - to - base, vertex - to - arc, arc - to - vertex, over - heated arc dectection, load allotting, load balancing and optimum restoration

    本論文基於變結構耗散網路理論，詳細討論了基形變換、形基變換、點弧變換、弧點變換、過熱弧搜尋、負荷分配、負荷均衡化以及優化恢復非故障停電區域供電等一系列與饋線自動化功能相關的處理演算法。
  3. After that, the thesis proposes a algorithm to seek the degree of the texture of a digital image. 3rd. it gives a new model for data clustering, " village - town " model and a clustering globally best algorithm based on genetic method

    以待聚類數據集為對象從尋求全局最優配置入手，首次提出了基於遺傳演算法的聚類變精度搜索方案和基於點分佈密度的類合併準則。
  4. An incredibly useful feature offered by many of these sites includes email notification based on your keyword search criteria

    難以置信提供許多有用的特徵，這些地點包括基於電子郵件通知您關鍵字搜尋準則
  5. Conventional clustering criteria - based algorithms is a kind of local search method by using iterative mountain climbing technique to find optimization solution, which has two severe defects - sensitive to initial data and easy as can get into local minimum

    傳統的基於聚類準則的聚類演算法本質上是一種局部搜索演算法，它們採用了一種迭代的爬山技術來尋找最優解，存在著對初始化敏感和容易陷入局部極小的致命缺點。
  6. Some methods are put forward for improving the convergence rate of the coa ( chaos optimization algorithm ) based on second carrier wave, which can greatly increase the velocity and efficiency of the first carrier wave to search for the optimal point at comparatively rough precision, and the refined search can be performed during second carrier wave more quickly as well as accurately

    摘要針對一般的基於二次載波的混沌優化方法收斂慢的弱點，提出了一些改進的方法，大大提高了首次載波尋找最佳點大概位置的速度和效能，同時能更快更精確地實現二次載波的精細搜索。
  7. A computer implemented method of generating keyword recommendations is provided, which includes providing keyword frequency data in computer readable media that indicate frequency counts of keywords used in past internet searches ; providing keyword affinity data in computer readable media that indicate affinities between pairs of keywords used in past user internet searches ; identifying keywords from the keyword frequency data that include the selected keyword ; identifying keywords from the keyword affinity data that have an affinity to the selected keyword ; and prioritizing the identified keywords based upon the keyword frequency

    一產生關鍵詞優點的電腦執行方法被提供哪一個包含提供在電腦有趣媒體中關鍵詞頻率數據，其說明在過去因特網搜索中使用關鍵詞的頻率罪狀的;提供在電腦中關鍵詞喜好數據有趣媒體搜尋，其指示在對在過去用戶因特網中使用關鍵詞之間喜好的;辨認出從包含有選擇的關鍵詞的關鍵詞頻率數據關鍵詞;辨認出從關鍵詞喜好數據關鍵詞，其有一向有選擇的關鍵詞喜好的;和按優先順序列出在關鍵詞頻率上把辨認出關鍵詞放置在基座上
  8. The competition between supply chains provides the base for the existence of positive - sum games among enterprises within the same supply chain, enables pareto improvement of supply chain management, and creates a win - win situation among these enterprises through the reduction of transaction costs, including the search cost, negotiation cost, contract execution cost and contract change cost. 3. with a focus on the reduction of transaction costs, we analyzed the re

    供應鏈與供應鏈之間的競爭使得供應鏈節點企業之間的競爭具有了正數和博弈的基礎，為供應鏈管理的帕累托改進創造了條件，使包括信息搜尋費用、交易談判費用、契約履行費用、交易變更費用等在內的交易費用大為節約，有助於實現節點企業之間的共贏。
  9. The principle of this approach is : during the second alphabetically pixel scanning of the labeling algorithm, the first pixel of each connected components is found, and a start - point table used for contour following is set up based on certain principles, thus the operation of search start points of the contour in the image is avoided, the execution of the standard contour following algorithm is accelerated

    演算法的基本原理是：利用標記過程尋找連通區域中第一個像素出現的位置，在此基礎上根據一定原則確定輪廓起點，省略了在圖像中逐像素搜索輪廓起點的過程，達到加速演算法執行的目的。
  10. A new sequential images sub - splicing method is proposed, which based on features of markers and aimed at looking for the same markers in overlapped area of two adjacent images to finish the splicing task. no real image coalescence is done, but the redundant information is diminished, so the two adjacent images are considered well spliced. big marks are interlaced with small ones to realize accurate image sub - splicing in real situation

    闡述了種子動態圖像拼接原理，提出了動態圖像亞拼接檢測方法，該方法基於標記特徵，以搜尋相鄰兩幀圖像中重疊區域內相同標記為目標，利用相同標記在前後兩幀圖像中應具有相同特徵向量的特點，通過特徵向量的匹配，實現冗餘圖像信息的去除，達到相鄰兩幀圖像的拼；提出了大小間隔的標記方案，以適應採集工況，實現準確圖像亞拼接；研究了重疊區域寬度對拼接精度的影響，給出了重替區域寬度設置方式。
  11. And the improved potential field model is used in path planning with dynamic environment the results of simulation have verified that the method can solve the problem effectively, even though there are stochastic moving obstacles in the surroundings. the third part describes the local minimum of the khatib artificial potential field model and its cause. a new way of optimizing the path using improved potential field approach with genetic algorithm was proposed

    再次，分析khatib人工勢場模型存在的局部最小點問題和產生原因，為了解決由於模型參數的隨機性帶來的局部最小值問題，提出一種基於改進的人工勢場模型的遺傳演算法搜索方法，並用該方法來尋求全局最優解，從而跳出函數的局部最小點，達到路徑最優。
分享友人
分享到 Line

分享到臉書