资源列表
opencv-imageRegegenize
- opencv图像的自动识别，包括图像的处理，采集，最后识别。-opencv image automatic identification, including image processing, collection, and finally recognized.
sleeping_barber-li-5k
- 操作系统课程设计 理发师睡眠问题 经典ipc-Courses on operating system design classic barber sleep problems ipc
mytest_libusb
- 此工程建在vs2010里面 使用前只需在main cpp里面把idVendor idProduct改为自己的USB设备ID #define MY VID 0x0666 #define MY PID 0x0001 即可直接打开 最简单的调用libusb w32的API程序了-The project built in vs2010 just in main CPP before use the idVendor idProduct instead of their own USB device ID
VirtualQQ
- 模拟QQ，主要是注册登录、好友管理、群管理之类的东西，做的比较细，但是功能不健全，还没有实现通讯，适合初学C++的参考-Simulation QQ, mainly Sign, things friends management, group management and the like, to do more fine, but the function is not perfect, yet achieve communication, suitable for beginners C++
Convert-image-to-negative-grayscale-threshold
- Converting RGB image to negative, gray scale and threshold image.
Log-transformation--gray-level--histogram
- Find log transformation, gray level, histogram of an image.
Mean-filters
- Find Arithmetic mean,geometric mean, contraharmonic mean, harmonic mean filters.
Logic-operators
- Apply AND, OR operators for an image.
Non-linear-filters
- Apply non-linear filters(Median, max, min filters).
C-procedure
- 哈夫曼树,函数嵌套验证哥德巴赫猜想,汉诺塔问题,循环队列实现,杨辉三角的递归解决方案-Huffman tree, nested function verify goldbach conjecture, Hanoi problem, circular queue implementation, Yang hui triangle recursive solution
Huffman-Tree
- 使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。 具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 -Emergence of the frequency of each character in the trigeminal lists using the Hu
zi-dian
- 字典树设集合S由若干单词（英文）组成，给定字符串K，在S中查找与K最佳匹配的结果。最佳匹配的结果定义为：与K有最长共同前缀的字符串。 例：S={abc, bdef, zhen, zhao, abdd}，K1=zhao，K2=abdf，K3=cheng，则与K1最匹配的结果是zhao，与K2最匹配的结果是abdd，与K3最匹配的结果是ε（空串）。 -Dictionary tree set S by a number of words (English), given the string