-
YUVPlayer-corrected
修正的版本,运行时下载个foreman_qcif.yuv,把程序中相关的路径改成你自己放foreman_qcif.yuv的路径就是可以了(Revised version, run-time to download a foreman_qcif.yuv, the procedures related to the path into the path of your own that you can put a foreman_qcif.yuv)
- 2010-08-07 17:36:38下载
- 积分:1
-
VCPPMulti-COM
windows下的VC++有关于多com接口的编程,是一个在工程中实际用过的例子。(under windows with VC++ programming interface for multi-com, used in a real project.)
- 2011-10-05 23:10:53下载
- 积分:1
-
GPS
《GPS应用程序设计》李洪涛著,此书对应的完整源代码,和一分清单。(" GPS application design," Li Hongtao with, the book corresponds to the full source code, and a sub-lists.)
- 2021-05-12 17:30:03下载
- 积分:1
-
06_DS18B20
DS18B20温度测量实验
功能:在数码管上显示当前DS18B20测到的温度
小数部分为4位,温度为负时,最高位显示"-"
测量范围:-55℃ ~ +125℃(DS18B20 temperature measurement test functions: in the digital tube displays the current measured temperature of DS18B20 fractional portion 4, the temperature is negative, the highest display " -" Measuring range:-55 ℃ ~+125 ℃)
- 2010-01-13 09:00:49下载
- 积分:1
-
testdlg
检测NAT类型的客户端,程序中指定了服务器IP地址,用户可以自行修改(Detect NAT type of the client, the program specifies the server IP address, the user can modify)
- 2013-08-22 10:16:36下载
- 积分:1
-
HardwareID
获取 电脑 CPU 硬盘序列号 网卡MAC 主板 显卡 以及MD5 加密(Access to computer CPU hard drive serial number card MAC motherboard graphics and MD5 encryption)
- 2015-02-25 00:21:44下载
- 积分:1
-
mangemaent
存储管理的主要功能之一是合理地分配空间。请求页式管理是一种常用的虚拟存储管理技术。
本实验的目的是通过请求页式管理中页面置换算法模拟设计,了解虚拟存储技术的特点,掌握请求页式存储管理的页面置换算法。(One of the main functions of storage management is a reasonable allocation of space. The requested page style management is a common virtual storage management technology. The purpose of this study is to page through the request-type management page replacement algorithm for analog design, understanding the characteristics of virtual storage technology, master requested page storage management page replacement algorithm.)
- 2010-05-29 16:05:23下载
- 积分:1
-
8df5833b7339
win32 SDK 方式实现拦截系统关机(Win32 SDK)
- 2013-09-16 14:11:26下载
- 积分:1
-
how_many_fibs
Recall the definition of the Fibonacci numbers:
f1 := 1
f2 := 2
fn := fn-1 + fn-2 (n>=3)
Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b]. (Recall the definition of the Fibonacci numbers:
f1 := 1
f2 := 2
fn := fn-1+ fn-2 (n>=3)
Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b]. )
- 2009-11-27 15:18:02下载
- 积分:1
-
bin2inc
说明: Binary to C include file
- 2020-06-25 07:00:02下载
- 积分:1