search time 中文意思是什麼

search time 解釋
查找時間
  • search : vt 1 搜查;檢查(身體、衣袋等);搜索,搜尋;找;尋找。2 調查;查究;探求;追求;根究 (into)。3...
  • time : n 1 時,時間,時日,歲月。2 時候,時刻;期間;時節,季節;〈常pl 〉時期,年代,時代; 〈the time ...
  1. In accordance with the problem that the fcm algorithm is quite time - consuming for search out cluster cancroids and may not be suitable for on - line modeling and control. this dissertation proposed an improved fuzzy identification method based multistage random sampling fuzzy c - means clustering algorithm ( mrfcm ). it has higher approximate precision and the cpu time has slowed down sharply compared with the common fuzzy

    Johnyen和liangwang介紹了幾種應用於模糊模型的信息優化準則,本論文在此基礎上對統計信息準則進行一些改進,並與快速模糊聚類和正交最小二乘方法結合,提高了模型的辨識精度和泛化能力。
  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. On one hand, numerical derivatives provide proper search directions in optimization, therefore their accuracy is of great importance for fast convergency. on the other hand, derivative evaluation is one of the most time - consuming steps in optimization

    當前的高性能數學規劃演算法大都依賴于導數計算以快速收斂到最優點,所以對求導精度的要求比較高;而導數計算所消耗的時間占優化時間的比例又非常的大。
  4. Functions realized are as follows : search for current news of educational administration management on the web. course selection in the prescribed time, and characteristic searching in roles of student, teacher, president, school or department leader, etc. the usable information include student ' s basic information, student ' s score, curriculum schedule, teacher assess, and so on

    本系統實現的功能有:網上查詢教務管理最新消息;學生、教師、學校領導、院系領導以不同角色的個性化信息查詢,包括:學生基本信息、學生成績、上課課表、教師評估結果等信息;在規定時間內的學生網上選課。
  5. Or search by flight time

    或使用航班時間作搜尋:
  6. This paper study practice of small and medium - sized enterprises ' bpr, using weifang charming hometextile co., 1td as research objiect, using author ' participant practice of bpr as background, combine process manage management, project management, iso9000 quality control system and other modern times manage theories. on the basis of analysis of environment, form stratagem programming scheme, this paper search key process analyse process, form new process. at the same time, with institution reform, human resource mechanism desigm, come into being frondose, executable scheme. and validated in the practise

    論文首先對企業內外部環境進行詳細分析、形成企業戰略規劃方案;根據戰略規劃發展的需要,確定關鍵流程? ?產品開發流程和生產管理流程;對關鍵流程進行分析診斷,確定其存在的問題;形成新的工作流程,輔之以機構重組、人力資源及激勵機制設計,形成具體的、具有可執行性的方案,並在實踐中得到一定的驗證。
  7. Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field

    本文提出一種新型的網格資源調度演算法最小跳數演算法,首先通過廣度搜索遍歷找到資源,並同時生成跳數場,再根據跳數調度資源。
  8. The larger the team project, the more time and resources the search takes if clauses are not specified

    如果沒有指定子句,則團隊項目越大,搜索所花的時間和資源就越多。
  9. This subject is with ovid ( journals ovid full text ) data base an example with two domestic biomedical information full text biomedicine electronic periodical that circle use often most these, proquest of umi, search to it characteristic, discipline distribute, sci, etc., that authoritative data base includes than serious, and jcr periodical influence factor analyze a lot of go on and appraised and study, can purchase the reference of offering of the department in order to expect the analysis result of a subject for readers and electronic periodical, do some exposition on appraisal of the electronic periodical of medical science of foreign language at the same time

    本課題以ovid和umi這兩種國內生物醫學情報界最常使用的全文生物醫學電子期刊數據庫為例,對其檢索特性、學科分佈、被sci等權威數據庫收錄的比重,以及jcr期刊影響因子分析等多個方面進行了評價研究,以期望本課題的分析結果能給讀者和電子期刊采購部門提供參考,同時對外文醫學電子期刊的評價研究作些闡述。
  10. However, i have a feeling that adding this would considerably increase database size, and therefore search time

    然而,我認為這樣做會大幅增加數據庫的大小和搜索時間。
  11. A method of transforming a search key into an address for the purpose of storing and retrieving items or data. the method is often designed to minimize the search time

    為存儲和檢索數據項或數據,把搜索關鍵字轉換為一個地址的一種方法。該方法常用於減少搜索時間。
  12. There exits contradiction between the qos guarantee and complexity of channel assignment algorithms. and the channel search time is correlated with the channel utilizing efficiency. so each solution plan is the compromise among these factors

    因為在系統的通信服務質量和通道分配演算法執行的復雜性之間存在矛盾,而且它與通道搜尋時間和通道利用率也有關系,所以任何一種解決方案的提出總是不同矛盾折中的結果。
  13. The selection of the channel assignment strategies is always aiming at achieving higher channel efficiency, better qos, shorter channel search time and simpler application of the algorithm

    在選擇通道分配方案時,總體目標是:獲得較高的通道利用率;較令人滿意的系統服務質量;盡可能短的搜尋時間以及採用盡可能簡單的演算法。
  14. This means that the client and search time - outs will start counting from zero when the

    類請求第二個數據頁時,客戶端和搜索超時將從零開始計數。
  15. We assume that the total search time was bounded and hence the retrieval task will not succeed for sure

    假定用於搜索的時間總量是有限的,因此搜索任務不一定會成功。
  16. For information about how client and server search time - outs work with query paging in the directory, see the documentation of the search methods for the provider for active directory

    有關客戶端和服務器搜索超時設置如何與目錄中查詢分頁配合使用的信息,請參見有關active directory提供程序的搜索方法的文檔。
  17. I ' ve changed the search time from 45 seconds to 15 seconds. other security measures have been added though like searching for real words, more than one word searches, and some others ( undisclosable )

    他的規則改了.原來是間隔45秒.現在改為間隔15秒.但你必須搜索兩個以上單詞組成的的真正詞匯.而不是一個詞.另外不要老是搜索一個詞組啊.哈哈
  18. Tuple space search is a fast update algorithms which can employ to large size rule set and we provide a two fields classification algorithms named rectangle algorithms which is a optimized two fields algorithms in the search time and space after we discuss the way of mark in detail

    在對加標記的改進方法的詳細論述的基礎上,本文介紹了一種二維分類演算法? ?矩形演算法,該演算法是目前一種查找性能和空間需求經過優化的二維演算法。
  19. Computing result shows that : coevolutionary mdo algorithms are effective on this problem ; distributed coevolutionary mdo algorithm is better than cooperate coevolutionary mdo algorithm ; asynchronous parallel version of distributed coevolutionary mdo algorithm speeds up the optimization procedure greatly while maintains good convergence performance ; multiobjective distributed coevolutionary mdo algorithm approximates the whole pareto optimal front well in only one single run, saves much computing cost than constraint method to obtain pareto optimal set, and greatly shortens search time by distributed asyn

    計算結果表明:協同進化mdo演算法求解該問題是有效的,其中分散式協同進化mdo演算法優于合作協同進化mdo演算法;異步并行的分散式協同進化mdo演算法在保證收斂性能的同時大大加快了優化進程;多目標的分散式協同進化mdo演算法僅一次運行就很好的逼近了問題的整個pareto最優前沿,比用約束法求解pareto最優集節省了大量計算開銷,而且通過網路多臺微機的分散式并行執行大大縮短了搜索時間。
  20. Because of communities divided by category tree, when users wants to search some commodity, he only needs to send his search requests to special community, which reduces the search range, improves search effect and decreases the search time

    本文提出一種基於分類樹的搜索演算法,基於分類樹所劃分的社區,用戶要查詢相應的商品的時候,只要到特定的社區中進行搜索就可以,減少了搜索的范圍,提高了搜索的命中率,縮短了搜索時間。
分享友人