-
远志网络还原大师算号器的源码，看了就明白很粗糙的算法但毕竟能用。...
远志网络还原大师算号器的源码，看了就明白很粗糙的算法但毕竟能用。-network reduction Chi master Suanhaoqi source code, read on to understand the algorithm is very rough but, after all, can be used.
- 2023-03-15 12:20:03下载
- 积分：1
-
Microsoft CryptoAPI
Microsoft CryptoAPI 可以自己看看
！
- 2022-01-26 08:19:07下载
- 积分：1
-
这是一个exememple算术编码
This is an exememple of arithmetic coding
- 2023-02-22 21:20:04下载
- 积分：1
-
数据挖掘中的CART算法
数据挖掘中的CART算法
-Data Mining in the CART algorithm
- 2022-02-09 14:41:40下载
- 积分：1
-
aes的原代码，在ＶB的环境下运行
aes.rar - aes的原代码，在ＶB的环境下运行．-Orangk"aes the original code in VB environment operation
- 2023-07-18 23:05:04下载
- 积分：1
-
//=== === === === === === =====
//函数说明
//函数名称：Correlation
//函数功能：计算最小二乘法拟合...
//=== === === === === === =====
//函数说明
//函数名称：Correlation
//函数功能：计算最小二乘法拟合的多项式的相关系数
//使用方法：int M------拟合多项式的项数（已知条件）
// double *b---拟合曲线的系数,按升次排列（已知条件）
// double *x---结点x轴数据（已知条件）
// double *y---结点y轴数据（已知条件）
// double *Yg--结点估计值，与*y相对应，个数为m（过程变量）
// int m------结点个数（已知条件）
//注意事项：多项式阶数最高为10,多项式的形式为 y = b0 + b1*(x-Xavr)...
-//=== === === === === === === === === === === =====// Function that// function name: Correlation// Function: Calculation of the polynomial least squares fitting correlation coefficient// Usage: int M------ polynomial fitting the number of (known conditions)// double* b-- Fitting curve coefficient, or times by arrangement (known conditions)// double* x--- node x-axis data (known conditions)// double* y--- node y-axis data (already known conditions)// double* Yg- the estimated value of node, and* y correspond to the number for m (process variables)// int m------ node number (known conditions)// Note: polynomial order up to 10, the polynomial
- 2023-05-06 14:40:03下载
- 积分：1
-
逐次超松弛迭代法（逐次超松弛法，…
逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.
- 2022-03-31 14:51:19下载
- 积分：1
-
Mean
Mean-shift聚类算法详细介绍，里面有丰富的图片和图形-Mean-shift clustering algorithm detail, which is rich in pictures and graphics
- 2023-04-13 18:10:04下载
- 积分：1
-
B树的相关算法。源程序，C文件压缩。包括建立，插入等等相关的操作。...
B树的相关算法。源程序，C文件压缩。包括建立，插入等等相关的操作。-B-tree algorithms. The source, C compression. Including, insert, etc. related to the operation.
- 2022-02-21 21:26:34下载
- 积分：1
-
the 29th World University acm Cup programming contest that the answer c.
第29届acm杯世界大学生编程竞赛答案题c.-the 29th World University acm Cup programming contest that the answer c.
- 2022-03-13 08:41:32下载
- 积分：1
