tcpip14study_14 days Institute TCPIP transplant program reductions books _ ah!

关于无线通信系统的DSP实现的经典中文资料，很有参考价值-on wireless communication system DSP classical Chinese information of great reference value

永磁电机控制（包括卫星飞轮用稀土永磁电机的方波-正弦波复合驱动、永磁交流伺服电动机的控制系统、永磁交流伺服电动机的设计特点、永磁交流伺服电动机发展前景）-permanent magnet motor control (including satellite Flywheel rare earth permanent magnet motor square- sine composite driven permanent magnet AC servo motor control system, permanent magnet AC servo motor design features, permanent magnet AC servo motor development prospects)

927c_sharp_langrefcksc编程，希望大家能够喜欢，应该是蛮有用的吧-927c_sharp_langrefcksc programming, we hope to like it, should be used is quite right,,, ha ha ha ha ha ha

MSWDNM驱动开发的相关书籍，希望大家支持-MSWDNM driven development related books, I hope you will support

解释了最基本的MFC程序流程-explanation of the most basic procedures have MFC

随便写的 这样居然还不行 真是的 那要我说些啥呢 -Do not write that it was not enough to say I

《Java编程思想》第四版源代码，大家一起研究研究。- Java programming ideas, the fourth edition of the source code, together with U.S. studies.

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

很久以来都在体会着JAVA的风格，现在做一简单陈述，希望大家多提宝贵意见-long been the experience with JAVA style now to make a simple statement, we hope more valuable views

该pdf详细介绍了java虚拟机的特点，请将zip直接改称pdf即可-Pdf details the java virtual machine features, please direct renamed pdf to zip