多处理器体系结构：

Log4J是Apache软件基金会Jakarta项目下的一个子项目，是用Java编写的优秀日志工具包。通过Log4J可以在不修改代码的情况下，方便、灵活地控制任意粒度的日志信息的开启或关闭，然后使用定制的格式，把日志信息输出到一个或多个需要的地方。 最令人感兴趣的就 是，这些可以通过一个配置文件来灵活地进行配置，而不需要修改应用的代码。 -Log4J is the Apache Software Foundation Jakarta under a subproject is prepared to use Java logging toolkit outstanding. Log4J can be adopted without amending the code, the convenience, flexibility to control arbitrary granularity of the log information of the open or closed, then use the custom format, the log information output to one or more needed. Most interesting is that these can be through a configuration file to configure a flexible manner, without modifying application code.

直接使用java代码操作excel表格-direct use of java code operation excel forms

java语言入门，由www.jspsky.com整理制作-java language Getting Started

利用Socket编程制作一个简单的C/S应用。其中，Client端为GUI程序，用于提供界面输入两个数，并有1个“发送”按钮，另外还有一个 TextField用于显示传来的计算结果；Server端用于监听连接请求、计算发送过来的两数的和、送回数据结果。-Socket programming produced using a simple C/S applications. Which side of the GUI Client procedures used to provide input interface number two, and a "send" button, there is another TextField came for the show results; Terminal Server connectivity for wiretapping request, sent over the calculation of the number two and, for the return data results.

用Java编写的体育商品销售管理系统，连接的是oracle。是Java课程设计或数据库的经典源码。-Written using Java sporting goods sales management system, are connected to oracle. Java curriculum design or database is a classic source.

java 聊天-java chat

即时通讯-Instant messaging

java的五个源代码-java source code

JScript语言参考。-JScript Language Reference.

用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。 要求：(1)查询各景点相关信息； (2)查询图中任意两个景点的最短路径。 (3)查询图中任意两个景点的所有路径。 --Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main attractions, storage spots number, name, profile and other information. Requires the ability to answer questions about attractions introduction, tour passing by and so on. Requirements: (1) check the relevant information sites (2) query graph the shortest path between any two spots. (3) The query graph for all paths of any two spots.