adaptive mmse space-time multiuser detection algorithm.m是自适应MMSE空时多用户检测算法 dec multiuser.m是空时解相关多用户检测算法 cd multiuser.m是空时匹配滤波器 ber.m是误码率计算 conver.m是空时PN码产生文件
标签： multiuser space-time detection algorithm
上传时间： 2015-10-29
上传用户：来茴
脱机手写体识别Matlab源程序 包括特征提取、bayes分类器、K近邻分类及最近邻分类。 TestScriptRecognition.m：测试代码 ScriptFeaExtract.m ：特征提取 KNearestEstimate.m ：K近邻估计 NearestEstimate.m : 最近邻估计 BayesTrain.m ：训练bayes分类器 Bayes.m ：测试bayes分类器 CrossValidate.m ：m交叉验证
标签： TestScriptRecognition ScriptFeaExtract Matlab bayes
上传时间： 2014-01-08
上传用户：王庆才
（1）满足均匀分布的[M,N]区间随机数，其中M,N是正整数。 (2) 满足指数分布的[M,N]区间随机数，其中M,N是正整数。
上传时间： 2013-12-13
上传用户：haoxiyizhong
The software implements particle filtering and Rao Blackwellised particle filtering for conditionally Gaussian Models. The RB algorithm can be interpreted as an efficient stochastic mixture of Kalman filters. The software also includes efficient state-of-the-art resampling routines. These are generic and suitable for any application. For details, please refer to Rao-Blackwellised Particle Filtering for Fault Diagnosis and On Sequential Simulation-Based Methods for Bayesian Filtering After downloading the file, type "tar -xf demo_rbpf_gauss.tar" to uncompress it. This creates the directory webalgorithm containing the required m files. Go to this directory, load matlab and run the demo.
标签： filtering particle Blackwellised conditionall
上传时间： 2014-12-05
上传用户：410805624
This demo nstrates the use of the reversible jump MCMC algorithm for neural networks. It uses a hierarchical full Bayesian model for neural networks. This model treats the model dimension (number of neurons), model parameters, regularisation parameters and noise parameters as random variables that need to be estimated. The derivations and proof of geometric convergence are presented, in detail, in: Christophe Andrieu, Nando de Freitas and Arnaud Doucet. Robust Full Bayesian Learning for Neural Networks. Technical report CUED/F-INFENG/TR 343, Cambridge University Department of Engineering, May 1999. After downloading the file, type "tar -xf rjMCMC.tar" to uncompress it. This creates the directory rjMCMC containing the required m files. Go to this directory, load matlab5 and type "rjdemo1". In the header of the demo file, one can select to monitor the simulation progress (with par.doPlot=1) and modify the simulation parameters.
标签： reversible algorithm the nstrates
上传时间： 2014-01-08
上传用户：cuibaigao
This directory includes matlab interface of the curvelet transform using usfft. Basic functions fdct_usfft.m -- forward curvelet transform afdct_usfft.m -- adjoint curvelet transform ifdct_usfft.m -- inverse curvelet transform fdct_usfft_param.m -- returns the location of each curvelet in phase-space Useful tools fdct_usfft_dispcoef.m -- returns a matrix contains all curvelet coefficients fdct_usfft_pos2idx.m -- for fixed scale and fixed direction, returns the curvelet which is closest to a certain point on the image Demos fdct_usfft_demo_basic.m -- display the shape of a curvelet fdct_usfft_demo_recon.m -- partial reconstruction using curvelet fdct_usfft_demo_disp.m -- display all the curvelet coefficients of an image fdct_usfft_demo_denoise.m -- image denoising using curvelet
标签： directory functions interface transform
上传时间： 2016-08-31
上传用户：cooran
3. 约瑟夫环问题。设编号为1,2,…,n(n>0)个人按顺时针方向围坐一圈。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报到m时停止报数，报m的人出列，从他在顺时针方向上的下一个人起重新自1起顺序报数；报到m的人出列；如此下去，直到所有人全部出列为止。用带头结点的单循环链表作数据元素的存储结构。 数据输入： 第一行为人数n。 第二行为报数值m。 数据输出： 依次输出出列人员的编号。 示例： 输入文件input3.txt： 4 3 4 1 3 2 输出：（标准输出） 3 2 4 1
上传时间： 2014-01-31
上传用户：zm7516678
m-k检验，用于进行m-k检验 突变所发生的时间
标签： m-k
上传时间： 2016-11-27
上传用户：努力努力再努力
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1 xng IR3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance — all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive surface sketching.
标签： demonstrate unorganized algorithm describe
上传时间： 2013-12-18
上传用户：xc216
Euler函数: m = p1^r1 * p2^r2 * …… * pn^rn ai >= 1 , 1 <= i <= n Euler函数： 定义：phi(m) 表示小于等于m并且与m互质的正整数的个数。 phi(m) = p1^(r1-1)*(p1-1) * p2^(r2-1)*(p2-1) * …… * pn^(rn-1)*(pn-1) = m*(1 - 1/p1)*(1 - 1/p2)*……*(1 - 1/pn) = p1^(r1-1)*p2^(r2-1)* …… * pn^(rn-1)*phi(p1*p2*……*pn) 定理：若(a , m) = 1 则有 a^phi(m) = 1 (mod m) 即a^phi(m) - 1 整出m 在实际代码中可以用类似素数筛法求出 for (i = 1 i < MAXN i++) phi[i] = i for (i = 2 i < MAXN i++) if (phi[i] == i) { for (j = i j < MAXN j += i) { phi[j] /= i phi[j] *= i - 1 } } 容斥原理：定义phi(p) 为比p小的与p互素的数的个数 设n的素因子有p1, p2, p3, … pk 包含p1, p2…的个数为n/p1, n/p2… 包含p1*p2, p2*p3…的个数为n/(p1*p2)… phi(n) = n - sigm_[i = 1](n/pi) + sigm_[i!=j](n/(pi*pj)) - …… +- n/(p1*p2……pk) = n*(1 - 1/p1)*(1 - 1/p2)*……*(1 - 1/pk)
上传时间： 2014-01-10
上传用户：wkchong
