AJAXMAP,AJAX做的MAP,很好用,DLL控件,

用PIC16F887做的4个触摸按键的例程-M-TOUCH SAMPLE CODE FOR PIC16F887

c+=gfgfgfdgfhghgnhgj hgmj kjhklhkhlkjl kjlkjhkljlk jljkl-c = gfgfgfdgfhghgnhgj hgmj kjhklhkhlk Songyuan 138000, China kjlkjhkljlkjlkjljkl

Windows网络编程(完成端口及网络编程)详细介绍(转载一)-Windows network programming (the completion of port and network programming) a detailed introduction (1 reprint)

编写筛选查找素数函数： 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.

此代码为tcp通信程序，主要是从客户端发送一数据，然后在在服务器段接收。-This code for tcp communications procedures, mainly from one client to send data, and then the server receives paragraph.

文章中详细论述了卷积运算的实现算法及滤波功能-Article to explain in detail the realization of the convolution operation and the filtering algorithm

使用VC++平台开发的扫雷游戏，基本功能和windows自带的差不多-Use VC++ Platform development of mine-clearing game, the basic functions and windows built-in almost

如何从access表导出到excel表

封包工具（最新版）-Packet tools (latest version)

Blind extraction of a cyclostationary signal using reduced-rank cyclic regression―A unifying approach-Blind extraction of a cyclostationary signal using reduced-rank cyclic regression-A unifying approach