光接入网技术(OHM科学丛书, 光接入网技术(OHM科学丛书

mc35MODEM说明-mc35MODEM

api中文文档查找java有关类，方法 ，帮助java开发人员自己解决问题 - 请选择 Visual C++ Visual Basic DOS Unix_Linux C++ Builder Java Windows_Unix Delphi C-C++ PHP-PERL PHP Perl Python HTML Asm Pascal Borland C++ Others MultiPlatform C++ VFP SQL PDF TEXT WORD VBScript JavaScript ASP CSharp CHM FlashMX matlab PowerBuilder PPT LabView Flex MathCAD VBA PalmOS IDL LISP VHDL Objective-C Fortran tcl/tk QT Video(重要)

教你如何欣赏优美的代码，如何写出优美的代码-teach you how to appreciate the beautiful code, how to write beautiful code

一本Oreilly出版社的英文电子书，写的非常好-Oreilly publishing a book in English

写给大家看的电子书，界面设计，人机交互，UI，-The Non-Designer Design book

介绍C++的电子书，这是一本好书，里面的内容非常丰富。-C++ Introduction of e-books, This is a good book, which is very rich in content.

精彩编程百例75～100 其中有媒体播放器 SQL语言编辑器 ADO方法连接多个数据库 用户密码验证系统 获取Man地址 信史服务 ping命令等待 -exciting programming 100 cases of which 75 to 100 media player SQL editor ADO connecting multiple methods database users access password verification system addresses Man messenger services ping awaiting orders

是用jsp开发的旅游管理网站，该网站对访问者分权限控制。同时该代码中包含了所需的数据库 ，使用非常方便。-Is the development of tourism management jsp website visitor access control points. At the same time, the code contains the necessary database, use very convenient.

文档中介绍了常用的数学软件，可能好多你都没有了解，不妨去试试吧，可能很大程度上简化您现有的工作。-Introduce a document commonly used mathematical software, may be a lot of you do not understand it, may wish to give it a try, may be simplified to a large extent your existing work.

背包问题动态规划算法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.