TP2V1.0

数据库课件,主要是兰州理工大学老师的教学课件。(Database courseware, courseware mainly Lanzhou University teacher.)

Social Networking Website (Fsplash) using jsp and Java Servlets.

GB28181安防监控标准SPVMN软件的安装和配置说明文件。(The Document of GB28181 Project SPVMN set)

说明：  实现一个简单远程监控软件，采用Windows Socket（或Java Socket）编程。采用C/S架构。（1）能够远程监控一台主机，显示主机屏幕内容，能远程关机（2）能远程下载或上传文件（3）能远程执行一些DOS命令（4）能远程运行一些可执行命令。 (Implement a simple remote control software, using Windows Socket (or Java Socket) programming. By C/S architecture. (1) to remotely monitor a host, the screen displays the contents of the host, can remotely shut down (2) can remotely download or upload files (3) can remotely perform some DOS commands (4) can remotely run some executable command.)

使用mybatis实现的一个小例子,可以帮助初学者快速入门(user mybatis complete a demo)

Nice auth for vk.com with tor

javaSE基础教程，个人总结，适合初学者。(javaSE based tutorial, personal summary, suitable for beginners)

This file helps to send the message between client and server

介绍java的三大特性，封装，继承，多态。(Introduced the three major characteristics of java, packages, inheritance, polymorphism.)

直接运行compile.bat和run.bat即可 使用了3种分词方法： 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理 若单个字不处于当前句子开头，先忽略， 若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)