登录
首页 » matlab » Neural-network-case

Neural-network-case

于 2013-05-16 发布 文件大小:367KB
0 188
下载积分: 1 下载次数: 1

代码说明:

  采用MATLAB编写的神经网络案例程序源码(Program source code written in MATLAB neural network case)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • DLT645
    电力抄表规约dl/t645调试软件,有助于开发645抄表程序(Electricity meter reading of the Statute dl/t645 debugging software, helps to develop 645 meter-reading program)
    2009-11-18 22:15:09下载
    积分:1
  • LST_simulation
    Layered Space Time Transmission RCPC encoder LST-a and LST-b simulation Viterbi decoding
    2010-03-09 14:33:34下载
    积分:1
  • filterIm_1.m
    calc md machin trualaz zzzzeaze
    2011-06-16 06:13:37下载
    积分:1
  • aa11
    闭环系统的奇异值曲线仿真和其鲁棒性能分析(Singular value of the closed-loop system curve simulation and robust performance analysis)
    2012-09-26 17:22:08下载
    积分:1
  • duobianliangmatlabcode
    讨论了多变量灰色预测模型的算法,给出多变量灰色预测模型的Matlab程序.通过实例说明算法程序的应用和效果. 更多还原 (Algorithm discussed multivariable gray forecasting model, gives the Matlab program multivariable gray forecasting model by examples illustrate the application and effectiveness of the algorithm of the program. More reduction)
    2013-12-14 15:46:32下载
    积分:1
  • duffing
    计算上田阵子的最大利亚普诺夫函数的matlab源码程序, 是确定系统的常微分方程。(the matlab code is using to caculat duffing the max lyapunvo about determined duffing system .)
    2010-08-30 09:08:16下载
    积分:1
  • 3
    说明:  matlab电机仿真精华50例\异步电机abo仿真模型(matlab simulation of the essence of 50 cases of electric induction motor simulation model abo)
    2008-07-24 12:11:22下载
    积分:1
  • cfo_CPP
    cyclic prefix in ofdm
    2011-08-20 10:08:14下载
    积分:1
  • image_XB_3
    小波变换的Matlab程序源代码,除了小波图像压缩算法外,还包括图像重构函数。(Wavelet Transform Matlab program source code, apart from wavelet image compression algorithm, also includes the functions of image reconstruction.)
    2013-03-24 14:56:39下载
    积分:1
  • cgsvd
    CGSVD Compact generalized SVD of a matrix pair in regularization problems. sm = cgsvd(A,L) [U,sm,X,V] = cgsvd(A,L) , sm = [sigma,mu] Computes the generalized SVD of the matrix pair (A,L): [ A ] = [ U 0 ]*[ diag(sigma) 0 ]*inv(X) [ L ] [ 0 V ] [ 0 eye(n-p) ] [ diag(mu) 0 ] where U is m-by-n , sigma is p-by-1 V is p-by-p , mu is p-by-1 X is n-by-n . It is assumed that m >= n >= p, which is true in regularization problems. Reference: C. F. Van Loan, Computing the CS and the generalized singular value decomposition , Numer. Math. 46 (1985), 479-491. Per Christian Hansen, IMM, 12/19/97. Initialization.
    2021-03-25 20:29:14下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载