-
Circuit_Analysis_II_with_MATLAB
Circuit Analysis II with MATLAB
- 2009-05-01 20:57:41下载
- 积分:1
-
Creat_Betweenness
可用来计算复杂网络的介中性,分析网络特性(Calculate the dielectric neutral network)
- 2014-09-30 08:35:30下载
- 积分:1
-
corwatermark
基于扩频技术的数字水印matlab源代码。大家共享之(Spread-spectrum technology based on digital watermarking matlab source code. U.S. share of)
- 2007-10-09 17:44:30下载
- 积分:1
-
recognize
this matlab program recognises the given telugu character and gives the corrsponding iscii code
- 2010-08-18 15:31:06下载
- 积分:1
-
gui
this is the example for matlab GUI
- 2011-08-13 08:44:37下载
- 积分:1
-
aitkenInterp
AITKEN S INTERPOLATION
Aitken s procedure yields systematically and successively better interpolation polynomials corresponding to successively higher order truncation of Newton s divided difference formula.
Given a set of x and corresponding f(x), estimate f1(x1)
f1= aitkenInterp(x,f,x1)
f = corresponding function of x
f1= corresponding function of x1
- 2012-10-11 19:37:49下载
- 积分:1
-
PDFofQuess
高斯独立同分布的mimo信道环境下,对协方差矩阵R的个元素的概率密度函数的统计(PDF of R under Quess Channel)
- 2009-11-06 23:04:45下载
- 积分:1
-
matlabyinqingwithc++.cpp
利用VC++6.0集成编程界面编写综合运用MAT数据文件和MATLAB引擎技术的(求矩阵的奇异值)C++源码程序。本程序说明了:1.如何利用VC++6.0集成编程界面编写源码程序;2.编译链接产生EXE文件所需的间夹文件。注意:要将压缩包内除matlabyinqingwithc++.cpp的所有文件都要拷贝到matlabyinqingwithc++.cpp的“任务文件夹下”。(Use VC++ 6.0 integrated programming interface MAT preparation of comprehensive use of data files and MATLAB engine technology (the singular value matrix) C++ Source procedures. This procedure describes: 1. How to use VC++ 6.0 integrated programming interface to prepare source procedures 2. Compiler generated EXE file the necessary link between the document folder. NOTE: In addition to compression packages matlabyinqingwithc++. Cpp must copy all the files to matlabyinqingwithc++. Cpp s mission folder. )
- 2008-06-24 11:38:00下载
- 积分:1
-
Topology-of-WSN
节点定位,仿真节点邻近关系图。通信模型。(Node location, the simulation node neighboring relation diagram. The communication model.
)
- 2012-04-24 12:36:41下载
- 积分:1
-
GRASP
贪婪随机自适应搜索法(GRASP),使用随机化的最小最小完成时间算法来产生问题的初始解,再通过变邻域下降算法来改进这个解。(Greedy randomized adaptive search method (GRASP), the minimum use of randomized algorithm to generate the minimum completion time of the initial solutions of the problem, and through the variable neighborhood descent algorithm to improve the solution.)
- 2021-02-09 12:49:53下载
- 积分:1