将EXCEL的内容导入到ORACLE数据库中

这是一个源码备份工具,可以方便的跳过中间文件只备份用有的源码到目标目录

This the implementation of structural SVM for training complex alignment models for protein sequence alignment, especially for homology modeling. The structural SVM algorithm can incorporate many relevant features like secondary structure, relative exposed surface area, profiles and their various interaction into the alignment model. It was developed under Linux and compiles under gcc, built upon the svm^light software by Thorsten Joachims.

Visual C++ 6.0应用编程150例-Visual C 6.0 Application Programming 150 cases

实现文本查找、文本替换、文本编辑和保存，可以统计出文字、数字、空格的个数。-Realize the text search, text replacement, text editor and save, you can text statistics, numbers, the number of spaces.

intel 8xx widows ce 5.0 BSP

listbox用法-ListBox Usage

Description: 采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接表，格式为首先输出第一个顶点，接着输出该顶点的所有的临界点的序号，换行，然后输出下一个顶点及邻接点，以此类推 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Description: Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interp

带有TimeSpan的分钟计数器

一个在vc6.0环境下编的无线局域网中移动终端（mt)的测试程序．-an environment in vc6.0 series of wireless LAN mobile terminal (mt) of the test.

是C#的ExRichTextBox.d-Is a C#, ExRichTextBox.dll