two-pictures-connection

this is mimo waterpouring system.

说明：  遗传算法得源代码,不是用MATLAB编得,而是用VC++编程.(genetic algorithm in the source code, instead of being MATLAB, but programming with VC.)

包含所有约束优化问题中涉及的matlab源程序。包含Rosen梯度法求解约束多维函数的极值，外点罚函数法解线性等式约束，外点罚函数法解一般等式约束，内点罚函数法，混合罚函数法，混合罚函数加速法，乘子法，坐标轮换法及复合形法(Contains all the constrained optimization problem involves matlab source. Contains Rosen gradient method for solving constrained multi-dimensional function extremum, external point penalty function method for solving linear equality constraints, external point penalty function method for solving general equality constraints, interior point penalty function method, mixed penalty function method, mixed penalty function acceleration method , multiplier method, the coordinate rotation method and complex method)

实现lpc脉冲编码仿真，运用matlab，有源码(LPC realize pulse code simulation, the use of matlab, has source)

说明：  本程序是用MATLAB编写，以后请MATLAB高手多进来切磋，请各位高手指教，看了后给点评价。谢谢！(this program is prepared using MATLAB, after many requests come in MATLAB master skills, the experts advise you please, after reading them to the point evaluation. Thank you!)

programing algoritnm matlab

网上能下载的本书的中文版均缺少89和97两页，又此书已绝版，本人只好从英文完整版中摘录缺少的内容，分别补全了这两页的内容。注：英文完整版也已经作为PDF的附件加了进去。 我也上传到了IASK，不能下载的朋友可以去搜索“(中文版)支持向量机导论.rar”(Internet can download the Chinese version of the book were missing two 89 and 97, and the book is out of print, I had to excerpts missing content from the English full version, respectively, to complement the content of the two pages. Note: The full version of English has also been added as an attachment inside a PDF. I also uploaded to the IASK, can not download friends can go search for "(Chinese version) Introduction to Support Vector Machines. Rar")

【kongjian_jiase.m】：MATLAB对excel文件的每行最大值或最小值标以字体颜色和背景颜色设置，m文件可以让大家了解matlab的控件函数用法。好资料喔。([Kongjian_jiase.m]: MATLAB excel file for each row in the maximum or minimum standard font color and background color settings, m files can let everyone know matlab control function usage. Oh good information.)

说明：  利用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)

一种对角牛顿法来求解非负稀疏编码问题，在原有的NNSC的算法上的进一步改进(Kind of angle Newton' s method to solve the problem of non-negative sparse coding, further improvements in the original NNSC algorithm)