Rensselaer Polytechnic Institute

About: Rensselaer Polytechnic Institute is a education organization based out in Troy, New York, United States. It is known for research contribution in the topics: Terahertz radiation & Population. The organization has 19024 authors who have published 39922 publications receiving 1414699 citations. The organization is also known as: RPI & Rensselaer Institute.

Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields

Abstract: Contents: Introduction: Differential Equations and Dynamical Systems.- An Introduction to Chaos: Four Examples.- Local Bifurcations.- Averaging and Perturbation from a Geometric Viewpoint.- Hyperbolic Sets, Sympolic Dynamics, and Strange Attractors.- Global Bifurcations.- Local Codimension Two Bifurcations of Flows.- Appendix: Suggestions for Further Reading. Postscript Added at Second Printing. Glossary. References. Index.

Mfold web server for nucleic acid folding and hybridization prediction

Abstract: The abbreviated name,‘mfold web server’,describes a number of closely related software applications available on the World Wide Web (WWW) for the prediction of the secondary structure of single stranded nucleic acids. The objective of this web server is to provide easy access to RNA and DNA folding and hybridization software to the scientific community at large. By making use of universally available web GUIs (Graphical User Interfaces),the server circumvents the problem of portability of this software. Detailed output,in the form of structure plots with or without reliability information,single strand frequency plots and ‘energy dot plots’, are available for the folding of single sequences. A variety of ‘bulk’ servers give less information,but in a shorter time and for up to hundreds of sequences at once. The portal for the mfold web server is http://www.bioinfo.rpi.edu/applications/ mfold. This URL will be referred to as ‘MFOLDROOT’.

The Sloan Digital Sky Survey: Technical summary

Abstract: The Sloan Digital Sky Survey (SDSS) will provide the data to support detailed investigations of the distribution of luminous and nonluminous matter in the universe: a photometrically and astrometrically calibrated digital imaging survey of π sr above about Galactic latitude 30° in five broad optical bands to a depth of g' ~ 23 mag, and a spectroscopic survey of the approximately 106 brightest galaxies and 105 brightest quasars found in the photometric object catalog produced by the imaging survey. This paper summarizes the observational parameters and data products of the SDSS and serves as an introduction to extensive technical on-line documentation.

The Laplacian Pyramid as a Compact Image Code

Abstract: We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations are first removed by subtracting a lowpass filtered copy of the image from the image itself. The result is a net data compression since the difference, or error, image has low variance and entropy, and the low-pass filtered image may represented at reduced sample density. Further data compression is achieved by quantizing the difference image. These steps are then repeated to compress the low-pass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus, the code tends to enhance salient image features. A further advantage of the present code is that it is well suited for many image analysis tasks as well as for image compression. Fast algorithms are described for coding and decoding.

A new, fast, and efficient image codec based on set partitioning in hierarchical trees

Abstract: Embedded zerotree wavelet (EZW) coding, introduced by Shapiro (see IEEE Trans. Signal Processing, vol.41, no.12, p.3445, 1993), is a very effective and computationally simple technique for image compression. We offer an alternative explanation of the principles of its operation, so that the reasons for its excellent performance can be better understood. These principles are partial ordering by magnitude with a set partitioning sorting algorithm, ordered bit plane transmission, and exploitation of self-similarity across different scales of an image wavelet transform. Moreover, we present a new and different implementation based on set partitioning in hierarchical trees (SPIHT), which provides even better performance than our previously reported extension of EZW that surpassed the performance of the original EZW. The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results obtained through much more sophisticated and computationally complex methods. In addition, the new coding and decoding procedures are extremely fast, and they can be made even faster, with only small loss in performance, by omitting entropy coding of the bit stream by the arithmetic code.