他useflu example may be

中文姓名识别程序，可以识别出大部分中文名字-Chinese name identification procedures, can be identified most Chinese names

XML处理类库 1.遍历页面的 < > 中间的字符将中间的 字符替换位其他不影响操作的字符。 2.遍历页面中 > < 中的字符串，判断其中是否有中文 3.遍历页面中 " " 中的字符串，判断其中是否有中文 4.遍历页面中 中的字符串，判断其中是否有中文 5.将取得的中文字符存入ArrayList中-XML lib, using to deal with some xml files

这是个迷宫原代码-This is a maze to the original code

说明: 这个程序(omni.com)是97年的Mekka ’97 4K Intro比赛的一等奖作品。整个程序全长4095字节，其中包含133字节的自解压程序(类RAR压缩)，未解压的程序长4782字节。三维场景包含144个立方体，367个面，362个点，15个不同的64*64的纹理-Note : This procedure (omni.com) is the Mekka 97 4K Intro"97 won the competition works. The whole process 4,095 byte length, which includes 133 bytes of self-extracting (RAR compression type), resulting in decompression procedures 4,782 bytes long. 3D cube contains 144, 367-, 362, 15* 64 different texture 64

本程序是QAM的调制程序，以及我在编程时测试用的例子，还有空时分组码中的线性分散码进行处理时所需要的向量化函数VEC还有它的逆函数，希望对大家有帮助-This procedure is the QAM modulation procedures, as well as when I test in the programming examples, as well as space-time block codes in a linear dispersion code when needed to quantify the function of VEC also its inverse function, in the hope that We have to help

基于****大学校自律会日常工作开发，存储和编辑所需信息，比较低能-**** University and self-discipline will be based on the daily work of the development, storage and editing the information, compare low-energy

波斯语字典,国内非常难找的哦-Persian dictionary, very difficult to find a domestic oh

改变Form的标题-change the title of Form

MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent relationship between the sum of the scores, thus the analysis of interdependence into question how to find the highest scoring tree interdependence.

学生考试成绩录入查询系统，可实现录入，查询，排列，以不同排列方式阅读查询-Student entry test scores Inquiry System, enabling entry, query, order to read the query sequence