SEARCH · Search NASA
Results for “Dimensionality Reduction”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Dimensionality Reduction and Global Sensitivity Analysis for the Community Land Model.
Abstract Not Provided
Dimensionality reduction for complex models via Bayesian compressive sensing.
Abstract Not Provided
Adaptive Basis Selection and Dimensionality Reduction with Bayesian Compressive Sensing.
Abstract Not Provided
Adaptive Basis Selection and Dimensionality Reduction with Bayesian Compressive Sensing.
Abstract not provided.
Surrogate Construction and Dimensionality Reduction via Bayesian Compressive Sensing.
Abstract not provided.
INVARIANT SUBSPACES AND DIMENSIONAL REDUCTION FOR QUANTUM DYNAMICS.
Abstract not provided.
Dimensionality Reduction Algorithms for Big Nuclear Data Streams with Application to SCALE Microscopic Cross Sections
Explore the source record for details and available documents.
Cosmological String Solutions by Dimensional Reduction
Explore the source record for details and available documents.
Dimensionality reduction of cortical spiking networks ? quantifying the structure behind the chaos.
Abstract not provided.
STRESS-CONSTRAINED TOPOLOGY DESIGN OF FUNCTIONALLY GRADED LATTICE STRUCTURES WITH SPLINE-BASED DIMENSIONALITY REDUCTION
Explore the source record for details and available documents.
Hyperspectral vegetation identification utilizing polynomial fitting for dimensionality reduction.
Abstract not provided.
Scalable compression and dimensionality reduction
Explore the source record for details and available documents.
Mori-Zwanzig dimensionality reduction for turbulent flows
Explore the source record for details and available documents.
The Analysis of Dimensionality Reduction Techniques in Cryptographic Object Code Classification
This paper compares the application of three different dimension reduction techniques to the problem of locating cryptography in compiled object code. A simple classi?er is used to compare dimension reduction via sorted covariance, principal component analysis, and correlation-based feature subset selection. The analysis concentrates on the classi?cation accuracy as the number of dimensions is increased.
Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data
This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.
Effective and exact holographies from symmetries and dualities
The theoretical basis of the phenomenon of effective and exact dimensional reduction, or holographic correspondence, is investigated in a wide variety of physical systems. We first derive general inequalities linking quantum systems of different spatial (or spatio-temporal) dimensionality, thus establishing bounds on arbitrary correlation functions. These bounds enforce an effective dimensional reduction and become most potent in the presence of certain symmetries. Exact dimensional reduction can stem from a duality that (i) follows from properties of the local density of states, and/or (ii) from properties of Hamiltonian-dependent algebras of interactions. Dualities of the first type (i) are illustrated with large-n vector theories whose local density of states may remain invariant under transformations that change the dimension. We argue that a broad class of examples of dimensional reduction may be understood in terms of the functional dependence of observables on the local density of states. Dualities of the second type (ii) are obtained via bond algebras, a recently developed algebraic tool. We apply this technique to systems displaying topological quantum order, and also discuss the implications of dimensional reduction for the storage of quantum information. - Highlights: Black-Right-Pointing-Pointer Study the phenomenon of dimensional reduction from symmetries and dualities. Black-Right-Pointing-Pointer Derive general (dimensional reduction) correlation inequalities. Black-Right-Pointing-Pointer Show that a duality exists whenever the inequalities become equalities. Black-Right-Pointing-Pointer Apply inequalities and bond algebraic techniques to establish topological order in various systems. Black-Right-Pointing-Pointer Show implications of dimensional reduction for the storage of quantum information.
Dynamics of cosmic strings with higher-dimensional windings
We consider F-strings with arbitrary configurations in the Minkowski directions of a higher-dimensional spacetime, which also wrap and spin around S{sup 1} subcycles of constant radius in an arbitrary internal manifold, and determine the relation between the higher-dimensional and the effective four-dimensional quantities that govern the string dynamics. We show that, for any such configuration, the motion of the windings in the compact space may render the string effectively tensionless from a four-dimensional perspective, so that it remains static with respect to the large dimensions. Such a critical configuration occurs when (locally) exactly half the square of the string length lies in the large dimensions and half lies in the compact space. The critical solution is then seen to arise as a special case, in which the wavelength of the windings is equal to their circumference. As examples, long straight strings and circular loops are considered in detail, and the solutions to the equations of motion that satisfy the tensionless condition are presented. These solutions are then generalized to planar loops and arbitrary three-dimensional configurations. Under the process of dimensional reduction, in which higher-dimensional motion is equivalent to an effective worldsheet current (giving rise to a conserved charge), this phenomenon may be seen as the analogue of the tensionless condition which arises for superconducting and chiral-current carrying cosmic strings.