遞歸定義 的英文怎麼說

中文拼音 [dìguīdìngyì]
遞歸定義 英文
recursive definition
  • 遞 : Ⅰ動詞（傳送;傳遞） hand over; pass; give Ⅱ副詞（順著次序） in the proper order; successively
  • 歸 : Ⅰ動詞1 （返回） return; go back to 2 （還給; 歸還） return sth to; give back to 3 （趨向或集中於...
  • 定 : Ⅰ形容詞1 （平靜; 穩定） calm; stable 2 （已經確定的; 不改變的） fixed; settled; established Ⅱ動詞...
  • 義 : Ⅰ名詞1 （正義） justice; righteousness 2 （情誼） human ties; relationship 3 （意義） meaning; si...
  1. In bnf, the only way to indicate a list of an arbitrary number of elements is through recursion.

    在BNF表示法中，為了表示一串任意個數的元素，唯一的方法是通過遞歸來定義。
  2. Defines recursive traversal properties of a role

    定義角色的遞歸遍歷屬性。
  3. Secondly, we introduce the recurrence definition of the non - uniform algebraic - hyperbolic b - spline basis using divided differences and the de boor - fix recurrence definition on polynomial functions, and based on the new forms, algebraic - hyperbolic b - spline curves are obtained. they share most of the properties as those of the b - spline curves in the polynomial space. we focus on deducing the calculating and knot inserting formulae for this new kind of curves and then prove that they have the variation diminishing properties

    二、利用廣義差商，基於多項式b樣條的deboor - fix遞推定義，給出了任意階非均勻代數雙曲b樣條的遞推定義，由此構造麯線，證明它的幾何不變性、仿射不變性、凸包性、 v . d .性等，重點給出了非均勻代數雙曲b樣條曲線的遞歸求值和節點插入演算法，演算法簡單且穩定，便於在計算機上實現
  4. Beyond readability, naming patterns allows recursive definition of patterns - either direct or mutual recursion

    除了可讀性，命名模式還允許遞歸的模式定義或者採用直接遞歸，採用相互遞歸。
  5. Using the theories of probability, algebra and number theory comprehensively, we investigate a class of boolean functions with three - valued walsh spectrum in the first part of this dissertation : the properties of the extended semi - bent functions, which are constructed from any two bent functions, are studied, followed by the structure characteristics of the boolean functions satisfying propagation criterion with respect to all but two vectors ; the definition and cryptographic properties of k - order quasi - bent functions are proposed whose walsh spectrum takes on only three values. some sufficient and necessary conditions are offered to decide whether a boolean function is a k - order quasi - bent function ; a special method is presented to construct the k - order quasi - bent functions, whose cryptographic properties are explored by the matrix method, which is different from the method of walsh spectrum and that of autocorrelation of boolean functions ; the application of this kind of boolean functions in the fields of stream cipher, communications and block ciphers is discussed, which shows the great importance of the fc - order quasi - bent functions ; some methodology are proposed to construct the k - order quasi - bent functions, including the complete construction by using the characteristic matrices of boolean functions, and the recursive method by two known k - order quasi - bent functions we further extend our investigation to the ring zp, where p is a prime, and the similar results are presented as far as the p - valued quasi - generalized - bent functions are considered

    本文首先綜合運用概率論、代數學、數論等基礎學科的理論知識，並以頻譜理論作為主要研究工具，對一類譜值分佈相對均勻的函數? ?廣半bent函數、 k階擬bent函數和p值k階擬廣義bent函數進行了系統、深入的研究，給出了廣半bent函數定義，並探討了廣半bent函數的密碼學性質；給出了k階擬bent函數和p值k階擬廣義bent函數的定義及等價判別條件；討論了k階擬bent函數和p值k階擬廣義bent函數與部分bent函數和p值廣義部分bent函數的關系，探討了它們的密碼學性質；給出了k階擬bent函數和p值k階擬廣義bent函數的典型構造方法，並將對k階擬bent函數的密碼性質的研究轉化到對一類特殊的矩陣的研究上；利用布爾函數的特徵矩陣原則上給出了k階擬bent函數的一種完全構造方法，還給出了從已有的p值k階擬廣義bent函數出發，遞歸構造變元個數更多的p值k階擬廣義bent函數的方法；初步探討了k階擬bent函數在序列密碼、分組密碼以及通信中的應用；給出了一類布爾函數walsh譜的分解式，並利用這類布爾函數的walsh譜分解式給出了一類近似穩定的布爾函數的構造，特殊情形下為k階擬bent函數；利用代數數論的知識考察了p值k階擬廣義bent函數的譜特徵，並給出了k階擬廣義bent函數與所有仿射函數的符合率特徵等等。
  6. First, it delves into the key technique of eis ? image registration, and presents an effective registration algorithm which is from coarse toprecise and form local to global. second, it applies recursive kalman filtering technique inmotion filtering of registration parameters and makes motion compensation for practical image. finally, it takes advantage of mosaicking to reconstruct undefined regions to avoid theubiquitous information missing and image degradation. this algorithm has high precision as wellas high speed

    首先，對電子穩像中關鍵環節? ?圖像配準技術進行了深入研究，給出一種由粗到精、由局部到全局的高效配準演算法;接著，採用了遞歸kalman濾波技術對配準參數進行運動濾波並對實際圖像進行運動補償;最後，利用了圖像拼接技術進行「無定義區」重建，避免了普遍存在的信息丟失和圖像降質問題。
  7. We define three kinds of generalized pascal matrices ( left, right and symmetry ), and discuss the their relations and the cholesky factorial of generalized symmetry pascal matrix. finally, a close relation is obtained between the diagonal of generalized right pascal matrix and a class of recurrence sequences

    定義三類（左、右、對稱）廣義pascal矩陣，討論了它們的相互聯系以及廣義對稱pascal矩陣的cholesky分解，並且得到廣義右pascal矩陣的對角化與一類遞歸序列具有緊密的聯系。
  8. This research addressed an urban traffic intelligent control system, which adopts a multi - agents coordination in urban traffic control to coordinate the signal of adjacent intersections for eliminating the congestion of traffic network. an agent represents a signal intersection control, and multi - agents realize coordination of multiple intersections to eliminate congestion. based on recursive modeling method and bayesian learning that enables an agent to select his rational action by examining with other agents by modeling their decision making in conjunction with dynamic belief update. based on this method, a simplified multi - agent traffic control system is established and the results demonstrate its effectiveness. it is very important for its

    本文中提出一種城市交通智能控制系統，針對城市交通網路中相鄰交叉口的交通流可能相互沖突，即局部交通流的優化可能引起其他區域交通狀況的惡化的問題，採用多智能體協調控制方法來協調相鄰交叉口處的控制信號消除網路中的交通擁塞.提出以一個智能體的方式實現一個信號燈交叉口控制，對多個信號燈交叉口形成的交通網路採用多智能體協調控制的方式實現網路流量優化來消除擁塞.文中提出由遞歸建模和改進的貝葉斯學習相結合的多智能體系統來使智能體可以確定其他智能體的準確模型並實時更新信息，並基於上述方法在簡單的交通網路模型上建立了多智能體交通控制系統，模擬結果表明了方法的有效性，對實現智能交通系統有重要意義
  9. Chapter two is focused on the wang - ball curves, including definition, properties and recursion algorithms

    第二章介紹wang - ball曲線的定義及性質，以及wang - ball曲線的遞歸求值演算法。
  10. In chapter 2, we discuss lipschitz condition which is satisfied by the second frechet - derivative of operator through the use of recurrence relations, so as to make it meaningful in general and get the convergence theorem

    第二章，通過運用遞歸技巧，對運算元的二階fr chet導數滿足的lipschitz條件進行討論，以使其在一般情況下有意義，並得到newton法的收斂性定理。
  11. In the first part of this paper, resorting to the idea of hadamard principle value and induction, we discuss the inductive definition, existence of hadamard principle value, recursive formula, computation formula, differential formula on the sense of hadamard principle value for several kinds of quasi - bochner - martinelli - type high order singular integrals with one singular point

    本文藉助于高階奇異積分的hadamard主值的思想以及歸納法的思想，在第一部分討論了幾類含一個奇點的擬bochner - martinelli型高階奇異積分的歸納定義， hadmard主值的存在性，遞推公式，計算公式，以及在hadamard主值意義下的微分公式。
  12. Assignment of an object to a single target is recursively defined as follows

    一個對象向單個目標的賦值遞歸地定義如下。
  13. The composite pattern is simply the object - oriented way to specify a recursively defined datatype ; these opportunities pop up all the time in software development

    Composite模式只是指定遞歸定義的數據類型的面向對象方法；這些機會始終出現在軟體開發中。
  14. Firstly, defines special structure as inner storage of discipline theoretic knowledge and analyze knowledge basing on recursive and / or tree

    定義了特殊結構來實現學科理論知識的內部存儲，並基於遞歸與或樹模型對學科理論知識進行分解。
  15. Chapter two is focused on the wang - ball curves, including definition, properties and recursive algorithms. using the dual functional of the wang - ball basis, the author derives the subdivision algorithms for the wang - ball curves for the first time and then obtains some identical equations of calculation combination

    第二章介紹wang - ball曲線的定義及性質，以及wang - ball曲線的遞歸求值演算法，利用wang - ball基函數的對偶泛函，作者在這里給出wang - ball曲線的顯式細分演算法，並由此導出幾個計算組合恆等式。
  16. Assignment of an object to a target list is recursively defined as follows

    一個對象向一個目的序列的賦值遞歸地定義如下
  17. Guidelines for defining and using recursive ctes

    定義和使用遞歸cte指南
  18. Scanning can be recursive and countable files extensions can de defined

    掃描是遞歸式的，可以定義被掃描的文件的擴展名。
  19. Object that corresponds to the type of the requested browser. this is done by starting with an empty dictionary, and applying the following recursive steps against the browser definition tree

    這一步是這樣完成的：在開始時使用一個空字典，然後對瀏覽器定義樹應用以下遞歸步驟：
  20. The ability to work over recursively defined types of objects is one of the most salient characteristics of software engineering as opposed to, say, digital design, where the systems are built from finite - state machines

    研究遞歸定義的對象類型的能力是軟體工程的最顯著的特徵之一（與數字設計成對比，系統是從有限狀態的機器構建的） 。
分享友人
分享到 Line

分享到臉書