介绍了用C语言来实现一个简单的带通滤波的方法，并有说明

在这本书中，您将了解驱动Linux开发过程的因素。您将发现Linux开发人员常用的各种工具—编译器、调试器、软件配置管理—以及如何使用这些工具来构建应用程序软件、工具、实用程序甚至Linux内核本身。您将了解Linux系统的独特组件，这些组件真正将Linux系统与其他类UNIX系统区分开来，并且您将深入研究系统的内部工作机制，以便更好地了解您作为新一代Linux开发人员的角色。

学习lpc2400必备书籍太大了分好几部分上传的，每个附件为一章节！希望大家珍惜-ARM essential book to learn too much of sub-upload several parts, each annex to a chapter! Hope that we cherish

This basically a raw image which has the details of the interiors of the car-This is basically a raw image which has the details of the interiors of the car

图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]

sgi-STL的相关资料.有代码和帮助文件-sgi-STL relevant information. A code and help files

SAR相干斑抑制及图像压缩的小波域方法，电子科大博士论文，有较高的参考价值。-SAR speckle suppression and image compression in the wavelet domain methods,电子科大doctoral thesis has a high reference value.

软件工程思想（好）-software engineering ideas (good)

opengl中经典之作，全英文，很正点。-opengl in the classic, all English, very punctual.

vb的一些实用技术文档，描述了许多vb中可能用到的技术-vb some practical technical documentation to describe a lot of vb technology may be used