登录
首页 » MathCAD » DFT-and-Antinotch-for-F56F11.4

DFT-and-Antinotch-for-F56F11.4

于 2012-06-15 发布 文件大小:1KB
0 145
下载积分: 1 下载次数: 7

代码说明:

  mtlab code for finding protein coding region in DNA strand

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

发表评论


0 个回复

  • FeatExtraction
    this file is for mfcc extraction
    2012-03-30 15:44:34下载
    积分:1
  • rle
    MATLAB program which enables us to do encoding techniques.
    2012-06-28 19:03:24下载
    积分:1
  • rain-flow-counting-method
    随机载荷模拟及雨流计数方法在matlab中的实现(Random load simulation and rain flow counting method implemented in matlab)
    2013-04-23 12:20:19下载
    积分:1
  • test
    matlab下实现从硬盘文件读取数据并绘制图表的例程。对于简单的实验数据作图与处理很有用。(achieve matlab file to read data from the hard drive and charting routines. For simple plotting and processing of experimental data is useful)
    2012-01-18 10:48:47下载
    积分:1
  • Rumore_rosa
    Pink noise generated in matlab
    2009-04-09 01:09:37下载
    积分:1
  • C-PID
    基于C语言的PID功能实现,用c语言编写的PID算法(PID function based on the C language implementation)
    2012-11-22 21:08:06下载
    积分:1
  • Matlab-GPS-Toolbox
    GPS卫星导航接收机的matlab工具箱,包括卫星位置计算、用户位置计算以及坐标转换等功能(GPS-matlab toolbox)
    2011-04-26 21:46:10下载
    积分:1
  • PSO
    PSO算法声纹识别整体程序代码,适合DSP硬件(Voiceprint identification of the overall code)
    2012-04-15 16:06:04下载
    积分:1
  • Wind-Turbine-Blockset
    风轮仿真分析以及程序,内有使用说明及相关问题表述(Wind Turbine Blockset)
    2021-04-24 15:18:46下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • 696518资源总数
  • 104755会员总数
  • 1今日下载