搜索證 的英文怎麼說

中文拼音 [sōusuǒzhèng]
搜索證 英文
search warrant
  • : 動詞1. (尋找) collect; gather2. (搜查) search; ransack
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • : Ⅰ動詞(證明) prove; verify; demonstrate Ⅱ名詞1 (證據) evidence; proof; testimony; witness 2 (...
  • 搜索 : 1 (仔細尋找) search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Ts can avoid circuit searching by using the flexible memory mechanism and respective tabu criteria. also according to aspiration criteria, ts can assoil some good solution status which have been tabued, in doing so it can ensure the diversification search and obtain the globe optimum

    Ts通過引入一個靈活的存儲結構和相應的禁忌準則來避免迂迴,並通過藐視準則來赦免一些被禁忌的優良狀態,進而保多樣化的有效探以最終實現全局優化。
  2. Due to existing signal processing technology ’ s shortage such aslow measurement, narrow measurement range precision and other poor performance, we introduced a high - precise signal processing technology : firstly, to get power spectrum with hanning windowed welch modified periodogram, search its peak value frequency ; secondly, to apply zooming analysis via goertzel algorithm ; at last, to get a highly precise doppler frequency with energy centrobaric rectifying algorithm 。 the simulating result indicated that this technology introduced could get accurate doppler frequency 。 depending on above discussed technology, we designed a signal processing scheme, and developed a signal processing system. the running result showed high performance, verified the feasibility and reliability of the highly precise signal processing technology introduced. in a word, the technology improved ldv ’ s performance such as measurement precision, measurement range, dynamic response time 。 and it will have a wide application foreground

    針對存在的缺點,本文提出了一種應用於激光多普勒測速的高精度信號處理技術,即首先利用加hanning窗的welch修正周期圖演算法得到信號功率譜,其譜峰值頻率,接著利用goertzel頻譜細化演算法對的譜峰進行細化分析,再引入能量重心頻譜校正演算法對細化后的譜峰進行校正分析,從而將離散頻譜分析演算法、頻譜細化演算法和頻譜校正演算法三者有機結合起來,充分發揮各自的優點:通過加hanning窗的welch修正周期圖演算法快速得到功率譜及峰值頻率,通過goertzel演算法獲得分析頻帶的高解析度頻譜,然後通過能量重心校正演算法對細化后的頻譜進行高精度校正,這樣不僅保了演算法的高效性,而且大大提高了分析的精度。
  3. 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演算法進行了改進,在演算法的策略和變動策略中應用了啟發式方法,由定鄰域變為變鄰域,平移和旋轉變動交替進行,既保了解的精度又提高了其收斂速度,取得了良好的布局效果。
  4. Thirdly, from the idea of locally linear approximate, another tangent - plane algorithm is presented for the distance between the convex nurbs surfaces. the critical step is the construction of the support mapping by gjk and lc to search for nearest points, and emphases are laid on dealing with isotropic cases and choosing initial iterated points. it is also proved that no isotropism during iteration would take place if initial iterated points are positive points

    切平面法是運用gjk和lc構造支撐映射的原理而設計的一個近點對的迭代法,著重給出了迷向情況的處理和初始迭代點的選取方法,並明了只要將初始迭代點取為陽點,就不會出現迷向情況。
  5. 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技術進行文本子主題分割,利用餘弦公式來計算文本塊之間的相似度,以及利用最優匹配方法來求解文檔之間的總體相似度。
  6. Sochi, russia ( ap ) - salvage workers scrambled friday to collect wreckage from the black sea, gathering evidence that may tell whether a terrorist attack or an errant ukrainian missile brought down a russian plane full of israelis

    契,俄羅斯(美聯社) ?救援人員在星期五緊急趕往黑海地區收集飛機殘骸,以據來判斷究竟是恐怖襲擊還是迷航的烏克蘭導彈使滿載以色列人的俄航飛機墜毀。
  7. Simulated annealing algorithm is a kind of heuristic monte carlo method. in the course of solve the optimum problem, it conquer the blindfold searching mechanism of normal monte carlo method, and based on a appointed theory to guides search, so it can ensure a successful search

    模擬退火方法是一種啟發式蒙特卡羅法,在解決優化的問題中,它克服了常規蒙特卡羅方法盲目的隨機機制,而是在一定的理論指導下,故能保成功。
  8. The support vector classifier is adopted to identify fault in the two types, and the grid search method based on cross - validation is chosen to determine model parameters

    該模型將變壓器故障分為放電性和過熱性兩大類,通過統計分析尋求特徵量區分類間的故障類型,採用支持向量機識別類內的故障類型,利用基於交叉驗的網格法來確定支持向量機的參數。
  9. 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

    本文根據網格計算任務調度的特點,提出了基於改進的遺傳演算法的網格任務調度,通過對傳統遺傳演算法的編碼方式進行改進,針對網格任務調度與一般分散式系統任務調度的不同之處,設計了資源?任務的一一對應的實數編碼方法,詳細設計了其編碼及解碼方式,最後在網格模擬器中進行了模擬,實驗數據明了改進后的遺傳演算法即具有全局能力,又具有較快的收斂速度,具有較好的性能,該實驗達到了本文以實現任務調度的最優跨度為目標的實驗目的。
  10. 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三種基本演算法的結構和特點,構造了一個分層演算法的時間復雜度模型,從事務規模、數據項平均長度和支持度三個方面,對分層演算法的時間復雜性進行了分析和驗
  11. In the genetic process of reproduction, crossover and mutation of the chromosomes in this method, these operators pr, pc and pm are produced randomly within some space, the scale of population and all kinds of genetic probability are also adjusted randomly so that the diversity individuals of population is ensured. the ga of dynamic population scale passes more information of paternal chromosomes to the offspring, which is beneficial to search the global optimization or quasi - global optimization

    該方法在染色體進行繁殖、交叉、突變的遺傳過程中,在某一范圍內隨機選取p _ r , p _ c , p _ m ,動態調整種群規模,保了種群個體的多樣性;選擇同父本分別進行三種遺傳過程使得父本染色體中有更多的信息傳遞給子代,這有利於全域最優解或準最優解。
  12. The application of sa and heuristic algorithm in packing problem is studied deeply. an improved sa, which utilizes heuristic approach in search tragedy and movement tragedy, is introduced and manifested to enhance the rate of convergence with an extent of exact solution

    對sa演算法和啟發式演算法在布局問題中的應用進行了研究,為提高收斂速度同時保一定精確度,對sa演算法進行了改進,在演算法的策略和變動策略中應用了啟發式方法,縮小布局狀態空間的
  13. In the first chapter, the improvement and development of furrow irrigation technique, theory foundation of controlled alternate furrow irrigation, and related research advance at home and abroad were analyzed and elucidated, and the main problems needing to be studied further and to be solved were put forward. in the second chapter, the soil infiltrative parameters, irrigating water advancing and water redistribution in soil were studied by adopting the controlled alternative furrow irrigation in field

    根據建立的水量平衡方程,採用模式技術中的爬山法,利用infiltvs分析軟體,計算得到的不同溝灌方式灌溉水流的推進過程與利用實測資料回歸分析得到的水流推進過程幾乎完全重合,預測精度很高,因此明本文建立的模型和分析計算方法是合理可行的,完全可用於不同溝灌方式土壤入滲參數和水流推進過程的估算。
  14. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    明了在考慮折扣因子的條件下,模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務,並且被連續加工所得的排序為最優排序:該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上分解樹的方法。
  15. 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

    本論文主要討論用最佳前導序列在頻域中進行通道估計的問題,在前人的基礎上提出一種改進型的最佳前導序列的方法,可使得估計誤差減小且便於計算,模擬驗了演算法的有效性。
  16. Considering the one - sidedness and inaccuracy of knowledge discovery only from single - color database, an approach is proposed to discover knowledge from 1331 groups of mix - color database with partial least - square regression, based on measuring and learning 400 groups of single - color database. by this method, the mean error decreases when converting from rgb to cmyk, the precision of color matching is improved, and the automatic and general problem in color matching is further solved

    本文基於統計學習理論構造了一種快速自適應隨機演算法,明了演算法的收斂性.給出了一種簡易實用的寬帶天線匹配設計新方法.應用該自適應演算法進行天線匹配設計,不僅演算法簡單,易於編程實現;而且能夠快速設計出具有較好性能的匹配網路,非常適用於各種短波、超短波天線的匹配設計問題
  17. The results show that the linearization technique based on em can reduce calculation burden in searching for optimal scheme

    計算結果表明,能量裕度線性差值方法使控制方案的非線性過程在保結果準確的前提下大大簡化。
  18. Ga is a searching algorithm that is based on the evolution theory and principles of genetics of bioscience

    結果明該演算法提高速度和布局效果。遺傳演算法是一種基於生物學進化原理的演算法。
  19. And a dynamic searching system of geometric theorem has been implemented, which can solve elementary geometric problems efficiently, including some non - constructive problems

    該系統不但可以明構造性的初等平面幾何命題,而且也實現了對非構造性幾何命題的定理
  20. Nucleic acid sequences of azoreduclase were searched and blasted in genbank. a pair of primers based on the conserved regions were designed. a specific fragment was amplified by pcr from the plasmid of rhodopsedomonas palustris and sequenced. the sequence contained a complete 471bp orf ( open reading frame )

    脫色實驗明沼澤紅假單胞菌( rhodopsedomonaspalustris )對偶氮染料有較強的降解能力,我們通過genbank,對所獲得的所有偶氮還原酶基因在ncbi進行比對並設計引物,從沼澤紅假單胞菌質粒中擴增獲得了一條含471bp完整開放閱讀框架的序列。
分享友人