simulink

风力机模型MATLAB仿真，叶尖速比，转矩，利用系数的MATLAB仿真，SIMULINK搭建仿真模型(MATLAB simulation of wind turbine model, the tip speed ratio, torque, utilization factor of MATLAB simulation, SIMULINK simulation model building)

0_Linear：线性回归练习 1_LogistRegression：逻辑回归练习 2_boston：波士顿房价预测 3_regularization：正则化 5_stock：股票价格预测 6_CTR：点击率预测 7_all_model：回归与分类模型 8_muticlass：多分类练习 9_regression_implement：不同回归算法tf实现(0_Linear. 1_LogistRegression. 2_boston. 3_regularization. 5_stock. 6_CTR. 7_all_model. 8_muticlass. 9_regression_implement.)

此程序为高斯白噪声AWGN信道的matlab描述(This program is Gaussian white noise AWGN channel matlab description)

说明：  我使用matlab寫的漸層處理程式，希望初學者可以進快上手。(I use matlab gradient processing program to write and hope into the beginners get started quickly.)

包括matlab中一些常用的函数，还有一些特殊函数，如马库姆函数(marcum Q-function)

MATLAB电机仿真精华50例PDF+源码(MATLAB simulation of the essence of 50 cases of motor PDF+ source code)

鲁棒性好，性能优越，有PMUSIC 校正前和校正后的比较，数值分析的EULER法，采用了小波去噪的思想，包含了阵列信号处理的常见算法，感应双馈发电机系统的仿真。( Robustness, superior performance, A relatively before correction and after correction PMUSIC, EULER numerical analysis method, Using wavelet denoising thought, Contains a common array signal processing algorithm, Simulation of doubly fed induction generator system.)

是最新MATLAB工程应用的代码，都是代码在里面，很值得鉴赏(Engineering applications is the latest MATLAB code is the code inside, it is worthy of appreciation )

说明：  归零编码，适用于FMT（滤波多音调治）技术(RZ code applicable to FMT (multi-tone filter rule) technology)

说明：  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 　　Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)