php+ mysql+ apache button to install one.

高斯列主元消元法， 这只是我个人的一种解法，仅供参考。-out PCA Gaussian Elimination Act, this is my personal one solution for reference.

Matlab基础篇是Matlab初学者的一个很好的向导，它介绍了Matlab的安装及初等的使用方法-Matlab Matlab for the project is a good beginner"s guide, it introduced the Matlab the installation and use of primary

本程序为大整数类的程序，希望对大家有所帮助，在不对之处望大家见谅啊！-This procedure for the integer type of procedure, and they hope to help everyone in doing so hope everyone will forgive ah!

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

mallet_wavelet.m 此函数用于研究Mallet算法及滤波器设计 此函数仅用于消噪-mallet_wavelet.m this function for research Mallet filter algorithm design and function only for denoising

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

数据结构的 用有序表实现集合的基本功能~交集 并集 插入 删除~界面美观~可操作性强-data structure using the table to achieve an orderly set of basic function-set intersection and inserted delete ~ ~ operable aesthetic interface strong

拓扑排序c版(数据结构)1.邻接表的实现 2.无环情况-topological sorting c version (data structures) 1. The adjacent table to achieve two. No part of

有需要的同仁载回去慢慢研究-need colleagues set back slowly study

最小二乘逼近（least-squares approximation）得到一组离散（discrete）数据点的近似函数（approximating function），实验数据往往是用最小二乘逼近得到一条秘密曲线（curve fitting）。下面概述的是最小二乘近似作为多项式的近似函数，除了多项式外，指数的几个右公式也可以作为类似的函数使用。关于最小平方近似的计算原理，请参考市场上的数值分析书籍