Java is one of the most widely used programming languages today. It was first released by Sun Microsystems in 1995. Over the years, its popularity has grown to the point where it plays an important role in most of our lives. From laptops to data centers, game consoles to scientific supercomputers, cell phones to the Internet, Java is everywhere! There are tons of applications and heaps of websites that will not work unless you have Java installed, and more are created every day. And, of course, Java is used to power what has become the world's most dominant mobile platform, Android.

Reporting the state of the art of color image processing, this monograph fills an existing gap in the literature on digital signal and image processing. It can serve the needs of different users at different levels: as a textbook which covers a graduate image processing course, as a up-to-date reference for researchers since it offers a broad survey of the relevant literature, and as a relevant information source for development engineers who work in the design and the implementation of various image processing tasks. Part of the material in the book was the basis of seminars at the University of Toronto. The book contains numerous examples and pictures of color image processing results, as well as tables which summarize the results of the analysis. Algorithms implemented in JAVA can be downloaded from the author's website .

This book was undertaken to provide a text and reference on the theory and practice of the FFT and its common usage. This book is organized in only four chapters, and is intended as a tutorial on the use of the FFf and its trade space. The trade space of the FFT is the parameters in its usage and the relationships between them - the sampie rate, the total number of points or the interval over which processing occurs in a single FFf, the selectivity of tuning to a given frequency over signals out-of-band, and the bandwidth over which a signal appears. The examples given in this text are in FORTRAN 9512003. FORTRAN 2003 was frozen as a standard while this work was in progress. The listings given here are intended as an aid in understanding the FFT and associated algorithms such as spectral window weightings, with the goal of making the best of them more accessible to the reader. The code I use here provides a simple bridge between the material in the text and implementation in FORTRAN 2003, C++, Java, MATLAB ©, and other modem languages. The examples are sufficiently simple to be translated into older languages such as C and FORTRAN 77 if desired.

l This book evolved from the ARCADE evaluation exercise that started in 1995. The project's goal is to evaluate alignment systems for parallel texts, i. e. , texts accompanied by their translation. Thirteen teams from various places around the world have participated so far and for the first time, some ten to fifteen years after the first alignment techniques were designed, the community has been able to get a clear picture of the behaviour of alignment systems. Several chapters in this book describe the details of competing systems, and the last chapter is devoted to the description of the evaluation protocol and results. The remaining chapters were especially commissioned from researchers who have been major figures in the field in recent years, in an attempt to address a wide range of topics that describe the state of the art in parallel text processing and use. As I recalled in the introduction, the Rosetta stone won eternal fame as the prototype of parallel texts, but such texts are probably almost as old as the invention of writing. Nowadays, parallel texts are electronic, and they are be­ coming an increasingly important resource for building the natural language processing tools needed in the "multilingual information society" that is cur­ rently emerging at an incredible speed. Applications are numerous, and they are expanding every day: multilingual lexicography and terminology, machine and human translation, cross-language information retrieval, language learning, etc.