chuandianzutiaosu

说明：  matlab m语言编写的拼图游戏，对于学习matlab很有帮助(matlab m jigsaw puzzle languages, matlab helpful for learning)

G723.1语音压缩编码功能的matlab实现(G723.1 speech compression coding function matlab implementation)

neural network inverse linear control 4

说明：  经典无网格教程的随书算法的例程，属于第三章例程(Classical meshless algorithm tutorial routines with books, belonging to the third chapter routines)

说明：  先进pid控制matlab仿真（第二版） 1、所有仿真算法按章归类，光盘中的程序名与书中一一对应。 2、将光盘中的仿真程序复制到硬盘MATLAB运行的路径中，便可仿真运行。 3、本书算法在MATLAB 5.3版下运行成功，并适用于其他版本。 4、程序chap1_11.mdl；chap3_2.mdl；chap3_5.mdl；chap6_2.mdl；chap6_4.mdl需要在Matlab6.5下运行，特此说明。 5、假如您对仿真程序有疑问，请及时通过 E-mail 与作者联系。 北京航空航天大学 刘金琨 E-mail 地址： ljk@dept3.buaa.edu.cn或ljk@buaa.edu.cn (advanced pid control Matlab simulation (2nd Edition) 1, all simulation algorithm grouped by chapter, the CD-ROM from the procedure he gathers with the book. Two of the CD-ROM simulation program MATLAB copied to the hard drive running in the path, the simulation can be run. 3, the book algorithm in MATLAB 5.3 version running success, and applicable to other versions. 4, procedures chap1_11.mdl; Chap3_2.mdl; Chap3_5.mdl; Chap6_2.mdl; Chap6_4.mdl need Matlab6.5 running, it is noted. Five, if you are right simulation program have queries, please timely adoption of E-mail contact with the author. Beijing University, Hangzhou aviation space E-mail address : ljk@dept3.buaa.edu.cn or ljk@buaa.edu.cn)

说明：  ukf与ekf做对比，可以看出ufk与ekf的性能差别(compare ukf with ekf)

本程序给出了最小二乘的ＡＲＭＡ模型的功率谱估计方法(This procedure gives the least squares of the ARMA model of power spectrum estimation methods)

说明：  《精通MTLAB最优化计算》第13章 粒子群优化算法 源码(&quot The most proficient MTLAB Optimization&quot Chapter 13 Particle swarm optimization algorithm source code)

说明：  利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)

matlab与c的联合编程的相关文，哈哈哈哈哈哈哈(matlab and c joint programming document)