MATLAB

说明：  摄像机标定的源代码，希望对大家都帮助，加油(camera ，fight up jiayou)

集总元件电阻、电感、电容的模拟，用不同大小的电感和电容加载，看天线的辐射方向图，从而分析加载天线的特性(Lumped resistance, inductance, capacitance of the simulation, using different sizes of inductors and capacitors to load to see if the antenna radiation pattern, to analyze the characteristics of the antenna load)

PROGRAM IS USED FOR Interface matrix keyboard with 8051.

Code to estimate dynamic models

Economic dispatch is the short-term determination of the optimal output of a number of electricity generation facilities, to meet the system load, at the lowest possible cost, subject to transmission and operational constraints. The Economic Dispatch Problem is solved by specialised computer software which should honour the operational and system constraints of the available resources and corresponding transmission capabilities. In the US Energy Policy Act of 2005 the term is defined as the operation of generation facilities to produce energy at the lowest cost to reliably serve consumers, recognising any operational limits of generation and transmission facilities .

三电平逆变，其畸变系统THD比两电平稍好(PWM Generator (3-Level) Block Example)

一本非常完整的matlab命令大全，很有针对性, 思路清晰，重点和难点突出。具有很高的参考和学习价值.(It is a very useful book of matlab command daqo.The thinking is clearly, important and difficult points is outstanding.So it has high value of reference and study.)

编写的qpsk源程序，实现qpsk的的调制解调(Qpsk written source, to achieve qpsk of the modulation and demodulation)

  最小费用最大流算法通用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.)

PURPOSE finds the mesh node that is closer to a requested location；INPUT xin,yin requested receiver locations, can be vectors global node indices of relocated receivers