-
Struts gradually advanced English original, and welcome your comments and correc...
Struts步步进阶的英文原版，欢迎大家批评指正-Struts gradually advanced English original, and welcome your comments and corrections
- 2022-01-22 15:08:38下载
- 积分：1
-
很好的串口项目程序，对初学串口编程很有帮助！
很好的串口项目程序，对初学串口编程很有帮助！-Serial project a good program, very helpful for beginners serial programming!
- 2022-03-18 21:09:39下载
- 积分：1
-
Essential Linux Device Drivers by Sreekrishnan Venkateswaran
Essential Linux Device Drivers by Sreekrishnan Venkateswaran -------------------------------------------------------------------------------- Publisher: Prentice Hall Pub Date: March 27, 2008 Print ISBN-10: 0-13-239655-6 Print ISBN-13: 978-0-13-239655-4 Pages: 744 Slots: 0.5 而且kernel里面有的驱动基本都涉及到了 。比较新的书。 -Essential Linux Device Drivers by Sreekrishnan Venkateswaran Publisher: Prentice Hall Pub Date: March 27, 2008 Print ISBN-10: 0-13-239655-6 Print ISBN-13: 978-0-13-239655-4 Pages: 744 Slots: 0.5 inside the kernel and some basic drivers are involved. Relatively new book.(补全上次,上下半部).保证可用-Essential Linux Device Drivers by Sreekrishnan Venkateswaran-------------------------------------------------------------------------------- Publisher: Prentice Hall Pub Date: March 27, 2008 Print ISBN-10: 0-13-239655-6 Print ISBN-13: 978-0-13-239655-4 Pages: 744 Slots: 0.5 and inside the kernel and some basic drivers are involved. Relatively new book.-Essential Linux Device Drivers by Sreekrishnan Venk
- 2023-03-04 04:05:04下载
- 积分：1
-
a Porting elaborate on the Chinese pdf books, from the instruction set to have d...
一本详细讲解s3c4510的中文pdf书籍，从指令集到驱动开发都有-a Porting elaborate on the Chinese pdf books, from the instruction set to have driven development
- 2023-06-17 03:00:04下载
- 积分：1
-
liferay cas安装文档配置方法
包括扩展认证方法.
liferay cas安装文档配置方法
包括扩展认证方法.-hwo to install liferay cas
include auth ext.
- 2023-07-10 02:20:02下载
- 积分：1
-
softice book
softice book
- 2022-03-21 19:16:05下载
- 积分：1
-
A* (A
A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。
公式表示为： f(n)=g(n)+h(n),
其中f(n) 是节点n从初始点到目标点的估价函数，
g(n) 是在状态空间中从初始节点到n节点的实际代价，
h(n)是从n到目标节点最佳路径的估计代价。
-A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.
- 2022-01-25 23:27:36下载
- 积分：1
-
More than 700 API functions in detail on the MFC programming very useful
700多个API函数的详细介绍,对MFC编程非常实用-More than 700 API functions in detail on the MFC programming very useful
- 2022-07-12 06:43:07下载
- 积分：1
-
Intel PXA270封装及管脚，对开发此芯片的硬件工程师有帮助
Intel PXA270封装及管脚，对开发此芯片的硬件工程师有帮助-Intel PXA270 pin package and on the development of this chip hardware engineers help
- 2022-04-15 18:27:45下载
- 积分：1
-
最好的spring教程，简单易懂。
最好的spring教程，简单易懂。-best spring guides, simple and understandable.
- 2022-04-18 06:28:53下载
- 积分：1
