加密算法
Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives:
- To generate an RSA key
cryptest g
- To encrypt and decrypt a string using RSA
cryptest r
- To calculate MD5, SHS, and RIPEMD-160 message digests:
cryptest m file
- To encrypt and decrypt a string using DES-E ...
工程计算MATLAB code to calculate the reorthogonalized sine tapers
input: N = the length of the time series data to be tapered
p = the number of tapers requested
I = the gap structure a vector of length N
I(t) = 1 if there is data at time t, t=1, ..., N
I(t) = 0 if there is a gap at time t
...
his project was built and tested with WinAVR-20060125.
Make sure the MCU target define in the Makefiles corresponds to the AVR you are using!!
To build the code, just install WinAVR and run "make" from the console in echomaster and
echoslave subdirs.
"make program" will program the device if yo ...
8点基二fft
Fast Fourier Transform (FFT).
Using 8 points, takes about 1.2 ms to execute one FFT.
Sets up General Purpose Timer 1 to generate events at 10 kHz.
Will produce 10 kHz output on T1PWM and T1PWM pins.
The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers, CRC Press, 1993, contains an FDTD code and output files in Appendix B. The same code and output files are contained in this directory.
EXAMPLE SOURCE CODE FOR IMPLIB FILTER
This filter accepts input through the standard input stream, convertsit and outputs it to the standard output am. The streams are linkedthrough pipes, such that the input stream is the output from the import librarian being invoked, and the output stream is con ...
EXAMPLE SOURCE CODE FOR TASM FILTER
his filter accepts input through the standard input stream, converts it and outputs it to the standard output stream. The streams are linked
through pipes, such that the input stream is the output from the assembler
being invoked, and the output stream is connecte ...
/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N.
*
* OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T.
* ...
