登录
首页 » matlab » 风电场并网的潮流计算

风电场并网的潮流计算

于 2019-11-25 发布
0 242
下载积分: 1 下载次数: 13

代码说明:

说明:  风电场并网的潮流计算,考虑了风电不确定性(The uncertainty of wind power is considered in the power flow calculation of wind power grid connection)

文件列表:

风电场并网的潮流计算.doc, 43520 , 2019-03-09

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

发表评论

0 个回复

  • YALL1
    利用ADMM算法进行压缩感知重建,内部含有多个版本(Using ADMM algorithm for compressed sensing reconstruction, the internal contains multiple versions)
    2021-05-14 10:30:02下载
    积分:1
  • 6502汇编器 要将6502汇编语言源文件汇编成二进制文件
    6502汇编器 要将6502汇编语言源文件汇编成二进制文件-Assembler 6502 to 6502 assembly language source files compiled into binary files
    2022-02-04 11:13:11下载
    积分:1
  • Corm-oneself
    NET Core+EF Core实例,自己使用了,很好,没有问题(NET Core+ EF Core instance, oneself use, is very good, no problem)
    2017-03-15 16:03:11下载
    积分:1
  • 晟矽微资料
    国产MCU开发工具,以及demo文件,给一些做家电或者智能设备的人员学习参考用(Domestic MCU development tools, as well as demo files)
    2017-08-31 22:53:24下载
    积分:1
  • Floyd算法,推荐
    Floyd算法,推荐-Floyd algorithm, recommended clamor clamor clamor clamor clamor
    2022-06-12 15:50:27下载
    积分:1
  • hie-qt27
    基于小波变换的数字水印算法matlab代码,实现典型相关分析,表示出两帧图像间各个像素点的相对情况。( Based on wavelet transform digital watermarking algorithm matlab code, Achieve canonical correlation analysis, Between two images showing the relative circumstances of each pixel.)
    2017-04-01 19:22:58下载
    积分:1
  • PESQ
    说明:  语音增强的评价指标PESQ的matlab实现(Realization of speech enhancement evaluation index PESQ based on MATLAB)
    2021-04-20 19:18:50下载
    积分:1
  • Find prime numbers prepared by screening the function: void sieve (bool isPrime...
    编写筛选查找素数函数: void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组,n为数组大小。由于2是第一个素数, 所以设置isPrime[0]和isPrime[1]的值为false,并设置其余的元素初值为true。 然后对从4到n-1的每一个i,判断i是否能够被2整除,如果i能够被2整除,则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理,当操作结束时,所有值为true的isPrime[i]所对应的i就是素数,它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
    2023-03-02 04:45:03下载
    积分:1
  • Delphi书籍
    说明:  压缩包里面是一些 delphi 书籍,可以下载看看(Some book for delphi,you can download see it .)
    2020-04-21 10:59:09下载
    积分:1
  • LKS
    基于Carsim和simulink实现车道保持(Lane keeping based on Carsim and Simulink)
    2018-08-10 14:49:12下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载