CF（COMPACT FLASH CARD）卡技术规范，英文版，PDF格式。

IDL的基础入门教程，Word版的。 -Getting Started with IDL based tutorials, Word version.

北京大学信息安全学科的上课讲义,很详细的介绍了计算机领域的信息安全问题,以及各作加密算法的分析,这是第一部分-Beijing University information security disciplines class lectures, very detailed introduction to the field of computer information security, and the encryption algorithm for the analysis, this is the first part

MAX232 说明-MAX232 Description

PB中的套接字是通过Winsock.pbl库来提供的，它封装了套接字编程中用到的数据结构和过程，在功能上类似于VB中的Winsock控件-PB through the socket to provide Winsock.pbl library, and it encapsulates socket programming used in the data structure and process functions similar to VB

proteus 6.9.4版，尽管最新的版到了7.6，但是有些文件可能必须要6.9版的软件才能打开，我当时找有点费劲，找到后大家共享吧-proteus 6.9.4 version, although the latest version to 7.6, but some files may have to 6.9 version of the software to open, I was struggling a bit to find, locate and share bar

背包问题动态规划算法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.

PCI LOCAL BUS SPECIFICATION REVISION2.3

介绍动态图象处理的好书籍。是我在这方面学习的良师益友。-dynamic image processing on the good books. I was in this context learning mentor.

矢量量化聚类程序，c++编写，已调试通过，内附说明文档。-VQ clustering procedure, c preparation, testing, documentation attached.