chapter03

vc用驱动接口开发的,可以禁用usb,光驱,软驱,可以作为动态库使用.(vc-driven interface with development, you can disable the usb, drive, floppy drive, you can use as a dynamic library.)

仅用于tp900掌机的usb驱动。安装简单方便。-Only the usb driver for tp900 handheld. Easy to install.(Writing From the information carefully detailed features, including the content description (at least 20 words). Try not to let owners to spend time on your revised instructions. When extracting archive can not have a password.)

单点定位就是根据一台接收机的观测数据来确定接收机位置的方式，它只能采用伪距观测量，可用于车船等的概略导航定位。(Single point positioning is based on observations of a receiver to determine the position of the receiver way, it only can use the false distance measurements, can be used to approximate the travel and other navigation and positioning)

说明：  程序运行在Windows98/2000/XP/2003平台下，可在VC++ 6.0或 .NET中调试。调试前请先安装Microsoft DirectX 9.0 SDK。对于硬件，无特殊要求。(running in Windows98/2000/XP/2003 platform, or in VC 6.0.NET debugging. Debugging former post install Microsoft DirectX 9.0 SDK. For hardware, no special requirements.)

基于visual c++开发，实现有bmp图像序列向avi视频信号转化(Based on Visual C + + development, the conversion from BMP image sequence to avi video signal is realized)

用C#開發的YouTube Downloader,只要貼上YouTube URL,就可以把Download YouTube影片(C# development of YouTube Downloader, as long as the paste YouTube URL, you can put Download YouTube Videos)

用 Visual C++.Net实现的如何 关闭缺省状态栏 的演示程序。注释详细。适合初学者。(Using Visual C . Net realized how close the default status bar of the demo program. Notes detail. Suitable for beginners.)

说明：  该程序包含了二维傅里叶变换、低通滤波器、高通滤波器(The program includes two-dimensional Fourier transform, low pass filters, high pass filter)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

实现网络抓包功能的基本原理与抓包实现方法，是个不错的提示(for sniffer)