svm1d

introduction to image processing.

解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。(Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow.)

说明：  基本遗传算法的matlab源程序，bstr2rval.m为基本编码转为实际值子函数，createPop.m创建初始种群子函数，crossOper.m基因交叉子函数，indiEval.m个体实际值子函数，mutateOper.m基因变异子函数，selectOper.m选择算子子函数，sga.m基本遗传算法子函数(The basic genetic algorithm matlab source, bstr2rval.m as the basic coding to the actual value of Functions, createPop.m create initial population Functions, crossOper.m gene cross-Functions, indiEval.m individual actual value Functions, mutateOper. m gene mutation Functions, selectOper.m selection operator Functions, sga.m basic genetic algorithm Functions)

Program to Stack implement

l1-norm, compress sensing

分析蔡氏电路的相轨迹图,画出了各个变量的三维、二维相图 (Chua' s circuit analysis phase trajectory diagram depicts the various variables dimensional, two-dimensional phase diagram)

该教程MATLAB实用教程（7.0版本）包括MATLAB语言基础、基本应用、高级应用三部分，系统全面。(The Practical Guide Tutorial MATLAB (version 7.0) includes the basic MATLAB language, basic applications, advanced applications of three parts, systematic and comprehensive.)

Fast Fourier Transform Using Matlab

说明：  GPS原理及其MATLAB仿真的PPT形式讲解(GPS theory and explain the form of MATLAB simulation PPT)

Companding is essentially a technique for achieving non-uniform quantization. There are basically 2 methods which are most popular in literature.:-A-law companding and u-law companding. These algorithms help in achieving to an extend, compression. The given code shows how to compress a 14-bit code to 8-bit code and its digital implementation using matlab. Please contact by mail if a detailed description of code is needed.