Dynamic-Surface-Control

说明：  光伏电池simulink模型，分析了光照强度和温度变化时，功率的变化情况(Simulink model of photovoltaic cell)

这是我们课程设计时所写的一个OFDM系统仿真程序，OFDM系统仿真.doc是我当时写的设计报告。已通过测试。(This is what we wrote a curriculum designed OFDM system simulation program, OFDM system simulation. Doc is a design report I had written. Has been tested.)

This book is about communication system by matlab.

利用MATLAB完成fsk调制的一段源代码，看一下吧，也许有用(Fsk modulation using MATLAB to complete a section of source code, take a look at it, might be useful to)

说明：  模拟干涉图像的程序，matlab编写，很实用，对正在学习的朋友有帮助。(Interference image of the process simulation, matlab written, very practical, and helpful friends are learning.)

该程序为matlab代码。通过对相同数据分别进行DFT与FFT这两种变换，来对比两者的异同。(The program for the matlab code. By the same data were carried out both DFT and FFT transform, to compare the similarities and differences between the two.)

经典的视觉显著性算法BMS的Matlab代码。(The classic visual saliency BMS algorithm Matlab code.)

　支持向量机方法是建立在统计学习理论的VC 维理论和结构风险最小原理基础上的，根据有限的样本信息在模型的复杂性（即对特定训练样本的学习精度，Accuracy）和学习能力（即无错误地识别任意样本的能力）之间寻求最佳折衷，以期获得最好的推广能力[14]（或称泛化能力）。 (SVM is based on statistical learning theory and the theory of VC dimension based on structural risk minimization principle, according to the limited sample of information in the model complexity (ie, training samples of a specific learning accuracy, Accuracy) and learning ability (ie, error-free samples to identify any capacity) to find the best compromise between, in order to obtain the best generalization ability [14] (or generalization).)

通讯录 程序设计 大二作品 c++ 面向对象 文件读写 操作符重载(Address Book program design sophomore c++ object-oriented works of the file to read and write operator overloading)

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