-
SP_d
利用Dijkstra算法计算最短有向路小程序(Dijkstra algorithm using the shortest way there is a small program to)
- 2011-06-14 16:00:28下载
- 积分:1
-
uhard
用ABAQUS及其子程序解决热冲压热力耦合问题(Subroutine with ABAQUS and hot stamping coupled thermal problem solving)
- 2021-03-29 08:49:11下载
- 积分:1
-
yantubbs-cam-model
修正剑桥模型在不排水条件下的源程序,很有用,是最近做项目是研究的课题。(cambridge with fortran)
- 2020-12-21 10:09:08下载
- 积分:1
-
DXSNH
基于最小二乘的多项式拟合法的GPS周跳探测程序(Based on the least square polynomial fitting method of GPS cycle slip detection program
)
- 2021-02-14 10:49:49下载
- 积分:1
-
EFG
这是一个有关解二维弹性板的无网格EFG程序matlab源代码,是学习无网格法入门的必学程序!(This is a solution of two-dimensional elastic plate meshless EFG process matlab source code, is a meshless method to study entry procedures must!)
- 2008-03-19 15:56:00下载
- 积分:1
-
VBA简介
微波仿真论坛下载的一位版主的稿子,有图有例子,手把手教你学习关于CST中的高级语言设计(CST-VBA,The CST STUDIO SUITE tools can be controlled from a Visual Basic (VBA) script. The language of the built in BASIC interpreter is almost 100% compatible with the Visual Basic for Application language. This language may be used either for creating own structure libraries or for the automation of common tasks)
- 2017-06-12 08:43:54下载
- 积分:1
-
yinshigaosi_method
隐式高斯法求解三相不平衡配电网的潮流计算,很实用,欢迎下载。(Implicit Gaussian method for solving three-phase unbalanced load flow calculation of the distribution network, very practical, welcome to download.)
- 2021-05-07 21:31:35下载
- 积分:1
-
Viscoelastic
粘弹正演程序和模型实例,2维数值模拟正演,适应于粘弹介质,(This program can be two-dimensional numerical simulation of acoustic wave equation, Viscoelastic isotropic media.)
- 2013-12-09 15:07:58下载
- 积分:1
-
kk
说明: 微分进化算法中的其中两个子程序,还有未上传(Differential evolution algorithm)
- 2019-07-20 21:29:49下载
- 积分: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