recursive definition 中文意思是什麼

Beyond readability, naming patterns allows recursive definition of patterns - either direct or mutual recursion

除了可讀性，命名模式還允許遞歸的模式定義或者採用直接遞歸，採用相互遞歸。

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函數與所有仿射函數的符合率特徵等等。

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主值意義下的微分公式。

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曲線的顯式細分演算法，並由此導出幾個計算組合恆等式。

The translation process from basic and complex asn. l modules into idl that includes default clause, optional clause and asn. l recursive definition is also shown. the implementation of the mib structure presented in the dissertation plays an important role in developing the platform of military network management. besides, the application of corba technology in tmn framework and the corresponding mapping algorithm of management information, provide efficient tools to develop the distributed network management in future

由於mib是網路管理系統的核心，因此本文提出的klb結構的實現方法對軍事網路管理開發平臺的研究具有非常重要的意義；另外， tmn和corba的集成研究以及二者在管理信息方面的映射演算法為實現分散式網路管理的進一步研究提供了堅實基礎和可靠工具。

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

這一步是這樣完成的：在開始時使用一個空字典，然後對瀏覽器定義樹應用以下遞歸步驟：