用.net开发的一个博克论坛，可以看贴，回帖，增加新贴。

本程序用C语言在LSB上添加水印。最低有效位(LSB)是给这些单元值的一个二进制整数位位置，就是，决定是否这个数字是偶数或奇数。LSB有时候是指最右边的位，因为写较不重要的数字到右边位置符号的协定。它类似于一个十进制整数的最不重要的数字，它是在一个(最右边)位置的数字。(This program in C language to add a watermark on the LSB. The least significant bit (LSB) is a binary integer position to the value of these units, that is, to decide whether this number is even or odd. LSB is sometimes referred to as the rightmost bit, write a less important figure to the right location symbol Agreement. It is similar to the most significant digit of a decimal integer, it is the number in a (far right) position.)

智能大厦管理系统的一个分支—智能大厦自动报警,本程序使用Access数据库(A branch of the Intelligent Building, Intelligent Building management system automatic alarm, the program uses Access )

一个利用c#编写的广播发送代码，所在的编译环境是vs！(A use of c# Prepared to send broadcast code, where the compiler environment is vs!)

vc++ opengl实现的简单机器人运动-vc++ opengl to achieve a simple robot

使用VC++语言基本实现菜单栏的基本功能(VC++ language using the basic realization of the basic functions of the menu bar)

使用 DMA 实现DSP 28335 的多路AD采集 。(Multi-channel AD acquisition of DSP 28335 is realized by DMA.)

卡尔曼滤波的C++实现算法，VC++6.0开发平台，可以直接使用。

对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。(For the initial given array, usually present multiple sub-array section has a length greater than a natural sorted. For example, if the array of elements for a {4,8,3,7,1,5,6,2} then naturally sorted subarray segment has {4,8}, {3,7}, {1,5,6}, {2}. used once on a linear array scanning is sufficient to identify all these rows subarray segments good sequence is then sub-arrays adjacent segments sorted pairwise merge to form larger sub-segments sorted array ({3,4,7,8}, {1, 2, 5,6}). Continue merge adjacent sorted subarray section until the entire array is sorted.)

Win2003隐藏账户建立源码 创建系统隐藏账号

MFC编程各章课件，介绍了MFC编程的基础知识。(MFC PROGRAMMING)