-
Channels
通过internet远程对示波器通道数据进行采集与读取控制(through remote internet access for oscilloscope data acquisition and control Read)
- 2007-07-10 10:46:47下载
- 积分：1
-
lm
说明： 最小二乘拟合的c++实现，使用差分，在matlab中设置c++编译器为vc++2005或以上，运行test.m即可(Least-squares fit in c++
set compiler as vc++ in matlab
then run test.m )
- 2011-09-29 15:24:18下载
- 积分：1
-
logSpectrumthe-spectrogram--cepstrum
语音对数谱，语谱图，倒谱的代码，自己编写的，可以运行(Speech log spectrum, the spectrogram, cepstrum of the code, I have written, you can run)
- 2015-03-17 18:51:56下载
- 积分：1
-
ChapterIIarrayanditsnumericalcomputation
这是一份MATLAB基础课件，由于我也是初学者，这部课件讲的很浅显，但比较适合初学者对MATLAB所有功能的一个初步了解内容包括涵数值数组及其运算， M文件和面向对象编成， 字符串数组， 符号变量， matlab 绘图 及 Simulnk动态仿真。以及两个基本浅显的程序题。此为第 2章。(This is a basic MATLAB courseware, because I am also a beginner, this software is very simple-speaking, but more suitable for beginners of all the features of MATLAB, a preliminary understanding of the content including the Han and its numerical array computing, M documents and for object into string array, variable symbols, matlab graphics and dynamic simulation Simulnk. As well as the two basic procedures for simple questions.)
- 2009-03-22 08:55:31下载
- 积分：1
-
72
说明： SMES AND SSSC FOR STABILITY
- 2015-03-18 03:41:16下载
- 积分：1
-
multifractal-spectrum
一种计算多重分形谱的算法，能够有效计算多重分形谱的各种参数(A method of calculating the multifractal spectrum)
- 2012-11-20 19:45:23下载
- 积分：1
-
[SS.net]---London-Olympics-2012
This is very good meaning for understanding steepest descent
- 2012-11-22 02:43:39下载
- 积分：1
-
german_highway-master
高速公路上关于车流量与速度关系，以及发生事故的可能性。(About the relationship between traffic volume and speed on the highway, and the possibility of accidents.)
- 2014-08-01 17:59:26下载
- 积分：1
-
交通流的元胞自动机模型代码
说明： 元胞自动机在数学模型中的应用，用matlab进行模拟(Application of cellular automata in mathematical model)
- 2020-06-26 14:00:02下载
- 积分：1
-
5
说明： 利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
- 2011-05-10 16:03:58下载
- 积分：1
