-
solvingequation
加步探索法，二分法,黄金分割法,抛物线插值法求解方程的演示(Plus step-by-step exploration of law, black-and-white, golden section method, the parabolic interpolation method for solving equations of presentation)
- 2009-06-28 10:18:42下载
- 积分：1
-
unit-commitment-problem--5-machine-
采用拉格朗日算法求解机组组合问题，采用的是5机系统(Lagrange algorithm for unit commitment problem, 5 machine system)
- 2021-04-20 15:18:51下载
- 积分：1
-
模糊指数平滑
说明： 模糊指数平滑算法源程序,进行预测 计算.(fuzzy exponential smoothing algorithm source for projection.)
- 2005-09-04 23:32:05下载
- 积分：1
-
SDEshuzhiqiujie
随机微分方程求解的一个很好的参考资料，算是比较基础的，深入浅出(Stochastic differential equations of a good reference, as a relatively basic, easy to understand)
- 2014-05-28 22:37:50下载
- 积分：1
-
1_2_3维均值聚类
说明： 简单地实现了一、二、三维的K均值聚类，效果还不错，适合初步学习模式识别的同志们(Simple implementation of one, two, three - dimensional k-means clustering, the effect is not bad, it is suitable for the initial learning pattern recognition comrades)
- 2020-07-02 04:00:01下载
- 积分：1
-
mcml-src
美国汪利宏的蒙特卡洛及卷积模拟程序，可以模拟top-hat光束和高斯光束在生物组织中的传输(U.S. WANG Li-hong of the Monte Carlo and convolution simulation program can simulate the top-hat beam and Gaussian beam transport in tissue)
- 2021-04-11 21:38:57下载
- 积分：1
-
code
ABAQUS渐近损伤 用于分析层合板渐近损伤 包含刚度折减(progresive damage)
- 2016-04-05 11:19:51下载
- 积分：1
-
split_step_fourier_method
说明： 使用分布傅立叶法计算非线性薛定谔方程。可以得到光纤非线性传输特性。(Fourier method using the distribution of nonlinear Schr枚dinger equation. Can be non-linear optical transmission characteristics.)
- 2008-10-14 09:34:16下载
- 积分：1
-
经典99行拓扑优化程序
经典99行拓扑优化程序，采用Heaviside方程获得接近0-1离散解(The classical 99-line topology optimization program uses Heaviside equation to obtain nearly 0-1 discrete solution)
- 2020-06-20 00:00:02下载
- 积分：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
