report

经典的apriori算法，用于挖掘数据中最大频繁项集和生成关联规则(The classic Apriori algorithm is used to mine the largest frequent itemsets and generate association rules in data.)

go语言实现的24种设计模式。包含全部的设计原则。(Implement design pattern by Go, Hope to help more programming partners.)

Microsoft扫雷游戏的一个VB实现-A bomb finder game written in VB running under Microsoft.

该程序可实现遥感影像的道路特征提取，编程平台为matlab，亲测好用(The program can extract road features from remote sensing images, and the programming platform is matlab.)

现在很好用的一个BBS哦 是ACCESS的()

通信仿真 jakes改进模型的程序,仿真基本理论-jakes improve communication simulation model of the process, simulation basic theory

利用matlab实现COOFDM信号的调制和解调(the modulation and demodulation of COOFDM signal using matlab)

This a simple calculator C++ programminng file. This can be used to study the programming part of C++ language.-This is a simple calculator C++ programminng file. This can be used to study the programming part of C++ language.

介绍了MathType的一些使用技巧，包括公式输入，公式排版等，给出了详细的图文教程(MathType introduced some tips, including formulas enter the formula typesetting, gives a detailed graphic tutorials)

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)