演算表 的英文怎麼說

中文拼音 [yǎnsuànbiǎo]
演算表 英文
boolean operation table
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 表 : Ⅰ名詞1 （外面;外表） outside; surface; external 2 （中表親戚） the relationship between the child...
  • 演算 : perform mathematical calculations; calculation; calculus演算器 exerciser
  1. - similar to asm, active appearance models ( aam ) is also composed of two parts : the aam subspace model and the aam search

    -與主動形狀模型演算法類似，主動表面模型也由兩部分組成：子空間模型和搜索過程。
  2. And then facing the problem of the channel estimation of the adaptive modulation system, we conclude out the channel estimation algorithms on maximum likelihood ( ml ) estimation and maximum a posteriori ( map ) estimation under the condition of flat fading channel and selective fading channel in detail. to meet flat fading channel, we simulate the relationship of the ratio between the error covariance in map estimation and ml estimation and pilot symbol message length. the conclusion can be drawn from these results

    接著，對自適應調制系統中的通道估計問題難點，詳細推導了平衰落通道條件下和選擇性衰落通道條件下最大似然（ ml ）估計和最大后驗概率（ map ）估計演算法，針對平衰落通道，我們模擬了map估計和ml估計的方差與導頻符號長度的關系，模擬結果表明，錯誤方差受多譜勒頻率的變化影響最大，並且對實際的自適應調制系統，導頻符號長度的取值超過20個符號長度時， map通道估計明顯優于ml通道估計。
  3. The result indicates that alb algorithm can get the shorter mean response time in the same condition, so it is better than the other ones in the paper

    結果表明，在同等條件下，此演算法能夠達到較小的平均應答延遲，從而優于文中提到的其他演算法。
  4. Represents the secret key for the symmetric algorithm

    表示對稱演算法的機密密鑰。
  5. For a class of quadratic finite element diseretization systems of an elliptic boundary problem with jump coefficients under the unstructured quadrilateral grids, we are concerned with two kinds of quadratic lagrangian finite element equations, by analyzing the relationship between the linear finite element and quadratic finite element basis functions, a hew amg method is designed

    摘要針對一類帶間斷系數的橢圓邊值問題，在非結構四邊形剖分下，討論了兩種二次拉格朗日有限元方程的代數多重網格法，通過利用雙線性元和二次元基函數之間的表示關系，給出了一種新的網格粗化演算法和構造提升運算元的代數途徑。
  6. Optimized association rules are permitted to contain uninstantiated attributes. the optimization procedure is to determine the instantiations such that some measures of the roles are maximized. this paper tries to maximize interest to find more interesting rules. on the other hand, the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence. a naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute. unfortunately, that results in a poor performance. a heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance. the experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes. the experiments with real data set show the approximate linear scalability and good accuracy of the algorithm

    優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度
  7. The simulated conclusion indicates that the improved algorithm achieved the anticipative purpose

    通過對改進的bp演算法進行的matlab模擬結果表明，改進的演算法達到了預期的目的。
  8. The laboratorial results show that this algorithm can improve the antinoise ability of object recognization, especially for the covered objects

    實驗結果表明，利用該演算法可以提高目標識別的抗噪能力，尤其適用於有遮擋目標的識別。
  9. A new approach to extract corners on the boundary was proposed. theoretical and experimental show that the algorithm is antinoise strongly and the corners are stabile

    摘要給出兩種新的提取圖像邊界角點的新方法。理論和實驗表明，演算法具有較強的抗噪性，而且提取出的角點穩定。
  10. Video compression plays an important role on digit moving picture processing, since it affects the picture ' s quality, comprcssing rate and visual degree in video sequence. adopting the same aphesis on the different objects, this approach which has employed by mpeg - 2 standard has led to a blur image of key objects, especially for those of the human faces

    視頻壓縮是數字視頻處理的關鍵技術，其決定了圖像的質量、壓縮率和對象的可分辨性，但是目前的mpeg壓縮演算法將不同圖像對象以相同的方式處理使視頻圖像中的關鍵對象信息無法清晰表達。
  11. Perfect pre - processing and post - processing function is one of the main factors to evaluate the vitality and market value of the finite element analysis system surveying today development of finite element analysis technology, most of which concentrate on establishing fine user interface, also has some limitation on application, and especially, the research on the visualization of arbitrary cut - plane is always in ascendants to realize the visual processing on cut - plane needs reprocessing the results of finite element analysis which have get, so the algorithm is two parts : seeking the physical value of cut - plane and drawing 2d contours, the former, based on the theory of stress on " arbitrary inclined plane " in physical mechanics, use the method of linear interpolation method to get the coordination and physical value of intersection between cut - plane and element arris ; the latter, based on the tables on elements, nodes, stress and strain, summarize a rapid algorithm of generating 2d contours based on the grid. this thesis synthesizes there two parts and get a visual processing program under fortran

    縱觀有限元分析技術的發展，目前大多集中在建立良好的用戶界面上的研究仍存在許多應用上的局限性，其中對任意剖面上可視化的研究仍處于方興未艾的階段。要實現任意剖面上可視化處理，必須先將得到的有限元計算結果進行再處理，因此在演算法上分為兩部分：求任意剖面上物理量值的演算法及二維等值線演算法。前一部分以彈性力學中「任意斜截面的應力」為理論基礎，利用線性插值方法得到截面與單元棱邊的交點坐標及交點物理量值；在此基礎上；根據已得到的單元及節點序號表、應力應變物理量表，總結出一種基於有限元剖分網格的快速生成二維等值線的演算法。
  12. Thirdly, resorting to cooperation - competition model of biomathematics, this thesis proposes a new co - evolution model. simulation results are shown to verify its effect and practicabilitv. last, standard methods for optimizing neural netvvorks are easily trapped into local optimization, and unable to adjust the structure of neural networks, thus their application is limited to certain extent

    本文主要驗證和設計適應性操作運算元和小生境方法保持群體多樣性的能力，實驗表明兩種方法都能較好地達到目的；利用生物合作競爭模型設計協同演化來動態地改變群體規模，實驗表明該模型是有效的；人工神經網路是得到越來越廣泛應用的學習系統，但是由於學習演算法存在一定的缺陷，如易於陷入局部極值，難以調整網路的結構等，使神經網路的應用受到一定的限制。
  13. Both theoretical proof and numerical experiments indicate that this algorithm is convergent and effective for solving large - scale semidefinite programming. in the following section, we work over the bisection problems

    數值實驗與理論分析均表明該演算法適用於求解大規模問題，且具有良好的收斂性；其次，研究了電路二等分問題。
  14. The experiments show that the performance of our method is similar to the ye - 0. 699 algorithm, which is the best approximate algorithm in polynomial time. but our method can effectively solve the max - bisection problem with a large scale. 2

    數值實驗表明，該方法與ye - 0 . 699近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異
  15. The new algorithm bases on bisection and secant iteration, which is different cuppen ' s method and newton iteration. the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm

    該演算法以割線法迭代為基礎，明顯不同與傳統的newton迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  16. By taking advantage of the characteristic of the curves ' expression, the algorithm changes the cardioid curve into the linearly combination of some simple iterations

    基於曲線表達式的特點，該演算法將心臟線的點坐標迭代關系轉化為幾個簡單的迭代關系的線性組合。
  17. Some classical chaotic systems are used to check formula, the result indicate the values calculated by the programs accord with the theory values

    用某些經典的混沌系統對這些演算法進行了驗證，結果表明程序計算的實際值和理論值基本一致。
  18. Further more, this algorithm also provides the criterion distinguishing edge inflexion and sleek curve section and the method computing inaccurately curvature radius and approximate perimeter. the paper also introduces the use method with cell edge hollow repairing and overlap or conglutination cell segmentation. for example, this algorithm has proved high - speed and has a good effect of cell segmentation on more than twenty groups of conglutinate and absent cells which are gathered from three kinds of cells

    同時給出了利用這些參數判別邊界角點，邊界光滑段的判據，以及估算曲率半徑，等效周長的方法;最後，以細胞邊界凹陷的修補和重疊細胞粘連的分割為例驗證了演算法的可行性，該演算法在採集到的30餘組粘連和缺損細胞上進行了驗證，結果表明，該演算法處理速度快，分割效果良好。
  19. The experimental results indicate that it is easy to be realized, can save the calculating cost and improve the constringency speed

    試驗結果表明，用粒子群演算法來訓練樣本集具有容易實現、節省計算成本和提高收斂速度等優點。
  20. This paper studies several interestingness and contingency table standardization to find a more robust algorithm instead of using support and confidence

    通過對有趣度參數和列聯表規整化的研究，進一步改進了對關聯規則挖掘演算法。
分享友人
分享到 Line

分享到臉書