windows wdm

这是继Effective C++后的一本书，More Effective C++主要讲解了一些效率，异常等问题。-This is the second Effective C++ After a book, More Effective C++ Mainly on a number of efficiency, anomalies and other issues.

在VC++ DirectX环境下，绘制一个四面体，实现四面体的旋转，并设置光照和材质信息。-This programme shows how to draw an rotating tetrahedron,and how to set lighting and materials.

计算器 矩阵计算 == 源代码 和.exe文件都有-== Matrix calculation calculator source code and. Exe files are

Windows Mobile 电源管理相关-Windows Mobile power management-related

汉字库不同字体大小转化成所需要的代码 汉字库不同字体大小转化成所需要的代码-汉字库different font size into the required code汉字库different font size into the required code

首先实现了MSK信号的相干调制解调，再比较了在MSK系统中加入不同(慢扫和快扫)线性调频信号（LFM）作为干扰信号时系统的误比特性能，都有程序实现

corba RTEC_Filter

MFC实现的内嵌浏览器explore，实现了退后，前进，刷新，收藏，网址编辑栏等。

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

2440a三星最后的wince4.2bsp包。修改了一些bug。有兴趣地可以在此基础上移植。-2440a Samsung wince4.2bsp the final package. Modify a number of bug. Interest on this basis can be transplanted.