XenServerDemo

关于JAVA Digester解析xml文件的教程。较详细描述了Digester的用法。(About JAVA Digester parse xml file tutorial. A more detailed description of the usage of Digester.)

chat window. by the help of this s/w u can do chatting from ur friends via lan after some modification.

DE算法作为一种新的进化算法被广泛关注，它的改进算法层出不穷，但最经典的莫过于JADE(DE algorithm has been widely concerned as a new evolutionary algorithm. Its improved algorithms emerge in an endless stream, but the most classic is JADE.)

ssd3 exam 1 stock WeatherApplication Weather EmployeeInformationSystem

直接运行compile.bat和run.bat即可 使用了3种分词方法： 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理 若单个字不处于当前句子开头，先忽略， 若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)

Googlecode较有代表性得完整代码，可以按照自己需要组合使用。(Google code is more representative and complete code, which can be combined according to its own needs.)

自己联系所写的坦克大战，非常简陋，但是可以借鉴参考一下(The battle of the tank that he created)

为JAVA开发的UML语言手册，为大型应用开发者提供参考。(UML language manual developed for JAVA, for large application developers to provide reference.)

一个简单的操作系统模拟程序 java+swing 可进行一般的文件操作 进程建立及删除等(A simple operating system simulation program java+ Swing can be a general file operations, such as the process of creation and deletion)

用JAVA实现一般背包问题（附院码）比较实用(Knapsack problem)