m06_QASK

matlab的简单例子 可以用来入门学习(matlab simple example can be used to study entry)

数值分析的MATLAB实现---拉格兰日差值(MATLAB implementation of numerical analysis)

matlab 构建AWGN 信道的构建，并且详细分析了BER 和信噪比(simulation on OFDM AWGN channel compute BER AND SNR perfermance)

：在有限区域内分布的稀疏不均的、具有一定分布结构的海量数据集的高效、高精度聚 类问题是一个尚未完全圆满解决的难题。针对Affinity Propagation 聚类算法(AP)的不足之处， 提出了两个改进型的聚类算法(n limited areas of uneven distribution of sparse, has certain distribution structure of the mass datasets of high efficiency, high precision together Problem is a perfectly solved problem has not yet completely. For Affinity Propagation clustering algorithm (AP) of the deficiencies, Put forward the two improved version of the clustering algorithm)

remote sensing image fusion based on wavelet on matlab

一个新设计的OTSU算法，使用方法如下：％ load clown ％ subplot(221) ％ imshow(X/max(X(:))) ％ title( Original , FontWeight , bold ) ％ for n = 2:4 ％ Iseg = otsu(X,n) ％ subplot(2,2,n), colormap(gray) ％ imshow(Iseg) ％ title([ n = int2str(n)], FontWeight , bold ) ％ end(OTSU design a new algorithm, using the method as follows: load clown subplot (221) imshow (X/max (X (:))) title (Original, FontWeight, bold) for n = 2:4 Iseg = otsu (X, n) subplot (2,2, n), colormap (gray) imshow (Iseg) title ([n = int2str (n)], FontWeight, bold) end)

绝对极品！！美国数学建模2009年A篇优秀论文，附带MATLAB源程序，解决了于环岛问题的仿真问题！ 基于元胞自动机的交通系统（环岛）建模与模拟实例，MATLAB解决。 MCM-2009a题论文+答案(Absolutely superb! ! A 2009 American Mathematical modeling of excellent papers, with MATLAB source code to solve the problem of simulation of problems in the island! Cellular Automata Based Traffic System (roundabout) modeling and simulation examples, MATLAB solution. MCM-2009a question papers+ answers)

说明：  关于kalman的matlab程序，希望给大家一些帮助(about kalman)

给出一组表征年平均全球表面温度异常的数据“gsta.dat”。这组数据的第一列表示时间，第二列表示相应的数据值。(A given dataset “gsta.dat”, which is the annual mean global surface temperature anomaly. In “gsta.dat”, the first column is the time and the second is the corresponding data value.)

在社会网络中，采用MATLAB构建最小图和查看两个图是否相似的两个算法(In social networks, using MATLAB to build a minimum figure and view two graphs is similar to the two algorithms)