計算時間 的英文怎麼說

中文拼音 [jìsuànshíjiān]
計算時間 英文
calculation interval
  • 計 : Ⅰ動詞1 （計算） count; compute; calculate; number 2 （設想; 打算） plan; plot Ⅱ名詞1 （測量或計算...
  • 算 : Ⅰ動詞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 （一間...
  • 計算 : 1 （求得未知數） count; compute; calculate; reckon; enumerate 2 （考慮; 籌劃） consideration; pla...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. 20 western culture is a culture of arithmetical time

    西方文化是計算時間的文化。
  2. The beowulf strategy aims at minimizing computation time

    Beowulf策略的目的是最小化計算時間。
  3. The time - delayed correlation demodulation is established in order to suppress the noise and demodulating the signal

    Wigner - ville分佈計算時間長，不適于齒輪與滾動軸承的實時診斷。
  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. From then on, people were able to measure time and determine seasons based on the position and length of the gnomon ' s shadow

    從此，人們便通過觀測圭表上日影的長短變化來計算時間、測定季節。
  6. An implementation of lss - dca is developed and the time and memory requirement of the program are assessed

    我們用visua1c +十開發了基於lss一dca思想的計算機程序，並測試了lss一dca程序的計算時間和內存要求。
  7. 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

    分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法
  8. The subregion with pure dielectric layers is analyzed by mol and the fast fourier transform ( fft ) is introduced to reduce the computing time, while the subregion with conductors is analyzed by fdfd to take advantage fully the superiorities of these two methods

    通過在純介質區域使用直線法，導體所在區域使用有限差分法分別進行求解，充分發揮兩種方法各自的優越性。由於在純介質區域中使用了直線法求解，因此該演算法具有計算時間與介質層厚度無關的突出優越性。
  9. Calculation time units adjusted to seconds

    計算（時間單位調整為秒）
  10. The signal totalizer integrator can be used to compute a time - input product

    信號累加器積分器用於計算時間輸入產品。
  11. By the study of several typic methods of determining convexo - concave features for vertices of polygon, the computation time complexity of these methods was analysed, and those methods were implemented in vc + +

    摘要主要針對幾種典型的多邊形頂點凸凹性識別演算法進行研究，對它們的計算時間復雜度進行分析，並用vc + + 6 . 0實現多邊形頂點凸凹性的高效識別。
  12. Accordingly, using graph theory and operating experience abroad for reference, it firstly brings forward a new method of voltage rectification which based on pilot bus with voltage control area in view of the weak coupling among every vca ( voltage control area ), using decomposing method of multi critical value, it realizes the eliminating vinculum of every vca. and then, the rectification starts by pilot bus voltage of every vca. so the resolution of whole power net is diverted into calculating smaller sub - net

    由於各個電壓控制區之間無功電壓的弱耦合性，利用多閥值分解的分區演算法，實現區域間的解耦，然後根據各個子網路的主導節點的電壓進行校正，從而把求解整個網路的問題轉化為求解各個小的子網路，降低了網路維數，減少了無功設備控制動作次數，提高了校正成功率，縮短了計算時間。
  13. At first glance one would assume that such a technique would be extraordinary wasteful of computing time.

    初看起來或許會覺得這種技術大概極其耗費計算時間。
  14. 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塊時間遞歸演算法的并行格型結構在計算時間方面所具有的高速和高效性能。
  15. The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper. the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough, as to continuous attributes, the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  16. In the andes, time is often measured by how long it takes to chew a quid of coca leaf

    在安第斯山脈，人們常常用嚼一塊古柯葉所用的時間作為計算時間的單位。
  17. In the andes, time is often measured by how long it takes to chew a quid of coca leaf. sometimes, and not just in andes, a destination is said to be so many cigarettes away

    在安第斯山脈，人們常常用嚼一塊古柯葉所用的時間作為計算時間的單位。有時，不僅在安第斯山，人們會說某地在幾枝煙之外。
  18. Viterbi algorithm is a kind of maximum likelihood decoding method, which can obtain high decoding speed and cost fixed decoding time, so it is widely used in deep space communication

    維特比譯碼演算法是一種最大似然譯碼，它可以得到較高的譯碼速度以及譯碼計算時間固定，因而在深空通信中得到廣泛應用。
  19. 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計算時間只有少量增加
  20. The simplified gaussian approximation can be obtained, which has almost the same in accuracy but much less calculations than improved gaussian approximation method. the single traffic cdma system in nakagami fading channel with rake receiver is investigated extensively. a closed form ber expression is obtained with arbitrary chip waveforms

    由於在用戶小時其誤差大，改進高斯法可以提高精度，但需要更多的計算時間，少用戶時直擴系統的工程計演算法能夠獲得與改進高斯法相似的精度，但需要的運算量大為減少。
分享友人
分享到 Line

分享到臉書