资源列表
java_mousechen_database
- java语言开发的数据库管理系统，开发环境用的是jbuider2006和sql2000数据库。很有特色的几个例子。-java language database management system, The development environment is jbuider2006 and sql2000 database. Many characteristics of a few examples.
java_kechengsheji_by_mousechen
- java语言课程设计案例，对于学过java，想实际开发的人来说，这些例子实用也最有意思，能把你所学的所有java语法，串通以来。-java language curriculum design case, the learned java, to the actual development of the people, These examples are the most interesting practical, you can learn all the java syntax, si
cache4j_0.4_src
- cache4j是一个有简单API与实现快速的Java对象缓存。它的特性包括：在内存中进行缓存，设计用于多线程环境，两种实现：同步与阻塞，多种缓存清除策略：LFU, LRU, FIFO，可使用强引用(strong reference)与软引用(soft reference)存储对象。-cache4j is a simple API and achieving rapid Java Object Cache. Its features include : in memory for caching,
Socket_0_getPort
- Socket进阶（Socket通信的服务器端）-Socket Enhancement (Socket Communication Server)
Socket_1_timeAndServer
- Socket起步（时间服务器 -Socket start (Socket server start time (time server
Socket_3_server
- Socket进阶（Socket通信的服务器端）-Socket Enhancement (Socket Communication Server)
Socket_4_client
- Socket提高（Socket通信的客户端）-Socket increase (Socket Communications client)
330KV
- 本设计为330kV变电站初步设计，分为主变压器选择、主接线、短路电流计算、电气设备的选择等几部分，同时附有电气主接线图等图纸加以说明。-the design of the preliminary design 330kV substation, the main transformer sub-choice, the main wiring, short-circuit current, Electrical equipment options, etc., along with electri
tsgl(v2.0)
- 教务管理系统 教务管理系统 -Academic Management System Academic Management System Academic Management System Academic Management System Academic Management System
pybj
- 评语编辑系统 评语编辑系统 评语编辑系统-reviews editing system reviews editing system reviews editing system reviews Editing System Reviews Editing System
teacher_200701_v11
- 学生学籍管理系统学 生学籍管理系统学生学籍管理系统-the Student Management System for t he Student Management System for t he Student Management System Maintenance Management System
BestWay1
- 最短路径算法的一种高效实现。适合在节点密集的环境中找两点之间的最短路径。-shortest path algorithm to achieve a highly efficient. Suitable for the node-intensive environment between 2:00 find the shortest path.