8psk

Function_estimation using Adaptive Genetic Algo

Linear predictive filering based audio compression

For inverting a matrix, Gauss-Jordan elimination is about as efficient as any other method. For solving sets of linear equations, Gauss-Jordan elimination produces both the solution of the equations for one or more right-hand side vectors b, and also the matrix inverse A(-1). However, its principal weaknesses are (i) that it requires all the right-hand sides to be stored and manipulated at the same time, and (ii) that when the inverse matrix is not desired, Gauss-Jordan is three times slower than the best alternative technique for solving a single linear set.

说明：  基追踪（BP）算法的主要目标是寻找欠定方程的解，转换成线性规划问题，这里是BP算法的实现(Atomic Decomposition by Basis Pursuit)

matlab源程序，通过拉普拉斯变换进行两幅图像的融合，融合效果好(matlab source, through the Laplace transform fusion of the two images, good fusion effect)

说明：  crack matlab 2014b for windows

Introduction to Evolutionary

Architecture Lab Part A，计算机系统导论实验作业(Architecture Lab Part A)

MATLAB遗传算法PMX变换的源代码(PMX Transform MATLAB genetic algorithm source code)

Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。 程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。(Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity.)