登录
首页 » matlab » DW

DW

于 2012-04-30 发布 文件大小:1KB
0 245
下载积分: 1 下载次数: 0

代码说明:

说明:  对于较低版本的matlab用户可以直接进行DW检验!但是要求残差向量要大于15(it can do wd)

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

发表评论

0 个回复

  • ggd
    该源码为matlab源码,主要实现建立ggd模型,并进行测试。(the source of Matlab source, mainly for the establishment of ggd model, and for the test.)
    2007-07-06 15:32:57下载
    积分:1
  • Generalizedpredictivecontrolcode
    广义预测控制的实现及程序代码和程序源代码的说明(Generalized predictive control code)
    2009-03-03 11:17:54下载
    积分:1
  • GUI_1
    matlab 读取操作图片,可以打开图片,改变其显示模式(matlab read operation picture, you can open the picture, and changing the display mode)
    2009-05-13 16:38:10下载
    积分:1
  • dist200
    一种用于模糊分类的距离测量的小程序,在模糊分类的C均值分类中使用。(a fuzzy classification for the measurement of the distance between the small procedures, in a vague category C classification means used.)
    2007-03-17 22:27:12下载
    积分:1
  • Matlab-time-frequency-anlysis-code
    时频分析工具箱中提供了计算各种线性时频表示和双线性时频分布的函数(Time-frequency analysis toolkit provides the calculation of linear time-frequency representation and bilinear time-frequency distribution function)
    2013-09-03 21:00:49下载
    积分:1
  • tiqu
    图像的颜色特征提取,通过选择合适的阈值,将对象从复杂背景中提取出来(Image color feature extraction, by selecting the appropriate threshold, the object is extracted from complex background)
    2013-11-14 09:38:55下载
    积分:1
  • matlabini
    MATLAB initiation for help you read it .
    2011-12-17 02:11:23下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • extractfields
    Function to separate fields from a video frame and (optionally) interpolate intermediate lines for each field.
    2010-10-15 19:04:23下载
    积分:1
  • find_yuanxin
    利用粒子群算法实现多边形的找圆心问题,对凸多边形适用。使用简便。(Particle swarm algorithm to find the center of the polygon problem, convex polygon apply. Easy to use.)
    2015-04-17 11:15:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载