搜索结果

The CD Audio sample allows some non-SCSI2 CD ROMs to support audio operations by intercepting the relevant audio ioctls and translating them into the command block(s) expected by the non-compliant cdroms. It supports Plug and Play and Power Management, and is 64-bit compliant.

包含一下内容: * An extensible agent * An SNMP library * tools to request or set information from SNMP agents * tools to generate and handle SNMP traps * a version of the unix netstat command using SNMP * a graphical Perl/Tk/SNMP based mib browser

a3load is 8051 firmware that can be used for uploading or downloading to EZ-USB RAM (internal or external). It implements the vendor specific command bRequest = 0xA3. The address to download/upload to/from is specified in the wValue field of the SETUP packet and the length of the transfer in the wL ...

OFDM-MIMO收发系统，The simulator GUI is started with command ui_start in Matlab command window.

A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.

abel Tool Sample Requires: Visual Basic 6 and MapObjects 2.x Data: redlands.shp (Redlands sample data set from MO 2.x) Interactive Labeling Tool If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the check box is not ch ...

USB启动盘制作软件 市面上现在大多数U盘都支持启动机器的功，但是要制作启动型U盘，需要进入WIN98，现在很多人机器上都没有98了吧，呵呵。为了做个启动盘，装一个98，多冤啊。这个小软件就是为此编制的，在WIN2K/XP下运行，可以直接把U盘做成启动盘。程序自带了MSDOS7.1的两个 基本启动文件IO.SYS和COMMAND.COM，如果要制作 ...

J2MEUI设计Demo，其中包含UI中的界面实例，Test，Command等控件

数字运算，判断一个数是否接近素数 A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum o ...

2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1. Print 2^? mod n = 1 otherwise. You should replace x and n with specific numbers. ...