对偶单纯形发源程序，利用Delphi开发的，使用范围较广

Adaptive Grids for Clustering Massive Data Sets - MAFIA. It is a subspace clustering algorithm.-Adaptive Grids for Clustering Massive Data Sets- MAFIA. It is a subspace clustering algorithm.

舞台灯用步进电机加减速算法：用A3992控制芯片控制步进电机加减速，A3992用的是串行数据控制方式，一个单片机可控制多个电机。用的是16细分算法。。。。

适用于初学者的C#源代码，教你学会画点画线和画面，并且能判断点与折线以及点与多边形的位置关系。代码清晰易懂，重点处附有注释。

C/A码信号属于伪随机噪声（PRN，Pseudo-random Noise）码系列。C/A码是长度为1023的G码(Gold

针对TinyOS数据所写的代码，数据格式详情请参考http://tinyos.stanford.edu/tinyos-wiki/index.php/Main_Page

应用背景The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA Framework provides the tools necessary to rapidly design, develop, execute and statistically test optimization algorithms.关键技术Its key features includes:   * Fast, reliable implementations of many state-of-the-art algorithms   * Extensible with custom algorithms, problems and operators   * Supports master-slave, island-model, and hybrid parallelization &n

利用图形处理器进行加速的有限差分法源代码,绝对珍贵.-Use of graphics processors to accelerate the finite difference method source code is absolutely precious.

bubble,insertion, selection排序-bubble sort,insertion sort, selection sort

求解约束优化问题增广拉格朗日乘子法源程序-Solving Constrained Optimization Problems Augmented Lagrange multiplier method source

应用背景霍夫曼树-C++源码实现：哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。关键技术给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。