基本算法为：先将1填入第一行中间位置；再依次将2

VC 实现逐行读取txt文本文件

本程序是对shamir门限方案的简单实现，主要分为生成子密钥，传递子密钥，恢复密钥，三个部分。可以用来更好的了解shamir方案，对shamir门限有一个全新的方案

Learnin Mathematics with the ABACUS Activity-book part 7

MD5的实现,大家可以多看看，

讲述了辨识的一些基本概念和基础知识，用经典辨识方法和最小二乘法进行辨识及对应的控制算法-Tells the story of the identification of some basic concepts and knowledge base, with classical identification method and least-square method for identification and corresponding control algorithm

矩阵类 可实现转置，求逆，求秩，求行列式值，求正定，重载了各种运算符-Matrices can be realized transpose, inverse, and rank, and the determinant value, and positive definite, a variety of operator overloading

客户端之间发送PING报文，客户端接受其他客户端的PING报文，回复信息。个人想法：通过UDP连接，客户端与服务器建立连接，登录只要用户名（不能重复），能从服务器查询在线用户。

采用c语言，用keil编写，用stc89c51芯片，在加上pcf8591adc芯片，非常实用，通讯方式采用iic通讯，可测0~10v电压，用lcd1602显示，希望能过，第一次上传代码

二重和一次积分程序-two and a re-integration process

平均因子分解法，适用于正定矩阵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