登录
首页 » Visual C++ » VC-code

VC-code

于 2015-04-14 发布 文件大小:539KB
0 280
下载积分: 1 下载次数: 13

代码说明:

  LBM 初学者的资料,模拟的各个部分都有很详细的分析(this is the materials for the freshman of LBM study,it is good tool)

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

发表评论

0 个回复

  • bp
    说明:  基于MATLAB完成的神经网络源程序,可以利用该程序完成有关神经网络的应用。(MATLAB based on the completion of the neural network source code, you can use the program to complete the neural network applications.)
    2009-02-12 13:54:26下载
    积分:1
  • AMQexamples
    ActiveMQ CPP 使用示例。ActiveMQ 是Apache出品,最流行的,能力强劲的开源消息总线(ActiveMQ CPP example)
    2014-01-06 11:22:28下载
    积分:1
  • EBCGLView
    EBCGLView.GLData调用 On Error GoTo HERROR Dim obj As EBCGLView.GLData Dim retObj As Object(EBCGLView.GLData call On Error GoTo HERROR Dim obj As EBCGLView.GLData Dim retObj As Object)
    2015-03-23 21:57:39下载
    积分:1
  • qstoolbox
    该代码为排队论工具.用于MM1,MG1等模型. (code for the queuing theory tools. For MM1, genotoxicity and other models.)
    2007-01-16 19:53:20下载
    积分:1
  • MATLAB-PDE-Toolbox
    MATLAB PDE Toolbox了解学习,有个更生层次的认识(MATLAB PDE Toolbox MATLAB PDE Toolbox)
    2013-04-09 22:07:24下载
    积分:1
  • CPN
    cpn算法例程,主要用c++实现,分两层实现,等等,自己看吧,(CPN algorithm routines, the main c++ achieved, divided into two levels to achieve, and so on, their own look,)
    2008-12-16 11:06:32下载
    积分:1
  • LEAC-txt
    wsn经典路由算法,对于初学者很有借鉴意义(Classic WSN routing algorithm for beginners is of great significance)
    2012-09-26 21:22:47下载
    积分:1
  • ISAR
    生成rcs数据,通过此段代码进行isar成像(isar imaging)
    2020-11-17 12:59:41下载
    积分:1
  • queue
    排队买饭程序:利用队列实现,可以有好朋友一起排队。(Queuing to buy food program: the use of queues to achieve, you can have friends lined up together.)
    2014-01-11 21:28:30下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载