This beautiful interface a good helper, but also to my friends, let us look at t...

对象闪烁功能-functional objects scintillation Contents Paragraphs Page

我搜集的C 语言教程 -I collected the C Language Guide

该设计以AT89S52单片机为核心，霍尔传感器测车速，实现对自行车里程、速度、时间、温度的测量统计，采用存储器24C32实现在系统掉电的时候保存里程信息，并能将自行车的里程及速度用LCD实时显示。文章详细介绍了自行车测速仪的硬件电路和软件设计。硬件部分利用霍尔元件将自行车每转一圈的脉冲数传入单片机系统，然后单片机系统将信号经过处理送LCD显示。软件部分用C语言进行编程，采用模块化设计思想。该系统硬件电路简单，子程序具有通用性，完全符合设计要求。

大家如果用的着的话，可以下下来看一看啊，-If used in the U.S., you can take a look at the next down, ah,

c++ learning 讲授对于初学者有很大帮助，对于熟悉着可以参考下-c++ learning to teach have much help for beginners, for those familiar with a can refer to the next

介绍给初学者,怎么去声明一个类.怎么去写一个子类,多多支持!-introduced to the beginners how to type a statement. How to write a class, the generous support!

哈夫曼压缩算法课程设计报告+源码(C++)-haffuman

this is μC_OS-Ⅱchinese for arm7 operation，include some useful code

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

加性高斯白噪声信道下，OFDM系统仿真程序，调制方式为16QAM-additive white Gaussian noise channels, OFDM system simulation program, the modulation method for 16QAM