CF活动助手推广版_--可以当作者【有视频教程】

OQPSK调制在移动通信等领域应用普遍，该例程采用两类典型解调算法来具体实现，二者差别主要体现在环路滤波器设计和码元同步算法选择上，效果均可，可直接套用。建议对调制解调有兴趣的初学者细致学习之。(OQPSK modulation is widely used in mobile communications and other fields, the routine use two kinds of typical demodulation algorithm, the difference between the two is mainly reflected in loop filter design and symbol synchronization algorithm, it can be directly applied. Recommendations for modulation and demodulation of beginners interested in learning carefully.)

数控编程基础入门课件（本人非编程人员，但真心恳求得到一个下载个数）(NC Programming Courseware entry)

说明：  Connect comport to PC and Test

捷联惯惯性导航的C程序实现，四元数表示姿态，静态下进行试验，MATLAB进行图像处理，包含原始数据。(Strapdown inertial navigation of the C programs used to achieve, said the attitude quaternion, static tests under, MATLAB for image processing, including raw data.)

Cad中数字求和,简单实用型，可以看到累计的数(cad adding )

Easy to learn Visual Basic 6.0

说明：  俄罗斯方块。最经典的益智游戏，不仅可以学习，还能增加想要的功能(Tetris. The most classic puzzle game can not only learn, but also increase the function you want)

source code of TSP _genetic algorithm

用Visual C++ 6.0实现的公交客运站的站务管理系统，实现售票，退票，车辆调度，财务结算，用户管理等功能。 数据库采用SQL Sever2000 数据库中的表单和代码文件说明相见压缩包中说明文档。(用Visual C++ 6.0实现的公交客运站的站务管理系统，实现售票，退票，车辆调度，财务结算，用户管理等功能。 数据库采用SQL Sever2000 数据库中的表格和代码文件说明相见压缩包中说明文档。)

最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。(best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.)