决策树分类器 (Decision Tree Classifier)
使用方法 dtree.exe train.dat test.dat
結果輸出 decisionTreeOutput.txt
色泽,根蒂,敲声,纹理,脐部,触感,密度,含糖率,好瓜
青绿,蜷缩,浊响,清晰,凹陷,硬滑,0.697,0.460,是
乌黑,蜷缩,沉闷,清晰,凹陷,硬滑,0.774,0.376,是
乌黑,蜷缩,浊响,清晰,凹陷,硬滑,0.634,0.264,是
青绿,蜷缩,沉闷,清晰,凹陷,硬滑,0.608,0.318,是
浅白,蜷缩,浊响,清晰,凹陷,硬滑,0.556,0.215,是
青绿,稍蜷,浊响,清晰,稍凹,软粘,0.403,0.237,是
乌黑,稍蜷,浊响,稍糊,稍凹,软粘,0.481,0.149,是
乌黑,稍蜷,浊响,清晰,稍凹,硬滑,0.437,0.211,是
測試
色泽,根蒂,敲声,纹理,脐部,触感,密度,含糖率,好瓜
浅白,蜷缩,浊响,模糊,平坦,硬滑,0.593,0.042,
依據歷史紀錄來計算，最後會顯示這是好瓜還是壞瓜
The program takes two files as input; a training file and a testing file. The output of the program is stored in a file named: decisionTreeOutput.txt.
The current program only supports string attributes (the values of the attributes must be of string type. Numerical values are not currently supported. Any numerical values will be treated as strings.). (2018-05-31, Visual C++, 79KB, 下载2次)
中国机器人大赛擂台赛源码，用的是博创公司的控制器
China Robot Competition Challenge Cup source, using the company s controller Borch (2013-10-13, Visual C++, 2KB, 下载9次)
半数跳海在也有像我们人类生存的一个星球上，由于气候的关系，每过一年，人们就要从东方向西方迁徙，然后再过一年，就又要从西方回到东方，年复一年。迁涉就必须要渡海，渡海就必须要过一个鬼门关。鬼门关不管船的贵贱，一律放行船中人数的一半，另一半则必须跳海侍鬼。若逢单，则落单的人也不能幸免。 每条船上有一个巫师，他负责监管一种筛选规则，让人们围成一圈，每数到一个“天数”，则数到的这个人就得跳海，然后继续绕着圈子数一个天数，让下一个人跳海，直到鬼门关所要的半数。因此，每逢迁涉，总有大批的人要贿赂巫师，希望幸免过关，而穷人则听天由命。巫师确实掌握着每个人的命运，但他有自己的办事原则，他暗中替天行道，每到过鬼门关的时候，就乘机将那些罪大恶极的，不配继续做人者给“挂”掉。他所收受的贿赂，用来平衡那些生存下来的人生活。 巫师是怎么替天行道的呢？原来，他是将一些好人安排在某些位子上，使得他们“天数不到，命不该跳”。那么那些位子究竟是怎么分布的呢？请你用现代化的编程技术来揭示这一秘密吧。
bai shu tiao hai (2012-11-20, Visual C++, 5KB, 下载2次)
博创机器人的控制程序，程序写的非常好，可以参考
Borch robot control program, the program is very well written, you can refer (2011-05-06, Visual C++, 556KB, 下载22次)
一款很好用的rtsp的客服端和服务器源码，已编译通过可以使用。希望给你有帮助
A very good customer service with the rtsp client and server source code, compiled by use. Want to help you (2010-08-10, Visual C++, 2426KB, 下载1865次)
群聚算法用来模拟成群结队的动物如蚂蚁，蜜蜂，老鼠，或鱼等的行进。
利用群聚算法实现一群东西在动，但各走各的，看起来不像是协调一致的移动而又目的相同的一种视觉效
果。
Clustering algorithm is used to simulate the hordes of animals such as ants, bees, rodents, fish, or the road. Clustering algorithm using a group of things moving, but with each other looked like a concerted move but the same purpose as a visual effect. (2010-07-29, Visual C++, 209KB, 下载10次)
diaodu1完成基本模块框架
diaodu2完成了先进先出，和输出显示模块。
diaodu2-1准备将FCFS的到达时间按从小到大排列进行实现。未果
diaodu3完成了SJF，优化了输出精度
diaodu4基本完成了RR但是有一个小bug，
diaodu5完成了RR
diaodu6优化了一些输入输出，但是发现RR等于4时正确，大于或小于4都有问题。算法出现问题
diaodu7解决了RR的问题。程序基本完成
diaodu8优化了代码，并完善了RR输出时间轴表示的代码，和main函数中输入操作命令转换为大写字母的比较方式。
diaodu1 completed basic module framework diaodu2 completed the first-in first-out. and output module. Diaodu2-1 ready to FCFS queue by the time of arrival from small to large to achieve alignment. Diaodu3 unsuccessful completion of the SJF, Optimizing the output accuracy diaodu4 basically completed the RR However, there is a small bug, diaodu5 RR diaodu6 completed the optimization of input and output, But RR was found to 4:00 correct, or less than 4 had problems. Diaodu7 algorithm to solve problems of the RR. Diaodu8 completed basic procedures to optimize the code, and improve the time frame indicated RR output code, and the main function entry orders converted to uppercase the comparative approach. (2006-12-11, Visual C++, 10KB, 下载7次)
新算法较好地解决了传统算法带来的噪声过大或者有用边缘丢失的问题,边缘检测效
果得到了改善
new algorithm can solve the traditional algorithm of excessive noise or risk loss of useful, edge detection results have improved (2006-05-23, Visual C++, 332KB, 下载18次)