MonteCarlo

求无向无权值复杂网络的各点对之间的最短路径，以及网络平均路径长度(abtain the shortest path of a complex net and get the averange path of the whole net)

matlab编程实现JPEG的压缩和编码(JPEG compression and coding)

说明：  《信号与系统》计算机练习－利用matlab 西安交通大学出版社 实验一("Signals and systems" computer exercises-using Matlab Xi'an Jiaotong University Press an experiment)

一连续平稳的随机信号x(t)，自相关函数RX(t)=e-/t/，信号x(t)为加性噪声所干扰，噪声是白噪声，测量值的离散值Z(k)为已知，TS=0.02s。 -3.2，-0.8，-14，-16，-17，-18，-3.3，-2.4， -18，-0.3，-0.4，-0.8，-19，-2.0，-1.2，-11，-14，-0.9，0.8，10，0.2，0.5，-0.5，2.4，-0.5，0.5，-13，0.5，10，-12，0.5，-0.6，-15，-0.7，15，0.5，-0.7，-2.0，-19，-17，-11，-14。 自编卡尔曼滤波递推程序，估计信号x(t)的波形。(A continuous stationary random signal x (t), the autocorrelation function RX (t) = e-/ t /, the signal x (t) is additive noise of the interference, noise is white noise, the measured value of the discrete values ​ ​ Z (k ) are known, TS = 0.02s. -3.2,-0.8,-14,-16,-17,-18,-3.3,-2.4,-18,-0.3,-0.4,-0.8,-19,-2.0,-1.2,-11,-14 ,-0.9,0.8,10,0.2,0.5,-0.5,2.4,-0.5,0.5,-13,0.5,10,-12,0.5,-0.6,-15,-0.7,15,0.5,-0.7,-2.0,-19,-17,-11,-14. Self Kalman filter recursive procedure, the estimated signal x (t) waveform.)

用于决策树中对数据进行分类，适合机器学习等领域(For a decision tree to classify data for machine learning and other fields)

Digital filter simulation in Matlab.

DTW算法的程序，申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划，为每个格点 （i，j）都计算其三个可能的前续格点的累积距离D1，D2，D3。考虑到边界问题，有些前续格点可能不存在，因此加入一些判断条件最后利用最小值函数min()，找到三个前续格点的累积 距离作为累积距离，与当前帧的匹配距离d（i，j）相加，作为当前格点的累积距离。该计算过程一直达到格点（n，m），并将D（n，m）输出，作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)

禁忌搜索算法matlab解决旅行商问题程序源代码，含数据结果！(Tabu Search solve tsp problem)

NEGF method to calculate the resonant tunnelling diode

一些matlab的简单程序，对于初学者很有帮助的，好好看看 (Matlab some simple procedures, useful for beginners, a good look at)