MATLAB-temperature-flied

该程序是MATLAB源程序，可以用来对纹理图像进行分割。(MATLAB source code of the procedure can be used for texture image segmentation.)

/* File : dlimintc.c * Abstract: * * Example MEX-file for a discrete-time limited integrator. * * Syntax: [sys, x0] = dlimintc(t,x,u,flag,lb,ub,x0,ts) * * For more details about S-functions, see simulink/src/sfuntmpl_doc.c

QAM modulation using matlab

计算在光纤长度一定时，不同功率抽运光对激光器输出特性的影响(A certain length in the fiber, the different power pump laser output characteristics on the impact of)

伺服系统三环的PID控制MATLAB仿真（根据是否加入摩擦干扰和前馈补偿分别进行仿真）(Ring of the PID servo control system MATLAB simulation (based on whether to join the disturbance and feedforward compensation for friction is simulated, respectively))

对加速度时间历程进行频谱分析得到功率谱密度，按下述程序计算加权加速度均方根值(Acceleration time history of spectral analysis to obtain the power spectral density, calculated according to the following procedure weighted acceleration RMS)

哈尔滨工业大学MATLAB讲义，ppt格式。(Harbin Institute of Technology MATLAB lecture, ppt format.)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

说明：  DTW算法是孤立词语音识别中最简单有效的算法，是基于DP动态规划的思想。(DTW)

说明：  遗传算法解决车辆路径问题，用matlab解答，可以直接运行(Genetic algorithm can solve the vehicle routing problem)