-
manipulator_simulation
MATLAB两自由度机械臂鲁棒控制仿真例程(MATLAB two-degree-of-freedom manipulator Robust control simulation routines for)
- 2013-02-25 22:20:02下载
- 积分:1
-
rd3functions
处理RD3格式的matlab工具包 ,主要实现rd3文件的读取(RD3 treatment matlab toolkit format, the main document read realize rd3)
- 2008-07-06 09:32:52下载
- 积分:1
-
ecgnoise
有关心电处理的程序,主要是心电去噪,欢迎大家参考(Are concerned about the power handling procedures, mainly ECG denoising, welcome reference)
- 2011-12-21 11:34:41下载
- 积分:1
-
DOA coherent sources
用matlab实现相关信号源DOA估计 FSS FBSS(doa of coherent sources FSS FBSS)
- 2013-01-10 12:36:54下载
- 积分:1
-
5ballov-15259
Arhives in matlab.if you use matlab and you need you create a botton you can use my file
- 2012-05-14 20:20:29下载
- 积分:1
-
Hammerstein_Toolbox_V1.2
In a number of vibration applications, systems under study are slightly non-linear. Cascade of Hammerstein models conveniently allows one to describe such systems.
The Hammerstein Toolbox provides a simple method based on a phase property of exponential sine sweeps
to estimate the structural elements (Kernels) of such a model from only one measured response of the system.
- 2020-08-25 16:48:14下载
- 积分:1
-
Emotion-Recognition
Human Emotion Recognition using modified Gabor as a feture extraction and SVM classifier
- 2014-10-15 14:58:15下载
- 积分:1
-
Matlab_scientific-language
《MATLAB语言-演算纸式的科学工程计算语言》,详细讲述Matlab编程入门,术语Matlab基础书籍(" MATLAB language- calculus paper-based scientific engineering computing language," a detailed account of Matlab programming entry, terminology Matlab based on books)
- 2013-07-29 11:37:12下载
- 积分:1
-
Highboostfilter
high boost filter for frequency domain
- 2009-12-10 15:10:32下载
- 积分:1
-
Dijkstra
说明: 最短路径的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.)
- 2008-11-26 22:27:45下载
- 积分:1