综合布线管理系统，用vb+execel实现，xexcel作为后台数据库存储数据。...

VC摹仿手写字的源码。大家来看看，共同探讨。-VC imitate handwritten word source. You see, and explore together.

CRC16,32,8位效验程序。 CRC16,32,8位效验程序。-CRC16, 32,8-bit-tested procedures. CRC16, 32,8-bit-tested procedures.

G.723 audio codec DLL (with sources) for ARM (windows mobile)

提取m4a媒体流,提取后面的媒体流，添加上aac格式的头就可以转换成aac文件格式-m4a flow,requrest code file head

磁卡机开发函数用于先达磁卡机-card machine development function for the first of 1,500 machines

输入一个句子（由空格分隔的若干个词）将该句子按如下的要求输出： 1.第偶数个词反序，第奇数个词不反序 2.个词之间只留一个空格 3.句首和句尾不留空格-importation of a sentence (space separated by the number of words) Revise the sentence requested by the following output : 1. even the first-term anti-sequence, section 000 odd word does not fight sequence two. between the words out, leaving only a blank 3. the first sentence and the end of the sentence without leaving spaces

数据挖掘决策树ID3算法原理 适用数据挖掘的模拟测试-ID3 decision tree data mining applies data mining algorithm simulation tests

该系统使用Java编写，实现了数据库的访问，增删改查，登陆注册，可以查看图书信息，使用控制台，没有web，但是图书管理的基本功能都实现了，有管理员系统，也有用户系统，还有后台信息查看，也有购物车这个模块，非常的全，适合一些刚入门的Java同胞门学习

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

基本上和小时候在红白机上玩的一样~ 我做了一个08年的新的地图~ 如果有人想要的话和我联系~-Basically, and a child playing in the red and white machine to do the same ~ I have a new 2008 map ~ If someone want it and contact me ~