一个著名的java开源分页tag，eXtremeComponents中文教程

//*** *** *** *** *** *** *** // MSP430x1xx Demo - Software Toggle P1.0 // // Description Toggle P1.0 by xor ing P1.0 inside of a software loop. // ACLK = n/a, MCLK = SMCLK = default DCO // // MSP430x1xx // ----------------- // /|| XIN|- // | | | // --|RST XOUT|- // | | // | P1.0|-->LED // // A. Dannenberg // Texas Instruments, Inc // January 2006 // Built with IAR Embedded Workbench Version: 3.40A -//*************************************** // MSP430x1xx Demo- Software Toggle P1.0 // // Description Toggle P1.0 by xor ing P1.0 inside of a software loop. // ACLK = n/a, MCLK = SMCLK = default DCO // // MSP430x1xx //----------------- // /|| XIN|- // | | | //--|RST XOUT|- // | | // | P1.0|-->LED // // A. Dannenberg // Texas Instruments, Inc // January 2006 // Built with IAR Embedded Workbench Version: 3.40A

这是一个基于java的统计图形代码，供大家参考~从基本的如何使用jfreeschart到饼图、方块图、条形图。。。并有其他介绍，欢迎使用，使用方便

本论文探讨ModBus协议在工业控制系统中的应用，对需要这方面知识的同仁有很大帮助-This paper explore the ModBus protocol in the industrial control system applications that require knowledge in this area of great help to colleagues

Java development with SCRUM agile method

ATL布幔之下的秘密-ATL mayor under the secret

掌握Win2000系统-master Win2000 system

3S2000办公自动化系统白皮书-3S2000 office automation systems White Paper

program for astar algoritham to find cheapest path between two nodes

VC在线杂志精华6-VC online magazine essence 6

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.