Enhanced version of the Serial Peripheral Interface available on Motorola s MC68HC11 family of CPUs.Enhancements include a wider supported operating frequency range, 4deep read and write fifos, and programmable transfer count dependent interrupt generation.
As with the SPI found in MC68HC11 processors the core features programmable clock phase [CPHA] and clock polarity [CPOL]. The core features an 8bit wishbone interface.
Very simple, very small.
ARM下 Implement matrix multiplication of 2 square matrices, with data read from an input file and printed both to the console and to an output file.
• Assume a file with correct data (no garbage, characters, etc.).
• you must check and provide appropriate execution for 2 extra cases, namely when the matrix size given is either “0” , or when the size is greater than the maximum handled of “5” . In these 2 cases you must implement the following behaviour:
o If size = 0, then print a message “Size = 0 is unacceptable” and continue by reading the
next size for the next 2 matrices (if not end of file).
o If size >5, then print two messages: “Size is too big - unacceptable”. Then read and
discard the next (size2 ) integers and continue by reading the next size for the next 2 matrices (if not end of file).
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
Structure the sources so that the compression and decompression code
form a library usable by any program, and write both gzip and zip on
top of this library. This would ideally be a reentrant (thread safe)
library, but this would degrade performance. In the meantime, you can
look at the sample program zread.c.
video editing for is streamlined for fast linear operations over video. It has batch-processing capabilities for processing large numbers of files and can be extended with third-party video filters. VirtualDub is mainly geared toward processing AVI files, although it can read (not write) MPEG-1 and also handle sets of BMP images.
最大流，The programs are designed to run under BSD UNIX.
All programs read from the standard input and write to the standard
output. Run "make" to compile the programs and generators.
File "list" lists the programs produced my "make".
Input files are in DIMACS format. See sample.input.
Java MP3 Player,
Here s a list of features:
- Reads, creates, updates, and removes id3v2.3 and id3v2.4 tags
- Reads, creates, updates, and removes id3v1 tags
- Extracts MPEG data such as bit rate, sample rate, channel mode, etc.
- Calculates playing time of mp3 from mpeg information (no good w/VBR)
- Can read and create Winamp styled playlists
- Offers other utility classes such as MP3FileFilter and MP3Comparator
- NullsoftID3GenreTable object keeps a list of genres for you and can
automatically determine the id3v1 genre from an id3v2 string or the
other way around
This is a GMM related paper written by Dar-Shyan Lee, and useful as well as convenient for programmer to read and research GMM files and improve the efficiency of GMM algorithm
