弦截法求解非线性方程，已在TC2.0环境中编译通过

本实验功能与目的是实现K—均值聚类算法，将“Iris.txt”文件中的数据用K—均值聚类的方法分为三类。分类结果用该数据的数据编号表示。

克鲁斯卡尔算法最小生成树，普里姆生成最小生成树

应用背景基于OPENCV的人脸检测算法，能够实现基本的人脸检测，对于初学者是较好的实例，可根据具体的平台进行修改关键技术目标检测已经应用到很多领域，目前人脸检测是较为热门和成熟的话题，本代码希望通过简单实例，介绍基本的入门代码。

实现了两个大数的加法，速度很快．最大可以是５００位数的相加-realized the majority of the two Adder, very fast. It is the largest of the median combined 500

最速下降法是以负梯度方向作为下降方向的极小化算法，本程序用该方法求解n元正定二次函数的极小值-Steepest descent method is based on the negative gradient direction as a decline in the direction of the minimization algorithm, this procedure using this method for solving n-positive definite quadratic function of the minimum

预编译的基于对象的脚本工具maXbox是一个免费的编剧工具，一个内置的德尔福的发动机在一个exe文件！它是专为教学，开发，测试和分析Windows和Linux（CLX）下的应用程序和算法，以运行在一个盒子里没有安装任何管理设置德尔福。该工具是基于与例题和习题的教育计划（由生物节律，形成建设加密是如何工作的）。纯代码的对象脚本。单位预编译和对象可调用！随着32部分教程程序员。

 AES高级加密算法的verilog语言实现

text retrieval

OFELI is an object oriented library of C++ classes for development of finite element codes. Its main features are : * Various storage schemes of matrices (dense, sparse, skyline). * Direct methods of solution of linear systems of equations as well as various combinations of iterative solvers and preconditioners. * Shape functions of most "popular" finite elements * Element arrays of most popular problems (Heat Transfer, Fluid Flow, Solid Mechanics, Electromagnetics, ...).-OFELI is an object oriented library of C++ classes for development of finite element codes. Its main features are :* Various storage schemes of matrices (dense, sparse, skyline).* Direct methods of solution of linear systems of equations as well as various combinations of iterative solvers and preconditioners.* Shape functions of most "popular" finite elements* Element arrays of most popular problems (Heat Transfer, Fluid Flow, Solid Mechanics, Electromagnetics, ...).

用高斯-赛德尔迭代法求方程组的根。它的原理与简单迭代法相似，但在赛德尔迭代法中，每次迭代时充分利用当前最新的迭代值-With the Gauss- Seidel iterative method seeking the roots of equations. Its principle with simple iterative method similar, but the Seidel iteration method in each iteration to take full advantage of the current value of the latest iteration