There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

The 11th edition of Harrison's Principles of Internal Medicine welcomes Anthony Fauci to its editorial staff, in addition to more than 85 new contributors. While the organization of the book is similar to previous editions, major emphasis has been placed on disorders that affect multiple organ systems. Important advances in genetics, immunology, and oncology are emphasized. Many chapters of the book have been rewritten and describe major advances in internal medicine. Subjects that received only a paragraph or two of attention in previous editions are now covered in entire chapters. Among the chapters that have been extensively revised are the chapters on infections in the compromised host, on skin rashes in infections, on many of the viral infections, including cytomegalovirus and Epstein-Barr virus, on sexually transmitted diseases, on diabetes mellitus, on disorders of bone and mineral metabolism, and on lymphadenopathy and splenomegaly. The major revisions in these chapters and many

Harrison's Principles of Internal Medicine

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

MUCKE aims to mine a large volume of images, to structure them conceptually and to use this conceptual structuring in order to improve large-scale image retrieval. The last decade witnessed important progress concerning low-level image representations. However, there are a number problems which need to be solved in order to unleash the full potential of image mining in applications. The central problem with low-level representations is the mismatch between them and the human interpretation of image content. This problem can be instantiated, for instance, by the incapability of existing descriptors to capture spatial relationships between the concepts represented or by their incapability to convey an explanation of why two images are similar in a content-based image retrieval framework. We start by assessing existing local descriptors for image classification and by proposing to use co-occurrence matrices to better capture spatial relationships in images. The main focus in MUCKE is on cleaning large scale Web image corpora and on proposing image representations which are closer to the human interpretation of images. Consequently, we introduce methods which tackle these two problems and compare results to state of the art methods. Note: some aspects of this deliverable are withheld at this time as they are pending review. Please contact the authors for a preview.

http://ieeexplore.ieee.org/iel2/4524/12820/00592460.pdf

Image Processing

We explore the effect of dimensionality on the nearest neighbor problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective, we present empirical results on both real and synthetic data sets that demonstrate that this effect can occur for as few as 10-15 dimensions. These results should not be interpreted to mean that high-dimensional indexing is never meaningful; we illustrate this point by identifying some high-dimensional workloads for which this effect does not occur. However, our results do emphasize that the methodology used almost universally in the database literature to evaluate high-dimensional indexing techniques is flawed, and should be modified. In particular, most such techniques proposed in the literature are not evaluated versus simple linear scan, and are evaluated over workloads for which nearest neighbor is not meaningful. Often, even the reported experiments, when analyzed carefully, show that linear scan would outperform the techniques being proposed on the workloads studied in high (10-15) dimensionality!.

When is nearest neighbor meaningful

In this paper, a general, efficient, split algorithm to compute the two-dimensional quaternion discrete Fourier transform (2-D QDFT), by using the special partitioning in the frequency domain, is introduced. The partition determines an effective transformation, or color image representation in the form of 1-D quaternion signals which allow for splitting the N × M-point 2-D QDFT into a set of 1-D QDFTs. Comparative estimates revealing the efficiency of the proposed algorithms with respect to the known ones are given. In particular, a proposed method of calculating the 2r × 2r -point 2-D QDFT uses 18N2 less multiplications than the well-known column-row method and method of calculation based on the symplectic decomposition. The proposed algorithm is simple to apply and design, which makes it very practical in color image processing in the frequency domain.

Tensor representation of color images and fast 2D quaternion discrete Fourier transform

Combined local and global image enhancement algorithm.

A comparative study of image feature detection and matching algorithms for touchless fingerprint systems.

In this paper, we present a key dependent covert communication system by incorporating Fibonacci P-codes and morphological statistical analysis. The key advantages of this process are: 1) The number of bit planes depend on the parameter P (ges 0 ) that could be used as key. 2) It is applicable to almost all digital imagery formats. 3) More number of digital information bits is focused over the least significant bit-layers. Thus, it has lower impact on the cover. The morphological variations of cover are employed for hiding secured information into the Fibonacci P-code bit planes. Simulation results were accomplished, using 30 color and 20 grayscale bitmap images varying in size, and classes of image features. In comparison with other existing adaptive and non-adaptive embedding methods will be presented. The proposed method also shows to have a greater resistance to detection.

Key Dependent Covert Communication System Using Fibonacci P-Codes

In this paper, tensor algorithms for calculating the two-dimensional (2-D) discrete cosine transform (DCT) are presented. The tensor approach is based on the concept of the covering revealing the transforms, which yields in particular the splitting of the shifted 2/sup r//spl times/2/sup r/-point Fourier and cosine transforms into 2/sup r-1/3 one-dimensional (1-D) incomplete 2/sup r/-point transforms. The multiplicative complexity of the 2-D 2/sup r//spl times/2/sup r/-point discrete cosine transforms in terms of the tensor representation is 4/sup r/3-2/sup r-2/(r/sup 2/+7r+14), which is reduced to 4/sup r/8/3-2/sup r/(r/sup 2/+7r+10)-20/3 when using the improved tensor algorithm. The multiplicative complexity in the general L/sup r//spl times/L/sup r/ case, with a prime L>2, as well as in the L/sub 1/L/sub 2//spl times/L/sub 1/L/sub 2/ case, with arbitrary co-prime L/sub 1/, L/sub 2/>1, is provided. The examples of the tensor algorithms for calculating the 8/spl times/8-point DCT through 104, 88, and 84 multiplications are given in detail. Based on the proposed concept, the fast algorithm for calculating the 1-D DCT-I is also developed. The multiplicative complexity of the 2/sup r/-point DCT-I is 2/sup r+1/-(r-2)(r+5)/2-8. The comparative estimates with the known algorithms are given.

Sos S. Agaian

Papers

Tensor representation of color images and fast 2D quaternion discrete Fourier transform

Combined local and global image enhancement algorithm.

A comparative study of image feature detection and matching algorithms for touchless fingerprint systems.

Key Dependent Covert Communication System Using Fibonacci P-Codes

Shifted Fourier transform-based tensor algorithms for the 2-D DCT