-
yuyin
说明： 对音频信号进行处理。实现变速不变调。变调不变速。男声变女声。内有实例音频文件(The audio signal processing. Adjusted to achieve the same speed. Tone does not shift. Male Female change. There are instances of audio files)
- 2011-03-14 10:55:27下载
- 积分：1
-
polynomial_multiplication
实现多项式相乘求模运算，并且模多项式是可以改变的，方便，简单(To achieve polynomial multiplication modulo operation, and polynomial model can be changed, convenient and simple)
- 2010-06-25 21:11:57下载
- 积分：1
-
two-FVM
本程序是采用有限体积法求解二维对流扩散方程的经典程序。程序里包含各种离散方法，划分网格方法等。适合CFD初学者阅读。(The program is two-dimensional finite volume method for solving convection-diffusion equation of the classic program. Program includes a variety of discrete methods, meshing methods. CFD for beginners)
- 2021-03-23 00:19:15下载
- 积分：1
-
SIMPLER
simple 算法，有详细步骤，几乎步都自带注解，很好理解。(simple algorithm detailed steps to bring their own annotations)
- 2021-01-26 15:28:41下载
- 积分：1
-
mathmathodbyClanguage
说明： 常用算法的c语言实现，包括一些经典的比如，最小二乘，插值与逼近等等！(Commonly used algorithm c language, including some classic example, least squares, interpolation and approximation, etc.!)
- 2008-09-18 15:45:21下载
- 积分：1
-
最小二乘
递推最小二乘法，辨识模型参数。。。。。。。。。(Least square method model identification)
- 2018-05-04 08:38:57下载
- 积分：1
-
ActivdeSet
有效集法利用数学规划的对偶理论,将所求双层规划转化为一个下层只有一个无约束凸二次子规划的双层规划问题.然后根据两个双层规划的最优解和最优目标值之间的关系,提出一种简单有效的算法来解决非增值型凸二次双层规划问题.(Quadratic Bilevel Programming )
- 2009-10-05 22:08:44下载
- 积分：1
-
naca0012
NACA0012翼型流场计算。结构化网格，AUSM格式。(NACA0012 airfoil flow field)
- 2011-05-03 20:37:12下载
- 积分：1
-
spline
样条插值算法的matlab代码，包括一次样条插值，二次样条插值和三次样条插值，可根据需要选择(Spline interpolation algorithm matlab code, including a spline interpolation, quadratic spline interpolation and cubic spline interpolation, can be selected)
- 2020-12-23 20:49:06下载
- 积分：1
-
hartigansSLC_OpenCV
hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1)
Sequential Leader algorithm:
Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY.
1. Select maximum cluster "radius"
2. Start with zero clusters
3. Add each item to be clustered to:
* Closest cluster if distance <= r
* New cluster if distance to closest cluster > r
4. Compute new center from members in cluster
5. Empty the clusters (keeping the centers)
6. Return to step 3 (until no changes are made)
- 2010-02-25 19:28:25下载
- 积分：1
