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 & Finite element method. The organization has 19024 authors who have published 39922 publications receiving 1414699 citations. The organization is also known as: RPI & Rensselaer Institute.

A Corner-Finding Algorithm for Chain-Coded Curves

Abstract: A method for detecting sharp "corners" in a chain-coded plane curve is described. A measure for the prominence ("cornerity") of a corner is introduced. The effectiveness of the method is illustrated by means of a number of examples.

On the capacity improvement of ad hoc wireless networks using directional antennas

Abstract: The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity of an ad hoc network does not scale well with the increasing number of nodes in the system when using omnidirectional antennas [6]. We investigate the capacity of ad hoc wireless networks using directional antennas. In this work, we consider arbitrary networks and random networks where nodes are assumed to be static.In arbitrary networks, due to the reduction of the interference area, the capacity gain is proven to be √2π/α when using directional transmission and omni reception. Because of the reduced probability of two neighbors pointing to each other, the capacity gain is √2π/β when omni transmission and directional reception are used. Although these two expressions look similar, the proof technique is different. By taking advantage of the above two approaches, the capacity gain is 2π/√αβ when both transmission and reception are directional.For random networks, interfering neighbors are reduced due to the decrease of interference area when directional antennas are used for transmission and/or reception. The throughput improvement factor is 2π/α, 2π/β and 4π2/αβ for directional transmission/omni reception, omni transmission/direc-tional reception, and directional transmission/directional reception, respectively.We have also analyzed hybrid beamform patterns that are a mix of omnidirectional/directional and a better model of real directional antennas.

Motion-compensated 3-D subband coding of video

Abstract: This paper describes a video coding system based on motion-compensated three-dimensional (3-D) subband/wavelet coding (MC-3DSBC), which can overcome the limits of both 3-D SBC and MC prediction-based coding. In this new system, spatio-temporal subbands are generated by MC temporal analysis and a spatial wavelet transform, and then encoded by 3-D subband-finite state scalar quantization (3DSB-FSSQ). The rate allocation from the GOP level to each class of subbands is optimized by utilizing the structural property of MC-3DSBC that additive superposition approximately holds for both rate and distortion. The proposed video coding system is applied to several test video clips. Its performance exceeds that of both a known MPEG-1 implementation and a similar subband MC predictive coder while maintaining modest computational complexity and memory size.

Clustering Large Graphs via the Singular Value Decomposition

Abstract: We consider the problem of partitioning a set of m points in the n-dimensional Euclidean space into k clusters (usually m and n are variable, while k is fixed), so as to minimize the sum of squared distances between each point and its cluster center. This formulation is usually the objective of the k-means clustering algorithm (Kanungo et al. (2000)). We prove that this problem in NP-hard even for k e 2, and we consider a continuous relaxation of this discrete problem: find the k-dimensional subspace V that minimizes the sum of squared distances to V of the m points. This relaxation can be solved by computing the Singular Value Decomposition (SVD) of the m × n matrix A that represents the m pointss this solution can be used to get a 2-approximation algorithm for the original problem. We then argue that in fact the relaxation provides a generalized clustering which is useful in its own right. Finally, we show that the SVD of a random submatrix—chosen according to a suitable probability distribution—of a given matrix provides an approximation to the SVD of the whole matrix, thus yielding a very fast randomized algorithm. We expect this algorithm to be the main contribution of this paper, since it can be applied to problems of very large size which typically arise in modern applications.

Selective Attachment of Gold Nanoparticles to Nitrogen-Doped Carbon Nanotubes

Abstract: Gold nanoparticles were selectively attached to chemically functionalized surface sites on nitrogen-doped carbon (CNx) nanotubes. A cationic polyelectrolyte was adsorbed on the surface of the nanotubes by electrostatic interaction between carboxyl groups on the chemically oxidized nanotube surface and polyelectrolyte chains. Negatively charged 10 nm gold nanoparticles from a gold colloid suspension were subsequently anchored to the surface of the nanotubes through the electrostatic interaction between the polyelectrolyte and the nanoparticles. This approach provides an efficient method to attach other nanostructures to carbon nanotubes and can be used as an illustrative detection of the functional groups on carbon nanotube surfaces.