资源列表
radon_ambiguity
- ％radon transform clear all ％ N=800 n=1:N fs=200 t=n/fs x1=exp(j*2*pi*(5*t+0.5*5*t.^2)) x2=exp(j*2*pi*(5*t+0.5*15*t.^2)) x=x1+x2 ％N=length(x) ％ ambifunb(x ) ％*****************************************RAT na
improvedGA
- 改进遗传算法（GA）部分代码，仅供学习者参考-Improved genetic algorithm (GA) part of code, for learner reference
subtraction_obtecttracker
- tracker.m Continuously keeps taking snap in real time and sending to function isub for tracking isub.m It is a function which takes two consequent frames, subtracts them(background gets subtracted), converts the resulting image i
12ballsoftheprogram
- 微软的一道题目，有12个外表一模一样的小球，其中有一个的质量和其他11个球不一样（11个球的质量完全相同），而且该球不知道是轻点还是重点。现在给你一个天平（无砝码），只有3次测量机会，请你找出该球。球号从a到l(小写)-Microsoft' s one topic, there are 12 look exactly the same ball, one of which the quality and not the same as the other 11 balls (11 ball
QPSK4_Weitongbu
- qpsk位同步源程序 包括调制解调及信道加噪等-qpsk bit synchronization source, including modulation and demodulation and channel plus noise, etc.
naz5
- Hi.the program i uploaded is useful for the electromagntic subjects. variations in the wave when it travels through the different media
OFDM
- OFDM simulation by using Matlab
knn2
- k-nearest neighborhood is a one method that select k number of units in such as cluster that this k units are nearest from the cluster center-k-nearest neighborhood is a one method that select k number of units in such as cluster that this k units ar
viabw
- 用viterbi算法和baum-welch训练找到和更新best path-find best path using Viterbi algorithm and Baum-Welch training
Car_Rvaluation2
- 利用梯度下降法训练一个神经网络，确定合适的权值，并且进行验证-Neural network
neural-network-classification
- 使用分类算法中的神经网络算法进行数据分类，实验表明算法可以得到较好的分类效果。-Classification algorithm using neural network algorithm for data classification, experiments show that the algorithm can get better classification results.
Ensemble-Learning
- 集成学习将若干基分类器的预测结果进行综合，具体包括Bagging算法和AdaBoost算法；还有随机森林算法，利用多棵树对样本进行训练并预测的一种分类器-Integrated learning integrates the prediction results of several base classifiers, including Bagging algorithm and AdaBoost algorithm and random forest algorithm, using a t