Active Template Library简明教程

《图形编程技巧与实例》――CD，此光盘为本书的配套光盘，包括全书八章内容所对应实例程序的工程文件包、可执行文件、程序使用的图形数据及运行结果位图文件等。 第1章~第8章的全部文件分别存放在 Chapter1 ~ Chapter8 章文件夹（序号表示章编号）中。

在matlab下产生m序周期,初态,特征式可以在主程序中自己设计.-under the Matlab m sequence cycle, the initial state, in the style of their own main program design.

关于ＭＦＣ编程的实用书籍，初学者一样可以以此为教程学习ＶＣ-MFC programming on the practical books, beginners can learn from this tutorial VC

智能天线的好程序　　　非常实用！-Smart antenna good program very useful!

它的关于传输线分析，解释清楚大约高频率的元素，关于晶体振荡器，对高频电阻，思路清晰电容器。这本书有助于为实际的应用程序执行。因为许多应用程序来自射频环境下是广泛有用的。

深入浅出MFC的示例程序,想要的朋友拿去吧-MFC easy examples of procedures, friends want to take it

用jsp开发的网上商城系统-jsp development with the Online Shopping Mall

This is a really good book for starters who want to learn ruby well. An up to date book on Ruby programming, written in a style described as "a beautiful display of pragmatically chunky bacon,  wrapped in a nutshell." Or something like that. Mr. Neighborly"s Humble Little Ruby Book covers the Ruby language from the very basics of using puts to put naughty  phrases on the screen all the way to serving up your favorite web page from WEBrick or connecting to your favorite web  service. Written in a conversational narrative rather than like a dry reference book, Mr. Neighborly"s Humble Little Ruby  Book is an easy to read, easy to follow guide to all thin

vc++图像处理程序设计的电子书，对新手很有帮助-vc++ standard像Jie braise the most序few chirpy cavity changchu email书，对nosebleed terrace themis exhaust stack助

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.