经典谱估计

北大ACM试题poj 第3072题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3072 question Question poj source code, good code, and want to help students engage in ACM

本文是关于语音编码算法综合性能比较 的一篇文章，对各种编码算法的性能进行综合 比较和评价的方法 。本文试图利用层次分析法来对编码算法进行性能评估。-This article is a speech coding algorithm on a comprehensive performance comparison of an article on the performance of various coding algorithm comparison and evaluation of a comprehensive approach. This paper attempts to make use of analytic hierarchy process to assess the performance of coding algorithm.

高效数据类型和算法库，含很多数值算法-high efficient data structure and algorithm, including a variety of algorithms and numeric computings.

Maple目前应用非常广泛符号计算软件之一它拥有非常强大符号计算和数值计算功本书详细地介绍了Maple基本功包括数值计算解方程微积分计算向量及矩阵计算解常微分方程和偏微分方程等本书深入讲解了Maple编程基本原理 -Maple is widely used at present one of the symbolic computation software, It has a very powerful symbolic computation and numerical calculation of power of this book describes in detail the basics of Maple, including numerical solution of equations of calculus, vector and matrix calculations calculation solution of ordinary differential equations and partial differential equations, etc., where Shu-depth briefing on the basic principles of programming in Maple

一个用来对非常大的数进行科学计算的程序库，带界面。-Used for a very large number for scientific computation library, with the interface.

C++经典的代码带全，基于C++ 代码生成同应用，可以方便快捷的编写程序，无需重新重写代码，大大加强程序编写进度，十分有效和使用，可以试试。

图像识别练习（字符验证码、车牌号、身份证号）

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

contour of heat transfer

guass主元消去方法-guass main element elimination method