网吧计费管理系统

中国Foxmail早已成为收发邮件的首选软件，其功能也早已超越Outlook，但是Foxmail也并非尽善尽美，尤其是在对邮件夹内邮件的导出、备份的处理上做的不是太好，只能手工一封一封将信导出，如果信件数目较少这样处理还可以应付，但如果对于成百上千封邮件仍这样处理显然是相当困难的. 本软件非常的小，目的就一个，就是把邮箱里面尽可能多的邮件和附件弄到一个文件夹里面去。 -Foxmail China has become the preferred sending and receiving e-mail software, its function has long been beyond the Outlook, but Foxmail is not perfect, especially in the e-mail folder for messages export, backup processing is not very good at doing only one hand a letters to export the letter, if the small number of letters still be able to handle it this way, but if for the hundreds of thousands of e-mails continue to handle it this way is obviously quite difficult. This software is very small, the purpose is one, is to mail as much as possible inside the number of messages and attachments to get inside a folder.

用JAVA，开发的一个LCD液晶时钟-with Java, the development of an LCD clock

堆栈的压栈与出栈-stack up and stack Yazhan

在Windows 2003中HOOK ZwCreateProcessEx　很不错的一篇文章啊！-A very good article of HOOK ZwCreateProcessEx in Windows 2003.

一个图书管理系统，功能比较强大，并且附带又论文！-A library management system, the more powerful features, and incidental to another paper!

algorithms of dataminig process for clustering data

窗口自动伸缩,注要是用VC++6.0来开发的一个程序，也用到了MFC架构的一些注要内容，希望能够给大家一些参考。-Automatic retractable window, note if using VC++ 6.0 to develop a process, also used in the MFC framework to the contents of some note, I hope everyone can give some reference.

24位BMP图象的读入与显示 请编程爱好者评价-24-bit BMP images, please read and display programming enthusiasts evaluation

vivi -vivi 1111111111111111111111111111111111111111111

DFA的“语言”是这个DFA接受的所有的串的集合。假设a1a2…an是输入符号序列，让这个DFA从初始状态q0开始运行。查询转移函数δ，比如说δ(q0,a1)=q1，以找出DFA在处理了第一个输入符号a1之后进入的状态。处理下一个输入符号a2，求δ(q1,a2)的值，假设这个状态是q2。以这种方式继续下去，找出状态q3,q4,…,qn，使得对每个i，δ(qi-1,ai)=qi。如果qn属于F，则接受输入a1a2…an，否则就“拒绝”。-DFA" s " language" is the DFA to accept all of the string collection. A1a2 ... an assumption is an input symbol sequence, so that the DFA into operation from the initial state q0. Look transfer function δ, say δ (q0, a1) = q1, in order to identify the DFA in dealing with the first input into the state after the symbol a1. To the next input symbol a2, seeking δ (q1, a2) values, assuming that this state is q2. Continue in this way to find out the state q3, q4, ..., qn, making for every i, δ (qi-1, ai) = qi. If qn belongs to F, then accept the input a1a2 ... an, otherwise, " refuse."