登录
首页 » PDF » ScraperConveyorSprocket

ScraperConveyorSprocket

于 2020-06-22 发布 文件大小:193KB
0 129
下载积分: 1 下载次数: 0

代码说明:

  2011-zhang-Dynamic Modeling of Scraper Conveyor Sprocket

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

发表评论

0 个回复

  • NRS_FW_FS
    Neighborhood rough set based heterogeneous feature subset selection
    2009-03-27 02:25:44下载
    积分:1
  • MATLAB
    MATLAB教案,一些MATLAB的命令。比较全面。(MATLAB)
    2010-11-29 10:10:59下载
    积分:1
  • svdPdeconvPmodulate
    对矩阵的奇异值分解,信号的解卷积,信号的调制 (matrix singular value decomposition,deconvolution,modulation)
    2012-05-21 10:16:45下载
    积分:1
  • gray_prediction_shichang_zhanyoulv
    利用灰色预测,经matlab编程,求出未来几年出版每门课程市场占有率情况,并进行级比检验、残差检验(Gray prediction by matlab programming, find the next few years, the market share of each course publishing, and to carry out class ratio test, residual test)
    2013-11-02 10:49:58下载
    积分:1
  • clear
    calculation of outage probability
    2010-10-08 06:35:47下载
    积分:1
  • hough
    可以对图像进行边缘检测,滤波,二值化处理,最后提取图像中的直线。(Edge detection can be carried out on the image, filtering, two value processing, and finally extract the image of the straight line.)
    2017-08-29 10:41:51下载
    积分:1
  • MexFunction
    这个程序使用vc++实现的一个工程,这个工程的作用就是完整实现了MATLAB和vc++混合编程的关键函数的功能-mexfunction。有其详细的开源代码!(This program uses the vc++ implementation of a project, the role of this project is to complete implementation of the MATLAB and vc++ mixed programming function of the key functions-mexfunction. Has its open source code in detail!)
    2010-12-28 11:02:57下载
    积分: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
  • UnderwaterCommunication
    This is a matlab file of underwater communication field.
    2015-02-28 17:41:21下载
    积分:1
  • Camera-Interface-Overview
    主要讲述了数码相机MIPI接口协议说明,工作模式及信号传输原理等(Camera Interface Overview)
    2014-01-20 22:19:32下载
    积分:1
  • 696518资源总数
  • 106253会员总数
  • 14今日下载