increaseber

matlab教程，初学者必备的资料，对建模和通信专业的同学有用处。(matlab tutorial for beginners necessary information on the modeling and communications professional students useful.)

3rd order ENO method

说明：  随机共振检测弱信号，a_b_f是主程序，sr是rk4算法，模拟双势阱中粒子运动(Stochastic resonance detection of weak signals, a_b_f is the main program, sr is rk4 algorithms, simulated double potential well of particle motion)

压缩感知常用程序oolbox_SparseMRS(CS Toolbox_SparseMRS)

说明：  计算线性规划问题，以及简单的优化问题解决方案，matlab主要用于数学计算方面，是很简单的数学软件(Calculation of linear programming problems, and simple solutions for optimization problems, matlab mainly for mathematical calculations, is a very simple mathematical software)

经验模态分解（EMD）方法（平稳化过程）是一种全新的处理非平稳数据序列的方法，其基本思想是：假如一个原始数据序列X(t)的极大值或极小值数目比上跨零点（或下跨零点）的数目多两个（或两个以上），则该数据序列就要进行平稳化处理(Empirical Mode Decomposition (EMD) method (a smooth process) is a new deal with non-stationary data sequence method, the basic idea is: If a raw data sequence X (t) the maximum or minimum number of than the cross-zero (or under the cross-zero) number more than two (or more), then the data is necessary to carry out a smooth sequence of treatment)

说明：  应用遗传算法解决多峰函数优化问题，气宗遗传算法的步骤很完备。(Application of genetic algorithms to solve multimodal function optimization, genetic algorithms gas were the steps are complete.)

Matlab Simulink Figures

深度学习用于InSAR处理。代码。可以使用(Deep learning is used for InSAR processing. The code. You can use)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)