登录
首页 » Visual C++ » psat-new-version

psat-new-version

于 2011-04-19 发布 文件大小:1629KB
0 302
下载积分: 1 下载次数: 5

代码说明:

  潮流计算 潮流计算潮流计算潮流计算潮流计算潮流计算(FLOW )

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

发表评论

0 个回复

  • xiliepingshun
    求解系列重型商用车的平顺性,求解结果收敛性良好。(Solving a series of heavy commercial vehicles, ride comfort, and solving the resulting convergence is good.)
    2012-08-15 11:42:01下载
    积分:1
  • MATLAB-IMAGE
    matlabr软件应用的图形图像处理,很专业的教材,事例很多(matlabr graphic image processing software applications, very professional materials, many examples)
    2013-11-22 17:25:08下载
    积分:1
  • Real-time-O(1)-Bilateral-Filtering
    本代码是Real-time O(1) Bilateral Filtering,也就是常数时间复杂度的双边滤波器,它对于很多其他算法有着很大的作用。对应论文就是Real-time O(1) Bilateral Filtering。亲自编译运行通过(It is the C++ code of Real-time O(1) Bilateral Filtering, that is, constant time complexy bilateral filtering, it is vitally useful for other algorithams. The responding paper is Real-time O(1) Bilateral Filtering. It is execuable.)
    2015-01-09 10:13:34下载
    积分:1
  • Matlab
    暑期matlab大作业 通信系统仿真大作业(Summer matlab great job communication system)
    2013-12-21 19:31:58下载
    积分:1
  • 采用遗传算法及改进的遗传算法进行配电网故障的定位
    采用遗传算法及改进的遗传算法进行配电网故障的定位 (Genetic Algorithm algorithm for fault location of distributionnetworks)
    2012-04-20 19:17:03下载
    积分:1
  • sift
    这是一个关于SIFT算法介绍的pdf和ppt的合集,可以很好地帮助初学者了解sift算法。(中英文都有)(This is a collection of pdf and ppt about SIFT algorithm. I believe it can greatly help beginners to understand SIFT algorithm.)
    2012-04-29 21:13:46下载
    积分: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
  • biot
    用于多孔介质中波的传播,分析波的传播速度随入射角的变化,消除频散的特性(wave propogation in porous media)
    2014-06-18 11:59:07下载
    积分:1
  • PROGRAMMATION-cPP-et-genie-logiciel
    book to learn Visual c++ and logiciel
    2014-02-19 12:13:40下载
    积分:1
  • SBOCCrare
    几个BOC 信号的分析例程,全球卫星导航系统将普遍使用BOC调制信号作为扩频测距信号,BOC信号号自相关函数呈现多个相关峰,传统扩频接收机所用的延迟锁定环(DLL)无法对该信号正确地进行码相位的 (Several BOC signal analysis routines, the global satellite navigation system will generally use the BOC modulation signal as a spread spectrum ranging signal, BOC signal autocorrelation function presents multiple correlation peaks, the traditional spread spectrum receiver with the delay locked loop (DLL ) can not be the signal code phase)
    2012-08-20 14:37:00下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载