LDR测试

一个液晶显示八段码的非常漂亮的时钟源码。-A liquid crystal display eight yards very beautiful clock source.

图书馆的一个简单的系统,基本上都会,我用的C语言编的-a simple library system will basically, I used the C language series

手写体识别DEMO 手写体识别DEMO 手写体识别DEMO手写体识别DEMO手写体识别DEMO手写体识别DEMO手写体识别DEMO手写体识别DEMO手写体识别DEMO手写体识别DEMO手写体识别DEMO

该组件可用编写字符串和数字运算处理脚本，供运行时调用获取执行结果 1、组件调用的方式可以参考 main.cpp 2、脚本的编写可以参考 debug/my.cfg 3、可调用系统函数有 atof: 将字符串转换为浮点数 ceil: floor: abs: index: strcmp: substr: strlen: trim: strstr: split: replace:字符串替换函数 printf: 这些函数基本与同名c函数相同 4、可预先编写一组脚本文件，编译时为每个文件指定ID，供调用时选择-The component can be used to prepare the string and digital processing script for run-time access to results of the implementation of one call, components can call the reference main.cpp2, the preparation of the script can refer to debug/my.cfg3, may call the system function has atof : convert a string to float ceil: floor: abs: index: strcmp: substr: strlen: trim: strstr: split: replace: string replace function printf: These functions are basically the same with the same name c function 4, can be prepared in advance by one Group script file, compile-time specified for each document ID, call for selection

（可执行文件）文本自动分行处理，应用ASCII 码的高８位特性．避免汉字半个字分开的现象．可以用到自定义控件中去．需望能给大家帮助．-(executable file) branch automatic text processing, application ASCII high eight properties. Avoid Chinese nonsense separate phenomenon. OCX can be used in China. We need to give hope to help.

Linux系统命令及其使用详解.doc,程序员必备！文件管理，磁盘管理  压缩管理 进程管理  网络管理

lib、dll等文件格式转换的软件，包括源程序-A utility for cross-platform development of function libraries, for converting and modifying object files and for dumping and disassembling object and executable files for all x86 and x86-64 platforms.

使用csharp的兄弟语言fsharp 进行文件的备份，在配置文件中设置需要备份的路径，目标路径和需要跳开的文件，程序将对文件进行多线程备份，并在前台进行数据显示。

windows应用程序捆绑核心编程的详细教程，doc格式，是一本很好的教程-windows applications bundled core programming detailed tutorial, doc format, is a very good tutorial

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