CI革命―塑造企业个性与美感的法宝

mfc资源大全包含MFC编程各个方面的源码-mfc resources Daquan MFC programming includes all aspects of FOSS

I2C最经典的技术文档集合，包括了总线规范、协议、设计应用。-I2C most classic collection of technical documentation, including a bus norms, protocols, design applications.

嵌入式BootLoader技术内幕，对嵌入式linux开发有很大参考价值。-BootLoader technology embedded inside, the development of embedded linux has a great reference value.

组播以其独特的优势，在网络通信方面的应用越来越广泛，但随之而来的就是安全问题，其中密钥管理是最基本的问题之一。本文研究了安全组播中的密钥管理问题。介绍了现有的两种主要解决方案，即SKDC方案和密钥树管理方案，并分析了它们的不足之处，指出基于密钥树的研究方向，在此基础上提出基于Huffman密钥分级树的密钥管理方案，将布尔函数的分析方法运用其中使管理简便化。并对该方案的性能从密钥管理的存储空间和密钥刷新通信量两个方面，给出了相应的分析。-Multicast With its unique advantages in the communication network is widely applied, but the attendant security issues, key management is the most basic one of the problems. This paper studies the security Multicast key management issues. Of the two main existing solutions, and key programs SKDC tree management program analysis of their deficiencies, that the tree on the key directions of research on this basis based on the classification tree Huffman key Key Management Program, Boolean function of the analytical method which enable the use of simple. Program and the performance of key management from the storage space and traffic Key set two, given the corresponding analysis.

MFC编程的一些好资料，有很多Windows的函数说明和例子-MFC programming some good information, a function of Windows has a lot of notes and examples

VOIP设备测试要领-VoIP test equipment essentials

对于可拓学中统一集的描述。统一集是模式识别的另外一种思路，很值得学习。-For a unified set of extenics in the description. Uniform set is another idea of pattern recognition, it is worth learning.

本人根据自己的开发经验总结的jsp开发过程中的一些中文乱码问题及解决方法。-I according to their own development experience in the jsp development process a number of Chinese garbled problems and solutions.

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

关于网络命令的书籍,可以让你接触到一些最实用的网络命令.-orders on the books network, which will let you access to some of the most practical network orders.