-
problems_TurboPascal
problems turbo pascal
- 2010-11-22 05:05:05下载
- 积分:1
-
haar
this can be used to get discription about haar wavelet
- 2011-07-16 22:24:25下载
- 积分:1
-
huidu4
不错的灰度处理matlab程序 实验过 有些地方需要修改更好(good handle Matlab experimental procedure that some places need to be amended to better)
- 2007-05-18 19:38:34下载
- 积分:1
-
lssvmpso
自己写的一个psolssvm程序 要有lssvm工具箱才可以运行(Write a psolssvm procedures to have lssvm the toolbox before you can run)
- 2012-11-19 21:19:45下载
- 积分:1
-
antenna_arrays
Ardtool是Matlab的图形用户界面,用于分析天线阵列的不同类型。认识的天线辐射模式的程序,以及天线的类型分类编程(Ardtool is a Matlab graphical user interface for the analysis of the different types of antenna arrays. Understanding antenna radiation pattern procedures, and antenna type classification program)
- 2010-08-10 09:11:37下载
- 积分:1
-
ecg_analysis_2min_3kai
对心电信号进行滤波处理后,计算RR间隔,进而求得瞬时心率和心率变异系数,通过对RR间隔的变化曲线进行频谱分析,从而求得各个自律神经活动的评价指标(After filter processing is performed on the ECG, the RR interval is calculated, and then seek the instantaneous heart rate and heart rate variability coefficient, spectral analysis through the curves of changes in the RR interval, to thereby obtain the evaluation index for each of the autonomic nervous activity)
- 2012-10-10 19:40:24下载
- 积分:1
-
Pattern-Recognition-
国外计算机科学教材系列,模式识别第四版课后习题部分matlab源码,李晶皎,王爱侠等译(Foreign computer science textbook series, the fourth edition of after-school exercise part of pattern recognition matlab source, Jiao Jing, Wang Aixia translated)
- 2013-12-27 10:53:37下载
- 积分:1
-
The_third_time
永磁同步电机矢量控制的仿真搭建,基于PID控制以及滑模控制,分数阶PID控制和分数阶滑模控制等(Permanent magnet synchronous motor vector control simulation, based on the PID control and sliding mode control, fractional order PID control and the fractional order sliding mode control, etc
)
- 2021-05-08 20:08:35下载
- 积分:1
-
ezyfit2.42
fit in processing with function
- 2015-07-08 18:54:59下载
- 积分:1
-
Centrality-measures
文件包括:1.计算平均最短路径;2.计算每个顶点相邻节点的平均度;3.计算每个节点的邻近中心度;4.计算节点的介数(slow);5.计算节点的介数(faster);6.计算每条边的介数值;7.快速迪杰斯特拉算法;8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)
- 2021-04-23 19:38:47下载
- 积分:1