登录
首页 » Visual C++ » antparset

antparset

于 2014-11-18 发布 文件大小:58KB
0 260
下载积分: 1 下载次数: 1

代码说明:

  Spatial Channel model examples

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

发表评论

0 个回复

  • pls
    一个PLS的matlab程序,包括求残差矩阵求回归方程的系数,删除回归分析的常数项,求误差平方和。(A PLS matlab procedures, including seeking residual matrix coefficients of the regression equation, deleted regression constant term, seeking the error sum of squares.)
    2013-05-24 08:50:48下载
    积分:1
  • ica_for_pid_design
    ica for pid design project
    2014-09-15 02:03:04下载
    积分:1
  • matlab
    这是一个电力系统无功优化的MATLAB程序,在MATLAB7上已调试通过,其实例节点有点少,可对其进行改进(This is a reactive power optimization of MATLAB procedures have been debug MATLAB7 passed, the example of a little less nodes may improve their)
    2007-12-26 15:20:33下载
    积分:1
  • matlab-fluent-heat-con
    matlab求解热传导方程的几个例子,有注释,适合初学者(matlab solving a few examples of the heat conduction equation, with notes, suitable for beginners)
    2012-05-22 17:04:00下载
    积分:1
  • GPIBK2306TEST
    利用GPIB接口控制K2306上下电,电压5V。(The control of K2306 electric interface using GPIB, voltage 5V. )
    2015-04-13 15:29:47下载
    积分:1
  • shuzituxiang
    这个程序自己编写的,可以实现简单的图像的二值化和均衡化(The procedures, can achieve a simple picture of the value of two and equalization)
    2014-11-03 15:30:18下载
    积分:1
  • bbb
    用matlab实现三次NURBS插值曲线拟合,插值源程序(Using matlab to achieve Cubic NURBS interpolation curve fitting, interpolation source)
    2011-08-17 15:50:34下载
    积分:1
  • MCT2008-for-ges
    固高所有GE运动控制卡的DEMO软件,用来测试板卡是否正常工作(Googol all GE motion control card DEMO software, used to test the board is working correctly)
    2014-11-19 12:23:25下载
    积分:1
  • OOhandling
    object oriented handling example
    2014-02-01 11:51:01下载
    积分: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
  • 696518资源总数
  • 105877会员总数
  • 14今日下载