资源列表
DelaunayNet
- 在测绘或地图学中，经常会需要用高程点生成DEM，一般首先由这些点按最小原则生成三角网，此代码即是根据任意多个点生成Delaunay三角网功能。-In the mapping or cartography often elevation point will need to generate DEM, generally the first point from these principles by the smallest triangulation generated, the code t
spline
- 由给出的三个点坐标，拟合出一条样条曲线，对于工程或数据分析的同志有作用。-Three points by the given coordinates, fitting out of a spline curve, or data analysis for the project has the role of comrades.
DistCalFromLB
- 根据地球上两点经纬度（以度分秒为单位），计算其间距离（以米为单位）。-calculate the distance between two points with latitude and longitude.
Conderer_multiresolution
- 非线性多分辨率信号的分解，论文及matlab代码-Non-linear multi-resolution signal decomposition, papers and matlab code
TestPRIM
- Testprogram for the quality of PseudoRandomNumber Generators
StandardCalculator
- 计算器运算器，主要是对一般常用的计算器进行编程，对简单的加减乘除的运算用VC编出来-Calculator calculator is mainly used for general programming calculator for simple addition and subtraction, multiplication and division of the computation made by the VC
Theproposedoperationcode(SINCOSetc.)
- 简易的运算包括sin，cos等，一些简单的运算的程序。-Simple operation, including sin, cos and so on, some simple arithmetic procedures.
kmean
- k-means 算法的工作过程说明如下：首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。-k-means algorithm process as follows: First of all, the object data from the n choose k
datamining
- 数据挖掘导论课后题答案 数据挖掘导论课后题答案 数据挖掘导论课后题答案-<Introductiong data mining >
knuth
- 大牛Knuth写的线性规划的C源代码，另附说明文档-Knuth s linear programming C source code, documentation attached
Triangular
- 线性代数方程组列主元三角分解法线性代数方程组-Linear algebraic equations PCA out Triangular decomposition
hybrd
- powell hybrid method