轉移搜索 的英文怎麼說

中文拼音 [zhuǎnyísōusuǒ]
轉移搜索 英文
ixquick
  • 轉 : 轉構詞成分。
  • 移 : Ⅰ動詞1. （移動） move; remove; shift 2. （改變; 變動） change; alter Ⅱ名詞（姓氏） a surname
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 轉移 : 1 （改換位置） shift; transfer; divert 2 （改變） change; transform 3 [醫學] （擴散） metastasis;...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. In this paper we improved the traditional sa algorithm, and the heuristic algorithm is applied to the search and move schedule. the neighborhood is changed from the fixable to the alterable, the operation of moving and rotating is alternate, and the precision of the solution is then guaranteed as well as its convergence speed

    本文對傳統的sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，由定鄰域搜索變為變鄰域搜索，平移和旋轉變動交替進行，既保證了解的精度又提高了其收斂速度，取得了良好的布局效果。
  2. Firstly, we have put forward a mathematic form ? interest vector - to express the user ' s interest and have given a formula to calculate quantificationally the interest degree of interest item. secondly, we apply the method of reinforcement learning to intelligent learning agent to make it leam the user ' s interest more precision, more quickly and more efficiency, to make it discover the divert of the user ' s interest in time. thirdly, we have developed a mean of information search and filtrate on user ' s interest

    這些研究工作主要體現在：提出用戶興趣的數學表示形式? ?興趣向量，並提出定量地計算用戶對興趣項的興趣度的計算方法；提出採用強化學習演算法，使智能學習agent能夠更準確，更快速和更高效地學習到用戶的興趣和及時發現用戶興趣的轉移；提出面向用戶興趣的信息搜索和信息過濾方法；提出一種基於對象的agent編程模式，也稱為用擴充oo建模技術或方法學的適用性來設計agent系統。
  3. As for the given numerical example, we calculate the optimum solution of the problems

    對平移和旋轉網格進行遍歷搜索數據，通過計算機處理，求得了問題的最優解。
  4. In this article, we use idea of turning dispersion into convergence and put all the well ' s points into the same unit net to think about it. and answer three questions of the distribution of well drilling by the way of searching for groups of points. fincite - step - searching underthe condition of translationg fcoordinate system or revolving coordinate system. to first question. we find two algo - rithms and make use of data that is given to find the solution. we seek coorlinate of net point is co. 361, 0. 461 ) and mostly four old well ' s points are utilized at the same time by first algorithim, which are no. 2, no, 4, no. 5, no. 10. by second algorithm, we rechon the coordinate of net point is co. 390, 0. 505 ). and that mostly four old well ' s points are utilizld which are no. 2, no. 4, no. 10. to second question, we turn it into the first question by angling awt the center of net point. we seek that mostly six old well ' s points are utilized at the same time, which are no. 1, no. 6, no. 7, no. 8, no. 9, no. 11, when net is angled 0. 78 radian. and net point is translated to ( 0. 75, 0. 076 ) ( at nwe coordinate system ). to third question, wefind a necessary and sufficient condition and affer algorithms, at last, we analyse algorithms

    運用化分散為集中的思想，把所有的井點都放在同一個單位網格內考慮.在坐標可平移、旋轉的條件下，利用尋找點群、有限步驟搜索法，對鉆井布局的三個問題進行了解答.對問題一，給出了兩個不同演算法.並對題目提供的數據進行了求解，演算法1得到的結點為（ 0 . 361 ， 0 . 461 ） ，最多有4個舊井點被同時利用，它們是第2 、 4 、 5 、 10個井點;演算法2得到的結點為（ 0 . 390 ， 0 . 505 ） ，最多有4個井點被利用，它們是第2 、 4 、 5 、 10個井點.對問題二，以結點為中心旋轉一定的角度后，歸結為問題一進行求解，求解結果為當網格傾斜角為0 . 78弧度（相對原坐標系） ，結點平移到（ 0 . 75 ， 0 . 076 ）點（在新坐標系下） ，可被同時利用的最多舊井點為6個，它們是第1 、 6 、 7 、 8 、 9 、 11個井點，對問題三，我們給出了充要條件，並給出了演算法.最後還分析了演算法的優劣性
  5. Powell algorithm which does not compute gradients and brent algorithm were used to search the optimal rotation and translation parameters, while multi - resolution searching strategy leads to a fast image registration

    在尋找最優的旋轉和平移參數時，採用了無需計算梯度的powell直接搜索演算法和brent演算法，並通過多分辨的方式加快圖象配準速度。
  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. Based on ant algorithm with its mechanisms of transfer search and adjacent domain search, an ant algorithm model for the short - term optimal operation of hydropower station is constructed

    摘要利用螞蟻演算法的轉移搜索和鄰域搜索機制，構造了水電站短期優化運行螞蟻演算法模型。
  8. Today, most internet users limit their searches to the web, so we ' ll limit this article to search engines that focus on the contents of web pages

    現在，大量的網路用戶限制了他們在網路上的搜尋（大多數的網路用戶把他們的搜索對象集中到了網頁的搜索上） ，因此我們也將焦點轉移到搜索網頁。
  9. This paper improved the way of neighborhood search of sa algorithm. the extended pattern search is adopted, in which three ways are chosen, that can change the packing states of objects ( translation, rotation, swap ) and two kinds of pattern search matrices ( translation and rotation pattern search matrices ) are introduced

    文中改進了模擬退火演算法的搜索方法，採用擴展模式搜索：選擇三種改變物體布局狀態的方式（平移、旋轉、交換） ，採取兩種模式搜索矩陣（平移和旋轉模式矩陣） 。
  10. Indentificatiort is also the first step towards studies on protein co - and post - translational modification, and ultimately, function. in the present study, the total proteins of the photo - thermo sensitive genie male - sterile rice ( oryza sativa, peiai64s ) spikelet at meiosis stage were used as the material. by optimizing crucial factors and procedures such as sample treatment, electrophoresis parameters, and gel concentration, 2 - d maps with high quality and reproducibility were obtained

    用兩種方法對經雙向電泳分離的凝膠上的蛋白質點進行了初步鑒定，一是通過電印跡轉移把蛋白質轉到pvdf膜上，再用edman降解的方法測得部分相對分子質量在10000 - 30000da的蛋白質點的n -端序列，通過網上搜索其同源性對其進行鑒定，並確定該點在凝膠上的位置。
  11. In this paper, we design a watermark algorithm to resist geometric attacks, which used lpt ' s characters to resist the scale, translation attack and used the exhaustive search method to oppose rotation attack

    本文利用數極坐標變換的性質，消除平移和縮放對水印的威脅，用搜索的方法來應對旋轉攻擊，設計並實現了一種新的抗幾何攻擊的水印演算法。
  12. After the searching and positioning knowledge point according to the correlation, intensity, overlapping of correlation and intensity, transfer of search center, search with multiple search centers, we can find five ways of the interaction of interdisciplinary knowledge point : comparison, combination of knowledge point of two or three disciplines, combination of knowledge point of multiple disciplines, combination of knowledge point of soft and hard disciplines, and co - existence

    按照關聯度的大小、強度的大小、關聯度和強度疊加、搜索中心轉移、多搜索中心搜索等知識點搜索定位，跨學科知識點相互作用有：比較、二門或三門學科知識點合成、多學科知識點合成、軟學科和硬學科知識點合成及共存五種方式。
分享友人
分享到 Line

分享到臉書