登录
首页 » matlab » MatlabCommands

MatlabCommands

于 2013-02-04 发布 文件大小:255KB
0 256
下载积分: 1 下载次数: 2

代码说明:

  This book contain commonly used MATLAB Commands and Functions.

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

发表评论

0 个回复

  • Matlab-code
    英文原版书籍《MATLAB Programming With Applications for Engineers》中例子及课后习题代码(Code of the book《MATLAB Programming With Applications for Engineers》)
    2013-12-17 07:25:05下载
    积分:1
  • FFT
    计算信号的谱特性,包括频谱特征及功率谱特征。(Calculate the spectral characteristics of the signal, including spectral characteristics and power spectral features.)
    2011-05-31 16:31:06下载
    积分:1
  • discriminate
    matlab程序,用于去掉二值图像中的单个像素的像素点,保留图像中较大面积的区域(get rid of single pixels in images)
    2015-03-06 10:47:45下载
    积分:1
  • verr072
    Tool for data mining
    2010-08-21 22:38:59下载
    积分:1
  • chapterall
    现代通信系统使用MATLAB第二版中所有程序m文件(modern communications system MATLAB second edition document all the procedures m)
    2007-03-14 12:53:24下载
    积分:1
  • SMO-and-EKF-on-PMSM
    一篇很好的将滑模控制与扩展卡尔曼控制结合的控制策略文章。(A very good text with SMO and EKF about PMSM )
    2015-01-09 19:38:58下载
    积分:1
  • lda-0.1-matlab
    这是一个LDA主题模型的matlab代码,可进行中文模糊聚类分析,内涵说明,可直接使用。(This is a topic LDA model matlab code, can be Chinese fuzzy clustering analysis, meaning that can be used directly.)
    2014-01-23 12:48:39下载
    积分: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
  • Beginning.Android.2
    不可多得的安卓入门图书!由Mark Murphy编著,手把手教你实现你的第一个安卓应用程序(Getting Andrews rare books! Edited by Mark Murphy, taught you how to achieve your first Android application)
    2014-09-23 14:15:30下载
    积分:1
  • 1234
    说明:  C-means一个简单完整的程序,供大家看一下,有不完善的地方,请多多指教(C-means a simple and complete procedures for Members to see, any problems, please exhibitions)
    2008-11-19 09:51:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载