登录
首页 » FlashMX » homerbond

homerbond

于 2013-12-17 发布 文件大小:940KB
0 237
下载积分: 1 下载次数: 5

代码说明:

  Flash file animation Imitating a James bond presentation with homer simpson with a gun The homer s eye moves too A mask and combination of movements flash file

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

发表评论

0 个回复

  • Cluster-Validity
    Comparison and Evaluation of Different Cluster Validity
    2014-02-20 10:09:51下载
    积分:1
  • 粒子群算法
    说明:  粒子群算法进行寻优,可以修改粒子数,迭代数进行寻优。(Particle swarm optimization)
    2019-12-05 15:27:32下载
    积分:1
  • MATLAB6.0shuxueshouce
    matlab6.0的教材,有较详细的各种数学方法的matlab计算,例子可供参考!(matlab6.0 materials, there are more detailed methods matlab mathematical calculation, for example, for reference!)
    2008-03-18 17:53:34下载
    积分:1
  • DCDC
    DCDC仿真电路,boost,buck,boost-buck(DCDC circuit simulation)
    2014-09-16 13:53:11下载
    积分:1
  • psd
    本程序将时域数据转换为频域(功率谱密度),方便数据的处理和分析。(The program time-domain data is converted to the frequency domain (power spectral density), to facilitate the processing and analysis of data.)
    2020-12-16 16:09:14下载
    积分:1
  • DC_motor_Lag_PID
    speed control of dc motoer
    2010-07-07 15:10:17下载
    积分:1
  • channeleqlizer
    channel equalizer for wireless communication system
    2009-04-28 18:46:20下载
    积分:1
  • lsm
    说明:  递推最小二乘法,根据最小二乘法改变,可以辨识参数(LSM)
    2010-04-15 22:23:16下载
    积分: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
  • cv
    说明:  经典的图像分割算法CV模型,完整的matlab代码(digital image segment CV model codes)
    2014-11-27 17:31:43下载
    积分:1
  • 696516资源总数
  • 106913会员总数
  • 8今日下载