MatlabTips

纠错输出编码的多类支持向量机,自己编辑的码本,完全随机编码,对于7-15类效果很好(err)

intro 2 matlab which gives fundamentals about matlab

文档中包含算例和它的单纯形法MATLAB程序(Examples of the simplex method program design and calculation )

本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等，带有源程序和中文说明文档，此文件夹中的文件，如需被利用，则要直接放至work目录下。(The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and minimum cross-sectional, short-circuit and times of short-circuit, the shortest path, minimum spanning tree prim algorithm with source code and Chinese documentation, thisfile folder for use, will have to be placed directly under the work directory.)

source code for face recognition using ica .a usefull code.

说明：  用遗传算法解决tsp问题，matlab程序，很好很有用哦(algorithm for multi- objective optimization. It is a very e&reg ective algorithm but has been generally criticized for its computational complexity,)

Prueba1 FletcherReeves Hernández Santiago José Maestría en Ciencias de la Computación Septiembre / 2011 1. Comenzar con un punto arbitrario 2. Calcular Gradiente de Fi 3. Si el Gradiente Fi es igual a 0(converge), termina 4. Si el Gradiente Fi es !=0 continuar 5. Encontrar dirección de búsqueda Si= -GradienteFi= - Gradiente F(Xi) 6. Determinar la Longitud Optima del incremento lamda(i) en dirección Si X(i+1)=X(i)+lamda(i)*S(i)= X(i)-lamda(i)*Gradiente F(Xi) 7. Hacer i=2 8. Obtener Gradiente Fi 9. Calcular Si= -GradFi + ( [abs(GradFi)^2]/[abs(GradF(i-1))^2] )*S(i-1) 10. Determinar la Longitud Optima del incremento lamda(i) en dirección Si X(i+1)=X(i)+lamda(i)*S(i)= X(i)-lamda(i)*Gradiente F(Xi) 7. Verificar Optimalidad de X(i+1) Si es optimo, detener Si no es optimo hacer i=i+1 e ir al paso 8

比较普通的EMd分解的matlab程序，已供初学者学习使用(More common EMd decomposition matlab program, has for beginners learning to use)

生成网格的MATLAB示例程序；可设置输入参数，网格可改变；(a sample procedure for grid generation)

对RS（15，9）编码算法进行matlab的实现和仿真(Matlab realization of RS (15,9) coding algorithm and simulation)