-
VB5.0與Windows API之間的呼叫技巧
取得Disk Volume Information
取得Disk Free Space與Total Space
取得Disk Driver List與各個Driver的型態(tài)
取得File 8.3之文件名稱格式
如何用程序來Delete Copy Move Rename File/Directory
如何用VB建立快捷方式(ShortCut)
如何直接開啟一個文件
設(shè)定Mouse 在某個固定范圍
隱藏Mouse
顯示、隱藏win95任務(wù)欄
建立Floating Window(Top Most的window)
建立與讀取.ini文件
檢查開機(jī)方式及Mouse Buttons個數(shù)
如何將整個畫面暗下來，如同關(guān)機(jī)前一般
如何截取屏幕畫面
如何改變桌面的圖片？
如何讀取 Windows 任務(wù)欄的大小及位置？
如何為 ListBox 設(shè)定水平滾動欄？
如何讓 Windows(95 及 NT) 重新開機(jī)？
標(biāo)簽：
Disk
Space
Information
Windows
上傳時間：
2013-12-18
上傳用戶：fanboynet
-
The GNU MP Bignum Library，非常好用的大數(shù)運算庫，GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and Floating point numbers.
標(biāo)簽：
Library
Bignum
The
GNU
上傳時間：
2014-01-08
上傳用戶：a673761058
-
The DHRY program performs the dhrystone benchmarks on the 8051.
Dhrystone is a general-performance benchmark test originally
developed by Reinhold Weicker in 1984. This benchmark is
used to measure and compare the performance of different
computers or, in this case, the efficiency of the code
generated for the same computer by different compilers.
The test reports general performance in dhrystones per second.
Like most benchmark programs, dhrystone consists of standard
code and concentrates on string handling. It uses no
Floating-point operations. It is heavily influenced by
hardware and software design, compiler and linker options,
code optimizing, cache memory, wait states, and integer
data types.
The DHRY program is available in different targets:
Simulator: Large Model: DHRY example in LARGE model
for Simulation
Philips 80C51MX: DHRY example in LARGE model
for the Philips 80C51MC
標(biāo)簽：
general-performanc
benchmarks
Dhrystone
dhrystone
上傳時間：
2016-11-30
上傳用戶：hphh
-
密碼學(xué)界牛人Victor Shoup用C++編寫數(shù)論類庫。
NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary precision Floating point arithmetic.
NTL provides high quality implementations of state-of-the-art algorithms for:
* arbitrary length integer arithmetic and arbitrary precision Floating point arithmetic
* polynomial arithmetic over the integers and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, computation of minimal polynomials, traces, norms, and more
* lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev
* basic linear algebra over the integers, finite fields, and arbitrary precision Floating point numbers.
標(biāo)簽：
high-performance
providing
portable
library
上傳時間：
2014-01-04
上傳用戶：exxxds
-
200-MHz ARM920T Processor
• 16-kbyte Instruction Cache
• 16-kbyte Data Cache
• Linux® , Microsoft® Windows® CE-enabled MMU
• 100-MHz System Bus
• MaverickCrunch™ Math Engine
• Floating Point, Integer, and Signal Processing
Instructions
• Optimized for digital music compression and
decompression algorithms.
• Hardware interlocks allow in-line coding.
• MaverickKey™ IDs
• 32-bit Unique ID can be used for DRM-compliant
128-bit random ID.
• Integrated Peripheral Interfaces
• 32-bit SDRAM Interface
標(biāo)簽：
8226
Cache
kbyte
Instruction
上傳時間：
2017-04-08
上傳用戶：comua
-
This library defines basic operation on polynomials, and contains also 3 different roots (zeroes)-finding methods that can handle quite large polynomials (>1000 coefs)
Implemented in ANSI C++ Templates. Handles all real and complex Floating point types. Html doc is included.
標(biāo)簽：
polynomials
different
operation
contains
上傳時間：
2013-12-18
上傳用戶：yan2267246
-
ieee754的標(biāo)準(zhǔn)，原英文版的！Twenty years ago anarchy threatened Floating-point arithmetic. Over a dozen commercially significant arithmetics
boasted diverse wordsizes, precisions, rounding procedures and over/underflow behaviors, and more were in the
works. “Portable” software intended to reconcile that numerical diversity had become unbearably costly to
develop.
Thirteen years ago, when IEEE 754 became official, major microprocessor manufacturers had already adopted it
despite the challenge it posed to implementors. With unprecedented altruism, hardware designers had risen to its
challenge in the belief that they would ease and encourage a vast burgeoning of numerical software. They did
succeed to a considerable extent. Anyway, rounding anomalies that preoccupied all of us in the 1970s afflict only
CRAY X-MPs — J90s now.
標(biāo)簽：
ieee
754
標(biāo)準(zhǔn)
上傳時間：
2017-07-28
上傳用戶：894898248
-
Topics Practices:
Programming and Numerical Methods
Practice 1: Introduction to C
Practice 2: Cycles and functions
First part cycles
Part Two: Roles
Practice 3 - Floating point arithmetic
Practice 4 - Search for roots of functions
Practice 5 - Numerical Integration
Practice 6 - Arrangements and matrices
Part One: Arrangements
Part II: Matrices
Practice 7 - Systems of linear equations
Practice 8 - Interpolation
Practice 9 - Algorithm Design Techniques
標(biāo)簽：
Practice
Introduction
Programming
Practices
上傳時間：
2013-12-16
上傳用戶：R50974
-
Implementation of GPU (Graphics Processing Unit) that rendered triangle based models. Our goal was to generate complex models with a movable camera. We wanted to be able to render complex images that consisted of hundreds to thousands of triangles. We wanted to apply interpolated shading on the objects, so that they appeared more
smooth and realisitc, and to have a camera that orbitted around the object, which allowed us to
look arond the object with a stationary light source. We chose to do this in hardware, because our initial implementation using running software on the NIOS II processor was too slow. Implementing parallelism in hardware is also easier to do than in software, which allows for more efficiency. We used Professor Land s Floating point hardware, which allowed us to do calculations efficiency, which is essential to graphics.
標(biāo)簽：
Implementation
Processing
Graphics
rendered
上傳時間：
2014-11-22
上傳用戶：shawvi
-
The 4.0 kbit/s speech codec described in this paper is based on a
Frequency Domain Interpolative (FDI) coding technique, which
belongs to the class of prototype waveform Interpolation (PWI)
coding techniques. The codec also has an integrated voice
activity detector (VAD) and a noise reduction capability. The
input signal is subjected to LPC analysis and the prediction
residual is separated into a slowly evolving waveform (SEW) and
a rapidly evolving waveform (REW) components. The SEW
magnitude component is quantized using a hierarchical
predictive vector quantization approach. The REW magnitude is
quantized using a gain and a sub-band based shape. SEW and
REW phases are derived at the decoder using a phase model,
based on a transmitted measure of voice periodicity. The spectral
(LSP) parameters are quantized using a combination of scalar
and vector quantizers. The 4.0 kbits/s coder has an algorithmic
delay of 60 ms and an estimated Floating point complexity of
21.5 MIPS. The performance of this coder has been evaluated
using in-house MOS tests under various conditions such as
background noise. channel errors, self-tandem. and DTX mode
of operation, and has been shown to be statistically equivalent to
ITU-T (3.729 8 kbps codec across all conditions tested.
標(biāo)簽：
frequency-domain
interpolation
performance
Design
kbit_s
speech
coder
based
and
of
上傳時間：
2018-04-08
上傳用戶：kilohorse
