cpu time 中文意思是什麼

cpu time 解釋
中央處理機時間
  • cpu : CPU = Central Processing Unit 【自動化】中央處理機。
  • 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. We also used 5 levels amr grid to simulate the helmholtz multi - fluid instability, but not compared the cpu time with each other yet

    我們也採用過五級剖分,由於均勻細網格的計算量太大無法比較耗費的時間。
  3. Whereas the programmer approaches the problem from the point of view of the application performance, a dba can approach the problem with an understanding of the database itself, and can offer advice and suggestions for the database layout, arrangement of tables and indexes, and effective use of informix and system resources, including data fragmentation, pdq priority, cpu time, memory utilization and data storage

    程序員是從應用程序性能的角度來考慮問題的,而dba考慮問題時理解了數據庫本身,從而可以對數據庫的布局、表和索引的安排,以及informix和系統資源(包括數據分段、 pdq優先級、 cpu時間、內存利用率和數據存儲)的有效使用提出意見和建議。
  4. This avoid high cost by using post - pruning measure which require many times for scanning disk data and amount of cpu time. so we gain a high efficiency

    這避免了后剪枝策略所需的高昂代價,減少了掃描磁盤數據的次數和大量的cpu時間,進一步提高了演算法的效率。
  5. Both the report server and the database engine compete for processing resources such as cpu time, memory, and disk access

    報表服務器和數據庫引擎會互相競爭cpu時間、內存和磁盤訪問。
  6. Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design. due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement. novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps. moreover, divide - and - conquer strategy and other simplified methods are adopted to minimize complexity. experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time

    文摘:以大規模混合模式布局問題為背景,提出了有效的初始詳細布局演算法.在大規模混合模式布局問題中,由於受到計算復雜性的限制,有效的初始布局演算法顯得非常重要.該演算法採用網路流方法來滿足行容量約束,採用線性布局策略解決單元重疊問題.同時,為解決大規模設計問題,整體上採用分治策略和簡化策略,有效地控制問題的規模,以時間開銷的少量增加換取線長的明顯改善.實驗結果表明該演算法能夠取得比較好的效果,平均比paflo演算法有16的線長改善,而cpu計算時間只有少量增加
  7. Lazy initialization of memory structures will save cpu time and may defer the activation of other plug - ins

    內存結構的滯后初始化可以節省cpu時間並延遲其他插件的激活。
  8. The concept of row ( column ) transposed matrix and row ( column ) symmetric matrix is given, their basic property is studied, and the formula for full rank factorization and orthogonal diagonal factorization of row ( column ) symmetric matrix are presented, which can reduce dramatically the amount of calculation and save the cpu time and memory without loss of any numerical precision

    摘要提出了行(列)轉置矩陣與行(列)對稱矩陣的概念,研究了其性質,給出了行(列)對稱矩陣的滿秩分解和正交時角分解公式,極大地減少了行(列)對稱矩陣的滿秩分解和正交對角分解的計算量與存儲量,且沒有降低數值精度。
  9. The focus of this paper is on the issue of minimizing cpu time to handle high speed data streams on top of the requirements of high accuracy and small memory

    在本篇論文中,我們研究高速產生的數據流中k中值點k - median的快速估計,特別是這些數據來源於高維空間。
  10. The " sys " field tells you the sum of cpu time used by the system as a whole

    「 sys 」欄位告訴您整個系統佔用的cpu時間總和。
  11. The " user " field tells you the sum of cpu time used by the user processor for the operation

    「 user 」欄位告訴您用戶處理器為該操作而佔用的cpu時間總和。
  12. The client then runs on spare cpu time, and uploads finished work units to the server

    科學家編寫軟體模擬蛋白質折疊的過程,以了解它們如何工作,從而開發新藥,治療疾病等。
  13. The coupling analysis program of surface flow and subsurface flow over porous media is developed based on the conversion principles of water on the surface under rainfall conditions. a new method to judge the saturation of the surface is proposed in this thesis, the convergence is speeded up and the cpu time is saved by using this method

    根據非飽和土上水的轉化機理,編制了降雨條件下地表水入滲和產流耦合的計算程序,並根據土-水特徵曲線,提出了判斷地表飽和的條件,根據此條件,加速了收斂速度,節省了cpu的時間。
  14. In aim solver, the convergence rate depends on spectral properties of the aim matrix, and the near - zone threshold distance has a dramatic impact on the memory and cpu time. a poorly conditioned matrix occurs through aim when a smaller near - zone

    另外,自適應積分方法計算中,在保證計算精度的條件下,較小的耦合距離將極大減小內存需求和計算的復雜度,但同時誤差積累也導致矩陣的性態變壞。
  15. We only need to apply an existing clustering once to computing k - medians, on demand, which reduces cpu time significantly. we conducted extensive experimental studies, and show that our approaches outperform other well - known approaches

    因此,在不同時段上所產生的誤差會隨著流數據注入而積累起來,這使得大多數演算法只能取得較差的近似結果,在實際運算中模糊不同演算法的差異。
  16. When the job completes, the submitter is notified of the exit status of the job, along with statistics such as the cpu time used and any input or output performed

    當任務完成時,提交者就會了解到該任務的退出狀態,同時還有一些統計信息,例如所使用的cpu時間,以及輸入和輸出信息。
  17. Adaptive grid techniques through a variational approach are applied to two shock problems with exact solutions. more grid points are redistributed in the shock regions in response to numerical solution and thus the shock can be captured successfully. the results show the techniques have excellent qualities in improving accuracy of numerical solution and reducing cpu time

    利用變分原理的自適應網格技術被應用到兩個有解析解的激波問題上,它能根據問題的求解,在解的大梯度區自動加密網格,從而非常成功地算出了激波。通過分析發現自適應網格技術在提高精度減少運行時間方面顯示了優良的性能。
  18. A number of tree - walking optimizations are built into this macro, giving you linear - o in big - o notation - efficiencies in processing a given sxml structure ; a naive approach could easily use more memory or cpu time. see resources

    這個宏對樹遍歷進行了一些優化,可以以線性效率用大o表示法為o ( n )處理給定的sxml結構,普通的方法很容易會佔用更多的內存和cpu時間。
  19. Numerical experiments show that the model provides systemic simulation for the whole load process, and the results of ga are stable and acceptable in allowable cpu time

    實驗表明,上述模型針對整個裝載過程獲得了系統模擬結果,其演算法在允許的運算時間內能獲得穩定的滿意解。
  20. Disables the keeping of cpu time and cache - hit ratio statistics

    不保留cpu時間和高速緩存命中率統計信息。
分享友人