鄰近搜索 的英文怎麼說

中文拼音 [līnjìnsōusuǒ]
鄰近搜索 英文
proximity search
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 鄰近 : nearclose toadjacent to
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. The main duties of aco include making use of various sophisticated equipment such as computers, transmitters and receivers in the communication centres to conduct point - to - point communications with adjacent airports, to provide aeronautical fixed, mobile and broadcasting services as well as communications for search and rescue

    航空通訊員航空通訊員的主要工作是利用各種精密儀器，如電腦、發射機和接收機等，與鄰近地區的機場進行點對點通訊，以及提供固定航空通訊、流動航空通訊、航空氣象廣播和搜索及拯救行動通訊等服務。
  2. Firstly, based on conventional vq, a fast algorithm named equal - sum block - extending nearest neighbor search ( ebnns ) is presented, which not only can achieve the reconstructed image of full search algorithm but also can greatly reduce both the codeword search ratio and chip area. in order to improve coding efficiency, a new algorithm called correlation - inheritance coding is proposed, which is embedded in conventional vq system to improve compression ratio by re - encoding the indexes

    首先，在普通矢量量化基礎上提出了等和值塊擴展最近鄰快速碼字搜索演算法（ ebnns ） ，該演算法在圖像畫質達到窮盡搜索演算法的前提下，大大降低了碼字搜索率和硬體實現面積；為了提高編碼效率，在相關性編碼方面，提出了相關繼承編碼演算法，對普通矢量量化后的編碼索引進行無損重編碼。
  3. Then navigation asteroids are selected under a integral evaluation, the planning of the photoing sequence is handled with an improved genetic algorithm, along with a difference selection method which optimizes the ratio of navigation evaluation to resource consumption. a single axis randomized expanding algorithm is proposed to solve the large angle slew maneuvers planning problem. this algorithm randomly produces

    對于自主探測器大角度機動規劃問題，本文提出單軸隨機擴展演算法，單軸隨機演算法在生成隨機節點過程中充分利用鄰近點的信息，把規劃問題構造空間的維數由3減少到2 ，從而減少問題求解的搜索空間，最後利用前向搜索的方法對規劃路徑進行優化。
  4. The role of the marine police is to maintain the integrity of the sea boundaries and regional waters of the hksar. it is responsible for enforcing the laws of hong kong in regional waters ; preventing illegal immigration by sea ; search and rescue in hong kong and adjacent waters ; and casualty evacuation

    水警的職責是維持香港特別行政區海上邊界及水域的治安，在本港水域執行香港法例、防止水路非法入境活動、負責本港及鄰近水域的搜索和拯救工作，以及運送死傷者。
  5. The role of the marine police is to maintain the integrity of the sea boundaries and regional waters of the hksar. it is responsible for enforcing the laws of hong kong in regional waters ; preventing smuggling and illegal immigration by sea ; search and rescue in hong kong and adjacent waters ; and casualty evacuation

    水警的職責是維持香港特別行政區海上邊界及水域的治安，在本港水域執行香港法例、防止水路走私及非法入境活動、負責本港及鄰近水域的搜索和拯救工作，以及運送死傷者。
  6. 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

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  7. Of 3. this index structure supports an efficient search for all items containing indexed words and advanced search operations, such as phrase searches and proximity searches

    此索引結構支持對包含索引詞的所有項進行高效搜索，並支持高級搜索操作，例如短語搜索和鄰近搜索。
  8. An improved method of de - noising via wavelet threshold and its implementation based on matlab

    基於最優投影和動態閾值的最近鄰搜索演算法
  9. Based on tabu search, a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem, which provides an approach to control the optimizing process flexibly

    基於tabu搜索設計了變鄰域結構的局部搜索技術，提供了靈活控制尋優過程的途徑;全多項式時間復雜性近似策略的開發，使得0一1背包問題的求解成為了n戶c問題近似演算法設計中最為成功的範例。
  10. Monte cristo leaned against a tree, and with that scrutinizing glance which was so rarely deceived, looked up and down the avenue, examined the passers - by, and carefully looked down the neighboring streets, to see that no one was concealed

    基督山靠在一棵樹上，用他那絕少錯漏的眼光搜索馬路，審察往來的行人，仔細探望鄰近的街道，看有沒有人躲在那兒。
  11. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  12. The ability to search the neighbor - area of the best solution of half - determined ga is improved with three new strategies : half determined hamming - decreasing, low bit determined mutation and self - adaptive scaling of design variables

    後者利用半確定性的變異操作， hamming - decreasor ，設計變量的自適應定標這三項措施對當前最優個體的鄰近區域的集中搜索來提高演算法的局部搜索能力。
  13. The new improved nearest neighbor search algorithm presented based on key dimension, which could be used to improve the performance of compute efficiency

    為降低計算時間，提出一種基於關鍵維的近鄰搜索演算法。
  14. On the other side, we use nearest neighbor approximation to calculate gussian mixture densities, which can reduce recognition time by 6. 67 % compared with standard viterbi beam search algorithm

    另一方面，使用高斯混合概率密度的最近鄰快速估算方法，使標準viterbibeam搜索演算法的搜索速度提高了6 . 67 。
  15. Further more, we improve the nearest neighbor approximation method by calculat e mixtures ordered by likelihood of being the best scoring mixture. the likelihood is calculating from previously processed data. this improved method can reduce recognition time by 15. 56 % compared with standard viterbi beam search algorithm

    本文對最近鄰快速估算方法進行改進，在搜索過程中根據已處理過的數據統計出各個高斯混合分量產生最高對數概率的概率，並依此預測隨后的計算中最有可能產生最高對數概率的高斯混合分量，優先計算更有可能產生最高對數概率的高斯混合分量，使標準viterbibeam搜索演算法的搜索速度提高了15 . 56 。
  16. Words in close proximity to each other

    搜索位置鄰近的詞。
  17. You can search for words or phrases in close proximity to another word or phrase

    可以搜索與另一個詞或短語鄰近的詞或短語。
  18. The modified method makes the output classification clearer and the intervals between different classes larger. furthermore, in order to handle the real attribute values conveniently, a real rough set theory based on the general neighborhood relation is proposed

    在廣義近鄰關系下定義了實域粗糙集的基本概念，研究了相應的性質，並提出了一種基於beam搜索的實域粗糙集的屬性約簡方法。
  19. To accelerate the learning process of self - organizing mapping in the situation of large mount of data or high dimension, two learning algorithms were proposed in this paper, by using partial distortion search and extended partial distortion search respectively to solve the problem of nearest neighbor search during learning process, which could reduce the multiplications greatly

    摘要針對傳統的自組織映射網路在大數據量或高維情形下訓練過程較慢的問題，提出了分別使用部分失真搜索和擴展的部分失真搜索來完成傳統演算法中最耗時的最近鄰搜索過程，減少了完成訓練所需乘法次數。
  20. 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是一種象素級的輪廓搜索演算法，它在方向圖中找到開始點和目標點之間的最小代價路徑。
分享友人
分享到 Line

分享到臉書