测试 测试 测试 测试

Part2 of CPRM data document, CPRM is for copyright protection in SD system

python核心编程，绝无仅有的好资源！-python-core programming, only a good resource

C++Primer3rdEdition被认为是C++入门的最经典入门书-C++

Think_in_C

介绍单相全桥逆变器的工作原理, 阐述产生SPWM波和实现PI 控制的算法, 给出以DSP( 数 字信号处理器) 实现控制的软件流程。实验表明利用软件完成逆变器控制是可行的。 关键词: 正弦逆变器 -Introduction of single-phase full-bridge inverter working principle, the resulting SPWM wave and realize PI control algorithm to DSP (digital signal processors) to achieve software flow control. Experiments show that the use of software controlled inverter is feasible. Key words: sine inverter

在多数情况下,集成电路芯片的管脚不会全部被使用。例如74ABT16244系列器件最多可以使用16路I/O管脚,但实际上通常不会全部使用,这样就会存在悬空端子。所有数字逻辑器件的无用端子必须连接到一个高电平或低电平,以防止电流漂移（具有总线保持功能的器件无需处理不用输入管脚）。究竟上拉还是下拉由实际器件在何种方式下功耗最低确定。-in most cases, the IC chips will not pin all been used. For example, 74 ABT16244 series device can use up to 16 Road I/O pins. but usually not all use, so there will always be vacant terminal. All digital logic device useless terminals to be connected to a serial or low-level. to prevent the current drift (with the bus maintain functional devices need not deal with the importation of pins). What to draw from the drop-down or what the actual device under way to determine the minimum power consumption.

嵌入式Linux应用程序开发标准教程第12 章-Embedded Linux application development standards of Chapter 12 tutorial

图论中最小生成树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]

"A Programmer s Introduction to C# 2.0, Third Edition" is a critical update to the highly successful second edition. It is written by a member of the original C# language-design team and a C# program manager, so you can be certain this book contains the expertise you re looking for. This third edition covers the new elements of C# 2005 that you ll soon embrace. This comprehensive tutorial explains features like generics, iterators, anonymous types, and partial classes. It is sure to be a key resource for all you C# programmers!

linux下 采用kdevelop环境就行qt界面的很好的资料。适合初学qt的学者-kdevelop used under linux environment, on the qt-line interface, a good information. Suitable for beginners qt scholars