java ftp客户端

Java的很多例子~~包括类等等……还有很多基本的源代码-Many examples of Java, including classes, etc. ~ ~ ... ... There are many basic source code ... ...

一个java客户端与服务器端聊天程序,对于学习java网络编程者来说具有一定参考价值!-a java client and server-side chatting procedures, learning java network programming who have certain reference value!

我做的手机游戏。有关宠物的，还没有完全的完成，有些技术问题请大侠们指教-I make mobile phone games. Relating to pets, but also not fully completed, and some technical problems, please enlighten heroes who

test,一个错误的传输过程orz!t est,一个错误的传输过程orz!test,一个错误的传输过程orz!-test, an error in the transmission process orz! t est, an error in the transmission process orz! test, an error in the transmission process orz!

本系统是新华社内部信息管理系统，在本系统中主要是处理信息（资料）的管理，主要的操作有列表显示资料信息、添加资料、修改资料、删除资料。为了资料的管理权限化、规范化、明确化。在本系统中用户管理一块，主要操作有列表用户信息、添加用户、修改用户、删除用户。为了方便用户对资料的管理和查找，本系统增添了资料检索模块，主要可以对资料的标题、内容、创建人、创建时间进行检索。此外，为了系统的可扩展性，预留了资料分类管理模块，该模块在本版本中还没实现。本系统采用MVC三层架构的模式，在开发过程中使用Struts和Hibernate来处理页面的逻辑和对象的持久化工作。避免了单纯的JSP+Servlet进行开发，使系统的结构更加清晰同时简化开发工作。 1) 使用Struts，体现MVC三层实现模式 2) 使用Hibernate操作数据库，实现数据库的持久化操作 -The system uses a three-tier MVC model, used in the development of Struts and Hibernate to handle the logic of the page and the work of persistent objects. To avoid the simple JSP+ Servlet for development, the structure of the system more clearly at the same time to simplify development. 1) the use of Struts, reflected the realization of three-tier MVC model 2) the use of Hibernate database operation to achieve persistent database operation

在网页上发布统计曲线-released on the website of statistical curves

project management文档-project management documentation

本程序为StreamTokenizer类的示例，对输入的文件test.txt进行令牌化，统计其中的单数和数字数以及符号数-StreamTokenizer procedures for the kind of example, the importation of the paper test.txt for token, statistics on the number of single figures and the number of symbols

Java编程源代码，十分棒的MIDI播放器[共2步](可根据相应的项目修改) -Java programming source code, a very stick MIDI player [of 2] (the corresponding item in accordance with modifications)

简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F)，设p,q ∈K,若对于任一字符串w,由p沿w可达某终点当且仅当由q沿w可达某终点,则说p,q等价，记为p≡q。而且，≡的一个等价类恰好就是状态数最少的确定型自动机的一个状态-Simplify the DFA-for a defined automaton M = (K, Σ, Δ, s, F), set p, q ∈ K, if for any string w, from p along w up to a certain destination if and only if along w from q up to a certain destination, then that p, q equivalent is recorded as p ≡ q. Moreover, ≡ an equivalence class is just the least number of states determine the type of a state automaton