登录
首页 » Visual C++ » solar_boost_inc

solar_boost_inc

于 2010-11-19 发布 文件大小:13KB
0 233
下载积分: 1 下载次数: 141

代码说明:

  是matlab程序,关于太阳能MPPT的三种不同方法的,自己可以调试一下看看,希望有用。(Matlab program is on three different solar MPPT methods, they can debug it and see, hope useful.)

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

发表评论

0 个回复

  • SEP-matlabe.m
    经典的SEP协议,代码完全正确,以及运行验证,对初学WSN路由协议的同学很有帮助。(Classic SEP protocol, the code is correct, and run the validation for beginner students WSN routing protocol is helpful.)
    2014-01-20 17:25:06下载
    积分:1
  • zq1
    说明:  太阳黑子的时间序列用最小二乘法模型定阶的C语言程序(Sunspot time series model using the least square method to determine the order of the C language program)
    2010-05-03 14:27:11下载
    积分:1
  • randomlib
    random library by mustiere
    2010-12-22 15:14:06下载
    积分:1
  • C1-
    应用于地震勘探领域的资料处理,第一代相干算法处理。(Used in seismic exploration in the field of data processing, the first generation of coherent algorithm processing.)
    2013-12-23 20:51:42下载
    积分:1
  • polynomial_lab
    Polynomial code in c++, contain differnet functions
    2013-01-19 20:00:10下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • bbbb
    用数组的方式求鞍点。开始时假设a[i][0]最大,将列号0赋给maxj保存,找出第i行中的最大者。。(With an array of ways for saddle point )
    2014-12-03 22:25:05下载
    积分:1
  • viterbi-3.0.1
    This file contains a C++ based source code for an optimized Viterbi decoder.
    2014-11-24 17:42:30下载
    积分:1
  • demod_2ask
    该程序实现2ask的解调,2ask解调C语言实现(The program 2ask demodulation, 2ask demodulation C language)
    2013-12-25 19:21:36下载
    积分:1
  • Basesss2
    FCM code source help you to execute an automatic seglentation using c++ language
    2014-08-30 07:02:29下载
    积分:1
  • 696518资源总数
  • 106242会员总数
  • 10今日下载