-
xox_Wave_NN
The Wavelet Neural Network
This is simple example for using of modified Morlet neural network.
Levenberg-Marquardt with numerical Jacobian calculation implemented.
Easy to use with other optimization algorithem e.g GA,PSO, etc.
The function "xox_lm" may be useful for other optimization problem easily.
The function "xox_jacobian" may be useful for Jacobian calculation easily.
The function "NN_fcn" may be used by the evolutionary based neural network.
The activation function "modified Morlet" will be replaceable by others.
- 2013-07-12 17:31:12下载
- 积分:1
-
Untitled
数学建模中灰色预测法模型的Matlab源程序代码(The model code of gray prediction method)
- 2012-05-26 16:42:01下载
- 积分:1
-
imageStitchMatlab
Matlab image stitching algorithm
- 2014-11-13 18:36:50下载
- 积分:1
-
12312312412VF
基于恒压恒频控制的模型,能普遍适用于各种新能源发电系统,提供参考价值,仿真可以正常运行(CVCF model-based control, can be generally applicable to all kinds of new energy generation systems, provide a reference value, the simulation can be run properly)
- 2017-04-08 10:06:12下载
- 积分:1
-
GuiTriEle
利用Matlab编制的有限元程序,针对悬臂梁,采用三角形划分网格,计算梁的固有频率和前三阶阵型,并绘制出来(Compiled using Matlab finite element program for the cantilever, the triangle mesh to calculate the natural frequency of beam formation and the first three and drawn out)
- 2010-11-25 23:56:29下载
- 积分:1
-
HMT
说明: 基于MATLAB环境下的HMT隐马尔克夫树模型参数训练代码母函数(Based on the MATLAB environment HMT parameters hidden Markov tree model training code generating function)
- 2008-09-19 15:07:50下载
- 积分:1
-
CP0804
说明: 基于导频脉冲序列,解决IR-UWB通信系统信号捕获和定时同步问题。(Pulse sequence based on the pilot to address the IR-UWB communication system signal acquisition and timing synchronization.)
- 2011-03-04 15:37:27下载
- 积分:1
-
qpsk
此为qpsk matalb仿真源程序,如有需要请谨慎下载(This is qpsk matalb simulation source, if necessary, download with caution)
- 2011-05-29 14:35:39下载
- 积分:1
-
dtw
Efficient Implementation of DTW algorithm in MATLAB
- 2020-08-30 22:08:11下载
- 积分:1
-
ACO
TSP问题的人工蚁群算法中,假设m只蚂蚁在图的相邻节点间移动,从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定:1、信息素质,也称信息素痕迹。2、可见度,即先验值。(Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem solution. Each ant transition probability is determined by the figure of two kinds of parameters for each edge: 1, the quality of information, also called pheromone trails. 2, visibility, ie priors.)
- 2016-10-10 20:51:31下载
- 积分:1