在XP关机程序

较 为 系 统 地 介绍 了 IP 电 话 技 术 的 原 理 和 相 关 协 议 ， 描 述 了 SIP 的 相 关 实 体 、 服 务 分 层 和 消 息 处 理 过 程 ， 结 合 嵌 入 式 技 术 设 计 、 实 现 了 一 个 基 于oSIP 协 议 栈 的 SIP 服 务 器 ， 并 对 该 服 务 器 进 行 了 试 验 。 -more systematic introduction of IP phone technology and the principle of the relevant agreements, the description of the SIP related entities, and news services layered process, with embedded technology design, Based on the realization of a oSIP protocol stack of SIP server, and on the servers of the test.

LS by Cao Siqin, 2007.7.17 ls [-l/-w/-s][-d/-f][-acpo!?] [path or file name mask1] [mask2 ...] Options: -? : display this help -l : list details -a : list all files -w/s : list in a line, file names are sepatated by tab -p : file name with full path -q : if file name contains space then use " to embrace it -c : swith on/off color -d : list folders only -f : list files only -o : omit file s extension name -O : omit all file s extension names -! : use kernel API instead of stream function to list other options : will be ignored Color: yellow : directory gray : hidden file/directory red : readonly file/directory blue : compressed file/directory green : system file/directory white : normal file/directory Noice: There should be less then 100 masks -l/-w, -d/-f can t be both valid, only the latter will be Both "-" and "/" can be used to define options-LS by Cao Siqin, 2007.7.17 ls [-l/-w/-s][-d/-f][-acpo!?] [path or

封装非终结符集合的类Vn，可以求出 FIRST集和FOLLOW集。-Package of non-terminal symbol set of classes Vn, you can find the FIRST sets and FOLLOW sets.

获取硬盘序列号，并采用算法生成一个唯一的编号-disk access sequences, and using an algorithm to only the numbers

一个文本编辑器，压缩包里包含源程序和可执行文件。-A text editor, contains source code and executable file.

这是一个名为“学生信息管理系统”的程序，您可以对学生信息做一些简单的操作！

该程序有x5045，12864液晶显示，步进电机等各个模块组成的一个程序有详细的功能说明-The program has x5045, 12864 LCD, stepper motor, composed of various modules, such as a program has a detailed description of the function

VC7写的，用来将金山单词本生成的文本文件转换成为我想要的其它格式写的。有兴趣的可以看看。-VC7 wrote, Jinshan words used to generate the text of the document I want to switch to the other format writes. Interested can look at.

控制台访问数据库和网络-visit database and network though console

关于猎人过河问题 要解决这个问题就要使过河时载两个过河，返回时尽量只有一个回来。用一个字符串数组来存猎人，狼，羊，白菜；下标依次为0，1，2，3；但他们都有河这边和那边两种状态；为方便则定义一个结构，只含一个int型变量n；当在河这边时n设为0；在河那边时n设为1。由于每次过河与返回都要考虑狼能否吃羊或羊能否吃白菜；则需要一个函数来判断每次选择是否满足条件。-Hunters across the river on the issues to resolve this issue so we should cross the river when the two set out across the river to return to when there is only one back as far as possible. Using a string array to keep hunters, the wolf, sheep, and cabbage subscript followed by 0,1,2,3 but they have a river here and there two states To facilitate the definition of a structure containing only an int variable n When in the river here when n is set to 0 in the river when n is set to one side. Due to cross the river and return each time to consider whether the wolf can eat the sheep吃羊or cabbage you need a function to determine each choose whether or not to meet the conditions.