重算時間 的英文怎麼說

中文拼音 [zhòngsuànshíjiān]
重算時間 英文
rerun time
  • 重 : 重Ⅰ名詞（重量; 分量） weight Ⅱ動詞（重視） lay [place put] stress on; place value upon; attach im...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. And the deficiencies are pointed out in present researches, such as highway capacity, level - of - service, influence factor of road alignments, etc. from these, it has confirmed that the thesis should be studied from rational analysis, quantitative analysis of level - of - service, impact on capacity of road alignments, setting - up simulation model, etc. the high - accuracy gps dynamic data acquisition appearance is proposed to be used for the first time to carry on the experiment of overtaking on two - lane highways, and experiment scheme is designed according to the driver ' s perceive to judge each overtaking course. based on the experiment data, it can get two important parameters of acceptant gap ? the critical gap of overtakable time headway and returnable time headway through data processing, which can offer the strong support to the research of two - lane highway capacity with qualitative and quantitative analysis. besides, the experiment methods is provided to observe overtaking ratio and to measure the

    研究中首次提出了運用高精度gps動態數據採集儀對雙車道公路上的超車行為進行觀測，設計了根據駕駛員感受度來衡量超車過程的實驗方案，並通過後期數據處理得到了超車過程中兩個重要的可接受間隙參數-可超車車頭時距和可回車車頭時距的臨界間隙值，為定性和定量分析雙車道公路通行能力提供有力的數據支持;同時，還提出了觀測超車率的實驗方法以及測量加速度干擾的實驗方案，統一了計算加速度干擾的時間統計間隔，為雙車道公路的服務水平量化研究奠定基礎;最後還簡單介紹了駕駛員問卷調查法和模擬程序中模型參數標定和驗證的數據採集方法。
  2. Trial 2, effect of supplemental copper of different type on nutrition and specific immunity of mice - ii the grouping of trialt animal was the same as trial 1, at the first day, second day, third day, one mouse was injected with pha brine fluid for 10mg / kg avoirdupois after weighing in the same time in each repeat, following the 7d, 14d, 21d, 8d feeding period, after weighing, blood was made, wrigh - giemsa coloration, counting the number of lymphocyte female cell and overage lymphocyte, index of immune organ, copper concentration in liver and spleen

    試驗二，不同形式銅對小鼠營養與特異性免疫功能的作用-試驗動物分組同試驗一，進入正式試驗期后，在每周第1天、 2天、 3天同一時間每重復選取1隻小鼠，稱重后每天按10mg kg體重肌肉注射一次植物血凝素生理鹽水溶液，並於試驗第7天、 14天、 21天、 28天稱重后尾尖取血，姬姆薩-瑞氏染色，計算t淋巴細胞轉化率，計算免疫器官指數，測定肝臟、脾臟銅含量。
  3. As soon as the servo system is concerned, the celerity of control algorithm is a very important capability guideline

    在計算機控制系統中，控製程序的時間間隔對控製品質有著很重要的影響，這就要求所設計的控制器收斂速度快。
  4. A highly efficient numerical algorithm by using multi - grid method ( mgm ) is introduced to solve the three dimensional field distribution in the present paper. formulae of the restriction and prolongation in mgm computation is deduced, and a 3d program of mgm is accomplished, which can solve the field distributions in electron optical systems for various electrostatic lenses. the 3d field distribution in an electrostatic concentric spherical model is tested with mgm algorithm and an algorithm based on finite difference method ( fdm ) respectively. comparing these two results in view of computational efficiency and computational accuracy, it appears that mgm is superior to fdm in solving electrostatic field distribution for the electron optics problem. this paper shows that the 3d field computation using mgm greatly improves the computational efficiency of field distributions in electron optical systems and shortens the computational time

    本文將一種高效率的數值計算方法? ?多重網格法引入三維靜電場分佈的計算，多重網格法利用限制和延拓可迅速求得滿足精度要求的場分佈.研究了求解各種靜電透鏡電子光學系統三維場分佈的多重網格法程序，驗算了靜電同心球模型的三維場分佈.通過與目前在場計算中常用的有限差分法進行比較，可以看出多重網格法的計算效率和計算精度優于有限差分法.本文表明利用多重網格法計算三維場大大提高了場分佈的計算效率，縮短了計算時間，因此為后續計算打下了良好的基礎
  5. Fractal coding has been proved useful for image compression. it is also proved effective for content - based image retrieval. in the paper, we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval. in this coding scheme, an image is partitioned into non - overlap blocks of a size close to that of a query iconic image. fractal codes are generated for each block independently. in the similarity measure of fractal codes, an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time

    分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法
  6. Two block time - recursive algorithms are developed for the efficient and fast computation of the 1 - d rdgt coefficients and for the fast reconstruction of the original signal from the coefficients in both the critical sampling case and the oversampling case. the two algorithms are implemented respectively by a unified parallel lattice structure. and the computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster method for the computation of the discrete gabor transforms

    首先論證了一維rdgt系數求解演算法和由變換系數重建原信號演算法，不論是在臨界抽樣條件下還是在過抽樣條件下，都同樣具有塊時間遞歸特性，並提出了相應的塊時間遞歸演算法及其并行格型結構實現方法，計算機模擬驗證了并行格型結構實現的可行性，計算復雜性分析與比較也說明了rdgt塊時間遞歸演算法的并行格型結構在計算時間方面所具有的高速和高效性能。
  7. 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計算時間只有少量增加
  8. By calculating rcs of arbitrary shaped conducting objects and the input admittance of a wire antenna on the arbitrary shaped conducting platform, it is shown that the method of impedance matrix interpolation can greatly reduce the computation time compared with the traditional moment method

    該方法僅對幾個插值點頻率直接進行計算，便可通過插值快速生成其他頻率點上的阻抗矩陣，相比于對每一個新頻率點重新直接計算阻抗矩陣，極大地減少了計算時間。
  9. The automatic metering system for 33 - 07 trucks can accurately make automatic metering and recording of mine - used truck hauling data such as run number, load, time etc. under various complicate and deteriorative operational environment conditions so as to realize the automation and computerization of the metering of mine - used truck hauling and meet the requirements of the truck hauling management in open - pit mine operation. as a result, it is of high popularization value

    07汽車自動計量系統能夠在礦用載重汽車各種復雜、惡劣的作業環境條件下對汽車運輸作業的車次、載重量、時間等數據進行準確自動計量和記錄，實現了礦用載重汽車運輸作業計量的自動化和計算機化，滿足了露天礦山生產汽車運輸管理工作的需要，具有較高的推廣應用價值。
  10. By comparing vertical fracturing well simulation with a streamline model and black oil model, it was pointed out that in simulation of vertical fracturing wells of hydraulic fracturing by using grid amplification there existed many drawbacks, such as grid orientation, calculating times doubled with the increase of grid number, the heterogeneity of model increased as fracture existence, which resulted in difficulties of equation solution and convergence

    摘要通過流線模型和黑油模型模擬垂直裂縫壓裂井的對比分析，指出了在黑油模型中運用網格放大技術模擬水力壓裂垂直裂縫井生產動態存在的諸多缺陷，如網格取向嚴重、計算時間隨網格數目增加而成倍增加、裂縫的存在增加模型的非均質性從而嚴重加大方程的求解難度，方程求解出現不收斂等。
  11. Do we need to re - calculate counters

    我們需要重新計算時間片嗎
  12. To exercise this demonstration, you will probably need to use the speed of recalculation command to increase the recalculation time from the default 5 seconds to 10 or 15 seconds

    為了練習此演示，可能需要使用「 speed of recalculation 」命令將重新計算時間從默認的5秒增加到10秒或15秒。
  13. The decision tree had a lot of algorithms, this paper focus on the optimization of fast classification in the face of n - value attribute of id3 algorithm which had parameters of user ' s interest. on the basis of avoiding the weak relevant attribute of n - value covered the worth strong relevant attribute, simplify complexity of the original algorithm and code cost through the mathematics tool, thus raise the speed of operation while using this algorithm, and lower costs in thrift as much as possible, to raise the efficiency

    決策樹學習有很多演算法，本文著重研究了對引入用戶興趣度參數的id3演算法在面對多值屬性時的快速分類的優化，在避免了多值弱相關屬性覆蓋少值強相關屬性的基礎上，通過數學工具簡化原演算法的復雜度和編碼代價，從而提高使用該演算法時的運算速度，盡量多的節約計算時間，從而達到降低成本的，提高效率的目的。
  14. When x - ict detects large industrial parts and requires high resolving power, image reconstruction of x - ict has huge pixel matrix and the amount of calculation increases greatly resulting in much more time of image reconstruction. this paper proposes the parallel image reconstruction based on workstations cluster to solve fast image reconstruction of high power x - ict this paper presents the relevant basic theories and principles of ict and image reconstruction, including scan mode and image reconstruction algorithm. high power x - ict which adopts powerful beeline accelerator as radial source often uses narrow fan - beam scan mode

    工業ct機檢測對象為大型工業構件並且要求高解析度時，圖像重建的像素點陣巨大，計算量大大增加，從而圖像重建時間過長。本論文提出用在工作站機群上的多機并行工作的并行圖像重建解決高能x射線工業ct機的快速圖像重建問題。本論文介紹了工業ct和圖像重建的基本理論、基本原理等有關內容，包括掃描方式和圖像重建演算法。
  15. Particularly for navier - stokes equation, we will compare the gmres methods with different preconditioned. we make some variances from the hss preconditioner ( [ 15 ] ), that are ma1 - ma4 in our paper. comparing with block triangular preconditioner we will find that the cpu time for ma1 is the smallest

    對navier - stokes方程的求解，我們重點是比較不同預條件的gmres方法，對基於對稱，反對稱分裂（ hss ）的預條件（ [ 15 ] ） ，我們提出幾種變形，本論文分別用m _ （ 1 ? m _ （ 4 ）來表示，並用它們和約束預條件做比較，結果表明，在計算時間上m _ （ 1 ）是最少的，最後我們對ep線性方程組的廣義逆解的擾動分析的某些結果也通過數值實驗給予驗證。
  16. Thirdly, the removing of the measurement capacitance value of adjacent pair decreases the dimension of the sensitivity distribution matrix from 66 to 54. the reduction of the dimension could help to improve the speed of image reconstruction

    最後，去掉這12電容值后，權重系數矩陣的維數從66減少到54 ，而維數的降低將有效地減少圖像重建的計算時間，提高系統實時性能。
  17. It may reconstruct images from all kinds of projections, which are got by various scan modes, and it is available to incomplete projection data too. but it usually takes a long running time

    但是由於計算量大、重建時間長的缺點，在很長一段時間內限制了其在醫學ct領域的應用
  18. Compared with elastic structural analysis, more time is used to analyze the plastic deformation structure. so, the real - time computation of plastic structure is more important than that of elastic structure

    與彈性結構分析相比，對發生塑性變形結構的分析需要更多的計算時間，因此塑性結構的實時計算更為重要。
  19. The conventional ways has low efficiency, which result in the application of overlap grid in moving - grid problem, which need re - disposes the interpolating connection in every step in time direction, is very difficult considering the computational efficiency. aim at the above problem in application of overlap grid, this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft, which could realize the automatic and shape - independent pre - disposal process for overlap grid. to deal with the problem of low efficiency for pre - disposal process in moving - grid, this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer

    對于重疊網格在動網格應用中的計算效率問題，本文通過進一步研究插值信息的高速查詢方法，提出不同於傳統演算法思路，以現代計算機大內存為基礎，用計算機物理內存空間換計算時間的」 mosaic 」方法以及應用基於二叉樹數據結構的adt （ alternatingdigitaltree ）方法兩類方法，成功的將原處理時間提高了兩個數量級? ?即將網格規模在百萬量級的重疊網格預處理時間從傳統方法的耗時30 60分鐘提高到幾十秒鐘，從而成功解決了這一問題。
  20. It is an important method of error control coding technology to solve the problem of transmission dependability. viterbi decoding algorithm is a kind of maximum likelihood decoding. because it can gain higher decoding speed and have the fixed decoding interval, viterbi decoding is applied so widely

    差錯控制編碼技術是解決傳輸可靠性的一種重要手段，維特比（ viterbi ）譯碼演算法是一種最大似然譯碼，它可以得到較高的譯碼速度以及譯碼計算時間固定，因而在通信系統中得到廣泛應用。
分享友人
分享到 Line

分享到臉書