登录
首页 » matlab » case9

case9

于 2010-07-06 发布 文件大小:1KB
0 110
下载积分: 1 下载次数: 13

代码说明:

  这是一个基于电力系统九节点的潮流计算的软件包(This is a power system based on nine nodes of the package flow calculation)

文件列表:

case9.m,1651,2007-09-17

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

发表评论

0 个回复

  • MRFexercise
    Training software for Markov Random Fields used at INRA
    2011-01-05 21:54:28下载
    积分:1
  • Matlab++
    MATLAB曲面拟合(注:本例参考他人)(MATLAB surface fitting (Note: in this case a reference to others))
    2008-08-08 11:42:44下载
    积分:1
  • myshift
    在瑞利信道下的,时延估计算法,进行的简单仿真,可执行,有图。(Under the Rayleigh channel, the delay estimation algorithm for a simple simulation, executable, Fig.)
    2012-05-02 16:43:32下载
    积分:1
  • minzf
    使用matlab编程实现了凤凰传奇的音乐《最炫民族风》。(use the matlab realize the music of 最炫民族风)
    2012-08-15 16:59:44下载
    积分:1
  • LOGO_05_GL
    Solving Travelling salesman problem for that 2-opt moves solved in Lenux
    2015-02-04 02:16:22下载
    积分:1
  • unr
    随机数演示程序,可以产生均匀分布,正态分布和瑞利分布的随机数,并画图表示。(Random Number demo program can generate uniformly distributed random lognormal distribution and rayleigh, and drawing representation.)
    2016-05-06 19:45:34下载
    积分:1
  • DTMF1
    matlab code for DTMF
    2010-07-26 18:13:29下载
    积分:1
  • HW4
    产生母婴心电信号图,程序简单易懂, 欢迎分享下载(Maternal and baby ECG signal, simple one,hope can help somebody)
    2011-11-07 01:36:53下载
    积分:1
  • QAM16
    QAM16在通信系统中是一种简单的调制方式,可以提高频谱利用率,该程序可以恢复QAM16的星座图(QAM16 in a communication system is a simple modulation, spectral efficiency can be improved, the program can resume constellation QAM16)
    2013-11-30 22:07:32下载
    积分:1
  • DTW
    DTW算法的程序,申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划,为每个格点 (i,j)都计算其三个可能的前续格点的累积距离D1,D2,D3。考虑到边界问题,有些前续格点可能不存在,因此加入一些判断条件最后利用最小值函数min(),找到三个前续格点的累积 距离作为累积距离,与当前帧的匹配距离d(i,j)相加,作为当前格点的累积距离。该计算过程一直达到格点(n,m),并将D(n,m)输出,作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)
    2014-05-05 14:30:21下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载