最新的CPPTooltip 2.1版本哦。

是自己用c＋＋写的文字特效-own use c++ to write the text effects

关于VB编程的精华文摘，对用VB编程的开发人员有借鉴作用 -VB on the essence of CAS, using VB developers might be useful

属性控件简单自绘制,增加树形控件背景，树形控件根节点、子节点加载图标，响应鼠标操作

个人日志管理小软件。这是我学vc写的第一个小程序，用串行化，可写，改，删等操作。有源代码-Personal Log Management Small software. This is my first school vc wrote a small program, using serialization can write, change, delete, etc. operations. Active code

我写的CS机器人-I wrote CS robot

有关本体实际应用的，并且包含了java 3d图像的显示，和SWRL查询。-The practical application of the body, and contains the java 3d image display, and the SWRL queries.

以C++为基础的数据结构与算法研究生复习资料。-To C++-Based data structure and algorithm for post-graduate refresher information.

wince用EVC编译的蓝牙扫描,文件传输,耳机控制软件.完完整软件包!MIPS,ARM编译通过 obexparser.lib filebrowser.cpp devicechooser.cpp treeutils.c-wince with EVC compiler Bluetooth scanning, file transfer, headset control software. End complete package! MIPS, ARM compiler through obexparser.libfilebrowser.cppdevicechooser.cpptreeutils.c

本程序使用了多线程的搜索技术,比传统的操作系统提供的顺序搜索的效率高许多.程序在每个新目录创建一个线程,处理该目录下的文件,从而实现多线程搜索-the procedures used multithreaded search technology, than the traditional operating system in order to provide highly efficient search of many. each procedure in the creation of a new directory threads, addressing the directory of documents, enabling multi-threaded search

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the