一个逆波兰式的生成程序

该代码实现背光亮度调节(PWM方式)，在s3x6410上验证没有问题-backlight control(PWM)

本软件是在ads上编译的串口实验程序，很好的，是针对lpc22xx的-the software is compiled in ads Serial experimental procedure, very good, against the lpc22xx

This the sorce code in Visual Basic 6 for the GPS Software.-This is the sorce code in Visual Basic 6 for the GPS Software.

一个B/s版的收支系统，记录平时的支出情况，以及用一些折线，柱状统计图 显示每月、每年的总消费对比，使用快1个月了，没出现什么问题。 功能： 1、登录 2、基本设置 3、收支类型管理

MFC技术内幕(配书源码)CHAP05.rar-MFC Insider (source book distribution) CHAP05.rar

VB制作的简单文件搜索器,因水平有限,急需完善。。。。。VERSION 5.00 Object = "{F9043C88-F6F2-101A-A3C9-08002B2F49FB}#1.2#0"; "COMDLG32.OCX" Begin VB.Form FrmMain BorderStyle = 1 "Fixed Single Caption = "文件搜索器" ClientHeight = 1590 ClientLeft = 45 ClientTop = 390 ClientWidth = 3990 Icon = "FrmMain.frx":0000 LinkTopic = "Form1" MaxButton = 0 "False ScaleHeight = 1590 ScaleWidth = 3990 StartUpPosition = 3 "窗口缺省 Begin VB.CommandButton Command3 Caption = "清除信息" Height = 300 Left = 1560 TabIndex = 5 Top = 1155 Width = 1575 End Begin MSComDlg.CommonDialog CommonDialog1 L

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

这只是demo 用于usb通讯，这是通过系统api函数来枚举获取并打开usb设备进行通讯，实现上位机和下位机通过usb口进行通讯，以往都是一串口通讯，这提高了通讯的速度。

id3算法实现-id3 algorithm

多机任务调度算法[n个任务,m个机器] 该算法用C++语言描述,-This an algrithom for multi-task schedule[n tasks, m machines] , which is implemented by C