登录
首页 » matlab » M-call-C

M-call-C

于 2007-03-27 发布 文件大小:30KB
0 287
下载积分: 1 下载次数: 42

代码说明:

  混合编程时,M文件中调用C语言函数,精通matlab编程一书的例程,希望有帮助。(mixed programming, the paper called M C language function, proficient Matlab programming routines in a book. hope it helps.)

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

发表评论

0 个回复

  • bp
    说明:  MATLAB 神经网络用于数字识别源程序 手写数字识别(MATLAB neural network for digital identification of the source handwritten numeral recognition)
    2010-05-18 13:35:39下载
    积分:1
  • MatLab-for-engineering-mathematics
    matlab 学习技巧,现在把我用的,也就是对我帮助很大的留个文件传上去,希望对大家有用,第四工程数学应用(matlab learning skills, and now I use, which is a great help to me to leave a document passed up, we want to be useful, the fourth application of engineering mathematics)
    2013-08-24 11:49:43下载
    积分:1
  • THS-7357
    This thesis is a contribution to the study of systems énergieélectrique of hybrid conversion associated unsystème destocking pourun isolated site
    2014-01-05 23:22:27下载
    积分:1
  • BERperformanceoflinearcompanding
    一篇经典的英文文献,关于非线性压扩对系统误码率影响的推导(A classic English literature, derivation of nonlinear companding on system bit error rate influence )
    2015-01-25 17:02:24下载
    积分:1
  • video_background
    运用编程实现提取一段视频的每一帧并保存。利用Fbackground函数实现提取一段视频的静止背景。(Use programming to extract each frame of a video and save it. The static background of a video is extracted by Fbackground function.)
    2018-07-19 14:53:38下载
    积分: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
  • ChaosToolbox
    混沌时间序列分析与预测工具箱 该工具箱包括了混沌时间序列分析与预测的常用方法.(Chaotic time series analysis and prediction of the toolbox toolbox includes chaotic time series analysis and prediction of the commonly used methods.)
    2009-04-02 09:37:22下载
    积分:1
  • hustMyDWTsimplefusion
    这是一个实现基于小波变换的融合算法的源代码,对于研究图像融合的专家具有重要的参考价值(this is the image fusion sourcecode )
    2009-05-26 21:33:13下载
    积分:1
  • ESPRINT
    ESPRINT谱估计,计算DOA,可以与capone进行对比。(ESPRINT spectrum estimation calculates DOA, with capone comparison.)
    2013-12-18 09:55:08下载
    积分:1
  • MatLab
    THE USE OF MATLABLE,WELCOME TO DOWNLOAD.
    2009-10-28 10:25:07下载
    积分:1
  • 696518资源总数
  • 106242会员总数
  • 10今日下载