介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and components such applications.

the minimun square elimination in curve fitting,introduction how to orgnize the data and has the program flow chat

椭圆拟合程序，基于最小二乘法，效果很好并能给出拟合后的椭圆坐标及曲线