computing time 中文意思是什麼
-
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
分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法 -
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
通過在純介質區域使用直線法，導體所在區域使用有限差分法分別進行求解，充分發揮兩種方法各自的優越性。由於在純介質區域中使用了直線法求解，因此該演算法具有計算時間與介質層厚度無關的突出優越性。 -
At first glance one would assume that such a technique would be extraordinary wasteful of computing time.
初看起來或許會覺得這種技術大概極其耗費計算時間。 -
In order to minimize computing time, simplified prediction procedures are provided, which transform parameter seeking into arma process, and computing complexity and duration are decreased
為了減小計算量，本文對farima模型擬合的方法和具體步驟進行了深入的研究，簡化了運算步驟，提出了一種簡化的預測方法。 -
The computing complexity and computing time of this algorithm is lower than that of existed algorithms
該演算法比已有的塊三對角矩陣求逆演算法的計算復雜度和計算時間低。 -
The author ' s work gives new way, which is beneficial to real time interaction and can efficiently reduce computing time as well as data storage amount. these algorithms can find good use in numerical machining, robotics, form - position tolerance and computer graphics. ( 3 ) degree reduction for nurbs curves and surfaces by applying the theory of the best uniform approximation of chebyshev polynomials and the explicit matrix representation of nurbs curves, this thesis centers on the research of the explicit nearly best approximation of multi - degree reduction of nurbs curves
以上關于等距曲線的幾何逼近與代數逼近的演算法改革了當前國際圖形界只能對基曲線沿法矢方向平移定距離的點作近似逼近的固定模式，創造了利於交互操作，能有效地減少計算量及數據存儲量的新方法，可在數控加工、浙江大學碩士學位論文機器人、形位公差學、計算機圖形學中獲得很好的應用（ 3 ） nurbs曲線曲面降階應用nurbs曲線的顯式矩陣表示及chebyshev多項式逼近理論，以實現nurbs曲線顯式一次性降多階的近似最佳逼近為目標進行了研究 -
Advantages of the program written by the spline collocation method are higher accuracy, wider convergent region, less input data and computing time
用樣條配點法編寫的程序具有精度高、收斂范圍特大、輸入的數據和計算時間少的優點。 -
The computing time is unrelated to the thickness of the pure dielectric layers
同時在直線法中有效地引入了fft演算法用於進一步提高演算法的計算效率。 -
First, the basic theory of the competitiveness is analyzed, evaluating indexes which conclude relative and absolute indexes basic on the last literatures are set up. second, because the data are too many and computing time is too long, the competitiveness of science and technology of 30 areas are clustered using fuzzy clustering model, the areas of the whole nation are clustered several kinds and we can draw some conclusions of same kind. evaluating the competitiveness using single model can produce white noise, so combinational models which concluding neural network, fuzzy theory and genetic algorithm are brought forward to evaluate the competitiveness of areas which are in the same kind with fujian province in the test
本文首先分析科技競爭力的基本理論，並根據以往研究科技競爭力文獻，建立包含絕對指標和相對指標的評價科技競爭力評價指標體系，其次，針對評價福建省科技競爭力在全國范圍內的排名情況數據較多，計算時間較長的具體情況，利用模糊神經網路模型對全國30個省市自治區科技競爭力水平進行聚類分析，將科技競爭力水平接近的地區聚為一類，得出科技競爭力水平相近地區情況，而後，針對已有文獻科技競爭力評價只是利用單一模型可能產生噪聲，影響評價結果，並且主觀性較強的缺點，本文將神經網路、模糊數學、遺傳演算法等智能演算法組合，利用組合評價模型對福建省和與福建省同在一類的其它地區的科技競爭力水平進行橫向、縱向評價，得出福建省在全國范圍內的科技競爭力水平排名。 -
Meanwhile, owing to the fact that there is huge hardness in accurate extracting of attenuation constant, one of the most new modified compact fdtd methods is applied to analyzing lossy multiple conductors to give accurate results. it is combined with the nonuniform mesh partitioning technique to reduce the computing time
針對有耗導體衰減常數難以精確提取的問題，將一種最新改進降維方法應用到有耗多導體系統分析中，並結合非均勻網格劃分技術，在得到準確衰減常數的同時有效地減少計算時間。 -
To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost
通過分析影響網路的鏈路負載均衡的因素，比如源-目的節點間的最大流，通過每條鏈路的最大流，源-目的節點間的路徑數目，通過每條鏈路的路徑數目，以及鏈路的剩餘容量等，提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ，通過模擬，與最小跳演算法（ mha ） 、最寬最短路徑（ wsp ）演算法、最小干擾路由演算法（ mira ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。 -
This thesis mainly focuses on the multi - level parallelism development and performance optimization of scientific programs on this architecture, and our works are summarized as follows. ( 1 ) we put forward the multi - level parallel computing time model, which is suitable for smp cluster to analyze program performance from the micro - aspect. we also provide a multi - level parallel optimization speedup model based on the single - processor speedup factor, which can evaluate program performance from three parallel levels and guide us to improve the programs
本文圍繞這種多級并行體系結構中的超節點級、節點級和單機指令級三個層次的并行性開發與優化，在科學計算程序的綜合優化技術研究方面做了以下的工作與創新: （ 1 ）針對smp集群體系結構提出了多級并行計算時間模型，用於程序性能的微觀分析;將單機處理速度與加速比統一起來，提出了基於單機優化加速因子的多級并行優化加速比評價模型，該模型分別從三個并行層次的角度出發對程序性能進行評價，並指導對程序的改進與優化。 -
Then for the computing time of the traditional pca - based face recognition algorithm is very large, we use wavelet transform to reduce the dimension of images, and decrease computation complex
針對傳統pca （主分量分析）方法運算量大的特點，本文通過小波變換對輸入圖像進行降維處理，降低了后續演算法的復雜度。 -
With a view to dct that costs the longer computing time, fast dct is proposed, and the method of prejudgment of an macro - block of all zero coefficient of dct is adopted in this paper, which makes about 40 percent dct computation reduced, consequently, the encoding speed of h. 263 encoder can be further increased
263編碼器的編碼速率；對運算量較大的dct給出了快速演算法，並對全零dct系數塊採用提前判斷的方法，從而省去了約40的dct運算，進一步提高了h 263編碼器的編碼速率。 -
Basing on the static aeroelasticity, the jig - shape and the attack angle design have been studied. generally, much computing time is needed in unsteady flow computation
利用現有條件自主開發出適合定常、非定常流場計算和氣動彈性研究的分散式并行計算機系統。 -
In order to reduce the computing time and improve efficiency, the procedure has been paralleled and the distributed parallel computation is accomplished in a net with four pcs. the parallel computation of static aeroelasticity and flutter has been initiated at home. on this basis, the work includes four parts
通過對單機串列程序進行分散式并行化改造，在國內首次實現了基於微機網路上的靜氣動彈性和顫振分散式并行計算，解決了數值求解氣動彈性問題難以避免的耗時巨大的問題。 -
The reporting is in fact so precise that parabon can provide the facility to pay individual clients for the computing time that they provide
Paradon的報告機制實際上是十分精確的，可以根據每一個單獨的客戶機所提供的計算時間，為其支付費用。 -
Effects of sea tide should be considered in modeling groundwater dynamics and associated contaminant transport in coastal aquifers, which may result in significant increase of computing time especially for variable - density contaminants, and superior numerical performance of the model is required
摘要模擬沿海地區地下水及污染物的輸移需要考慮海洋潮汐的影響，對于變密度污染物，考慮潮汐的影響會大大增加模型計算量，模擬此類問題要求模型具備優良的計算效果。 -
The mstkf has high estimation accuracy and requires less computing time
該演算法具有估計精度高、計算量小等特點。 -
About 30 % or more computing time is lessen when the problem ' s scale is large enough
在矩陣規模較大時，計算時間約可以減少30甚至更多。
分享友人