FDI

里面包括五个源码，有简单的计算器程序，UDP实现网络广播-Which includes five-source, has a simple calculator program, UDP realize Webcast

该程序可进行正则表达式的测试，方便开发人员在进行正则表达式书写时，可对正确与否。并能输出Csharp代码。(The program can test regular expressions to facilitate the development of staff during the time of writing regular expressions may be correct or not. And can output CSharp code.)

LDAP操作使用，jbuilder开发。-LDAP operate, JBuilder development.

功能巨全界面漂亮的带宽使用量监视器,功能巨全界面漂亮的带宽使用量监视器-Function of the whole interface pretty huge bandwidth usage monitor, the entire interface features beautiful giant bandwidth usage monitor

说明：  VC毕业设计，全景图拼接算法实战源码+论文。算法基本思想，图像A和Ｂ，Ａ有至少１／３部分与Ｂ重合，在Ａ中找图像块ａ，在Ｂ中找图像块ｂ，利用夹角余弦距离，求ａ 、ｂ的相似度，利用循环使ｂ在Ｂ中移动，找到相似度最大的图像块ｂ。通过ｂ所在点坐标，确定B相对于Ａ的偏移量。通过偏移量将Ａ和Ｂ放在同一坐标系实现拼接。(VC graduation design, panorama mosaic algorithm actual source code + thesis. The basic idea of the algorithm is that at least one third of the images A and B overlap with B. Find the image block a in A, and find the image block b in B. Use the cosine distance of the angle to find the similarity of a and b. Use the loop to move b in B to find the image block b with the highest similarity. Determine the offset of B relative to A through the coordinates of the point where b is located. A and B are placed in the same coordinate system through the offset to achieve stitching.)

读SourceFile.txt文件，对出现的字母进行哈夫曼编码，输出编码表到Code.txt,并用构建得的编码对SourceFIle.txt进行编码。(Read the SourceFile.txt file, Huffman encoding the letters that appear, output the encoding table to Code.txt, and encode SourceFIle.txt with the constructed encoding.)

很不错的聊天室程序，分服务端和客户端-A good program about chat room, it includes server and client

很好，欢迎下载。2009年4月16日.很好，欢迎下载。很好，欢迎下载。-Well, welcome to download. April 16, 2009. Well, welcome to download. Well, welcome to download.

局域网点对点语音聊天程序，只要输入对方的IP地址就可以聊天了-LAN peer-to-peer voice chat program, as long as the importation of each other"s IP addresses on a chat

设p是素数，a是p的本原根，即a1,a2,a3,…,ap-1在mod p下产生1到p-1的所有值，所以对任何b属于{1,…,p-1},有唯一的i属于{1,…,p-1}使得ai mod p 等于p。称i为模p下以a为底b的离散对数。(P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so for any b belongs to (1, ..., p-1), there are only i belong to (1, ..., p-1) makes ai mod p equivalent to p. Said i was under the modulus p to a for b at the end of the discrete logarithm.)