一个FLASH播放软件，功能比较单一，适合于初学者使用。

刚学编程，多多指教-just learning programming, exhibitions

关于矩阵的一些基本操作，例如，矩阵的求逆，方阵的的行列试-on some basic matrix operations, such as matrix inversion, the ranks of the phalanx test, etc.

创建Mobile今日主题项目，当前内存查看 Requirements: Visual Studio 2005, Windows Mobile 5.0 Pocket PC SDK, ActiveSync 4.0.-Description: This sample illustrates how to create a custom Today screen item for Pocket PC. Relevant APIs: Today screen plugins. Usage: Load the project from Visual Studio 2005, and build normally. This sample will build as a DLL called Memwatcher.dll. It will also create a .cab file called memwatchercab.cab. Install the the cab on on your device. Once you have installed memwatcher via the cab, open the Settings-Today applet and tap on the Items tab. Tap OK to close the dialog. (This causes Today to reload all the applets on the Today screen- including the Memwatcher sample.) Assumptions: None. Requirements: Visual Studio 2005, Windows Mobile 5.0 Pocket PC SDK, ActiveSync 4.0.

可用于获得内网任一主机的IP地址，可用于进行深入开发-can be used to access the network within a host"s IP address, can be used for in-depth development

根据车速及驾驶员意愿改变助力大小，并可通过主动调整转向力矩来保持汽车行驶稳定性-INS

VB 迷宫求解 一个用VB平台开发的迷宫求解程序。功能强大。-VB to solve a maze using VB platform maze solver. Powerful.

这是一个显示PNG 格式图片的例子，在Visual C++ 6.0下编译通过！-This is a display PNG format images example, in Visual C++ 6.0 compiled by!

big gb2312 可以做为delphi工程 简繁 批量转换参考-big

Another Library of String Functions

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