登录
首页 » matlab » maain

maain

于 2015-02-07 发布 文件大小:40KB
0 202
下载积分: 1 下载次数: 35

代码说明:

  matlab code for Smart Grid

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

发表评论

0 个回复

  • c
    说明:  This mfile change the place of a picture that included of 4 pictures that they are in it.
    2010-10-03 21:58:05下载
    积分:1
  • DBE
    聚类重要步骤,利用数据之间的相似度自适应确定类别数(decide adaptive number of classes using similarity)
    2013-09-24 22:27:58下载
    积分:1
  • MATLAB-for-Engineers-3rd-ed.---H
    eBook on Matlab for Science Engineers.
    2013-10-31 02:43:02下载
    积分:1
  • delphi2
    delphi与matlab混合编程研究 (delphi with matlab Mixed Programming)
    2011-02-06 21:57:12下载
    积分:1
  • Quadrature-Component-Analysis
    干涉图的正交分析."Quadrature Component Analysis for Interferometry".(This software shows the performance of the algorithm proposed in the paper: "Quadrature Component Analysis for Interferometry".)
    2013-11-26 15:09:45下载
    积分:1
  • zhuangjiaPID
    专家PID程序主要是针对受控对象和各种规律已知情况的一种智能程序(Expert PID program is mainly directed against the known laws of the controlled object and a variety of circumstances an intelligent process)
    2011-04-20 08:47:22下载
    积分:1
  • matlabyuanchengxu
    matlab 2007R基础教程 清华大学版 书上一部分题目的源程序源程序(matlab 2007R Essentials version of Tsinghua University as part of the book title of the source source)
    2011-06-12 09:49:08下载
    积分:1
  • siftdescriptormatlab
    this function returns the SIFT descriptors DESCR of the SIFT frames P defined on the octave G of the Gaussian scale space.
    2011-10-09 14:25:51下载
    积分:1
  • MATLAB-fangzhenjihsuyuyingyongshucai
    matlab仿真技术与应用实例,书中的例子,仿真的matlab的m文件。(matlab simulation technology and application examples, the book' s examples, simulation matlab m-file.)
    2013-09-12 15:38:41下载
    积分:1
  • Centrality-measures
    文件包括:1.计算平均最短路径;2.计算每个顶点相邻节点的平均度;3.计算每个节点的邻近中心度;4.计算节点的介数(slow);5.计算节点的介数(faster);6.计算每条边的介数值;7.快速迪杰斯特拉算法;8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)
    2021-04-23 19:38:47下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载