跳过

这本书就是著名的沃塞曼编写的《统计学完全教程》，它的特点是覆盖全面、实用性强，除常规内容还包括Bootstrap方法、有向图DAGs估计、Wald检验、Delta方法、统计泛函估计等。-This book is prepared by well-known Wasserman 《ALL OF Statistics》, which are covered by the characteristics of a comprehensive, practical, in addition to conventional Bootstrap method also includes, DAGs have to plan estimates, Wald test, Delta method, statistical Functional estimation.

Visual+C+++6.0数据库开发技术与工程实践（下），共7个实例，有源代码，使用前看光盘使用说明-Visual+ C+++6.0 database development Technology and Engineering Practice (below), a total of seven instances, active code, CD-ROM read instructions before use

使用窗体开发了这个教堂管理系统 （兼容性-视觉工作室 2010 年或以上和水晶报表必须安装在您的系统，这个项目成功运行） 和在后端使用 MS Access 2010 数据库。

电梯模拟 的 Visual C++ 的代码-elevator simulation Visual C code

利用分裂基算法求实序列 的DFT， 的虚部赋值为零。-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment to zero.

数据结构作业与复习题目-data strcture homework and review

题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module

用C语言实现动态表的源程序，包括各种必须的方法-C language movements of the source, including all necessary means

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

有需要的同仁载回去慢慢研究-need colleagues set back slowly study