reload_perf_counters

能实现增加，搜索，删除，计数的学生通讯录（本科C++课程设计）(To achieve increase, search, delete, count the student address book (undergraduate C++ curriculum design))

基本7022芯片的抄表测试程序.代码与抄表终端一致(Basic 7022 chip meter test procedure. Code consistent with the meter reading terminal)

对控制台窗口操作进行抖动，通过窗口句柄找到控制台窗口，通过快速移动窗口位置实现抖动效果(The operation of the console window is jittered, the console window is found by the window handle, and the jitter effect is achieved by moving the window position quickly.)

this is CLIPS code for eye disease

磁盘文件系统的模拟,能实现文件的添加,删除,实现多级目录(Disk file system simulation, can realize the file to add, delete, multi-stage directory)

The physical layer of WCDMA is explained in detail. The downlink physical channel structure, uplink physical channel structure and timing relationship between channels are described in detail.

利用二维数组创建杨辉三角形，基于vc++程序设计(Creating a Yang Hui triangle by using a two-dimensional array .Programming based on vc++)

hangle unicode used AI

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

这是一个实现用C语言发送电子邮件的小程序，可以把截获的键盘记录发送给监控的主机。(This is a realization of C language small program to send email, you can send intercepted keyloggers monitored host.)