13004499

说明：  该matlab程序详细展示了频谱分析的方法，值得参考(Matlab program shows the detailed spectrum analysis, it is also useful)

low pass filter desined in matlab signal toolbox butterworth fiter

a program compiled by matlab to computer more than 30 of gravity parameter from a gravity modle

通信原理上机实验-基于Matlab的模拟幅度调制系统-SSB调制解调系统程序代码(On communication theory machine experiment- Matlab-based simulation system-SSB modulation amplitude modulation and demodulation system code)

压控振荡器的压控算法控制，这个MATLAB仿真压控的PID算法，很有学习应用价值，是平常使用的，一定可行。 (VCO VCO control algorithm, the MATLAB simulation voltage control PID algorithm, great learning value is usually used, necessarily feasible.)

matlab extreme machine learning

1D CNN和2D CNN网络的仿真实现，包含完整的子函数分解，采用matlab编写(demo_cnn_auto- demo for Autonomous CNNs with a symmetric A template solve_cnn2d- solve a 2D CNN system, Euler method solve_cnn2d_multi- solve a 2D multi-layered CNN system, Euler method Utility routines make_cnn_params- check and update the CNN params structure make_cnn_params_multi- check and update the multi-layer CNN params structure make_cnn_time- check and update the CNN time structure step_ahead1- advance a 1D CNN state one step forward, Euler method step_ahead2- advance a 2D CNN state one step forward, Euler method unit_sat- unity saturation )

仿真电力系统的稳态与潮流计算，能够帮助理解电力系统的分析与设计(Steady-state power system simulation and power flow calculation, can help to understand the power system analysis and design)

力矢量算法实现的画图程序，编写环境matlab， 3D 本人原创 (force-oriented graph drawing algrithm, 3D, computer science applied)

说明：  最短路径的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.)