SFLA

calibration matlab code

计算单模光纤的色散曲线，最后拟合出色散随波长变化的曲线(Single-mode fiber dispersion curve calculation, the final fitting with excellent wavelength dispersion curve)

直角坐标法的潮流程序，关于一个5节点的算例，有数据(Cartesian method of trends program, on a 5-node example, with data)

BP neural code the backpropagation algorithm nwueal implementation in matlab, the code for training element wise

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.)

how you can create, read, delete and update using Matlab by simple code

史上最详细的BPSK的源程序，下载后绝对不会让你后悔，如果喜欢点个赞哦，欢迎交流。(BPSK history of the most detailed source, will not let you download later regret it, if you like the point of a like oh, please share.)

麻省理工的matlab课件，包括基础知识及一些例子，相当不错(The ppt from MIT in matlab )

模型跟踪 例题可以看看看 模型参考自适应控制本书从MATLAB仿真及可视化仿真的角度出发,系统地介绍了系统辨识与自适应控制的... ●第3章为模型参考自适应控制,(Model following examples can look at the book to see the model reference adaptive control MATLAB simulation and visual simulation point of view, the system introduces the system identification and adaptive control ... ● Chapter 3 for model reference adaptive control,)

说明：  分支定界法（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.)