由Aristid Lindenmayer编著的书籍，讲述关于虚拟植物绘制的算法设计...

《C++ 陷阱》内容简介 转自：http://infopower.com.cn/showdetail.php?isbn=7-5083-1494-8 C++ 是一门高效率但是复杂的编程语言，因为它的复杂性，使得程序员有机会去面对形形色色的各种设计和编程错误。如何去规避这些陷井，编写出更具重用性和易维护的C++代码，正是本书的目标所在。作者Stephen C. Dewhurst结合了将近二十年的C++开发经验，罗列了最常见的99个小问题，并详细阐述这些问题的解决之道，让读者在不知觉之间掌握C++的高级编程技巧，充分领悟C++的细微之处。阅读本书，必会对实际工作带来巨大的帮助。- C++ Trap carried Description: http://infopower.com.cn/showdetail.php?isbn=7-5083-1494-8 C++ Are an efficient but complex programming language because of its complexity, programmers have the opportunity to make the face of all sorts of various design and programming errors. How to circumvent these pitfalls, the preparation of a more reusability and easy maintenance of the C++ Code, it is the objective of this book. Author Stephen C. Dewhurst combines nearly two decades of C++ Development experience, listed the 99 most common minor problems, and elaborate on these issues a solution so that the reader can not grasp consciousness between C++ high-level programming skills, to fully comprehend C++ s

数据通讯与网络教程是进行网络编程和数据通信人员的一本圣经，共分为十部分，这是第一部分，尤其对准备从事网络编程、数据通信编程的工程人员具有指导意义。-data communication and network Guide is network programming and data communications staff of a Bible, is divided into 10 parts, This is the first part of preparations especially in network programming, data communications programming staff is instructive.

深入浅出JAVA Swing程序设计光盘代码.新书,相当不错-simple Java Swing code CD program design. Book that is quite good

TI公司的OMAP5912_Interrupts中断，希望对学习DSP的爱好者有用。-TI

windows 核心编程-core programming windows

BLUETOOTH核心技术中文资料 PDF版本!!! 希望大家like! -bluetooth prefer ebook pdf version luck to you

我收藏的数据结构与算法，与大家共享，谢谢支持-My collection of data structures and algorithms, and share, thanks to support

数字锁相环路原理与应用:全数字锁相环。根据本资料可以自己编写代码在计算机上模拟实现。-PLL Digital Principles and Applications: all-digital phase-locked loop. According to this information can write code on the computer simulation.

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.

蒙特卡罗(Monte Carlo)方法，统计学中的近似积分计算方法-Monte Carlo (the Monte Carlo), which was the approximate integral calculation method