一本极难得的学习UNIX编程的好书

C++程序设计基础教程 不用介绍了，入门书-C Programming Guide not based on the book entry

Delphi写的屏幕取词程序-Delphi written procedures Capture Characters from Screen

matlab在通信系统中的应用仿真――HDB3码-matlab in Communication System Simulation- HDB3 Code

Vc++的MFC的PDF教 程-Vc MFC PDF Guide

labview实验教程，很好的实验教程，有这方面需求的人来下-PC Guide, a good experiment and guidance in this regard to the needs of people under

有关ADS集成开发环境和EASYJTAG-H仿真器的使用。ADS集成开发环境是ARM公司推出的ARM核微控制器集成开发工具，英文全称为ARM Developer Suite，成熟版本为ADS1.2。ADS1.2支持ARM10之前的所有ARM系列微控制器，支持软件调试及JTAG硬件仿真调试，支持汇编、C、C++源程序，具有编译效率高、系统库功能强等特点，可以在Windows98、Windows XP、Windows2000以及RedHat Linux上运行。 这里将简单介绍使用ADS1.2建立工程，编译连接设置，调试操作等等。最后还介绍了基于LPC2131系列ARM7微控制器的工程模板的使用，EASYJTAG-H仿真器的安装与使用。-The ADS integrated development environment and emulator EASYJTAG-H use. ADS integrated development environment is introduced by ARM" s ARM-core MCU integrated development tool, the English called the ARM Developer Suite, mature version ADS1.2. ADS1.2 supports all ARM family before the ARM10 micro-controller, support software debugging and JTAG debug hardware emulation, support assembly, C, C++ source with compiler efficiency, system library functions and other properties, you can Windows98, Windows XP , Windows2000 and RedHat Linux running on. Here" s a brief introduction to use ADS1.2 building projects, compile connection settings, debugging operation and so on. Fi

这是一本学习 window编程的很好的参考教材，主要讲了api 函数-This is a learning window Programming good reference materials, the main speaker of the api function

本书以Altera公司开发的NIOS嵌入式处理器软核为例，介绍了嵌入式处理器的组成原理和开发应用。介绍NIOS系统设计和c程序编程与调试。-book to Altera NIOS development of the soft-core embedded processor as an example. on the embedded processor"s architecture and application development. NIOS introduced c system design and programming and debugging.

我所上传的是一本有关matlab学习的书籍，希望对大家有所帮助。-I Upload is a study of the Matlab books, we hope to help.

CSDN论坛-算法精华.chm文件 有各种各样的算法,如:最短路径有两种不同的提法：一是从某个顶点到其它顶点的最短路径，二是每一对顶点的最短路径，前者是否包含后者？若不然，前者与最小生成树有何区别？-CSDN Forum- the best algorithm. Chm file there is a wide range of algorithms, such as: the shortest path there are two different formulations: one from a vertex to other vertex of the shortest path, and second, each of the vertices of the shortest path The former contains the latter? If not, the former with the minimum spanning tree What