资源列表
sdica
- 硕博美国留学的中科大本科毕业的研究独立分量分析的一位牛人编写的子带ica的matlab程序。研究盲源分离的必备。-USTC graduated Shuobo study in the United States of an independent component analysis cattle were prepared subband ica matlab program. Study the blind source separation essential.
Interpolation
- 频谱的比值校正，汉宁、矩形、海明窗的具体算法，原理等，比较详细的分析程序-spectrum correction
OpenTSTOOL_win
- OpenTSTOOL_win，时间序列工具箱。里面包含用来编程的两个时间序列，让大家更加容易学习。-OpenTSTOOL_win, time series toolbox. Which contains two time series used to programming, easier to learn.
ICALABIPv2_0
- 独立分量分析工具，ICAlab，可以对了解独立分量分析的具体操作。-Independent component analysis tools, ICAlab, specific actions can understand the independent component analysis.
dlinerint
- 超强算法，一种数值估计的算法，很好用哦，是关于二元插值计算的例程-Powerful algorithm, a numerical estimation algorithm Oh well, it is calculated bivariate interpolation routine
gravity
- function dg=gplus(x,y,z,x1,x2,y1,y2,z1,z2,p) G=6.67e-11 t222=myfun(x,y,z,x2,y2,z2) t122=myfun(x,y,z,x1,y2,z2) t212=myfun(x,y,z,x2,y1,z2) t221=myfun(x,y,z,x2,y2,z1) t211=myfun(x,y,z,x2,y1,z1) t121=myfun(x,y,z,x1,y2,z1) t112=myfu
Sellmeier
- 计算光纤中的材料色散和波导色散的matlab程序-Calculation of the fiber material dispersion and waveguide dispersion matlab program
jieyue-signal
- 阶跃信号与正弦信号调制，在同一张图纸上绘制四个子图。这是一个很基础的编程应用。-Step signal with a sinusoidal signal modulation, drawn with a drawing on four subgraphs. This is a very basic programming application.
FiniteD
- The aim of this assignment is to use the Finite Difference Method to numerically determine the transverse electromagnetic (TEM) transmission line (TL) parameters of a line with a coupled ribbon shaped cross-section. To achieve this, a computer
PHEAP
- 联通图G的一个子图如果是一棵包含G的所有顶点的树，则该子图称为G的生成树 生成树是联通图的极小连通子图。所谓极小是指：若在树中任意增加一条边，则 将出现一个回路；若去掉一条边，将会使之编程非连通图。生成树各边的权 值总和称为生成素的权。权最小的生成树称为最小生成树，常用的算法有prime算法和kruskal算法。 -Unicom graph G is a subgraph of G is the one that contains all the vertices of the tree,
PEDGE
- prime算法实现的另一算法，针对不同类型的不同实现，比较清晰-prime algorithm in another algorithm, for different types of
MST
- prime算法的基本思想 1.清空生成树，任取一个顶点加入生成树 2.在那些一个端点在生成树里，另一个端点不在生成树里的边中，选取一条权最小的边，将它和另一个端点加进生成树 3.重复步骤2，直到所有的顶点都进入了生成树为止，此时的生成树就是最小生成树-The basic idea of the prime algorithm. Empty spanning tree, take any a vertex joined spanning