lexical-011

Qualcomm Diag Driver

Struts学习文档，内有详细实战例子。并有大量的企业实战经验分享，包括一些开发中常见的问题的解决方法。(The Struts learning document with detailed real example. And a lot of hands-on experience to share, including some of the common problems in the development of the solution.)

简单的Winsock2点对点聊天工具，功能比较简单，但条理清晰，是一个入门的好例子。-simple peer-to-peer chat tools, function relatively simple, lucid, and the entry is a good example.

说明：  根据奇异值分解出来的奇异值，画出奇异值分布曲线，根据公式算出奇异值的突变点，此时突变点即是VMD分解分量数的K值(According to the singular value decomposed by singular value, the distribution curve of singular value is drawn, and the mutation point of singular value is calculated according to the formula. At this time, the mutation point is the K value of the decomposition component number of VMD)

这个项目可以实现简易的客户端和服务器端的通信，客户端和服务器端是任意指定的，通过这个程序，读者可以了解基于tcp的通信原理和基于UDp的通信原理以及两者之间的区别。

一个简单的聊天室，用java做的，功能不是很全，但基本功能还是有的(A simple chat room, to do with java, feature is not very wide, but the basic function or some)

This class represents a currency as identified in the ISO 4217 currency codes.

项目部来了一位漂亮的MM,她飘逸的红发散发出诱人的魅力,深深地迷住了我. 还主动问我:你刚才给我发的那些,是怎么弄的呢?我怎么弄不起呢:< ? 于是乎我做了这个东东来发消息,再于是乎我想你也可能需要,就来发表了:P. 程序环境: win系统,并且打开了windows message服务的主机可以通信(端口135). 涉及的功能: 使用一位高手提供的135端口信息发送函数. 一个ini文件类用于记录IP信息. 自定义一个消息和相关代码,用于把程序缩小到系统托盘.

直接运行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)

说明：  采用C++编写的实现了贝塞尔曲线图形化，使用软件vs2017(Graphization of Bessel Curve Written in C++ Language,Using software vs2017)