sybase数据备份和还原，挺不错的，给大家看看吧，有兴趣就用...

实现M/M/1单窗口无限排队系统的系统仿真，利用事件调度法实现离散事件系统仿真，并统计平均队列长度以及平均等待时间等值，以与理论分析结果进行对比。 M/M/1排队系统： 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

数据结构――家谱的实现 本人的课程设计 MFC-data structure-- I literally achieve the curriculum design MFC

这是一套医院使用的订购药品的进存销系统，功能强大，使用方便-This is a set of ordering the use of hospital drugs into Cun-pin system, a powerful and easy to use

车辆管理信息系统-Vehicle Management Information System

自己编写的一个小算法 用于weka中，数据预处理-I have written for a small weka algorithm, the data pre-processing

算法与数据结构,C语言版严蔚敏,清华大学出版社-algorithms and data structures, C-language version of Yan Wei Min, Qinghua University Press

魔方阵完整算法（内含详细解释） 包括奇数和偶数 在VC6.0下运行-Magic matrix integrity algorithm (containing detailed explanation), including odd and even run in VC6.0

利用Access数据库制作的学生管理系统，可以方便的进行查询和其他管理。-use Access database produced by the student management system, to facilitate the conduct of inquiries and other management.

PFC实例是参照PB6.51版本的PFC的example做的，里面的注释基本都是用中文重新写过，方便大家阅读，本PFC实例没有使用SQLSPY、DEBUG服务和数据窗口属性服务，但是增加了一些实例，如：带进度条的检索工具，SQL语法分析，数据窗口缓存服务等。-PFC PB6.51 example is the reference version of the example of PFC done inside of the Notes which are re-written in Chinese, facilitate reading, the examples do not use PFC SQLSPY, DEBUG window service attributes and data services, but an increase of some examples, such as : the progress of the band Search tools, SQL syntax analysis, data window cache services.

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.