资源列表
Electrical_Angle
- This module will calculate the electrical angle between two different signals (Normally current + Voltage). once the first siganl as a reference signal and once the second signal as a reference signal.
tsp
- 本程序为神经网络解决TSP问题 数据有100城市 200城市和500城市，采用VC++编程 程序中已经设置成最佳参数 交叉驴0.6 变异率0.01 @ 迭代500 代。效果不错-The procedures for the neural network to solve the TSP data of 100 cities 200 cities and 500 cities, using VC++ programming procedure has been set to the optim
maximumpower
- load recieves maximum power from the source when its resitive value is equal to the thevenin resistance of the circuit.
SPWMinverter3P_Final
- Consist of SPWM Generator. Three phase inverter with pulses.
bp00
- bp神经网络vc++实现,具有较好的效果，可以参考-bp neural network vc++ realize, with good results, you can refer to
wety
- 采用C++神经网络开发，ANNIE,可以用C++语言开发各种神经网络_比如BP,RBF,HOPFIELD，等,同时随附件带有基于VC和.NET的程序-Using C++ neural network development, ANNIE, you can use language to develop a variety of neural networks C++ _ such as BP, RBF, HOPFIELD, etc., along with the annex with VC-b
BP8887
- 以c++代码实现了BP神经网络的类，文件中具有测试的数据，测试效果非常不错-In c++ code implements the BP neural network class, file with the test data, test results are very good
source
- 输入信号为方波信号+高斯白噪声，方波信号基 频为1kHz，幅值为1，高斯白噪声方差为0.2， 均值为0，采样频率为20kHz。试用最大熵估计 法估计此信号的AR模型及其功率谱，并分析结 果-The input signal is a square wave signal+ Gaussian white noise, square wave signal fundamental frequency 1kHz, amplitude is a Gaussian white noise variance
source
- 输入信号为方波信号+高斯白噪声，方波信号基 频为1kHz，幅值为1，高斯白噪声方差为0.2， 均值为0，采样频率为20kHz。试用周期图法和 ARMA谱估计法(SVD-TLS)估计此信号的功率 谱，并分析比较其结果-The input signal is a square wave signal+ Gaussian white noise, square wave signal fundamental frequency 1kHz, amplitude is a Gaussian white n
source
- 白噪声 –单位冲激信号 –正弦信号 –方波信号 –三角波信号 功率谱-White Noise- unit impulse signal- sinusoidal signal- a square wave signal- triangular wave signal power spectrum
FreeTree
- 无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径-Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T
Josephus
- Josephus问题：设n个人围坐在一个圆桌周围，从第s个人开始数数，数到m的人，让他出局，然后从出局的人的下一个人开始重新开始数数，数到m的人，再让他出局，……，知道全部出局为止-Josephus problem: Let n individuals sitting at a round table, from the first s personal began to count, count to m, let him out, then the next person out of th