对于入门的dsp初学者来说，是个很经典的材料

给出求解线性多目标规划问题弱有效解子集的一种新算法．在不同的条件下，运用此　 算法得到了线性多目标规划的弱有效解子集，并在得到的解子集中再次进行寻优，进而得到　 弱有效解集中决策者满意的较优解；同时用ＶＣ＋＋语言实现了此算法，并给出了具体算例． -Given for solving linear multiobjective programming weakly efficient solution of a subset of the new algorithm. Under different conditions, using this algorithm is a linear multi-objective planning for a subset of weakly efficient solution, and in the solution subset of re-optimization, and then weakly efficient solution to be satisfied with the focus on decision-makers better solution at the same time using VC language realize this algorithm, and gives a specific example.

通过学习如何在CodeWarrior IDE集成开发环境下编写，编译一个工程的例子，使读者能够掌握在ADS软件平台下开发用户应用程序。本章还描述了如何使用AXD调试工程，使读者对于调试工程有个初步的理解，为进一步的使用和掌握调试工具起到抛砖引玉的作用。-through learning how the CodeWarrior IDE Integrated Development Environment to prepare, Build a project example, to allow readers to grasp the ADS software platform developed under user applications. This chapter also describes how to use the AXD debugger works, so that readers works for debugging a preliminary understanding, To further the use and control of debugging tools serve as a trigger effect.

基础的教程，希望大家喜欢-based tutorial hope you like

C++视频教程孙鑫C++视屏教程(全20讲)-VC6.0

spring电子白皮书-spring White Paper

accp数据库 希望对想要的人有用!! 很难才弄到的-hope accp database useful to people who want to!! it is very difficult to get the

NIosII软处理器快速入门 让初学者快速熟悉nios ii 的软核处理-NIosII soft processors Quick Start for beginners quickly familiar with nios ii soft-core processing

应用程序调试技术windows debug -Debugging applications windows debug

对于可拓学中统一集的描述。统一集是模式识别的另外一种思路，很值得学习。-For a unified set of extenics in the description. Uniform set is another idea of pattern recognition, it is worth learning.

是以下这本书的书上示例代码 书 名 JAVA2面向对象程序设计 页数 作 者 洪维恩 开本 责任编辑 字数 千字 出 版 社 中国铁道出版社 出版时间 2002年8月第1版 再版时间 2002年8月第1次-following the book"s sample code book title JAVA2 Object-oriented program design pages Hongweien author readership Editor thousands of characters characters Press published the China Railway time in August 2002 a first edition reprint time in August 2002 1st