多维度的K-mean均值聚类算法

判断随机数，用于随机读取数据的时候，是初级源代码，可以修改用于其他地方-Determine the random numbers for random read data, it is the primary source code, can be modified for other places

基于oeo4b的Kriging插值算法/克里格.js工作。插值一组X，Y，Z坐标。

运筹学的贝叶斯预测，是上机进行运筹学实验的重要实验。-Bayesian forecasting of operations research is on the machine is important experimental operations research experiments.

一个简单的基于VC6.0的印刷体数字识别系统，可以简单的识别宋体的印刷体数字，实现二值化，灰度化，锐角梯度化，字符分割，数字图片的归一化等功能

高性能计算高斯消去解方程组c++程序（复杂度 n^3-high-performance computing solutions Gaussian Elimination equations c (n ^ complex 3

#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END

应用背景数据加密标准，（辅），是一次主要的，对称密钥算法和加密的，加密和电子数据。它在现代科技的进步中具有很强的影响力，在学术界也有很强的影响力；关键技术C++  ；（发音为 ； ； ；CEE加+，/ˈ四ː ；PLʌ的 ；PLʌ/）是一个通用的 ；编程语言。它有 ； ；势在必行，面向对象的通用 ； ；编程功能，同时还提供低级别的内存操作设施。它的设计与偏置向上，系统编程和嵌入式，资源受限和大型系统，性能，效率和灵活性，其设计亮点。

12球秤中算法,经典DELPHI面试考题-12球秤中算放.

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

#ifndef _BINARY_TREE_H_INCLUDED#define _BINARY_TREE_H_INCLUDED#include #include templatestruct Bintree_node {T element;Bintree_node* lchild;Bintree_node* rchild;explicit Bintree_node(const T& elem=T(), Bintree_node* lchd=0, Bintree_node* rchd=0): element(elem), lchild(lchd), rchild(rchd) {}};templateclass Binary_tree {public:typedef Bintree_node* PBtn;Binary_tree();virtual ~Binary_tree();void clear();int depth() const;int size() const;virtual PBtn find(const T& elem) const=0;virtual void insert(const T& elem)=0;virtual void erase(const T& elem)=0;virtual void print(std::ostream& output) const=0;void print_tree(std::ostream& output) const;protected: