LINUX启动时，第一个运行的进程是INIT进程。 本文主要对INIT进程作了详细分析。...

xvidcore,XVID解码编码器，转换器-xvidcore, XVID codec devices, converters, etc.

UNIX网络编程第1卷代码-UNIX Network Programming, Vol 1 code

一个自动生成makefile的工具，对于小型linux的工程，这个工具很好！-An automatic makefile generation tool, for small linux project, this tool is very good!

unix环境高级编程一书的源码-unix environment for high-level programming book source

//颜色初始化 if(!has_colors() || start_color() == ERR){ endwin() printf("Terminal does not support color. ") exit(1) } init_pair(1, COLOR_GREEN, COLOR_BLACK) init_pair(2, COLOR_RED, COLOR_BLACK) init_pair(3, COLOR_CYAN, COLOR_BLACK) init_pair(4, COLOR_WHITE, COLOR_BLACK) init_pair(5, COLOR_MAGENTA, COLOR_BLACK) init_pair(6, COLOR_BLUE, COLOR_BLACK) init_pair(7, COLOR_YELLOW, COLOR_BLACK) //写字符串 for(i = 1 i

GSM的编解码c源码（使用intel的ipp包）堪称效率最高。-GSM arranges decodes the c source code (to use intel the ipp package) to may be called the efficiency to be highest.

mpeg 解复用-mpeg demultiplexing

linux管理电子书，帮助初学者，便于更好更快的掌握linux系统的操作-linux management e-books, to help beginners to facilitate faster and better grasp of the Linux operating system

著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the time, return to post office. Under these conditions, how to select a shortest route? This issue by the Chinese mathematician Mei Gu tube study in 1960, and gives the first algorithm, hence the name.

TCL demo by N. Sidiropoulos and R. Bro clear all F=5 ％ users I=4 ％ antennas-TCLdemo by N. Sidiropoulos and R. Broclear all F = 5 usersI = 4 antennas