Dive Into Python 中文版电子书 有WORD/CHM/TXT版本 附加例程代码

讲解C++的PPT（主要是关于程序结构）-Explain the C++, PPT (mainly about the program structure)

在多数情况下,集成电路芯片的管脚不会全部被使用。例如74ABT16244系列器件最多可以使用16路I/O管脚,但实际上通常不会全部使用,这样就会存在悬空端子。所有数字逻辑器件的无用端子必须连接到一个高电平或低电平,以防止电流漂移（具有总线保持功能的器件无需处理不用输入管脚）。究竟上拉还是下拉由实际器件在何种方式下功耗最低确定。-in most cases, the IC chips will not pin all been used. For example, 74 ABT16244 series device can use up to 16 Road I/O pins. but usually not all use, so there will always be vacant terminal. All digital logic device useless terminals to be connected to a serial or low-level. to prevent the current drift (with the bus maintain functional devices need not deal with the importation of pins). What to draw from the drop-down or what the actual device under way to determine the minimum power consumption.

Sequential Minimal Optimization for SVM 配C++源码-Sequential Minimal Optimization for SVM Distribution C source

< 精通GUI图象处理编程>>的PDF电子版,供大家参考

vb实例，内容不错-vb examples, as well

80x86 汇编语言程序设计 (C).rar-80x86 assembly language programming (C). Rar

打包源代码，实现数据库在线安装与IISWeb服务器的配置-packaged source code, online database server installation and configuration IISWeb

A good Communication simulation book

The C+ + Programming Language Third Edition Bjarne Stroustrup AT&T Labs Murray Hill, New Jersey-The C++ Programming Language Third Edition Bjarne Stroustrup AT&T Labs Murray Hill, New Jersey

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.