采集windows桌面的源码

《COM本质论》十分经典的com书籍，深入浅出介绍了com始末

网业文件转换成txt文件，方便阅读-network industry convert documents into the txt file, easy reading

基于VS2012，用C#做的json封装的例子，windows自带的函数使用很不方便。本示例提供了很好的封装方法，开发者可以或字节使用。

The Windows Installer XML (WiX) is a toolset that builds Windows installation packages from XML source code. The toolset supports a command line environment that developers may integrate into their build processes to build MSI and MSM setup packages

AIC法定阶的依阶次递推算法程序,计算残差方差的估计值的结果计算AIC：-AIC in accordance with the statutory order of procedure order recursive algorithm for calculating the estimated value of residual variance of the results of calculating the AIC:

递归求解图片迷宫路径 windows2003下通过-Solving recursive picture maze path through windows2003

用VC编写的程序，憨豆的眼睛，很有趣的。看看吧-VC prepared by the procedure, like the bean eyes, very interesting. Let"s see it

Matrix 11: Matrix template library 相当好用-Matrix 11: Matrix template library very easy to use

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

用matlab编的关于识别的例子，初学者可以-using Matlab series on the identification example, beginners can s