Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EUCLIDEAN SPACE”

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.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

A Generalized, Compactly-Supported Correlation Function for Data Assimilation Applications

Correlation functions play an essential role in modern data assimilation, where they are used to model covariances given a set of tunable parameters or applied as tapering functions to localize covariances in ensemble-based schemes. One of the most widely-used correlation functions in data assimilation is the Gaspari and Cohn (1999) piecewise-rational, compactly-supported parametric correlation function (hereafter referred to as GC99). The GC99 correlation function is useful due to its tunable cut-off parameter c and Gaussian-like shape achieved when the parameter a is set to one-half. These properties are attractive for tapering functions in data assimilation applications. However, the GC99 correlation function is homogeneous over Euclidean 3-space and isotropic when restricted to the sphere, properties that may be less than ideal for some geophysical applications. GC99 is also compactly-supported on a sphere of fixed radius, which requires tuning of the cut-off parameter c that can depend on the specific application. This work presents a generalization of the GC99 correlation function that allows the cut-off parameter c and shape parameter a to vary over space to gain more flexibility in shape while maintaining its compact support property. The function, which we call the Generalized Gaspari Cohn (GenGC) correlation function, introduces inhomogeneity in Euclidean 3-space and anisotropy when restricted to the sphere by allowing both parameters c and a to vary, as functions, over the spatial domain. The GC99 correlation function is a special case of GenGC where the functions c and a are held constant, as fixed parameters rather than functions. The GenGC correlation function also generalizes the follow-on to the work of Gaspari and Cohn (1999) presented in Gaspari et al. (2006), which allowed a to vary while keeping c fixed. We illustrate through simple one- and two-dimensional examples the variety of inhomogeneous and anisotropic correlation functions GenGC can produce by varying c and a over space, and suggest applications where they may be useful in data assimilation, such as covariance modeling or localization. In particular, we describe how the GenGC correlation function can be used to construct covariances using correlation length and variance fields derived from dynamics. For example, the correlation length field for advective dynamics is governed by a partial differential equation (PDE) in N spatial dimensions, where N is the number of space dimensions of the state. Correlation length fields can be determined from this PDE and used with GenGC to construct the corresponding correlations. We can then approximate the full covariance by rescaling by the variance, which also satisfies a PDE in N spatial dimensions for advective dynamics. Thus we can approximate the full covariance without solving the covariance PDE, which is in 2N spatial dimensions, by solving just two PDEs each in only N spatial dimensions. This approach to evolving the correlation length and variance fields, then reconstructing the correlations using GenGC, is suggested as an alternative to current methods of covariance modeling in data assimilation algorithms.

GC99↗
NASA NTRS1989

Use of 3D vision for fine robot motion

An integration of 3-D vision systems with robot manipulators will allow robots to operate in a poorly structured environment by visually locating targets and obstacles. However, by using computer vision for objects acquisition makes the problem of overall system calibration even more difficult. Indeed, in a CAD based manipulation a control architecture has to find an accurate mapping between the 3-D Euclidean work space and a robot configuration space (joint angles). If a stereo vision is involved, then one needs to map a pair of 2-D video images directly into the robot configuration space. Neural Network approach aside, a common solution to this problem is to calibrate vision and manipulator independently, and then tie them via common mapping into the task space. In other words, both vision and robot refer to some common Absolute Euclidean Coordinate Frame via their individual mappings. This approach has two major difficulties. First a vision system has to be calibrated over the total work space. And second, the absolute frame, which is usually quite arbitrary, has to be the same with a high degree of precision for both robot and vision subsystem calibrations. The use of computer vision to allow robust fine motion manipulation in a poorly structured world which is currently in progress is described along with the preliminary results and encountered problems.

Lokshin, Anatole↗
NASA NTRSDate not supplied

High dimensional similarity search with quantum assisted variational autoencoder

Recent progress in quantum algorithms and hardware is indicator of the potential importance of quantum computing in the next future. However, finding suitable application areas remains an active area of research. Quantum machine learning [1] is touted as a potential approach to demonstrate quantum advantage within both the gate-model [2,3] and the adiabatic [4,5] schemes. For instance, the Quantum-assisted Variational Autoencoder (QVAE) [6] has been proposed as a quantum enhancement to the discrete VAE [7]. We extend on previous work and study the real-world applicability of a QVAE, specifically, for similarity search in large-scale high dimensional datasets. While similarity search algorithms are available for low dimensional datasets, scaling to billion-scale datasets with thousands of dimensions is non-trivial. We show how the latent-space representation of a QVAE can be used to construct a space-efficient search index. We back up our claims by experimental results which show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset. Further, we show real-world speedups compared to linear search and demonstrate memory efficient scaling to large-scale datasets.

Nicholas D Gao↗
NASA NTRSDate not supplied

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the QVAE has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the MODIS dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.

Data mining, similarity search, quantum machine le↗
NASA NTRS1972

On pursuit with curvature constraints.

A theorem is proved extending results of Cockayne on pursuit with curvature constraints. Let two points (pursuer and evader) move in Euclidean 3-space with constant speeds. Provided the pursuer has greater speed and greater normal acceleration, it is shown that pursuit is always successful. The methods used are similar to Cockayne's. The pursuer, by some preliminary maneuvers, sets up a condition where he is leaving the line of sight in the same direction and with the same speed as the evader. It is shown that from this instant, the pursuer can, without violating constraints, keep the line of sight parallel to the original and ultimately collide with the evader.

Rublein, G. T.↗
NASA NTRS1979

Ultimate boundedness stability and controllability of hereditary systems

By generalizing the Liapunov-Yoshizawa techniques, necessary and sufficient conditions are given for uniform boundedness and uniform ultimate boundedness of a rather general class of nonlinear differential equations of neutral type. Among the applications treated by the methods are the Lienard equation of neutral type and hereditary systems of Lurie type. The absolute stability of this later equation is also investigated. A certain existence result of a solution of a neutral functional differential inclusion with two point boundary values is applied to study the exact function space controllability of a nonlinear neutral functional differential control system. A geometric growth condition is used to characterize both the function space and Euclidean controllability of another nonlinear delay system which has a compact and convex control set. This yields conditions under which perturbed nonlinear delay controllable systems are controllable.

Chukwu, E. N.↗
NASA NTRS1979

Controllability of delay systems with restrained controls

Using a geometric growth condition, both the function space and Euclidean controllability of a nonlinear delay system which has a compact and convex control set are characterized. This extends analogous results for ordinary differential systems, and it yields conditions under which perturbed nonlinear delay controllable systems are controllable.

Chukwu, E. N.↗
NASA NTRS1984

Modeling concepts for communication of geometric shape data

ANSI5, an abbreviation for Section 5 of the American National Standard under Engineering Drawing and Related Documentation Practices (Committee Y14) on Digital Representation for Communication of Product Definition Data (ANSI Y14.26M-1981), allows encoding of a broad range of geometric shapes to be communicated through digital channels. A brief review of its underlying concepts is presented. The intent of ANSI5 is to devise a unified set of concise language formats for transmission of data pertaining to five types of geometric entities in Euclidean 3 space (E(3)). These are regarded as point like, curve like, surface like, solid like, and a combination of these types. For the first four types, ANSI5 makes a distinction between the geometry and topology. Geometry is a description of the spatial occupancy of the entity, and topology discusses the interconnectedness of the entity's boundary components.

Collins, M. F.↗
NASA NTRS1982

Advances in information extraction techniques

Sundry recent developments are presented which show some potential for affecting the automatic extraction of information from remotely sensed data. Pattern representations more abstract than Euclidean vector spaces offer some hope of unifying structural and decision theoretical approaches. The estimation of expected classification error rates is becoming more sophisticated and rigorous, but useful finite-sample results for nonparametric distributions appear unobtainable. Focus on computational complexity allows comparison of algorithms, while software engineering techniques reduce the effort necessary to develop and maintain complex image processing systems. Advances in computer systems architecture, commercial database technology, and man-machine communications should be closely monitored by the remote sensing community. A NASA-sponsored recommendation for research directions in mathematical pattern recognition are offered.

Nagy, G.↗
NASA NTRS1994

Constraints on the luminosity function of gamma-ray bursts detected by BATSE

We have utilized the integral moment analysis technique of Horack & Emslie to extract information on the allowable form of the luminosity function for gamma-ray bursts observed by Burst and Transient Source Experiment (BATSE). Using the general properties of moments, we are able to derive constraints on the range of luminosity from which the gamma-ray bursts must be sampled. These constraints are independent of the form of the radial distribution of the gamma-ray bursts, and depend only on the assumptions that space is Euclidean and that the luminosity function phi(L) is distance independent. For power-law luminosity functions of the form phi(L) = A(sub 0)L(exp -alpha), we find that the range of luminosity from which 80% of the gamma-ray bursts must be sampled cannot exceed approximately 6.5, with a 3 sigma upper limit of 12-15, regardless of the value of alpha.

Horack, J. M.↗
NASA NTRS1972

Applications of partial orderings to the study of positive definiteness, monotonicity, and convergence of iterative methods for linear systems.

Most of the known results concerning convergence of iterative methods for solving linear systems involve either positive definiteness or monotonicity. In this paper a new concept, called K-semipositivity, is introduced, which provides a link between convergence theory, monotonicity, and positive definiteness. By using this concept, together with partial orderings in Euclidean n-space, several new convergence theorems are proved. Application to Jacobi's methods and the theory of regular splittings shows the usefulness of these new results.

Vandergraft, J. S.↗