登录
首页 » Others » xinxindongtu

xinxindongtu

于 2019-06-27 发布
0 184
下载积分: 1 下载次数: 1

代码说明:

说明:  会跳动的红心,比较可爱版,可以编译上自己的名字(Beating hearts, lovely versions, can compile their own names)

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

发表评论

0 个回复

  • gamma
    与gamma函数和正态分布函数有关的三份资料,对深入理解和应用gamma函数有帮助。(Normal distribution function with the gamma function and the three relevant information on the in-depth understanding and application of gamma function is helpful.)
    2010-10-29 20:40:47下载
    积分:1
  • Color_Deblurring_ROF
    Color_Deblurring_ROF Color_Deblurring_ROF
    2011-10-14 15:20:53下载
    积分:1
  • 均匀线阵DOA估计Unitary -ESPRIT算法MATLAB
    均匀线阵DOA估计Unitary -ESPRIT算法MATLAB程序(Unitary -ESPRIT for ULA)
    2020-11-30 09:39:28下载
    积分:1
  • HYSY_981
    说明:  悬链线方程,初始估计锚链的最长和最短长度,用于锚泊系统初始设计(Catenary equation for initial estimation of the longest and shortest length of the chain for initial design of the mooring system)
    2019-11-09 10:54:58下载
    积分:1
  • Matlab
    该程序采用MATLAB软件编写,能够很好的实现快速傅里叶的频谱分析。(The program using MATLAB writing software, can achieve a good FFT spectrum analysis. )
    2011-11-08 10:58:14下载
    积分:1
  • edgefold
    edge fold function in communication
    2013-05-07 01:59:40下载
    积分:1
  • SSLSocketOutputStream
    ClassCompareTest extends AbstractComparatorTest Source Code for Andriod.
    2014-01-06 14:30:33下载
    积分:1
  • 8psk
    说明:  8PSK的源程序 matlab程序示例(8PSK source of the examples Matlab)
    2006-03-06 22:39:11下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • gsys
    可以具体地实现光栅衍射的衍射图样和强度分布,对衍射的研究有很大的帮助。(Can specifically diffraction grating diffraction pattern and intensity distribution of diffraction studies on a great help.)
    2010-08-09 17:15:37下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载