AspNetPager分页控件.rar

艺术文字输入

我做的老师留的作业,只有基本的注册,登录,修改,查询功能.应该有很多不足,希望大家批评指正!-I do teachers stay in operation, only the basic registration, login, modify the inquiry. Should be a lot less than the hope that we criticized correct!

ftp服务器代码,超级稳定的FTP界面,比cuteftp还好用哦.-ftp server code, super-stable FTP interface, better than using CuteFTP Oh.

一个嵌入式系统的生物识别的MS通用接口LAP源码-a biometric identification system MS General Interface LAP FOSS

本人自己做的作业，应用链表知识 通过老师检查，保证可以使用 快点下载吧-This the work done by myself,applied chained list knowlege,it is checked by my teacher, i am sure it can be used well,download it quickly.

利用VC实现的求最小公约数,任意输入两个数即可得到您要的结果-Realize the use of VC for the lowest common denominator, both the number of arbitrary input can be the result you want

路过世纪飞扬的网站发现好些个仪表控件，可惜都要付费，这对于很多用户来说不得不说是一件憾事。最近两天导师项目不忙，就抽空做了一个仪表控件，是对照别人的仪表外观做的，在此公布出来大家讨论讨论，最好大家都写些免费的控件放在网上，好资源共享。如果有兄弟觉得好用的话，请在使用处留下俺的名号，这就够给我面子了。-Music of the passing century site found some 000 meters controls, but must pay, which many users have to say is a great pity. Two recent projects of being mentors, find time to do an instrument of control, instrument control other people"s appearance to do, the announcement out of this discussion discussions, the best we have written some controls on the free Internet, a good share resources. If the brothers feel useful, please I left behind in the use of the name, enough to give me a face.

这是一个Basl曲线生成器，它可通过鼠标和输入生成一个Basl曲线-Basl curve generator, which can generate mouse and the importation of a curve Basl

我有一起使用 Visual c + + 的学生信息系统-基于对话框的应用程序。向下滚动以查看下载说明和输出。您可以添加、 编辑、 删除和搜索的名字、 年龄、 城市、 国家、 全球行动纲领 》，学生等。

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."