AFSA_fxy

实验内容 信号与系统试验报告 自己的作业 1.设有两个信号： 要求x(t)和h(t)采样形成离散序列， 参数选择如下： 采样率Δ=4ms， 频率f=30Hz， a=2f2ln(M), M=2.5 在MATLAB下实现连续信号离散化， 并绘制出离散形式的信号波形。 (Experimental signal and system test the contents of the report of one)

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

MC（蒙特卡罗）算法计算多节点的通信网性能分析。双向链路可靠性相同。一个有图一个无图(MC (Monte Carlo) algorithm to calculate the multi-node communication network performance analysis. The same two-way link reliability. A diagram of a non-graph)

OQAM pre processing

用于求解分数阶混沌系统的有效程序，对学习分数阶动力学系统的同学非常有帮助。(Effective procedure for solving fractional order chaotic systems，Kinetics of fractional order system in study students are very helpful.)

说明：  实现dijstra算法，算出任意两点间的最短路径(Implementing Dijstra algorithms)

simple basic buck circuit

利用matlab估计系统模型，matlab的系统辨识工具箱中提供了大量与辨识有关的函数，(system identification tooibox)

MATLAB与Microsoft Excel的连接,有个应用举例，希望对一些人有用(MATLAB and Microsoft Excel connectivity, application-for example, hope for some useful)

matlab应用程序 可直接用 ，运用只能算法解决旅行商问题(Matlab application can be used directly, only USES the algorithm to solve traveling salesman problem )