可以很好的实现数学中的算法

A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists.

在这里，我已经旋转了一个图像使用轨迹栏。然后用户可以手动旋转所需的角度。

这个是基于8051单片机的silconlab对Xbee通信的源代码，里面详细的介绍了算法的基本用法。

计算机模拟物理作业,用来模拟2体运动-computer simulation of physical operations, used to simulate two MOVEMENT

用vb写的有关科学计算方面的，包括求最大值，积分，统计，概率，矩阵运算等-used to write the relevant scientific computing, including seeking maximum points, statistics, probability, matrix operations, etc.

飞思卡尔线性ccd曝光程序，自适应曝光，加了舵机，电机控制

XP下的MPICH1.2.5软件包，用来做并行计算的最好开发环境！-the mpich1.2.5 softpack in xp system is the best develope enviroment for parallel computing

利用ＶＣ程序计算阴历-calculated using the Moon VC

#include "stdio.h"    #include "stdlib.h"   #include "io.h"  #include "math.h"  #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */typedef int Status; typedef int QElemType; /* QElemType类型根据实际情况而定，这里假设为int *//* 循环队列的顺序存储结构 */typedef struct{ QElemType data[MAXSIZE]; int front;     /* 头指针 */ int rear;  /* 尾指针，若队列不空，指向队列尾元素的下一个位置 */}SqQueue;Status visit(QElemType c){ printf("%d ",c); return OK;}/* 初始化一个空队列Q */Status Init

几种排序算法C＋＋实现-Several sorting algorithm C to achieve