struts+ hibernate book online system to achieve

实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点，并利用该算法求解。此外，要求支持图形界面的算法输入与输出。在此基础上，添加n^2级算法的实现，并比较相同规模下，两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically generate at least 1 million points, and the use of the algorithm. In addition, the algorithms required to support graphical user interface input and output. On this basis, add the n ^ 2 Ji Implementation of the algorithm and compare the same scale, the two kinds of algorithm" s time consuming.

JXTA源文件，需要运行JXTA平台所需的所有源码-JXTA source files need to run the JXTA platform, all the necessary source code

文本转换成语音tts，可以将文本自动转换为英文语音。只支持英文。-Text converted to voice tts, text can be automatically converted to the English voice. Only supports English.

j2ee帮助文档-j2ee help documents

J2me 源码第一章-J2me first chapter FOSS

java经典代码-classic

学习java的必备书，我看了以后进步很大，非常经典，推荐给大家。-An essential book to learn java, I have read since has made great progress in a very classic, recommended to everyone.

Java Secure Shell Channel Library.

Chat application to communicate between systems. This web based app can be run using Tomcat.

Java Persistent API - JPA JEE 5-Java Persistent API- JPA JEE 5