msc

matlabtx319-《Matlab 6.X辅助图像处理》源代码(matlabtx319- "Matlab 6.X assisted image processing" source code)

产生以群结构运动的多个目标的模拟运动轨迹 参数可调(group tracking data)

对于端面抽运的双包层光纤激光器，利用速率方程对脉冲输出能量进行数值仿真(In the end pumped double clad fiber laser, the output energy is numerically simulated by the rate equation)

Pisarenko谐波分解算法,wolf 方法计算李雅普诺夫指数,本科毕设要求参见标准测试模型。( Pisarenko harmonic decomposition algorithm, wolf calculated Lyapunov exponent, Undergraduate complete set requirements refer to the standard test models.)

说明：  线性阵列在近场区域运用MVDR算法定位噪声源，里面有几种简单的算法(Linear arrays use MVDR algorithm to locate noise sources in near field. There are several simple algorithms in it.)

matlab图形处理功能的总结。对matlab处理图形时涉及的各种绘图方法进行了系统总结 (The function of Image processing )

说明：  ANN-BP分类器设计，用其中一半的数据采用ANN-BP算法设计分类器，另一半数据用于测试分类器性能。(ANN-BP classifier design, with half of the data using ANN-BP algorithm design classifier, the other half of the data used to test the classifier performance.)

五种迭代法解------非线性方程求根 分别采用了牛顿法、简易牛顿法、史蒂芬孙迭代法、二分法和割线法(The iterative method for solving nonlinear equations.)

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)

this word contain a code to approximate weighted histogram