这是一个用来求循环节的程序，最后输出循环节

资源描述 一個簡單的網路傳輸範例程式 由client端輸入指令來控制檔案傳輸 ====使用方法==== 先設定server端： 可任意輸入server的port number server開啟接聽埠 client端： 輸入server的ip及port number 連線成功即可開始傳輸 輸入HELP可以查看指令 ============= 編譯前要確定Linker有加上-lws2_32 祝您玩的愉快^^

运动目标跟踪示例程序，对于学习和开发目标跟踪帮助很大-code for tracking

顾名思义，这个源码是针对喜欢聊天的人们所做的．希望大家能喜欢．-As the name suggests, the source code is like chatting against people doing. Hope that we can like.

本软件为商业版ACCESS数据库软件，如果需要SQL版本，请花钱购买。在网络上呆了这么多年，从来没有除了2002年发过两个程序以外一直都没有发过什么程序。 同时发布这个程序也是为了想交一些朋友。本程序也并非本人原创，只是在闲暇时发现网络上面根本就没有完全公开或者使用方便的程序。为了尊重本人的劳动成果，希望下载后的朋友不要更改界面。同时希望使用本系统的朋友能和我的网站做个友情链接。-software for the commercial version of its Access database software, SQL version if required, please spend money to buy. The network spent so many years, never apart from 2002 to issue two proceedings have not been made on what procedures. While this procedure is issued to pay for some of my friends. This procedure is not my original, the only leisure found in the above fundamental network is not fully open or convenient procedures. In order to respect the result I hope that after downloading their friends not to change the interface. While the use of the system hope the friends and my website to be a useful links.

butterfly on nature-butterfly on nature

在一定时间后，限制用户使用计算机 在开始按钮上显示剩余的时间-After a certain period of time, restrict users to use computers in the Start button to display the remaining time

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

Jtagserver source code

将标准输出重定向到一管道-The example of redirecting standard output to an pipe

在WinCE5.0和WinCE4.2下面的Nand Flash驱动程序，支持small block和big block.-WinCE5.0 and in the following WinCE4.2 Nand Flash driver, support small block and big block.