These files contain all of the code listings in
Java 2: The Complete Reference
The source code is organized into files by chapter.
Within each chapter file, the listings are stored
in the same order as they appear in the book.
Simply edit the appropriate file to extract the
listing in which you are interested.
The code for Scrabblet is in its own ZIP file,
called CHAP32.ZIP.
A class--the basic building block of an object-oriented language such as Java--is a template that describes the data and behavior associated with instances of that class. When you instantiate a class you create an object that looks and feels like other instances of the same class. The data associated with a class or object is stored in variables the behavior associated with a class or object is implemented with methods. Methods are similar to the functions or procedures in procedural languages such as C.
This project demonstrates the use of secure hash functions technique
to implement a file encryption / decryption system.
This implemented application can encrypt / decrypt multiple files
on the fly using a password. The password supplied by the user
is used as the source message from which the hash code (key) is
generated using the SHA algorithm. Then this key is used to
enctypted the data in the file(s). This key is stored in the
encrypted file along with the encrypted data.
This project demonstrates the use of secure hash functions technique
to implement a file encryption / decryption system.
This implemented application can encrypt / decrypt multiple files
on the fly using a password. The password supplied by the user
is used as the source message from which the hash code (key) is
generated using the SHA algorithm. Then this key is used to
enctypted the data in the file(s). This key is stored in the
encrypted file along with the encrypted data.
MPEG-4 標準文檔
access to visual objects in natural and synthetic moving pictures and associated natural or synthetic sound for
various applications such as digital storage media, internet, various forms of wired or wireless communication etc.
The use of ISO/IEC 14496 means that motion video can be manipulated as a form of computer data and can be
stored on various storage media, transmitted and received over existing and future networks and distributed on
existing and future broadcast channels.
This program incorporates the FV method for solving the Navier-Stokes equations using 2D, Cartesian grids and the staggered arrangement of variables. Variables are stored as 2D arrays. SIMPLE method is used for pressure calculation. UDS and CDS are implemented for the discretization of convective terms, CDS is used for the diffusive terms. The boundary conditions are set for the lid-driven cavity flow. Only steady flows are considered.
If you have ever wanted to store data temporarily in your Delphi Win32/.Net, C++ Builder or Kylix application, and you at the same time wanted full access to the data as if they were stored in a database table, you have the right solution here. kbmMemTable is a full TDataset compatible in memory table loaded with functionality.
The code performs a number (ITERS) of iterations of the
Bailey s 6-step FFT algorithm (following the ideas in the
CMU Task parallel suite).
1.- Generates an input signal vector (dgen) with size
n=n1xn2 stored in row major order
In this code the size of the input signal
is NN=NxN (n=NN, n1=n2=N)
2.- Transpose (tpose) A to have it stored in column
major order
3.- Perform independent FFTs on the rows (cffts)
4.- Scale each element of the resulting array by a
factor of w[n]**(p*q)
5.- Transpose (tpose) to prepair it for the next step
6.- Perform independent FFTs on the rows (cffts)
7.- Transpose the resulting matrix
The code requires nested Parallelism.
RS_latch using vhdl,
When using static gates as building blocks, the most fundamental latch is the simple SR latch, where S and R stand for set and reset. It can be constructed from a pair of cross-coupled NOR (Not OR) logic gates. The stored bit is present on the output marked Q.
Normally, in storage mode, the S and R inputs are both low, and feedback maintains the Q and Q outputs in a constant state, with Q the complement of Q. If S (Set) is pulsed high while R is held low, then the Q output is forced high, and stays high when S returns to low similarly, if R (Reset) is pulsed high while S is held low, then the Q output is forced low, and stays low when R returns to low.
To write data to the FIFO, present the data to be written and assert the write enable. At the next rising edge of the clock, the data will be written. For every rising edge of the clock that the write enable is asserted, a piece of data is written into the FIFO.
If the FIFO has data in it, the value at the head of the FIFO is present on the FIFO data output. To read data from the FIFO, assert the read enable. At the next rising edge of the clock, capture the data output the FIFO will subsequently advance to the next piece of data stored in the FIFO.
