国防科大数学建模讲义,对于喜欢数学的人非常有用。利用数学模型解决实际问题。...

linux系统管理方面的书籍-the books

MFC程序开发参考大全（人民邮电出版社）第五章源码-MFC Programming Reference (People

一个很好用的书籍,可以方便的连接到csdn网页-With a good book, you can conveniently connect to CSDN page

汇编 问题 收集 源于aogo汇编学习论坛-Compilation to gather from aogo

ASP.NET+SQL Server动态网站开发案例精选[配套光盘] 本书讲解如何使用ASP.NET和SQL Server开发动态网站，并通过9个与现实生活息息相关的完整案例，使读者迅速掌握动态网站的开发方法和全 过程。 全书共分11章，第1~2章提纲挈领，将动态网站开发所涉及的关键知识点做了简要介绍。在第3~11章，从需求分析、系统分析、目录结 构和通用模块、界面设计到代码实现，一步步教会读者制作9个精选案例。配套光盘包括所有案例的源程序，读者可以直接取用。 本书适合网 页设计人员、Web应用开发人员和广大网络爱好者学习使用-Microsoft SQL Server dynamic web site development and selected cases [matching CD] on the book how to use ASP.NET and SQL Server development of dynamic web site, through 9 and the reality of life is closely related to the integrity cases, readers quick access to dynamic website development methods and the entire process. The book is divided into 11 chapters, Chapter 1 ~ 2 highlights, the dynamic web development as the key point of knowledge made a brief presentation. In paragraph 3 ~ 11 chapters, ranging from needs analysis, systems analysis, directory structure and generic modules, interface design to achieve code, a reader step by step the church produced nine selected cases. Matching discs include all ca

世界首个C++编译器作者之一的Lippman的《深入C++对象模型》英文版，可以增强读者对C++语言底层实现机制的了解，写出更加高效，安全的代码。-the world"s first C compiler Lippman had one of the authors of the "in-depth Object Model C" English, Readers can enhance the bottom of the C language understanding of the mechanism, to write more efficient, safer code.

基于VC++线程的动态数据曲线的绘制方法,要做动态曲线的可以参考-Based on VC++ Thread dynamic data curve drawing method, much remains to be dynamic curve can refer to

metlab神经网络工具箱的用法和各个模块介绍，希望对大家有用。-metlab neural network toolbox is used and the various modules presented, useful for all.

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

提供了OFDM系统中的几项关键技术，并提出了解决方法-OFDM system provides a number of key technologies, and proposed solutions