遞歸法 的英文怎麼說

中文拼音 [dìguīfǎ]
遞歸法 英文
recurrence method
  • 遞 : Ⅰ動詞（傳送;傳遞） hand over; pass; give Ⅱ副詞（順著次序） in the proper order; successively
  • 歸 : Ⅰ動詞1 （返回） return; go back to 2 （還給; 歸還） return sth to; give back to 3 （趨向或集中於...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. As it can be expressed easily by argument equations, we use the conicoid as the criteria of points " classification. based on the point ' s normal and the adjacent field, corresponding to the conicoid equation such as plane, ball and cylinder, we search the points that fit the equation along the adjacent field. using this method, we realized the automatic classification of unorganized points

    本文採用了可以比較方便地用參數方程表示的二次曲面作為數據點的分類標準，根據點的法向量以及其鄰域結點的各種屬性，對應于平面、球面、柱面等二次曲面，依據曲面方程的特點，從起始點開始沿鄰域深度優先遞歸尋找符合方程的數據點，實現了散亂數據點的自動分類。
  2. Bottom - up parsing implementation with recursive descendent method

    用遞歸下降方法實現自底向上的語法分析
  3. We first present a number of desiderata for an xml - based query language, and based on this criterion, we introduce the syntax of a simple core ian - guage for semistructured data and then describe four extensions that have resulted in working prototypes. second, we present the algorithm for computing the result of a regular expression on data graph with cycles, the first - order interpretation of querying language for semistructured data, and explore structural recursion and bisimulation in semistructured data and propose an efficient and systematic way to computing a bisimulation between the two graphs. we also proposed and implemented a web querying system with database features

    基於這些準則，對一個簡單的半結構數據查詢核心語言的語法提出了兩方面擴充；給出了計算數據圖中正規表達式的演算法；對半結構數據查詢語言的一階邏輯描述、結構遞歸和數據圖的雙態模擬（ bisimulation ）等問題進行了研究，提出了一種判定數據圖的bisimulation演算法；在xml數據查詢語言研究的基礎上，設計並實現了一種具有數據庫查詢特性的web查詢系統原型。
  4. This paper analyses the numerical simulation problems of the semiconductor devices deeply. a one dimensional pn junction diode is worked out satisfyingly by the recursive method with the matlab5. 3 software

    論文深入的分析了半導體器件的數值模擬問題，利用matlab5 . 3等計算機工具，用解三對角矩陣方程的遞歸演算法，實現了pn結二極體的一維求解，取得了比較滿意的結果。
  5. It is proposed that no qualitative difference can be established between word ? formation rules and syntactic rules, since both types are capable of generating infinite sets of linguistic forms, both are recursive, and neither is subject to limitations on the length of the derivatives

    但這並不表明兩者有質的差別，因為構詞規則和句法規則一樣，有生成無限集合的可能，有遞歸性，理論上沒有長度上的限制。
  6. Chaos theory is defined as the study of complex nonlinear dynamic systems. complex implies just that, nonlinear implies recursion and higher mathematical algorithms, and dynamic implies nonconstant and nonperiodic

    混沌理論用於研究復雜非線性動態系統。復雜意謂它就是那樣，非線性意謂遞歸和更高數學法則，而動態意謂非常數及非周期。
  7. In bnf, the only way to indicate a list of an arbitrary number of elements is through recursion.

    在BNF表示法中，為了表示一串任意個數的元素，唯一的方法是通過遞歸來定義。
  8. This is the reason why we use recursion

    但遞歸方法更優雅，能更好地反映問題的本質。
  9. The syntax analyzer has one recursive procedure for each nonterminal u.

    對于每個非終結符號U，語法分析程序都有一個遞歸過程。
  10. 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塊時間遞歸演算法的并行格型結構在計算時間方面所具有的高速和高效性能。
  11. Teaching discussion on the complexity analysis based on recursive arithmetic

    基於遞歸演算法復雜度分析的教學探討
  12. Neural network control is an important mode of intelligent control, and it is widely used in branches of control science, first, the architecture and the learning rule ( error back propagation algorithm ) of multiplayered neural network which is widely used in control system are presentedo especially, the paper refers to the architecture of diagonal recurrent neural network and its learning algorithm - - - - - recurrent prediction error algorithm because of its faster convergence with low computing costo next, before introducing the neural network control to the double close loop dc driver system, the controllers of current and velocity loop are designed using engineering design approach after analysis of the system, simulation models of the system are created

    神經網路控制是智能控制的重要方式之一，它廣泛應用於自動控制學科各個領域。本文首先敘述了控制系統中常用的多層前饋網路結構及演算法（ bp演算法） ，特別提及了能夠較好描述系統動態性能的對角遞歸神經網路和在用遞推預報誤差演算法訓練drnn時取得了較快的收斂速度。其次，應用工程方法分析設計了tf - 1350糖分離機的電流、轉速雙閉環直流調速系統的控制器，作為引入神經網路控制的設計基礎，並建立了系統的模擬模型。
  13. Data fitting based on equivalent distance points and recursive algorithm

    基於等間距節點的邊岡數據擬合與遞歸演算法
  14. The thesis expatiated the behavioral and complicated degree in machine first, and to evaluate the degree of complexity of running condition, proposes two methods : qualitative graphic method - recurrence plot and quantitative estimation criterion. both method can effectively describe the complexity of running condition. the predictability of running condition based on these two methods is also discussed

    論文首先闡述了機組狀態行為的復雜程度，並對如何評價機組這一總體故障特徵進行了研究，從定性和定量的角度上分別提出了圖形描述工具?遞歸圖和定量評估指標兩種方法，並結合這兩種方法討論了機組行為的可預測性問題。
  15. In recent decades, people have made a research in single channel deconvolution problems, for example, the traits, fast algorithm of deconvolution results and process for error. they proposed many methods, such as inverse filter algorithm, z transform algorithm, dfs algorithm, l2 algorithm, recursion algorithm

    幾十年來，人們對單通道信號卷積反演問題如反卷積解的性質、解的快速演算法及對誤差的處理等進行了深入的研究，並取得了不少的成就，如逆濾波法、 z變換法、遞歸法、 dfs法、最小平方法等。
  16. 5. by applying our recurrence method of decreasing order, we obtain the close formulas of convoluted summations for generalized fibonacci - lucas numbers, euler numbers and genocchi numbers etc. furthermore, we obtain the computed formulae of the higher - order cumulants for a class of the lattice animal and some identities for riemann zeta functions and beta functions. 6

    建立降階遞歸法，並用這種方法得到廣義fibonacci - lucas數、 euler數、 genocchi數等的多重卷積求和的封閉公式，進而得到了若干riemannzeta函數與beta函數的恆等式以及一類latticeanimals的高階累積量的計算公式。
  17. Study on the algorithm of double identity tree - like data depth - sorting with recursion method

    利用遞歸法實現雙編號樹形數據深度排序的演算法
  18. According to the relationship of shannon ' s formula of boolean functions and bdd, the fault tree structure to bdd conversion was accomplished by recursive method

    依據布爾函數shannon分解和bdd圖的關系，用遞歸法實現了故障樹向bdd轉化。
  19. In this chapter, we establish convergence theorem by using the recurrence relations

    在這一章中，我們是用遞歸法給出了迭代法的收斂理論。
  20. Now, you might ask which method is better ? recursion or non - recursion

    這時你會問哪種方法更好一些呢? ?是遞歸法還是非遞歸法？
分享友人
分享到 Line

分享到臉書