machine_learning_in_action

实现了QPSK在瑞利信道下的性能仿真,仿真结果与理论曲线相比较，结果相符。供大家参考。(It achieved the simulation of QPSK performance in Rayleigh channel.)

Genetic algorithm in matlab.

基于快速模拟退火反演算法采用地震数据反演反射系数，进而可以很好地预测出弹性参数。(Based on fast simulated annealing inversion algorithm using seismic data inversion reflection coefficient, which can well predict the elastic parameters. )

说明：  继续上传我自己遍的信道！谢谢！ 这个我没有完全的调试成功，请指正！(to upload my own times of the Road! Thank you! This I did not successfully complete debugging, Hi!)

用matlab编程，关于RBF神经网络预测的问题(Using matlab programming, on the RBF neural network prediction problem)

This file is about vector control of permanent magnet synchronous machine. You must try it

动态规划matlab程序，适用于只有一个状态变量的情况(dynamic programming matlab program that applies only to one state variable.)

说明：  各向异性材料的刚度矩阵计算M文件，适合初学者学习和运用(The stiffness matrix calculation m file of anisotropic material is suitable for beginners to learn and use)

说明：  语音识别动态时间归正全过程的matlab程序，运行测试能出结果，希望对你们有用，实在没点数才把自己压箱底的东西拿出来,呜呜(Reformed voice recognition dynamic time the whole process of matlab program, run the test to the result, I hope helpful for you, only then it did not point out what their own bottom pressure, the hum)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)