the 29th World University acm Cup programming contest that the answer c.

三角分解法，对于数值计算的朋友可能会有一定的帮助-triangular decomposition method for the numerical calculation of a friend may be of some help

点可以配置fft算法的源代码，注释，细节

类和数组

用C语言实现的二维几何运算源码，包含了常见的二维几何运算，包括： ㈠ 点的基本运算  1. 平面上两点之间距离 1  2. 判断两点是否重合 1  3. 矢量叉乘 1  4. 矢量点乘 2  5. 判断点是否在线段上 2  6. 求一点饶某点旋转后的坐标 2  7. 求矢量夹角 2  ㈡ 线段及直线的基本运算  1. 点与线段的关系 3  2. 求点到线段所在直线垂线的垂足 4  3. 点到线段的最近点 4  4. 点到线段所在直线的距离 4 

密码学中 enigma算法的 c语言实现 原理清晰-Enigma cryptography algorithm implementation of the principles of clear language c

自动谱分析：可用于丢失/采样/子束光谱分析；矢量自动迭代，可用于建模，故障诊断；-The applications of this additional toolbox are: - Automatic spectral analysis for Irregular sampling/Missing data, analysis of spectral subbands, - Vector Autoregressive modeling and Detection [uses ARMASA] - Reduced statistics ARMAsel: A compact yet accurate ARMA model is obtained based on a given power spectrum. Can be used for generation of colored noise with a prescribed spectrum. - ARfil algorithm: The analysis of missing data/irregularly sampled signals - Subband analysis: Accurate analysis of a part of the power spectrum - Detection: Generally applicable test statistic to determine whether two signals have been generated by the same process or not. Based on the Kullback-Leibler index or Likelihood Ratio. - Analysis of segments of data, possibly of unequal length.

STEVE的工具库-STEVE library of tools

这 ia 8 益智执行与曼哈顿距离启发式模型使用星搜索算法。它是由 8 个数字上板，目标是要把这些数字按顺序由 awapping 他们在空白的瓷砖。如果不能达到的最终状态由于订购它给出错误，并说最终的状态就不能实现。使用的搜索算法是 A * 搜索，这非常类似于 Dijsktra。8 的谜题是一个标准的人工智能技术问题。8 拼图问题的更多信息，请访问此链接： http://en.wikipedia.org/wiki/15_puzzle一旦你把你的初始状态，它将查找到最终状态的最短路径，然后打印该路径。要知道的事情： 队列、 堆栈、 列表、 动态数组 * 算法

this code is downed from website and can detect the data`s error and correct it .it can detect 2 bit error and correct 1bit error for 512bytes or 256 words data.

雅可比算法的算例程序，用简单明了的计算过程展示了雅可比算法的C设计过程。-Jacobi algorithm example program, with a simple and straightforward calculation shows C Jacobi algorithm design process.