recursive function theory 中文意思是什麼
recursive function theory
解釋
遞歸函數論-
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函數與所有仿射函數的符合率特徵等等。 -
This paper studies 3 kinds of algorithms : the viterbi algorithm, multiresolutional algorithm based on wavelet transformation and bayesian bootstrap algorithm. the viterbi algorithm is based on the hidden markov model theory and it is a kind of map estimation, this paper studies this algorithm and puts up an algorithm that suits for filtering in the presence of interference. multiresolutional algorithm takes full advantage of multiresolutional data, we can see it has a better filtering ability than the traditional filtering methods ; bootstrap algorithm is a recursive bayesian estimation, it describes the probability density function by the samples, so it can be used to nonlinear non - gaussion filtering, the simulation result of the two groundings is presented
Viterbi演算法以隱馬爾可夫理論為基礎，是一種最大后驗概率估計方法，本文對該演算法進行了研究，給出了一種適合於非高斯干擾條件下的濾波方法；多分辨分析方法充分利用到了多解析度測量數據所包含的信息，從模擬結果中可以看出，該方法的濾波精度要高於傳統的濾波演算法；自主濾波方法是一種遞推貝葉斯估計演算法，它利用采樣點來描述目標狀態的概率密度函數，因而適用於非線性、非高斯條件下的濾波，本文分別對這兩種情況下的濾波進行了模擬。 -
In the research of the algorithms and theory of temporal difference learning, a new class of multi - step learning prediction algorithms based on linear function approximators and recursive least squares methods is proposed, which are called the rls - td ( t ) learning algorithm. the convergence with probability one of the rls - td ( t ) algorithm is proved for ergodic markov chains, and the conditions for convergence are analyzed
在時域差值學習（ temporaldifferencelearning ）學習演算法和理論方面，首次提出了一種基於線性值函數逼近的多步遞推最小二乘td （ ） （ rls - td （ ） ）學習演算法，並分析和證明了該演算法在求解遍歷markov鏈學習預測問題中的收斂條件和一致收斂性。
分享友人