This directory contains utility for implementing generic Reqursive Least Squares (RLS) algorithm. The example shows how one can use the utility to estamate the parameters of a simple linear discrete time system.
標(biāo)簽： implementing Reqursive directory algorithm
上傳時(shí)間： 2014-01-06
上傳用戶：gtf1207
PID algorithm simulation program, including rk 四階算法。
標(biāo)簽： simulation algorithm including program
上傳時(shí)間： 2015-03-20
上傳用戶：youth25
傳輸資料加解密,再以非對(duì)稱式加密法中...Data Encryption Standard (DES) algorithm,Fast ...經(jīng)Triple DES CBC 演算法對(duì)私密金鑰做加密或解 密.使用者可從網(wǎng)站下載NCNUCA的憑證產(chǎn)生程式,自行產(chǎn)生
標(biāo)簽： Encryption DES algorithm Standard
上傳時(shí)間： 2015-03-20
上傳用戶：shawvi
In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
標(biāo)簽： algorithm character position either
上傳時(shí)間： 2014-01-27
上傳用戶：wang0123456789
用于腦電信號(hào)特征提取的InfoMax Algorithm Based on ICA；也可以稍作改動(dòng)用于其他信息提取。
標(biāo)簽： Algorithm InfoMax Based ICA
上傳時(shí)間： 2014-01-22
上傳用戶：diets
apriori java 實(shí)現(xiàn) * A program to find association rules with the apriori algorithm (Agrawal et al. 1993).<br> * Other than the standard apriori algorithm, this program enable to find<br> * apriori all relation.
標(biāo)簽： apriori association algorithm Agrawal
上傳時(shí)間： 2013-12-21
上傳用戶：s363994250
samsung nand flash k9f series ECC algorithm
標(biāo)簽： algorithm samsung series flash
上傳時(shí)間： 2015-03-28
上傳用戶：wlcaption
This a Bayesian ICA algorithm for the linear instantaneous mixing model with additive Gaussian noise [1]. The inference problem is solved by ML-II, i.e. the sources are found by integration over the source posterior and the noise covariance and mixing matrix are found by maximization of the marginal likelihood [1]. The sufficient statistics are estimated by either variational mean field theory with the linear response correction or by adaptive TAP mean field theory [2,3]. The mean field equations are solved by a belief propagation method [4] or sequential iteration. The computational complexity is N M^3, where N is the number of time samples and M the number of sources.
標(biāo)簽： instantaneous algorithm Bayesian Gaussian
上傳時(shí)間： 2013-12-19
上傳用戶：jjj0202
FISMAT accommodates different arithmetic operators, fuzzification and defuzzification algorithm, implication relations, and different method of approximate reasoning such as Compositional Rule of Inference (CRI) and Approximate Analogical Reasoning Scheme based on Similarity Measure.
標(biāo)簽： defuzzification fuzzification accommodates arithmetic
上傳時(shí)間： 2013-12-30
上傳用戶：dongbaobao
Tiny Encrytion Algorithm壓縮速度快，抗差分攻擊力強(qiáng)
標(biāo)簽： Encrytion Algorithm Tiny 速度
上傳時(shí)間： 2015-04-04
上傳用戶：陽光少年2016
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
