这是一个完整的教务管理系统案例，能够满足日常的教务管理工作，也可以下载学习...

botton按钮的各个不同美化效果，仅供大家参考，如有不足之处，望多多指教-botton button various beautification effects, only for your reference, if inadequate, hope the exhibitions

cashcode document MNT description

AT89C205通过4个按键选择4种不同的音乐，并由AT89C205的p3.7输出经LM386放大，发出四种不同的音乐。-AT89C205 keys 4 through 4 different selection of music by the AT89C205 enlarge p3.7 output by LM386, issued four different music.

微分搜索算法是一种由 civicioglu 提出的新的进化搜索算法。它是比很多病提出了进化算法的更强大。

经典Ｃ源程序90例.rar 经典Ｃ源程序90例.rar-Classic C source of 90 cases. Rar

VB环境下用MapObjects实现SQL复合查询，功能类似于ArcView中的SQL查询功能。-VB using MapObjects environment to achieve complex SQL queries, functions similar to ArcView functionality of SQL query.

水管工人玩过吧，我每次玩的时候都手忙脚乱的，就写了一个程序自动玩，效果不错。-plumber played before, I play every time when they are running around in circles, wrote an automatic play, and effectiveness.

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

windows下基于VC++和UDP协议的数据接收程序，基于透明传输协议，mfc界面，带收到确认信号-windows Based on VC++ and UDP protocols data reception process, based on a transparent transfer protocol, mfc interface with receive a confirmation signal

在普通的表达式中，符号是位于运算对象之间的，而在波兰表达式中，运算符号位于参与运算的对象之前。 波兰式在计算中的价值在于它不需要使用括号，之所以如此是由于波兰式的操作符的先后顺序是明确的。 -In the general expression, the symbols are located in between the operands, while the expression in Poland, the computation involved in computing at Symbol before the object. Polish-style in the calculation of the value is that it does not require the use of brackets, the reason for this is due to Poland-based operator of the sequence is clear.