登录
首页 » matlab » upfc11

upfc11

于 2011-09-13 发布 文件大小:87KB
0 274
下载积分: 1 下载次数: 47

代码说明:

  unified power flow controller

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

发表评论

0 个回复

  • multi-prac2
    experiments for multimedia lab
    2011-04-20 04:11:17下载
    积分:1
  • 关于IEEE-6、14 30节点系统IEEE
    关于IEEE-6、14 30节点系统很实用的,经过运行可靠MATLAB程序上的潮流计算(power flower)
    2021-04-06 09:29:03下载
    积分:1
  • Multi-Instance
    Multi-Instance Learning matlab code
    2013-09-24 15:00:08下载
    积分:1
  • stepwise
    多元统计分析中用于判别的逐步判别法,用于筛选变量,剔除多余变量的逐步判别的matlab程序(Multivariate statistical analysis for discriminant stepwise discriminant method for screening variables, stepwise discriminant eliminate redundant variables matlab program)
    2012-12-25 09:41:53下载
    积分:1
  • Matlab_function_s
    一些matlab底下的小函数,详细见索引。直接解压,不用密码。(under Matlab some small function, see detailed index. Direct unpack, without a password.)
    2006-07-06 05:58:15下载
    积分:1
  • huiduzhifangtu
    灰度共生矩阵和灰度梯度共生矩阵的提取方式,是比较重要的纹理特征提取方法,用matlab实现的(The GLCM and gray gradient co-occurrence matrix extracted, texture feature extraction method, using matlab to achieve)
    2013-04-02 19:26:27下载
    积分:1
  • A_Guide_to_MATLAB_for_Beginners_and_Experienced_U
    A guide to using MATLAB for beginners and experienced users
    2010-12-05 23:56:53下载
    积分:1
  • 111
    function pi = solve2(count,m,cc) 借助布冯投针实验 仿真求pi的值 pi=0 frq=0 randNo = binornd(1,cc,1,m) pro=zeros(1,count) for j=1:count for i = 1:m if randNo(1,i) == 1 frq = frq + 1 end pro(i) = frq/i end pi = (2*m)/frq pro(j) = pi end pro = pro,num =1:count plot(num,pro) (function pi = solve2 (count, m, cc) to vote with Buffon needle experiment simulation find the value of pi pi = 0 frq = 0 randNo = binornd (1, cc, 1, m) pro = zeros (1, count) for j = 1: count for i = 1: m if randNo (1, i) == 1 frq = frq+ 1 end pro (i) = frq/i end pi = (2* m )/frq pro (j) = pi end pro = pro, num = 1: count plot (num, pro) )
    2011-05-24 15:39:41下载
    积分:1
  • PCMcode
    实现通信原理上的PCM(脉冲编码调制)调制与解调等 功能(MATLAB PCM)
    2009-12-17 14:15:40下载
    积分:1
  • HanoiFolder
    Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are allowed only if they place smaller disks on top of larger disks
    2015-02-05 20:49:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载