高斯消去法，解四元一次方程组

介绍了有关最小生成树prim的生成途径以及程序具体设计-Describes the generation of the minimum spanning tree prim specific design of channels and programs

约瑟夫环.CPP，一个解约瑟夫环的C++实现-Joseph Ring. CPP, a solution of Joseph Central C++ Realize

运用自相关函数求混沌时间序列的延迟时间，使用matlab工具编程实现自相关函数求延迟时间；运用自相关函数求混沌时间序列的延迟时间，使用matlab工具编程实现自相关函数求延迟时间；运用自相关函数求混沌时间序列的延迟时间，使用matlab工具编程实现自相关函数求延迟时间；

二十四点计算程序 ver 1.0 // 作者：刘洋 // 邮件: lynn_mail@yeah.net // 主页：http://digitinn.yeah.net // 日期：2002-8-29

应用背景 早期成果转现在电子表格，各文本数据转换 关键技术电子表格对像的创建，打开，形成电子表格文件

用C＋＋编写的二到十六进制正整数字符串转为数值的小程序-Using C prepared in 2-16 M-ary positive integer values into a string of small procedures

糊涂先生给他的五个朋友写信，他写了五封信，但是当他的朋友收到信后，都告诉他：“你的信寄错了”。那么请你计算一下：出现这种情况的概率有多少？（假设糊涂先生是随机地往信封里装信的），你能不能把所有的情况都列出来呢-Mr. foolish to write him five friends, he wrote five letters, but when his friend received a letter, told him:

The inverse of the gradient function. I ve provided versions that work on 1-d vectors, or 2-d or 3-d arrays. In the 1-d case I offer 5 different methods, from cumtrapz, and an integrated cubic spline, plus several finite difference methods. In higher dimensions, only a finite difference/linear algebra solution is provided, but it is fully vectorized and fully sparse in its approach. In 2-d and 3-d, if the gradients are inconsistent, then a least squares solution is generated

炼钢浇注的时序规划算法，有详细的程序注释，希望对大家有用-Pouring steel timing planning algorithm, a detailed procedure for the Notes, in the hope that useful to everybody

Finding Generalized Projected Clusters in High Dimensional Spaces - ORCLUS - A subspace clustering algorithm.-Finding Generalized Projected Clusters in High Dimensional Spaces- ORCLUS- A subspace clustering algorithm.