60-small-self-Matlab-code

对图像运用zernike矩提取轮廓和图像重构(code)

TD-SCDMA 系统Iu接口技术规范 TD-SCDMA System Iu Interface Technical Specification (TD-SCDMA system Iu Interface Specification TD-SCDMA System Iu Interface Technical Specification)

因而本文基于MATLAB 针对Nakagami 衰落信道仿真了它的统计 特性,包括接收信号的复包络模拟和在具有最大比合并分集下的电平通过率及平均衰落持续时间的性能分析。重点在于理解和建立采用 MATLAB 进行信道信真的方法及对Nakagami 衰落信道本身统计特性的理解。(Based on MATLAB which Nakagami fading channel simulation for its statistical properties, including the received signal complex envelope simulation and has the maximum ratio combining diversity under the level crossing rate and average fade duration of the performance analysis. Emphasis is on understanding and the establishment of the channel using MATLAB and the letter is really way Nakagami fading channel statistical characteristics of their own understanding.)

匈牙利算法的matlab实现，自己处理的，克服了大部分的死循环问题(Hungary matlab solve death circle)

于群《MATLAB/Simulink电力系统建模与仿真》课本+仿真模型和代码+matpower及其使用手册(In group " MATLAB/Simulink power system modeling and simulation" textbook+ simulation model and code+matpower and use manual)

实现典型相关分析，电力系统暂态稳定程序，可以进行暂态稳定计算,IMC-PID是利用内模控制原理来对PID参数进行计算。( Achieve canonical correlation analysis, Power System Transient Stability Program, can be transient stability, The IMC- PID is using the internal model control principle for PID parameters is calculated.)

GPS for MatlabDetermination of the WGS-84 geoid height correction Determination of the WGS-84 geoid height correctionDetermination of the WGS-84 geoid height correction

“基于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.)

ereeetet...which finds erettt

matlab可视化大学物理学教案演示程序第零章：应用基础(matlab visualization of physics at the University of lesson plans demo program zero: the application of basic)