landing and user passwords are admin. It is a very good use of materials managem...

windowsNT下读写端口-read and write ports under Windows NT.

应用背景这个Module主要分析了EDID数据中关于显示器的一些重要的配置信息，比如显示器屏幕的实际的宽高比(单位cm)、显示器的厂商与产品的ID号、显示器的生产日期、显示器的版本号、显示器的反差系数(Gamma)以及电源管理模式等...关键技术其开发的工具是VS2012的C#控制台应用程序，该程序主要涉及对显示器EDID数据的解析，EDID: Extended Display Identification Data（扩展显示标识数据）是一种VESA 标准数据格式，其中包含有关监视器及其性能的参数，包括供应商信息、最大图像大小、颜色设置、厂商预设置、频率范围的限制以及显示器名和序列号的字符串。 这些信息保存在 display 节中，用来通过一个 DDC（Display Data Channel）与系统进行通信，这是在显示器和 PC 图形适配器之间进行的。

abela beier 编程-program with abela beier

The Davicom DM9008A NDIS CE miniport device driver is used to be the network component of the Microsoft WinCE.net enables hardware containing Davicom s fast ethernet controller DM9008A -The Davicom DM9008A NDIS CE miniport Devic e driver is used to be the network component of th e Microsoft WinCE.net enables hardware 2005 ning Davicom s DM9008 to fast ethernet controller A

thread safe locking queue implementation in c++, easily convert to c implementation.

delfet3d计算后处理，可以从中间点，插值到网格点上-After treatment delfet3d calculated from the middle point, interpolated to the grid point

Visual C++下开发的用于和DSP通信的程序，该程序用用于调试DSP时一些数据的观测和记录-Visual C++ under development and DSP communications for the program for debugging DSP with some of the observations and record data

开源GIS：openlayer-2.1-source 文件，-openlayer-2.1-source（GIS）

一、问题描述：将多个多项式输入并存储在内存中，然后对多项式进行加，减，乘等基本运算。 二、实行数据方法：用单链表来储存多项式，每个节点存储一项-First, the problem Description: The number of polynomial input and stored in memory, and then make additions to the polynomial, subtraction, multiplication and other basic computing. Second, the implementation of data Methods: Single-Linked List to store polynomials, each node storing a

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!