XML官方指南中文版是学习XML的资料，相信对想学好XML的人很有帮助...

A base-64 MIME format encoder/decoder with C source code

采用jquery技术进行客户端验证文本框的输入是否是正确的，里面有我自己进行扩展的一些验证，例如中文验证，手机号码验证，邮编验证等等。-Jquery technology used to verify the client whether the input text box is correct, which I have to expand some of authentication, such as English authentication, mobile phone number verification, authentication and so on postcode.

关于数据结构中表达式求值的算法，功能强大，符合需要交作业的同学的需求 应该是初学数据结构的人使用-This the algorthim of expression evaluation in data structure, its function is very powerful, and concord with the demand of classmates which are needed to hand over the work, it should be used by the beginner of data structure.

非常稳定好用的串口通讯源代码，经过上千次测试，没有问题-Very stable, easy-to-use serial communication source code, after thousands of tests, there is no problem

License Options file and may replace Named Users for a Program, whether temporarily or not, no more than four (4) times per year, prov file never exceeds the number licensed per Program. Portions of the Programs may be installed on individual computers to accelerate startup times, as long as the-License Options file and may replace Named Users for a Program. whether temporarily or not. no more than four (4) times per year. 577 file never exceeds the number licensed per Program. Portions of the Programs may be instal led on individual computers to accelerate star tup times, as long as the

Windows socket编程的客户端实现。-Windows socket programming, client-side implementation.

HTTP上传文件到WEB上，使用方便，代码清晰，很容易就看的明白，采用POST方式

简易VC计算器，除简单算术运算外还可以计算表达式-simple calculator, in addition to simple arithmetic operations, also can calculate the expression

Winamp LCD Display plug-in

已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right numbered 1,2, ..., n, also know that two adjacent numbers between nodes ChonSu (this tree that links these two nodes in the path of the number of edges). Seeking any two leaf nodes x, y (1 ≤ x ≤ n) between the ChonSu