足球俱乐部游戏的管理软件 能够完成交易等

一个管理系统 用java作的，里面有struts。-a management system for the use of java, there are struts.

商人过河游戏,游戏规则详见源代码注释部分-river businessmen game, the rules of the game see the source code Notes

学生考勤统计软件，请大家指点 -Student attendance statistical software, please instruct the U.S.

多项式的计算问题，这个小程序实现了多项式的求和的计算，输入系数和次数，并以-1 -1 结束-Polynomial computational problems, this small program enables the calculation of polynomial derivation, input coefficients and the frequency and to the end of-1-1

插分约素的内容，很有用,希望对大家有帮助-Chap-hours about the contents of useful, and I hope to be helpful

这是一个记事本程序，是课程设计是做的，比较简单哦，-This a notebook of the process, the program is designed to do, relatively simple Oh, Oh! !

此版本的华容道仅是个VC++语言的演示版，只是为了演示 一种思路，所以没有增加任何的功能。本游戏图象也是从 同类FLASH游戏中剪出，可惜它的出处网页已经不可访问了. 由于华容道每角色同一时刻可能有不同方向的选择，增加了 判断难度。本游戏主要演示单键无选择控制华容道的模拟 智能处理过程。当然这很简单，谈不上真正的智能。 如果对AI类兴趣的话，可以到 http://chess.withu.com 和计算机下一盘，欢迎交流探讨该类AI算法。 本游戏还存在一些BUG，就请各位自己修正了。 (是在边界处理上，少处理了一种特殊情况) 另：本游戏开放源码，可以随意使用或修改。 ------ musix@withu.com , 2001 , taizhou,jiangsu-HuaRong Road is only the VC language version of the demonstration, only to demonstrate an idea, no increase in functionality. The game image is similar FLASH from the game, cut out, but it"s not the source website has been visited. As HuaRong Road every role the same time may be different and the choice of direction, increasing the difficulty of judging. The main demonstration of a single-game non-selective control of HuaRong Road intelligent simulation process. Of course, this is very simple, no real intelligence. If the AI category of interest, to be the next http://chess.withu.com and computer disk welcome such exchange on

图片特效显示程序，在vb下显示图片各种特技的方法。-Photo Effects display program, in vb display pictures under a variety of special effects approach.

隐马尔可夫模型源代码，可用于图像处理，分类，压缩，去噪等等。-Hidden Markov Model source code, can be used for image processing, classification, compression, denoising, etc..

通过欧几里德距离对三维空间内的数据点进行聚类： 从文件读入三列表示坐标的数据进行聚类。按项目总数和组数平均划分。首先计算两两之间的距离，选出最近的两个点，再按距离由小到大排序，找出距这两个点最近的若干个点。 除去这些点后对其余的点重复进行上述操作。-By Euclidean distance on three-dimensional space, clustering of data points: from the file read into the three coordinates of the data indicated that cluster. According to the average number of total number of projects and group division. First, calculate the distance between 22 to elect the nearest two points, and then from small to large order to identify these two points away from a number of recent points. After removing these points the rest of the point of repeating to carry out such operations.