SEARCH · Search NASA

Results for “Euclidean”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

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 NTRS1984

A Simple Algorithm for the Metric Traveling Salesman Problem

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Grimm, M. J.↗

NASA NTRS1982

An evaluation of thematic mapper simulator data for mapping forest cover

Computer-aided analysis techniques applied to Thematic Mapper Simulator (TMS) data were evaluated for the purpose of mapping forest cover types. Classification results obtained using a supervised set of training statistics and various combinations of three and four channel subsets of the seven available TMS channels are compared for the L2 (Minimum Euclidean Distance), GML (Gaussian Maximum Likelihood), and SECHO (Supervised Extraction and Classification of Homogeneous Objects) classification algorithms. SECHO performed significantly better than either of the two per-point classifiers for the untransformed data. Overall classification results of the Karhunen-Loeve transformation increased for the L2 algorithm, but decreased for both the GML and SECHO algorithms.

Dean, M. E.↗

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 NTRS1983

Analysis of Landsat for monitoring vegetables in New York mucklands

This pilot study assessed the feasibility of relying on Landsat multispectral scanner data for inventorying vegetables grown in mucklands,in variably shaped, variably sized fields. Classification of muckland vegetables using a Euclidean distance classifier and a parallelepiped classifier was performed with reasonable accuracy (generally over 60 percent) based on only one date of Landsat data. Prior canonical and principal component analyses did not improve the classification accuracy but did reduce the dimensionality of the data.

Zhu, M. H.↗

NASA NTRS1985

A Factorization Approach to the Linear Regulator Quadratic Cost Problem

A factorization approach to the linear regulator quadratic cost problem is developed. This approach makes some new connections between optimal control, factorization, Riccati equations and certain Wiener-Hopf operator equations. Applications of the theory to systems describable by evolution equations in Hilbert space and differential delay equations in Euclidean space are presented.

Milman, M. H.↗

NASA NTRS1985

Combined trellis coding with asymmetric MPSK modulation: An MSAT-X report

Traditionally symmetric, multiple phase-shift-keyed (MPSK) signal constellations, i.e., those with uniformly spaced signal points around the circle, have been used for both uncoded and coded systems. Although symmetric MPSK signal constellations are optimum for systems with no coding, the same is not necessarily true for coded systems. This appears to show that by designing the signal constellations to be asymmetric, one can, in many instances, obtain a significant performance improvement over the traditional symmetric MPSK constellations combined with trellis coding. The joint design of n/(n + 1) trellis codes and asymmetric 2 sup n + 1 - point MPSK is considered, which has a unity bandwidth expansion relative to uncoded 2 sup n-point symmetric MPSK. The asymptotic performance gains due to coding and asymmetry are evaluated in terms of the minimum free Euclidean distance free of the trellis. A comparison of the maximum value of this performance measure with the minimum distance d sub min of the uncoded system is an indication of the maximum reduction in required E sub b/N sub O that can be achieved for arbitrarily small system bit-error rates. It is to be emphasized that the introduction of asymmetry into the signal set does not effect the bandwidth of power requirements of the system; hence, the above-mentioned improvements in performance come at little or no cost. MPSK signal sets in coded systems appear in the work of Divsalar.

Simon, M. K.↗

NASA NTRS1985

A cluster analysis method for identification of subpopulations of cells in flow cytometric list-mode arrays

A specialized program was developed for flow cytometric list-mode data using an heirarchical tree method for identifying and enumerating individual subpopulations, the method of principal components for a two-dimensional display of 6-parameter data array, and a standard sorting algorithm for characterizing subpopulations. The program was tested against a published data set subjected to cluster analysis and experimental data sets from controlled flow cytometry experiments using a Coulter Electronics EPICS V Cell Sorter. A version of the program in compiled BASIC is usable on a 16-bit microcomputer with the MS-DOS operating system. It is specialized for 6 parameters and up to 20,000 cells. Its two-dimensional display of Euclidean distances reveals clusters clearly, as does its 1-dimensional display. The identified subpopulations can, in suitable experiments, be related to functional subpopulations of cells.

Li, Z. K.↗

NASA NTRS1985

A new description of combined trellis coding with asymmetric modulation

The combination of rate k/(k+t) trellis codes with digital modulations described by an asymmetric 2 sup k+1-point signal constellation has been recently shown to yield performance improvement over the traditional symmetric constellation combined with the same trellis code. The approach taken is to specify an underlying trellis code and then map the output code symbols into the fixed signal constellation based on a rule called mapping by set partitioning. The latter process is tantamount to assigning signals from the constellation to the trellis code transitions so as to maximize the free Euclidean distance of the code. Recently, a new description of trellis codes has been given that combines the above two steps into one. The ideas introduced are further explored, placing particular emphasis on the optimization of the signal constellation asymmetry. It can be concluded that the trellis-coded amplitude modulation (AM) designs given are very close to being optimum.

Simon, M. K.↗

NASA NTRS1984

On the surface density of X-ray selected BL Lacertae objects

Only a handful of BL Lac objects have been found as a result of systematic optical identification of serendipitous Einstein X-ray sources. By combining the data from two flux-limited complete X-ray surveys (the HEAO 1 A-2 and the Einstein Observatory Medium Sensitivity Survey) the surface density of X-ray emitting BL Lac objects is evaluated as a function of their X-ray flux. It is found that a single power law is not an acceptable representation of the BL Lac objects' X-ray log N-log S. The number-flux relationship is consistent with the Euclidean slope at 'high' flux levels but shows a drastic flattnring below fluxes of the order of 10 to the -12th ergs per sq cm/s. The implications of this result are briefly discussed with respect to the luminosity function, the cosmological evolution, and the X-ray to optical flux ratio in BL Lac objects.

Maccacaro, T.↗

NASA NTRS1985

A VLSI design of a pipeline Reed-Solomon decoder

A pipeline structure of a transform decoder similar to a systolic array was developed to decode Reed-Solomon (RS) codes. An important ingredient of this design is a modified Euclidean algorithm for computing the error locator polynomial. The computation of inverse field elements is completely avoided in this modification of Euclid's algorithm. The new decoder is regular and simple, and naturally suitable for VLSI implementation.

Shao, H. M.↗

NASA NTRS1985

A remark about pointed bubbles

The polymer expansion is a formal algebraic identity between a partition function and logarithm in statistical physics problems. The expansion gives a systematic method to control the free energy or to establish exponential tree-graph decay of connected correlations. Here, the convergence properties of the polymer expansion are analyzed in connection with three practical examples, including: intersecting bonds in chemical polymer chains; a connected closed hypersurface built from the (d-1)-faces of the d-dimensional unit cubes; and the set of Feynamn diagrams in the perturbation series of the Euclidean field theory partition function Z. The example of connected polymer chains is generalized to apply to other lattice models, including n-state Ising models at high temperature; short range lattice gases at high temperature; and weak coupling lattice field and gauge theories.

Garabedian, P. R.↗

NASA NTRS1987

Error control techniques for satellite and space communications

During the period June 1, 1986 through November 30, 1986, progress was made in the following areas: undetected error probability and throughput analysis of a concatenated coding scheme; capacity and cutoff rate analysis of concatenated codes; concatenated codes using bandwidth efficient trellis inner codes; bounds on the minimum free Euclidean distance of bandwidth efficient trellis codes; and construction of multidimensional bandwidth efficient trellis codes for use as inner codes in a concatenated coding system.

Costello, Daniel J., Jr.↗

NASA NTRS1987

Error control techniques for satellite and space communications

The performance of bandwidth efficient trellis inner codes using two-dimensional MPSK signal constellations in a NASA concatenated coding is summarized. Work was also continued on trellis coded modulation using multi-dimensional signal sets. Achievable lower bounds on free distance trellis codes were proved and the existence of good trellis coded modulation (TCM) schemes were established for a variety of signal constellations. The performance of TCM schemes on fading channels is being investigated. Preliminary results indicate that bandwidth efficient trellis coding is feasible on such channels, but that the important design parameter is no longer the minimum free Euclidean distance.

Costello, Daniel J., Jr.↗

NASA NTRS1987

The performance of trellis coded multilevel DPSK on a fading mobile satellite channel

The performance of trellis coded multilevel differential phase-shift-keying (MDPSK) over Rician and Rayleigh fading channels is discussed. For operation at L-Band, this signalling technique leads to a more robust system than the coherent system with dual pilot tone calibration previously proposed for UHF. The results are obtained using a combination of analysis and simulation. The analysis shows that the design criterion for trellis codes to be operated on fading channels with interleaving/deinterleaving is no longer free Euclidean distance. The correct design criterion for optimizing bit error probability of trellis coded MDPSK over fading channels will be presented along with examples illustrating its application.

Simon, Marvin K.↗

NASA NTRS1987

Trellis coding with asymmetric modulations

Through the asymmetric design of signal constellations, it often becomes possible to obtain a performance gain over conventional symmetric constellations combined with trellis coding. Attention is given to the joint design of n/(n+1) trellis codes and asymmetric 2 exp (n+1)-point signal constellations having no bandwidth expansion relative to an uncoded 2 exp n-point symmetric signal set. The asymptotic performance gains due to coding and asymmetry are explained in terms of the minimum free Euclidean distance of the trellis; examples are given which show the performance gain due to the asymmetry of the signal set. Since asymmetry does not affect bandwidth or power requirements, these improvements come at little or no cost.

Divsalar, Dariush↗

NASA NTRS1987

Source counts in the chronometric cosmology

The chronometric cosmology (a static, homogeneous, and hence nonevolving model proposed by Segal) is unable to explain the steep number versus flux law N(S) for quasars or extragalactic radio sources. The explanation given by Segal to explain the steep N(S) laws gives at best a small increase over a Euclidean N(S) proportional to S exp-1.5, and requires that the source spectral index be close to but greater than zero to create the effect. For typical radio spectral indices of roughly 0.75, the chronometric model cannot give a quantitative fit to the excess number of 1-3 Jy sources that the standard cosmology attributes to evolution. Thus the chronometric model can explain a steep N(S) law only for flat spectrum sources, while the observations show the steepest N(S) law for steep spectrum sources. Furthermore, the observed N(S) law for ultraviolet excess quasars is steeper than the steepest possible chronometric prediction.

Wright, Edward L.↗

NASA NTRS1986

Approximate methods for black hole collisions

The head-on collision of two nonrotating black holes, initially falling toward each other with speed of approach equal to escape velocity, is studied. The initial-value problem for the two-black-hole configuration is solved by giving the extrinsic curvature on a Euclidean space slice, with the equal masses of the two holes and their separation as free parameters. An approximating space-time is then constructed by stacking up a whole sequence of initial-value slices with decreasing separation between the black holes. The space-time singularities at the centers of the two black holes collide at some instant of time, and after that time the space-time so constructed is just the Schwarzschild solution with mass equal to the total mass of both black holes. The approximating space-time describes the coalescence of the event horizons, but contains no gravitational waves.

Eardley, D. M.↗