RenameHandler

在n个城市间以最低的经济代价建设此通信网(N inter-city communication network at the lowest economic cost of construction)

IME的编程资料.有相关资料和源码~~内容相当丰富(IME programming information. Have relevant information and source ~ ~ content quite rich)

A Comprehensive Performance Comparison

Gives description, introduction, generation for the space time block codes.

用C编的一个小程序，基于Socket的基础编程，局域网连接，具有多线程-C-series with a small procedure, based on the basis of Socket programming, LAN connectivity, with multi-threaded

LED显示汉字 彩色音乐频谱 32X64 P4 LED彩色屏 STM32音乐频谱 装饰LED(LED Display Chinese Character Color Music Spectrum 32X64 P4 LED Color Screen STM32 Music Spectrum Decorative LED)

说明：  msgina代码修改此代码生成dll替换winxp中的msgina.dll可以设置xp登录方式(Msgina code to modify this code to generate DLL to replace msgina. DLL in WinXP can set the way of XP login)

基于vlc库做的媒体播放器，功能如下： 播放视频或音乐文件，包括网络媒体文件 媒体控制包括播放，暂停，停止，音量调节，视频文件还包括全屏操作。 注意：要运行此程序还必须要有vlc0.9.9a版本库！(Based on vlc media player library to do, features are as follows: Play a video or music files, including network media control media files, including play, pause, stop, volume adjustment, video file also includes full screen action. Note: To run this program also must have vlc0.9.9a version of the library!)

WINDOWS核心编程的异常处理机制的完全模仿和实现,采用WIN32和DDK没有用MFC实现,,(The exception handling mechanism of WINDOWS core programming completely imitate and implementation, MFC implementation, using WIN32 and DDK to use,)

用递归的方法实现以下算法： 1．以二叉链表表示二叉树，建立一棵二叉树（算法5.3）； 2．输出二叉树的中序遍历结果（算法5.1）； 3．输出二叉树的前序遍历结果（见讲稿）； 4．输出二叉树的后序遍历结果（见讲稿）； 5．计算二叉树的深度（算法5.5）； 6．统计二叉树的结点个数（算法5.6）； 7．统计二叉树的叶结点个数； 8．统计二叉树的度为1的结点个数； 9．输出二叉树中从每个叶子结点到根结点的路径。(The following algorithm is implemented using a recursive method: 1., the two fork list is used to represent the two fork tree, and a two fork tree is established (algorithm 5.3). 2. output two order tree traversal results (algorithm 5.1); 3. output two prefix traversal results (see lecture notes); 4. output the result of traversal traversal of two fork tree (see lecture notes). 5. calculate the depth of the two forked tree (algorithm 5.5); 6. statistics the number of nodes of the two fork tree (algorithm 5.6). 7. statistics of the number of leaf nodes of the two forked tree; 8. the number of nodes of the two forked tree is 1. 9. output the path from each leaf node to the root node in the two fork tree.)