登录
首页 » matlab » Desktop

Desktop

于 2014-12-14 发布 文件大小:8KB
0 200
下载积分: 1 下载次数: 15

代码说明:

  simulink自适应程序s函数和模型,可以用到噪声控制等方向(simulink adaptive program s functions and models, and so can be used to control the direction of the noise)

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

发表评论

0 个回复

  • deeld
    economic dispatch with abc algorithm
    2013-07-12 18:29:20下载
    积分:1
  • GUI
    对一段声音进行高通低通和带通滤波 ,观察其波形,滤波频率可选择(A sound of high-pass low-pass and band-pass filter, and observe the waveform, the filter frequency selectable)
    2012-04-07 16:59:18下载
    积分:1
  • fig5_MSOM
    The sourcecode of Universally-Convergent Squared-Operator Iteration Methods for fig5 using MSOM
    2013-12-03 20:55:09下载
    积分:1
  • modetm
    matlab code for calculate the TM froma rectangular waveguide
    2010-11-15 13:58:28下载
    积分:1
  • jackknife_parafac
    Jackknife PARAFAC, 用在多维线性分解.(Very famous Jackknife parafac, suited for multi-way data decomposition.)
    2020-09-26 18:17:46下载
    积分:1
  • MSST_Y
    信号子空间变换算法(SST)的聚焦矩阵是利用各频率点与参考频点之间信号子空间的关系导出的.(The focus matrix of signal subspace transform (SST) algorithm is derived from the relationship between the signal subspace of each frequency point and the reference frequency point.)
    2019-03-05 09:48:02下载
    积分:1
  • jiashejianyan
    假设检验例题 7.1 设总体 ,其中参数 , 为未知,试指出下面统计假设中哪些是简单假设,哪些是复合假设: (1) ; (2) ; (3) ; (4) ; (5) . 解:(1)是简单假设,其余位复合假设 (Hypothesis testing for Example 7.1 overall, including parameters, is unknown, pointed out that the following statistical hypothesis test which is a simple assumption, which is a compound hypothesis: (1) (2) (3) (4) (5). Solution : (1) is a simple assumption, the remaining bit composite hypothesis)
    2007-09-04 22:21:46下载
    积分:1
  • four-Toolbox-for-SVM
    说明:  SVM分类器,关键是对信号进行分类,是模式识别的必备宝典(SVM classifier, the key is to classify the signal is essential for pattern recognition Collection)
    2011-03-20 21:14:30下载
    积分:1
  • bakerMap
    implementation of bakermap method for image kryptography in matlab programming language
    2011-05-09 10:58:33下载
    积分:1
  • ga_tsp
    This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...
    2013-04-09 22:15:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载