-
Numerical_Analysis_Using_MATLAB_and_Excel_Third_E
Analysis Using MATLAB® and Excel® Steven T. Karris Third Edition.
- 2009-12-30 02:09:48下载
- 积分:1
-
Spreading-code-matlab
m序列生成和抽取,Gold码和kasami序列生成,三种序列子相关,互相性能分析等。程序完整,注释清楚,报告详细。(m sequence generation and extraction, Gold codes and kasami sequence generation, all three sub-sequences related to each other performance analysis. Program integrity, comments clear, the report detailed.)
- 2021-04-22 18:58:48下载
- 积分:1
-
TV-demo
Total Variation Denoising(TV denoising (scalar fidelity term) [ROF92]
Reduces the total-variation of the image. Filters out noise while preserving edges. Textures and fine-scale details are also removed. In this demo the assumption is that a white Gaussian noise is added with a-priori known (or estimated) noise power (variance). The fidelity term to the input image is calculated automatically so that the power of the noise is reduced.
)
- 2011-05-23 23:44:43下载
- 积分:1
-
dataSFLA
通过现实数据集对混合蛙跳算法SFLA聚类性能进行评测,得到图示说明算法性能。(Real data set by clustering performance evaluation of SFLA to get illustrates algorithm performance.)
- 2011-11-08 22:26:26下载
- 积分:1
-
my_2017pow_sixpulses
this is a simulation matlab/simpowersysterm file forsix pulse converter
- 2017-01-20 21:23:27下载
- 积分:1
-
diffnorm
Computer programming to calculate normalized frequency for different types of optical fibers.
- 2010-06-06 17:09:20下载
- 积分:1
-
original_PSO
利用基本粒子群优化算法,使用matlab工具,求解Rastrigrin函数。(using particle swarm optimization algorithm, the use of Matlab tool Solving Rastrigrin function.)
- 2006-10-21 15:02:21下载
- 积分:1
-
3
Solves coal gasification problem in matlab
- 2013-10-24 22:18:50下载
- 积分:1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。
bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分:1
-
review
some related work in image processing.
- 2007-03-27 14:07:24下载
- 积分:1