登录
首页 » matlab » MATLAByanzou

MATLAByanzou

于 2013-05-11 发布 文件大小:6KB
0 263
下载积分: 1 下载次数: 3

代码说明:

  用Matlab演奏经典曲目卡农、最炫民族风、青花瓷、新贵妃醉酒,很多歌曲都可以使用此方法(Using Matlab played classics Canon, and most unusual national wind blue and white porcelain, New Drunken Beauty, a lot of songs can use this method)

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

发表评论

0 个回复

  • Control_IMP
    Design a Controller IMP
    2009-12-18 00:39:53下载
    积分:1
  • matlab7refbook
    Matlab 7 reference book
    2008-08-07 23:06:36下载
    积分:1
  • fpisimulator
    This program simulates Gaussian beam propagation through a Fabry-Perot interferometer %with adjustable error angles.(Gaussian beam prop agation through a Fabry-Perot interferometer % error with adjustable angles.)
    2006-07-16 15:11:00下载
    积分:1
  • 20100528KFDA
    完整的核主元分析法程序,包含训练识别功能,希望有所帮助。(Complete nuclear principal component analysis procedures, including training in recognition, hope that helps)
    2010-05-27 14:46:49下载
    积分:1
  • dickey_fuller
    this is a simpliest example to testing unit root
    2009-09-06 03:12:21下载
    积分:1
  • Kaiser
    说明:  MATLAB实现kaiser窗函数。~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ (MATLAB kaiser window function to achieve)
    2011-03-13 18:24:09下载
    积分:1
  • pingpao
    matlab仿真的平抛运动,无空气阻力,非弹性碰撞(速度衰减40%)(Matlab simulation-parabolic movement, no air resistance, non-elastic collisions (40% rate of attenuation))
    2007-05-26 12:15:59下载
    积分:1
  • fourierslice
    验证傅里叶切片定理,可减少傅里叶变换的计算量(fourier slice)
    2021-05-06 17:58:37下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • lsb_embed
    数字水印嵌入算法,利用空域变换的(lsb)算法(Digital watermark embedding algorithm, the use of airspace transform (lsb) algorithm)
    2010-03-08 10:46:34下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载