登录
首页 » matlab » Roscoe-PMU

Roscoe-PMU

于 2013-11-08 发布 文件大小:751KB
0 225
下载积分: 1 下载次数: 33

代码说明:

  P and M class PMU examples for MATLAB

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

发表评论

0 个回复

  • sanxiang
    本程序的功能是用支路追加法求阻抗矩阵,再用三相短路计算短路电流和电压(The function of this procedure is to use branch supplementary method for impedance matrix, with a three phase short circuit calculation of short circuit current and voltage)
    2015-01-09 13:26:11下载
    积分:1
  • robot
    实现机器人动态收敛(多点收敛),GUI界面,机器人个数自行设定,AVI生成,动态仿真!(Robot dynamic convergence (convergence of multi-point), GUI interface, the number of robots on their own set, AVI generation, dynamic simulation! )
    2012-01-05 12:40:29下载
    积分:1
  • BCT
    brain connectivity toolbox,生成随机网络(brain connectivity )
    2013-05-22 20:34:47下载
    积分:1
  • IEEE30BusSystemCDF
    说明:  bus system data for matlab code
    2020-06-21 20:00:02下载
    积分:1
  • 3D-Harris-corner-detector
    基于时空兴趣点的3d harris角点检测代码,matlab编写方式(3D Harris corner detector)
    2011-08-30 17:30:45下载
    积分:1
  • BP_water_retrive
    通过bp神经网络,读取水深和多光谱遥感图像的dn值,实现水深的反演功能(Bp neural network, read dn value of the water depth and multi-spectral remote sensing image inversion function of water depth.)
    2020-12-20 16:19:09下载
    积分:1
  • GPSmatlabs
    matlab file for gps
    2013-12-21 06:36:59下载
    积分:1
  • MAP
    卷积码的最大后验概率译码算法的一个验证matlab算法,必有注释。(Convolutional codes of maximum a posteriori probability decoding algorithm matlab an authentication algorithm, there is the Notes.)
    2007-09-11 21:04:16下载
    积分:1
  • M
    说明:  字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
    2013-11-29 14:28:52下载
    积分:1
  • L01p_e
    [x,f]= L01p_e(c,A,b,N)用枚举法求解下列 0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式,N= 0时可以省略。 返回结果x是最优解,f是最优解处的函数值。 ([X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.)
    2013-07-16 21:51:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载