Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data structures”

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
DOE OSTI2019

iEEG-BIDS, extending the Brain Imaging Data Structure specification to human intracranial electrophysiology

he Brain Imaging Data Structure (BIDS) is a community-driven specification for organizing neuroscience data and metadata with the aim to make datasets more transparent, reusable, and reproducible. Intracranial electroencephalography (iEEG) data offer a unique combination of high spatial and temporal resolution measurements of the living human brain. To improve internal (re)use and external sharing of these unique data, we present a specification for storing and sharing iEEG data: iEEG-BIDS.

Science & Technology - Other Topics↗
NASA NTRS1993

Certification trails for data structures

Certification trails are a recently introduced and promising approach to fault detection and fault tolerance. The applicability of the certification trail technique is significantly generalized. Previously, certification trails had to be customized to each algorithm application; trails appropriate to wide classes of algorithms were developed. These certification trails are based on common data-structure operations such as those carried out using these sets of operations such as those carried out using balanced binary trees and heaps. Any algorithms using these sets of operations can therefore employ the certification trail method to achieve software fault tolerance. To exemplify the scope of the generalization of the certification trail technique provided, constructions of trails for abstract data types such as priority queues and union-find structures are given. These trails are applicable to any data-structure implementation of the abstract data type. It is also shown that these ideals lead naturally to monitors for data-structure operations.

Sullivan, Gregory F.↗
NASA NTRS1984

Advanced Data Structure and Geographic Information Systems

The current state of the art in specified areas of Geographic Information Systems GIS technology is examined. Study of the question of very large, efficient, heterogeneous spatial databases is required in order to explore the potential application of remotely sensed data for studying the long term habitability of the Earth. Research includes a review of spatial data structures and storage, development of operations required by GIS, and preparation of a testbed system to compare Vaster data structure with NASA's Topological Raster Structure.

Peuquet, D.↗
NASA NTRS1990

Sphere quadtrees - A new data structure to support the visualization of spherically distributed data

The concept of the sphere quadtree (SQT) is introduced to enable the structuring of spherically distributed data to be consistent with its geometry and facilitate mapping of the data onto a flat file system. The SQT is based on the recursive subdivision of the spherical triangles that result from the projection of the faces of an icosahedron onto a sphere. The SQT concept is insensitive to the distortions that occur far from the equator in spherically distributed data sets. Geographic data can be shown at several levels and at any resolution, allowing a system of referencing between data sets of different resolutions as well as data that are not geographically registered. SQTs are found to facilitate the search for particular spherically distributed data sets and improve the efficiency of surface rendering algorithms.

Fekete, Gyorgy↗
NASA NTRS1989

Querying databases of trajectories of differential equations: Data structures for trajectories

One approach to qualitative reasoning about dynamical systems is to extract qualitative information by searching or making queries on databases containing very large numbers of trajectories. The efficiency of such queries depends crucially upon finding an appropriate data structure for trajectories of dynamical systems. Suppose that a large number of parameterized trajectories gamma of a dynamical system evolving in R sup N are stored in a database. Let Eta is contained in set R sup N denote a parameterized path in Euclidean Space, and let the Euclidean Norm denote a norm on the space of paths. A data structure is defined to represent trajectories of dynamical systems, and an algorithm is sketched which answers queries.

Grossman, Robert↗
NASA NTRS2010

IVS Working Group 4: VLBI Data Structures

In 2007 the IVS Directing Board established IVS Working Group 4 on VLBI Data Structures. This note discusses the current VLBI data format, goals for a new format, the history and formation of the Working Group, and a timeline for the development of a new VLBI data format.

Gipson, John↗
DOE OSTI2018

Algorithms and data structures to accelerate network analysis

As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. Here in this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail early dropping, LFN tables, and multiresolution priority queues) designed to optimize the process of analyzing network traffic. We integrated these optimizations on R-Scope, a high performance network appliance that runs the Bro network analyzer, and present benchmarks showcasing performance speed ups of 5X at traffic rates of 10 Gbps.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2008

Multiple Instance Regression with Structured Data

This slide presentation reviews the use of multiple instance regression with structured data from multiple and related data sets. It applies the concept to a practical problem, that of estimating crop yield using remote sensed country wide weekly observations.

multiple instance regression↗
NASA NTRS1990

A scheme for supporting distributed data structures on multicomputers

A data migration mechanism is proposed that allows an explicit and controlled mapping of data to memory. While read or write copies of each data element can be assigned to any processor's memory, longer term storage of each data element is assigned to a specific location in the memory of a particular processor. The proposed integration of a data migration scheme with a compiler is able to eliminate the migration of unneeded data that can occur in multiprocessor paging or caching. The overhead of adjudicating multiple concurrent writes to the same page or cache line is also eliminated. Data is presented that suggests that the scheme may be a pratical method for efficiently supporting data migration.

Hiranandani, Seema↗
NASA NTRS1992

Sensor fusion IV: Control paradigms and data structures; Proceedings of the Meeting, Boston, MA, Nov. 12-15, 1991

Various papers on control paradigms and data structures in sensor fusion are presented. The general topics addressed include: decision models and computational methods, sensor modeling and data representation, active sensing strategies, geometric planning and visualization, task-driven sensing, motion analysis, models motivated biology and psychology, decentralized detection and distributed decision, data fusion architectures, robust estimation of shapes and features, application and implementation. Some of the individual subjects considered are: the Firefly experiment on neural networks for distributed sensor data fusion, manifold traversing as a model for learning control of autonomous robots, choice of coordinate systems for multiple sensor fusion, continuous motion using task-directed stereo vision, interactive and cooperative sensing and control for advanced teleoperation, knowledge-based imaging for terrain analysis, physical and digital simulations for IVA robotics.

Schenker, Paul S.↗
DOE OSTI2018

Efficient accesses of data structures using processing near memory

Systems, apparatuses, and methods for implementing efficient queues and other data structures. A queue may be shared among multiple processors and/or threads without using explicit software atomic instructions to coordinate access to the queue. System software may allocate an atomic queue and corresponding queue metadata in system memory and return, to the requesting thread, a handle referencing the queue metadata. Any number of threads may utilize the handle for accessing the atomic queue. The logic for ensuring the atomicity of accesses to the atomic queue may reside in a management unit in the memory controller coupled to the memory where the atomic queue is allocated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Evaluated Nuclear Structure Data File (ENSDF)

Contains recommended nuclear structure and decay data for all the known nuclides, which are obtained following a critical review of all available experimental data, supplemented with systematic trend studies and theoretical models. ENSDF data include (i) nuclear level properties, such as observation source, energy, half-life, decay modes, spin and parity; (ii) gamma ray energies, intensities, multipolarities, mixing ratios and conversion coefficients; (iii) nuclear radiation energy and intensity as well as radiation-specific data for different radiation types, such as such as gammas, alphas, betas and neutrons. Data for about 220 nuclides are fully evaluated each year; additionally, many datasets are partially updated each year. Nearly all the evaluation work is supported by the US Nuclear Data Program. The National Nuclear Data Center at Brookhaven National Laboratory is responsible for coordinating the evaluation effort as well as its web and journal dissemination.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Detailed requirements for a next generation nuclear data structure.

This document attempts to compile the requirements for the top-levels of a hierarchical arrangement of nuclear data such as found in the ENDF format. This set of requirements will be used to guide the development of a new data structure to replace the legacy ENDF format.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1973

Development and application of vibroacoustic structural data banks in predicting vibration design and test criteria for rocket vehicle structures

A method of predicting broadband random vibration criteria for components on space vehicles is presented. Large amounts of vibration and acoustic data obtained from flights and static firing tests of space vehicle were formulated into vibroacoustic data banks for structural categories of ring frame, skin stringer, and honeycomb. The vibration spectra with their associated acoustic spectra are normalized to a reference acoustic spectrum. The individual normalized spectra are grouped according to definite structural characteristics and statistically analyzed to form the vibroacoustic data banks described in this report. These data banks represent the reference vibration criteria available for determining the new vehicle vibration criteria.

Bandgren, H. J.↗
NASA NTRSDate not supplied

1235 Preparing for TEMPO: A Review of Planned Metadata, Data Structure, and Distribution by NASA’s Atmospheric Science Data Center

The Atmospheric Science Data Center (ASDC) is in the Science Directorate located at the NASA Langley Research Center (LaRC), in Hampton, Virginia. The ASDC is one of NASA’s Distributed Active Archive Centers (DAAC) and supports over 60 projects and provides access to more than 1,000 archived collections. These datasets were created from satellite measurements, field experiments, and modeled data products. ASDC projects focus on the following Earth science disciplines: Radiation Budget, Clouds, Aerosols, and Tropospheric Composition. The ASDC is the official Distributed Active Archive Center (DAAC) of record for the upcoming Tropospheric Emissions: Monitoring of Pollution (TEMPO) instrument.. The instrument will share a ride on a commercial satellite as a hosted payload and will be launched to an orbit about 22,000 miles above Earth's equator. The investigation will, for the first time, use a space-based instrument to make accurate observations of tropospheric pollution concentrations of ozone, nitrogen dioxide, formaldehyde, and aerosols with high resolution and frequency over the U.S, Canada, and Mexico.

Ashlee Autore↗
NASA NTRSDate not supplied

1235 Preparing for TEMPO: A Review of Planned Metadata, Data Structure, and Distribution by NASA’s Atmospheric Science Data Center

The Atmospheric Science Data Center (ASDC) is in the Science Directorate located at the NASA Langley Research Center (LaRC), in Hampton, Virginia. The ASDC is one of NASA’s Distributed Active Archive Centers (DAAC) and supports over 60 projects and provides access to more than 1,000 archived collections. These datasets were created from satellite measurements, field experiments, and modeled data products. ASDC projects focus on the following Earth science disciplines: Radiation Budget, Clouds, Aerosols, and Tropospheric Composition. The ASDC is the official Distributed Active Archive Center (DAAC) of record for the upcoming Tropospheric Emissions: Monitoring of Pollution (TEMPO) instrument.. The instrument will share a ride on a commercial satellite as a hosted payload and will be launched to an orbit about 22,000 miles above Earth's equator. The investigation will, for the first time, use a space-based instrument to make accurate observations of tropospheric pollution concentrations of ozone, nitrogen dioxide, formaldehyde, and aerosols with high resolution and frequency over the U.S, Canada, and Mexico.

Ashlee Autore↗
NASA NTRS2006

Generating a 2D Representation of a Complex Data Structure

A computer program, designed to assist in the development and debugging of other software, generates a two-dimensional (2D) representation of a possibly complex n-dimensional (where n is an integer >2) data structure or abstract rank-n object in that other software. The nature of the 2D representation is such that it can be displayed on a non-graphical output device and distributed by non-graphical means.

James, Mark↗