卫星位置和速度的Lagrange插值算法分析，介绍卫星位置和速度的算法...

这是一个基于列主元高斯消去法求3*3方程组的程序。只需确定方程组未知数的系数和等号右边的数，就可以算出最终的结果。结果精度高达8位小数。

Exceptional C++ shows by example how to go about solid software engineering. Along with a lot of other material, this book includes expanded versions of the first 30 issues of the popular Internet C++ feature Guru of the Week (or, in its short form, GotW), a series of self-contained C++ engineering problems and solutions that illustrate specific design and coding techniques.

                   阿伦方差算法实现，适合初学者学习 。 指出当今风行于世的阿仑方差有错误。详细分析了阿仑方差的来龙去脉，指出阿仑方差前提出错，以至物理意义费解。本文在扬弃阿仑方差的基础上，提出物理意义十分直观的自差统计这一新概念，既能表征频率稳定度，又可表征基准的不确定度。用于雷达测速的精度分析，简洁方便

bp神经网络在语音识别中的应用，同时利用Matlab进行仿真得到结果。  神经网络是近年来信息科学、脑科学、神经心理学等诸多学科共同关注和研究的热点。由于其具有良好的抽象分类特性,现已应用于语音识别系统的研究和开发，并成为解决识别相关问题的有效工具。文章在讲述语音识别过程的基础上重点讨论利用BP神经网络对语音进行识别,用matlab完成对神经网络的训练和测试,并获得满意的结果。

Extended Kalman Filter-code

这是书上的常用算法和模型介绍，有BP网络的C语言实现，HMM的C语言实现，失量量化的C语言实现。-This is a book commonly used algorithms and model introduction, there are BP networks realize the C language, HMM of the C language, loss of the C language to quantify.

image zoom_in algorithm based on opencv2.4.4。Caution: please configure openc2.4.4 before you use it ！！！！！！！！！！！

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

改进的平方根法,比较简单的，用VC实现的-improvements to the square root law, a simple comparison with the VC

计算理论的经典算法，将确定型有穷自动机最简化，根据等价类的算法用vc实现化简过程。-classical theory calculation algorithm, will determine type DFA most simplified, according to the algorithm equivalence classes with vc achieve simplification process.