模式识别算法

实现功能登陆、注册、个人中心、购物车增删改、动态商品页面

Ajax+ASP.NET小巧高效的无刷新聊天室程序，没有使用数据库，而是使用新概念的Dictionary、LinkedList集合实现数据临时存储，运行后先随便输入一个昵称登陆，然后就进入了聊天室，请注意，发送消息时候没有提交按钮，直接按键盘回车键就可实现消息发送，测试时候打开两个浏览器，使用不同的昵称进入聊天室，效果更好。 -Ajax+ ASP.NET compact and efficient non-refresh chat room program, do not use databases, but the use of new concepts Dictionary, LinkedList collection of data temporary storage, run casually enter a nickname, after the first landing, and then entered the chat room, please Note that when there is no submit button to send the message, directly from the keyboard enter key to send the message can be achieved, the test time to open two browser, using a different nickname to enter chat rooms, better.

java程序界面风格的设置-style settings

K-means聚类算法实现代码，在VC++环境下开发的，令附有实验样本集。-K-means clustering algorithm code, in the VC++ development environment, so that experiments with sample set.

EVC开发的读取系统时间，如果时间错误，通过调用控制面板强制用户修正时间。-EVC developed reading system time, time error, by calling the user control panel to amend the mandatory time.

Windows XP风格之Office XP风格菜单的源代码-Windows XP style of Office XP style menu source code

实现LZARI压缩算法的C++类 这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。 -LZARI compression algorithm to achieve the category C is a LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it become a category C, it can easily compression.

文本框使用示例(SDK-example of the use of text box (SDK

将任意一个指定的文本文件中的字符进行哈夫曼编码，生成一个编码文件（压缩文件）；反过来，可将一个压缩文件解码还原为一个文本文件。-Would be arbitrary for a specified text file in characters Huffman encoding, to generate a code file (compressed file) in turn, can be a compressed file decoding back into a text file.

给出一个带权有向图，该程序可以打印出从原点到其他所有点的最短路径。内容包含测试数据及问题的详细描述。-Give a weighted directed graph, the program can print out from the origin to all other points of the shortest path. Contains test data and detailed description of the problem.