读写U盘的源程序

文件检索系统,逐级目录检索文件,比资源管理器效率略高-Document retrieval system, retrieval of documents directory level than the slightly higher efficiency of resource management

基于电话的语音自动应答系统，VC工程源码！-Automatic voice-based telephone answering system, VC-source project!

浮点运算加减乘除四则运算，方法和特别，值得借鉴-Four floating-point addition and subtraction multiplication and division operations, methods, and in particular, it is worth drawing

VC实现的，多维函数搜索，无约束优化方法， (1)最速下降法　(2)阻尼牛顿法(3)共轭梯度法　(4)鲍维尔法(5)变尺度法(6)单纯形法 -VC implementation, multi-dimensional function of search, unconstrained optimization methods, (1), steepest descent method (2) damped Newton" s method (3) conjugate gradient method (4) Powell Law (5) variable metric method (6) The simplex method

通过连接并口的JTAG线或wiggler线，刷写支持JTAG的目标设备的FLASH。免拆芯片维修升级。主要针对BCM多种CPU和个别其他CPU。多种常见FLASH支持。-By connecting parallel port JTAG cable or wiggler line of brushes to write to support JTAG target device FLASH. The maintenance-free split-chip upgrade. Targeted at a variety of CPU and individual BCM other CPU. A variety of common FLASH support.

flash网站素材，做网站的朋友们可以收集-flash web site material, so the site can collect friends

这是一本基于统计意义上的决策推理的书。属于信息科学领域，对从事科研的学生和工程师都有意义-This is a statistics-based decision-making sense of the reasoning book. Belong to the field of information science, to the conduct of scientific research have significance for students and engineers

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices

在C++或C中如何创建WINDOWS的D-in C or C on how to create Windows D

《Windows 环境下32位汇编程序设计》附书代码-"under Windows 32 program design compilation," A code book