DirectX

这是一个关于MODEM的网络编程源代码，采用VC++编写。(This is a MODEM network programming source code, written using VC++.)

说明：  该程序实现了对mdb数据库文件，用mfc来编写界面进行浏览。压缩文件里的StuInfo6.mdb为所给的数据库文件。 通过按钮控件可以将记录移动到第一条记录，最后一条记录以及上一条记录，下一条记录等等。(The program realized mdb database file to write the interface with mfc browsing. Compressed file in the StuInfo6.mdb for the given database file. Button controls can be recorded through the move to the first record, last record and previous record, next record and so on. )

cypress USB 中GPIF中相关的开发资料(keyword: cypress USB GPIF)

说明：  程序实现了一个简单的网络版的掷骰子，一个服务器端，另一个客户端。(Program implements a simple network version of the dice, a server-side, another client.)

行程编码的基本原理是：用一个符号值或串长代替具有相同值的连续符号（连续符号构成了一段连续的“行程”。行程编码因此而得名），使符号长度少于原始数据的长度。只在各行或者各列数据的代码发生变化时，一次记录该代码及相同代码重复的个数，从而实现数据的压缩。(The basic principle of run length coding is: a symbolic value or string length instead of having the same value of consecutive symbols that symbol length less than the length of the original data (consecutive symbols constitute a period of continuous stroke run-length encoding, hence the name.) . Only when the code for each row or each column of data is changed, the recording time code and the same number of code duplication, in order to achieve compressed data.)

一个GPRS开发的例子，稍做修改，就可用在自己的项目中(The development of a GPRS example, some small modifications, you can use in their own projects)

计算机系贷款管理(Department of Computer Loan Management)

adf4350的设计主程序和实现的功能输出频率(adf4350 the design and implementation of the function main output frequency)

f4系统下 usb+片上fsmc的实例demo 可为sd底层快速操作 提供可能(Under f4 systems usb+ piece fsmc instance demo for fast operation provides possible underlying sd)

斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作(Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the basis of further to the O (1) to achieve specified nodes and reduce the value of O (log n) time to complete the deletion of arbitrary nodes parade for)