sco acquisition card procedures

ortp协议栈（实时传输协议），版本：ortp-0.4.2.tar.gz-ortp protocol stack (Real-time Transport Protocol), version: ortp-0.4.2.tar.gz

linxu环境下的蓝牙协议栈和测试程序，对在linux下开发蓝牙技术的同行很有帮助。-Environment linxu Bluetooth protocol stack and test procedures, in the Bluetooth technology developed under linux peer helpful.

isp116x系列USB芯片在LINUX下的驱动程序-isp116x series of USB chip in the Linux Driver

有n个人围成一圈，顺序排号。从第一个人开始报数（从1到3报数），凡报到3的人退出 　　　圈子，问最后留下的是原来第几号的那位。 -Have n individuals form a circle, in that order排号. From the first person to start off (from the reported number of 1-3), who reported 3 people out of the circle, the final question left is the original issue of who the first few.

linux 应用程序API_进程 进程和信号编程 管道/io ,进程间通讯，网络编程， 线程机制 -linux application process and signal process API_ programming pipeline/io, inter-process communication, network programming, threading mechanism

基于lwip协议栈的ftp精灵程序（经典）-ftp daemon based on lwip module

Unix下基于Web的管理工具，可以管理操作系统、Apache、Internet服务、DNS等-Web based manage tool in Unix, can manage OS, apache, internet service and DNS etc

Linux库例程系列一-Linux for a series of routines

共享记忆体是指同一块记忆体区段被一个以上的行程所分享。这是我们所知速度最快的行程间通讯方式。使用共享记忆体在使用多CPU的机器上，会使机器发挥较佳的效能。-shared memory is with a memory segment was more than one trip to share. We know this is the fastest means of communication between the itinerary. The use of shared memory in the use of multi-CPU machines, machines will play better efficiency.

著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于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.