-
K2
说明: 贝叶斯网络学习算法——k2算法,包括对贝叶斯网络结构的学习,最后生成网络(Bayesian network learning algorithm- k2 algorithms, including Bayesian network structure learning, the last generation network)
- 2009-09-20 21:46:52下载
- 积分:1
-
ComplexNetworks
复杂网络MATLAB工具包和源程序,用于计算复杂网络特性的工具包。(Complex network MATLAB toolkit and source code)
- 2020-11-19 21:39:38下载
- 积分:1
-
Occam1DCSEM_V3.10
可控源电磁法(CSEM)一维反演程序,利用Occam算法(1d inversion program for CSEM)
- 2021-04-08 10:59:01下载
- 积分:1
-
pfm-scource
计算材料学中用相场法模拟凝固相变以及晶粒长大的开源性程序(Computational Materials Science solidification using phase-field simulation of grain growth phase transitions and open-source program)
- 2021-01-28 16:38:34下载
- 积分:1
-
numerical-method-of-noline
非线性方程数值解法的数学基础,有牛顿法,割线法等(Mathematical foundations of numerical solution of nonlinear equations, Newton method, secant method)
- 2015-01-05 19:07:37下载
- 积分:1
-
Bayesian-Estimates-
用R做贝叶斯估计,估计随机微分方程中的参数(Bayesian estimation made by R, the parameter estimates stochastic differential equation)
- 2013-11-13 09:57:55下载
- 积分:1
-
kring123
克里金(Kriging)插值法又称空间自协方差最佳插值法,它是以南非矿业工程师D.G.Krige的名字命名的一种最优内插法。克里金法广泛地应用于地下水模拟、土壤制图等领域,是一种很有用的地质统计格网化方法。它首先考虑的是空间属性在空间位置上的变异分布.(Kringing smooth)
- 2020-09-16 21:57:55下载
- 积分:1
-
fft
用DFT 函数计算电压u, 电流i的基波(f1=50 Hz)的有效值和相位;
用FFT函数分别计算电压u和电流i 所包含的直流,基波和谐波的有效值和初相角;
可计算基波(f1=50 Hz)和各次谐波的功率p和功率因数con?.(The effective value and phase of fundamental wave (f1 = 50 Hz) of voltage U and current I are calculated by DFT function.
The effective values and initial phase angles of DC, fundamental and harmonic waves contained in voltage U and current I are calculated by FFT function, respectively.
The power P and power factor con of fundamental wave (f1 = 50 Hz) and harmonics can be calculated.)
- 2019-03-28 15:48:19下载
- 积分:1
-
program
程序包中含有Lagrange插值、Newton插值、Hermite插值、jacobi迭代、gauss迭代、 超松弛迭代、cholesky分解(Package contains Lagrange interpolation, Newton interpolation, Hermite interpolation, jacobi iteration, gauss iteration, ultra-relaxation iteration, cholesky decomposition)
- 2008-12-17 20:18:47下载
- 积分:1
-
PSO
说明: 基于模拟退火的粒子群算法,模拟退火算法在搜索过程中具有该概率突跳的能力,能够有效地避免搜索过程陷入局部极小解。(Based on simulated annealing particle swarm optimization, simulated annealing algorithm in the search process has a sudden jump in the probability of the capacity, which can effectively avoid the search process into a local minimum solution.)
- 2010-03-17 21:51:53下载
- 积分:1