computational algorithm 中文意思是什麼

computational algorithm 解釋
計算邏輯演算法
  1. The computational results of the particle images are agreement with the simulated datain reasonable, the most absolute difference of the displacement is 0. 6671 pixel at the x abscissa and 0. 7928 pixel at y abscissa ; the computational results are equal to the data form the algorithm of particle brightness - distribution pattern tracking ( the conventional cross - correlation algorithm ) at voluminous points, their discrepancy is only one pixel at few points, mostly in boundary area

    西安理工大學碩士學位論文最後,在visualfortran環境下給出了這種演算法的具體實現,處理模擬粒子圖像的結果與模擬數據比較吻合,最大位移絕對誤差在x方向是0 . 6671像素,在y方向是0 . 7928像素;計算結果與示蹤粒子灰度分佈模板法(基本的互相關法)在絕大部分點是相同的,只在少數點相差一個像素,而且大多出現在邊界區域。
  2. 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

    本文將一種高效率的數值計算方法? ?多重網格法引入三維靜電場分佈的計算,多重網格法利用限制和延拓可迅速求得滿足精度要求的場分佈.研究了求解各種靜電透鏡電子光學系統三維場分佈的多重網格法程序,驗算了靜電同心球模型的三維場分佈.通過與目前在場計算中常用的有限差分法進行比較,可以看出多重網格法的計算效率和計算精度優于有限差分法.本文表明利用多重網格法計算三維場大大提高了場分佈的計算效率,縮短了計算時間,因此為后續計算打下了良好的基礎
  3. Besides, of the several algorithms those have been proposed in the literature for solving the transportation problem, previous computational results indicated that the primal algorithm ( modi method ) is more efficient, so we have compared the amedv versus the modi method. because very little experimentation was carried out on algorithmic techniques used in the codes of amedv, we have also performed a number of runs that test the overall solution time as the number of significant digits in each of the parameters is varied

    因為元素判別值分配法是運輸問題引發出的求解新方法,並且階石法是目前解運輸問題的較快速解法,所以特別針對運輸問題通過若干組有代表性的檢驗數據進行數值測試,在實際問題中對比元素判別值分配法與階石法的演算法執行時間,研究兩對演算法執行效率上的差別,並分析差別產生的原因。
  4. In order to verify the accuracy, credence and effectiveness of the unstructured overset grid algorithm, steady and unsteady flow field of naca0012 airfoil are simulated. the unsteady flow field is caused by the oscillation of the airfoil. the two computational results are both compatible well with the experimental data

    為了驗證非結構重疊網格方法的正確性、可靠性和有效性,本文對基於非結構重疊網格的naca0012翼型的定常流場以及簡諧振蕩的非定常流場進行了數值模擬,均取得了與實驗數據符合良好的結果。
  5. A good algorithm is one that has a low computational complexity, provides a high quality of motion compensation and also ensures that the bitstream is as small as possible

    一個好的運動估計方法應當是:估計性能高、計算復雜度低、比特傳輸速率低。
  6. As an example, the implementation of the laplace equation with the gridless method has been presented at first and the resulting large scale matrix equations are solved by gmres algorithm. the numerical simulations of the flows over a cylinder are tested successfully with clouds of different scales, which shows the " cloud " effects on the computational accuracy

    本文先以代表定常不可壓位勢繞流的laplace方程為例,研究了laplace方程的無網格離散形式,並運用gmres高效演算法對其快速求解,數值模擬了典型的圓柱繞流;並通過不同點雲尺度的數值模擬,顯示出點雲尺度對計算精度的影響。
  7. Abstract : in this paper, we study the period of the processing of the multi - input series production lines using the method of max algebra, the computational algorithm of production period for multi - input produciton lines and a batch of produciton on nonblocking are given

    文摘:利用極大代數方法討論了多入口串列生產線的周期問題,給出在無阻塞控制下的多入口串列生產線生產周期的計算公式及其批量加工生產時的周期公式。
  8. Analyzing current the erp status at home and abroad, this thesis summariises the theories of different stages, system structure, flows, etc. based on the erp management thoughts and discusses the typical erp management model and important computational algorithm

    論文分析了國內外erp的發展狀況,基於erp的管理思想對erp系統發展的各個階段性理論、系統結構、流程等方面進行了分析歸納,探討了erp系統的典型管理模式及重要演算法。
  9. Furthermore, in accordant with the theory of pls regression, we applied linear algebra and computational mathematics to establish four practical algorithm of pls regression i

    通過這兩個實例分析,表明偏最小二乘回歸具有良好的估計特性和廣闊的運用范圍
  10. The algorithm takes advantages of all nonredundant information of the fourth - order cumulant matrices and so reduces the computational cost

    該方法利用了四階累積量陣的所有非冗餘信息,在很大程度上降低了運算量。
  11. Thereby, a single candidate at the final - level search is enough to provide the desired performance. as a result, the algorithm performs only one local search at the finest level, and its overall computational cost and data bandwidth burden decrease. according to different motion area, the search methods dynamically are also introduced

    根據這個初始運動矢量對當前塊的運動類型進行分類,針對不同塊的不同運動內容,確定每一塊運動矢量搜索的起點、搜索的范圍和搜索策略,小運動塊的搜索范圍小,大運動塊的搜索范圍大,這樣既可節省計算量,也可以減小搜索范圍,而且不影響搜索精度,因而搜索效率高。
  12. Fourthly, a fast back projection ( fbp ) algorithm is presented. it sloves the problem of large computational load of bp algorithm and the condition of dividing the subapterture is presented

    接著提出了一種快速後向投影演算法( fbp ) ,解決了bp演算法計算量大的問題,給出了子孔徑劃分的條件。
  13. A greedy algorithm for aligning dna sequence. jounal of computational biology, 2000, 7 12, 1 2 : 203 - 214. 9 singh r k, dettloff w d, chi v l et al

    基於這一體系結構特點,本文對megablast程序的流程進行了優化,採用對庫造表的策略,實現了計算和輸出的重疊。
  14. Now the two issues we are confronted with are : first, a reasonable regularization technique is required to overcome the ill - posedness of the problem ; second, we are required to develop a computational efficient technique to reduce the complexity of the solving, which in turn promotes the implementation of the solving algorithm

    目前,逆問題研究中需要解決的關鍵問題是: 1對逆問題中的病態現象,給出一種合理的正則化方法; 2減少逆問題求解所需的計算量,增強求解演算法的可實施性。
  15. In the cylinder2 - 1 / 2d code, object - oriented methodology is employed to increase flexibility and extensibility, a charge conserving current weighting algorithm and a multi - time - scale algorithm is used to enhance computational efficiency

    程序演算法中採用了滿足電流電荷連續性方程的電流分配方法和多時標推動粒子方法等,有效地提高了程序的計算速度。
  16. Finally, two upswing algorithms are given, one reduces the computational complexity and improves the resistance capability to the near - far problem, and the other is an adaptive blind mud algorithm with a simple structure

    最後,給出了兩種改進的多用戶檢測演算法,一種降低了運算量,提高了系統抗遠近效應能力;另一種方法是一種簡單結構的自適應盲多用戶檢測演算法。
  17. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型,是一種新的全局優化搜索演算法,具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點,在很多領域得到了廣泛應用,另一方面,在圖像處理領域有很多優化問題如圖像壓縮,模式識別,圖像校準,圖像分割,三維重建,圖像檢索等等,實際上都等同於一個大范圍搜索尋優問題,而最優化問題是遺傳演算法經典應用領域,因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  18. In order to improve their speed, " fast polynomial multiplication algorithm " and " fast algorithm of r - circulant matrix inversion " are proposed, which offer obviously computational advantages

    本文提出了「快速多項式乘法運算」演算法和「 r -循環矩陣快速乘逆運算」演算法,用以提高這兩種運算的速度,具有明顯的速度優勢。
  19. In audio robust watermark algorithm, watermark is embedded in transform domain by using the speediness, simplicity and multi - resolution of wavelet transform. when extracting watermarking, the audio is decomposed by single - level discrete 1 - d wavelet transform, and watermarking is extracted by ica based on kurtosis maximization. this method ’ s computational cost is low

    音頻水印利用小波變換快速、簡單和多解析度的特點來嵌入水印,提取的時候,先對觀測音頻文件進行一級小波分解,然後用基於最大峰值的ica方法進行水印提取,這種方法避免了其他盲源分離方法必需的求逆運算,所以計算量小。
  20. The purpose of this dissertation is to study the lagrangian method and conservative rezonning algorithm. finite volume scheme is used for lagrangian equations of hydrodynamics. because of the pressure gradients " influence upon velocities and energy, computational scheme is proposed for momentum equation on two control volumes in order to suspend the time when the mesh becomes distorted

    本文的目的是研究lagrange方法及重映演算法,主要內容可分為以下幾個方面:首先從積分形式的二維lagrange流體力學方程組出發,用有限體積格式進行計算,考慮壓力梯度分佈對速度和能量改變的影響,構造了在兩個控制體上的動量方程的計算格式,使得速度的改變受其周圍八個壓力的影響,在一定程度上推遲了網格相交的進程。
分享友人