-
Lamb-wave
程序计算了压电铌酸锂薄板中Lamb波传播时的相速度(The program calculates the phase velocity of the piezoelectric thin lithium niobate when the Lamb wave propagation)
- 2014-08-20 22:11:40下载
- 积分：1
-
wave_jiangzao
该代码可以实现对非平稳水文序列的消噪处理(It may realize the elimination of noise in stochastic hydrological series.)
- 2015-01-22 11:07:20下载
- 积分：1
-
SRandCEinOCT
[IOVS]2011 Shadow Removal and Contrast Enhancement in OCT Images of the Human Optic Nerve Headl的实现matlab代码，医学图像增强([IOVS] 2011 Shadow Removal and Contrast Enhancement in OCT Images of the Human Optic Nerve Headl realization of matlab code medical image enhancement)
- 2013-11-14 19:08:38下载
- 积分：1
-
capon
该matlab代码描写的是波束成形算法中的Capon算法的具体实现(The matlab code describing the concrete implementation of the Capon beamforming algorithm algorithm)
- 2014-02-23 17:37:08下载
- 积分：1
-
脉搏波消除基线漂移
说明： 脉搏波去除基线漂移程序，也可尝试应用于其他生理信号的基线漂移。(The program of removing baseline drift of pulse wave, which can also be applied for other physiological signals.)
- 2021-05-22 13:30:02下载
- 积分：1
-
image
彩色活动轮廓模型,活动轮廓模型,图像分割，活动轮廓模型(Color active contour model, active contour model, image segmentation, active contour model)
- 2009-03-19 19:52:02下载
- 积分：1
-
nn2
continue for system identification
- 2011-08-26 16:07:31下载
- 积分：1
-
基于matlab平台的LTE系统级仿真
基于matlab平台的LTE系统级仿真 维也纳大学的开源代码(Matlab-based LTE system-level simulation platform)
- 2014-06-07 11:05:50下载
- 积分：1
-
Waveletedenoisingandmatlabapplication
小波去噪理论及MATLAB实现研究，里面含有理论及算法程序(Wavelete denoising and matlab application)
- 2010-12-24 13:25:08下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
|
联系客服（QQ：3324461878）
