用最小二乘法拟合圆的算法，求出圆的特征值

接口文件。只是顶层文件，故用处不大，第一次试发-Interface file. Only top-level document, it is not useful, the first test-fat

用matlab书写的关于tensor的列子。tensor即张量，是高纬线性代数的核心。-Using matlab to write on the tensor of Liezi. tensor or tensor, is the high latitudes of the core of linear algebra.

水文中河道断面数据库非常庞大,用SQL语句嵌入VB程序当中,可查询断面数据,并用MSCHART显示断面形状.-Hydrology river section is very large databases with SQL embedded VB, inquiries can be cross section data and use MSCHART show section shape.

sl贪吃蛇 sl贪吃蛇 -silverlight silverlight silverlight silverlight silverlight silverlight

黑白棋小游戏，用Ｃ＋＋编写　用VISUAL c++调试-Reversi game, using C to prepare to use VISUAL c++ Debugging

Web结构挖掘HITS算法。文件里面包含了详细的说明和示例。-Web structure mining HITS algorithm. The file contains a detailed description and an example.

用visual c++ 6.0 实现的科学计算器，输入表达式，计算出结果。-Using visual c++ 6.0 to achieve a scientific calculator, enter the expression to calculate the result.

查看DWG格式文件-View DWG format

binary a 256 colors bitmap 二值化256色位图-binary a 256 colors bitmap binarization 256 color bitmap

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!