Developed using Visual studio 2005, is a magic to do with the collection of figh...

说明：  两相交错并联BUCK仿真，SIMPLIS软件仿真程序(Two phase interleaving parallel buck simulation, simple software simulation program)

I2C转UART，51单片机普通IO口模拟I2C从机，解决UART不够的问题(I2C switch to UART, 51 Microprocessor Analog IO port I2C slave address the problem of insufficient UART)

通过GPIO口，模拟I2C协议，和设备进行I2C通信(I2C communications via GPIO ports, analog I2C protocol, and equipment)

说明：  STM8L051F3 Uart例程，可供初学者参考(STM8L051F3 Uart test demo)

李天平通用权限管理系统： 实现用户角色机器权限分组管理(Li Tianping Universal Rights Management System: user role management division of the machine permissions)

头部姿势估计的综述，英文论文，一共11页(head pose estimation)

说明：  需要net3.0以上的平台运行，根据参数设置，可以在后台自动抓取指定驱动器中的指定类型的文件袋指定的保存目录。(Net3.0 above the platform needed to run, according to parameter settings can be specified in the background automatically crawl the specified drive type of file to save the specified directory pocket.)

说明：  4*4按键能够输出1、2、3、4、5......(4*4 keys can output 1, 2, 3, 4, 5...)

本程序包含语音压缩和语音识别领域所需的LPCC，MFCC特征提取算法以及语音端点检测源码。在对语音数据进行特征提取前，可对语音数据进行16K到8K的降采样率处理，包含180阶FIR滤波器的频率压缩程序 (This procedure includes voice compression and voice recognition requirements in the area of the LPCC, MFCC feature extraction algorithm, as well as voice activity detection source. Voice data in the feature extraction before the voice data can be 16K to 8K sampling rate of the drop treatment, including the 180-order FIR filter frequency compression procedures)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)