-
smithchart
This is a source code .
this is a sourc c odeeg
- 2009-03-27 21:40:31下载
- 积分：1
-
rnnsimv2
RNNSIM v.2 package contains a number of m-files for training and evaluation
of the random neural network. All functions have been thoroughly tested.
After downloading the separate files or the zipped file, make sure that they are
stored or extracted in the directory /rnnsimv2
Below an overview of the files contained in this directory along with a brief description of what
they do. The on-line help facility explains how to call the different functions. You simply write
help <function-name> in the MATLAB command window.
Along with the m-files in this directory you will find a manual for the simulator
in PDF format (rnnsimv2.pdf). Start by printing this out and read the release notes.
Two simple demonstration programs are given to illustrate how most of the functions
work.
- 2010-03-04 17:19:48下载
- 积分：1
-
shuntgenerator
Shunt Generator equation
- 2010-02-06 13:15:35下载
- 积分：1
-
reconosimiento-de-voz
Get reduce the size of an original sound file between half to three quarters of the initial size. The FLAC format is often used to sell music online, and as an alternative to MP3 to share when you want to reduce the file size would have
- 2013-11-12 02:35:06下载
- 积分：1
-
biosig4octmat-2.88
Matlab 脑电信号转mat数据工具包，脑电研究的福音。(EEG data transfer mat Matlab toolkit gospel EEG studies.)
- 2021-03-10 15:29:27下载
- 积分：1
-
DSP实验
观察数据长度N的变化对DTFT分辨率的影响
这几个程序是老师写的 对于理解DTFT有很大帮助(Effect of observation data length N on DTFT resolution
These programs are written by the teacher and are very helpful for understanding DTFT.)
- 2020-06-17 05:20:01下载
- 积分：1
-
bib_mas
a complete biblio of the asynchronous machine
- 2009-02-23 15:44:54下载
- 积分：1
-
getfirstline
this gives first line of a given document
- 2010-08-18 15:15:08下载
- 积分：1
-
homomorphic-filter
homomorphic filter codes are available.
- 2014-08-11 17:17:30下载
- 积分：1
-
Travelling-salesman-problem-algorithm
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
- 2013-12-30 00:26:10下载
- 积分：1
