This is my WINDOWS technology curriculum design, the development of the VC. Auth...

这是一个用C语言实现的通讯录问题，可以直接运行-This is a language with C

很不错的C＋+程序 -very good C+ Program

一个Intel的Dialogic版卡的编程拨号-an Intel Dialogic card version of dial-up programming

ENVI（著名的遥感图像处理软件）中文版培训资料，很基础，适合新手！-ENVI (the well-known remote sensing image processing software), the Chinese version of training materials, it is the basis for novices!

c++builder v5.0 AutoCAD vcl源代码

For certain source coding problems, it is well known that the Kraft inequality provides a simple sufficient condition for the existence of codes with given codeword lengths. Motivated by this fact, a sufficient condition based on the Kraft inequality can also be sought for the problem of zero-error instantaneous coding with decoder side information

windowsmobile一些自定义的小控件！-windowsmobile some custom widget!

16进制编辑器方便查看文件结构 结构-16 hexadecimal editor view the file structure to facilitate the structure of

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!

掌上课堂(Pocket Tutor)是一款免费、自主开发的教育类微视频录制应用软件。掌上课堂将您的iPad和安卓平板变成随时随地可以录制课程的白板。您的点击，说话，书写均可以被实时地录制下来，并且可以一键同步到云端网络，在网络上播放给亲朋好友。