Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured data”

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 955 records · Page 53

Short Duration Bioastronautics Investigation 1904: Human Factors Assessment of Vibration Effects on Visual Performance during Launch

The primary objective of the Short Duration Bioastronautics Investigation (SDBI) 1904 was to determine visual performance limits during Shuttle operational vibration and g-loads, specifically through the determination of minimal usable font sizes using Orion-type display formats. Currently there is little to no data available to quantify human visual performance under the extreme g- and vibration conditions of launch. Existing data on shuttle vibration magnitude and frequency is incomplete and does not address human visual performance. There have been anecdotal reports of performance decrements from shuttle crews, but no structured data have been collected. Previous work by NASA on the effects of vibration and linear g-loads on human performance was conducted during the Gemini era, but these experiments were performed using displays and controls that are dramatically different than current concepts being considered by the Constellation Program. Recently, three investigations of visual performance under vibration have been completed at NASA Ames Research Center: the first examining whole-body vibration, the second employing whole-body vibration coupled with a sustained g-load, and a third examining the effects of peak versus extended duration vibration. However, all of these studies were conducted using only a single x-axis direction (eyeballs in/out). Estimates of thrust oscillations from the Constellation Ares-I first stage are driving the need for realistic human performance requirements. SDBI 1904 was an opportunity to address the need for requirements by conducting a highly focused and applied evaluation in a relevant spaceflight environment. The SDBI was a companion effort to Detailed Test Objective (DTO) 695, which measured shuttle seat accelerations (vibration) during ascent. Data from the SDBI will serve an important role in interpreting the DTO vibration data. Both SDBI 1904 and DTO 695 were low impact with respect to flight resources, and combined, they represent an efficient and focused problem solving approach. This project provided (a) immediate data for developing preliminary human performance vibration requirements; (b) flight validated inputs for ongoing and future ground-based research; and (c) preliminary information related to Orion display format design.

Thompson, Shelby↗

Challenges in Development of Online Visualization and Analysis Tools for Satellite Data

Over the years, various online visualization and analysis tools have been developed to facilitate satellite data access and help scientific users around the world to conduct research and develop applications (e.g., data product evaluation, what-if questions, etc.). For those who are new to satellite data products, using them can be a daunting task due to many obstacles in data processing such as data formats, complex data structures, special software packages, unfamiliar terminology, etc., especially when one is not sure whether a dataset is suitable for his/er research project. Even for experienced users, developing software for data processing and analysis can be a costly and time-consuming task. Online visualization tools can overcome many of these difficulties and allow users to focus on scientific questions. For example, Giovanni (the Geospatial Interactive Online Visualization and Analysis Infrastructure, https://giovanni.gsfc.nasa.gov), developed by the NASA Goddard Earth Sciences Data and Information Services Center (GES DISC), allows access over 1900 satellite and model variables in 82 measurement groups of 8 disciplines without downloading data and software. Main features include basic functions for data analysis and visualization, data provenance, output data in different formats (ASCII, NetCDF, GeoTIFF), and more. Over the years, ~1700 peer-reviewed publications in different disciplines have been benefited from Giovanni in research activities (e.g. initial investigation, what-if questions, product evaluation). Despite the success of online visualization and analysis tools, challenges and new opportunities still exist and more can be done with new requirements and technology. Examples are: a) how to increase the efficiency of dataset search by enhancing intuitive aspects; b) how to facilitate interdisciplinary research; c) how to provide data quality information; d) how to engage users to participate in data quality assessment; and more. NASA Earth Observing System Data and Information System (EOSDIS) satellite-based data products are processed at various levels ranging from Level 0 to Level 4. While most users use data products at higher levels (Level-3 and 4), products at lower levels are still important for case studies, algorithm development, ground validation, etc. In this presentation, we will use Giovanni as an example to present and discuss challenges and near-future opportunities for satellite data online visualization and analysis tools.

Liu, Zhong↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗

MO-A-BRD-09: A Data-Mining Algorithm for Large Scale Analysis of Dose-Outcome Relationships in a Database of Irradiated Head-And-Neck (HN) Cancer Patients

Purpose: To develop a framework for automatic extraction of clinically meaningful dosimetric-outcome relationships from an in-house, analytic oncology database. Methods: Dose-volume histograms (DVH) and clinical outcome-related structured data elements have been routinely stored to our database for 513 HN cancer patients treated from 2007 to 2014. SQL queries were developed to extract outcomes that had been assessed for at least 100 patients, as well as DVH curves for organs-at-risk (OAR) that were contoured for at least 100 patients. DVH curves for paired OAR (e.g., left and right parotids) were automatically combined and included as additional structures for analysis. For each OAR-outcome combination, DVH dose points, D(V{sub t}), at a series of normalized volume thresholds, V{sub t}=[0.01,0.99], were stratified into two groups based on outcomes after treatment completion. The probability, P[D(V{sub t})], of an outcome was modeled at each V{sub t} by logistic regression. Notable combinations, defined as having P[D(V{sub t})] increase by at least 5% per Gy (p<0.05), were further evaluated for clinical relevance using a custom graphical interface. Results: A total of 57 individual and combined structures and 115 outcomes were queried, resulting in over 6,500 combinations for analysis. Of these, 528 combinations met the 5%/Gy requirement, with further manual inspection revealing a number of reasonable models based on either reported literature or proximity between neighboring OAR. The data mining algorithm confirmed the following well-known toxicity/outcome relationships: dysphagia/larynx, voice changes/larynx, esophagitis/esophagus, xerostomia/combined parotids, and mucositis/oral mucosa. Other notable relationships included dysphagia/pharyngeal constrictors, nausea/brainstem, nausea/spinal cord, weight-loss/mandible, and weight-loss/combined parotids. Conclusion: Our database platform has enabled large-scale analysis of dose-outcome relationships. The current data-mining framework revealed both known and novel dosimetric and clinical relationships, underscoring the potential utility of this analytic approach. Multivariate models may be necessary to further evaluate the complex relationship between neighboring OARs and observed outcomes. This research was supported through collaborations with Elekta, Philips, and Toshiba.

60 APPLIED LIFE SCIENCES↗

Reconstruction of effective potential from statistical analysis of dynamic trajectories

The broad incorporation of microscopic methods is yielding a wealth of information on the atomic and mesoscale dynamics of individual atoms, molecules, and particles on surfaces and in open volumes. Analysis of such data necessitates statistical frameworks to convert observed dynamic behaviors to effective properties of materials. Here, we develop a method for the stochastic reconstruction of effective local potentials solely from observed structural data collected from molecular dynamics simulations (i.e., data analogous to those obtained via atomically resolved microscopies). Using the silicon vacancy defect in graphene as a model, we apply the statistical framework presented herein to reconstruct the free energy landscape from the calculated atomic displacements. Evidence of consistency between the reconstructed local potential and the trajectory data from which it was produced is presented, along with a quantitative assessment of the uncertainty in the inferred parameters.

74 ATOMIC AND MOLECULAR PHYSICS↗

Exploring modified gravity: constraints on the μ and Σ parametrization with WMAP , ACT, and SPT

ABSTRACT The cosmic acceleration problem remains one of the most significant challenges in cosmology. One of the proposed solutions to this problem is the modification of gravity on large scales. In this paper, we explore the well-known μ–Σ parametrization scenarios and confront them with observational data, including the cosmic microwave background (CMB) radiation from the Wilkinson Microwave Anisotropy Probe (WMAP), Atacama Cosmology Telescope (ACT), and South Pole Telescope (SPT), as well as large-scale structure data from the Sloan Digital Sky Survey (SDSS; baryon acoustic oscillation + redshift-space distortion) and Pantheon supernova (SN) catalogue. We employ a Bayesian framework to constrain the model parameters and discuss the implications of our results on the viability of modified gravity theories. Our analysis reveals the strengths and limitations of the μ–Σ parametrization and provides valuable insights into the nature of gravity on cosmological scales. From the joint analysis of the ACT + WMAP + SDSS + SN, we find μ0 − 1 = 0.02 ± 0.19 and Σ0 − 1 = 0.021 ± 0.068 at 68 per cent confidence level (CL). In light of the SPT + WMAP + SDSS + SN, we find μ0 − 1 = 0.07 ± 0.18 and $\Sigma _0 -1 = -0.009^{+0.078}_{-0.11}$ at 68 per cent CL. In all the analyses carried out, we do not find any deviations from the theory of general relativity. Our results represent an observational update on the well-known μ–Σ parametrization in view of current CMB data, independent of and competitive with the constraints obtained with the Planck data.

79 ASTRONOMY AND ASTROPHYSICS↗

PowerSystems.jl and PowerSimulations.jl [SWR-18-23]

Data structures in Julia to enable power systems analysis. Also, PowerSimulations.jl is a Julia package for power system modeling and simulation found at https://github.com/NREL/PowerSimulations.jl. The objectives of the package are: Provide a flexible modeling framework that can accommodate problems of different complexity and at different time-scales. Streamline the construction of large scale optimization problems to avoid repetition of work when adding/modifying model details. Exploit Julia's capabilities to improve computational performance of large scale power system simulations. The flexible modeling framework is enabled through a modular set of capabilities that enable scalable power system analysis and exploration of new analysis methods. The modularity of PowerSimulations results from the structure of the simulations enabled by the package: Simulations define a set of problems that can be solved using numerical techniques. Problems are generated by expressing model formulations against system data For example, an annual production cost modeling simulation can be created by formulating a unit commitment model against system data to assemble a set of 365 daily time-coupled scheduling problems.

Lara, Jose Daniel↗

kynema-sgf [SWR-20-85]

Kynema-SGF (formerly AMR-Wind), wherein SGF stands for structured-grid fluid dynamics, is a massively parallel, block-structured adaptive-mesh, incompressible flow solver. The codebase was initiated in 2019 from incflo. The solver is built on top of the AMReX library. AMReX library provides the mesh data structures, mesh adaptivity, as well as the linear solvers used for solving the governing equations. Kynema-SGF is actively developed and maintained by a dedicated multi-institutional team from Lawrence Berkeley National Laboratory, National Laboratory of the Rockies, and Sandia National Laboratories. The primary applications for Kynema-SGF are: performing large-eddy simulations (LES) of atmospheric boundary layer (ABL) flows, simulating wind farm turbine-wake interactions using actuator disk or actuator line models for turbines, and as a background solver when coupled with a near-body solver (e.g., Kynema-UGF) with overset methodology to perform blade-resolved simulations of multiple wind turbines within a wind farm. For offshore applications, the ability to model the air-sea interaction effects and its impact on the ABL characteristics is another focus for the code development effort. As with other codes in the Kynema ecosystem, Kynema-SGF shares the following objectives: *an open, well-documented implementation of the state-of-the-art computational models for modeling wind farm flow physics at various fidelities that are backed by a comprehensive verification and validation (V&V) process; *be capable of performing the highest-fidelity simulations of flow fields within wind farms; and *be able to leverage the high-performance leadership class computing facilities available at DOE national laboratories.

Ananthan, Shreyas↗

A Fault-oblivious Extreme-scale Execution Environment

Exascale computing systems will provide a thousand-fold increase in parallelism and a proportional increase in failure rate relative to today's machines. Systems software for exascale machines must provide the infrastructure to support existing applications while simultaneously enabling efficient execution of new programming models that naturally express dynamic, adaptive, irregular computation; coupled simulations; and massive data analysis in a highly unreliable hardware environment with billions of threads of execution. We propose a new approach to the data and work distribution model provided by system software based on the unifying formalism of an abstract file system. The proposed hierarchical data model provides simple, familiar visibility and access to data structures through the file system hierarchy, while providing fault tolerance through selective redundancy. The hierarchical task model features work queues whose form and organization are represented as file system objects. Data and work are both first class entities. By exposing the relationships between data and work to the runtime system, information is available to optimize execution time and provide fault tolerance. The data distribution scheme provides replication (where desirable and possible) for fault tolerance and efficiency, and it is hierarchical to make it possible to take advantage of locality. The user, tools, and applications, including legacy applications, can interface with the data, work queues, and one another through the abstract file model. This runtime environment will provide multiple interfaces to support traditional Message Passing Interface applications, languages developed under DARPA's High Productivity Computing Systems program, as well as other, experimental programming models. We will validate our runtime system with pilot codes on existing platforms and will use simulation to validate for exascale-class platforms. In this final report, we summarize research results from the work done at the Ohio State University towards the larger goals of the project listed above.

97 MATHEMATICS AND COMPUTING↗

Athena: High-Performance Sparse Tensor Contraction Sequence on Heterogeneous Memory

Sparse tensor contraction sequence has been widely employed in many fields, such as chemistry and physics. However, how to efficiently implement the sequence faces multiple challenges, such as redundant computations and memory operations, massive memory consumption, and inefficient utilization of hardware. To address the above challenges, we introduce Athena, a high-performance framework for SpTC sequences. Athena introduces new data structures, leverages emerging Optane-based heterogeneous memory (HM) architecture, and stage parallelism. In particular, Athena introduces shared hash table-represented sparse accumulator to eliminate unnecessary input processing and data migration; Athena uses a novel data-semantic guided dynamic migration solution to make the best use of the Optane-based HM for high performance; Athena also co-runs execution phases with different characteristics to enable high hardware utilization. Evaluating with 12 datasets, we show that Athena brings 327-7362× speedup over the state-of-the-art SpTC algorithm. With the dynamic data placement guided by data semantics, Athena brings performance improvement on Optane-based HM over a state-of-the-art software-based data management solution, a hardware-based data management solution, and PMM-only by 1.58×, 1.82×, and 2.34× respectively.

Liu, Jiawen↗

Determining XV-15 aeroelastic modes from flight data with frequency-domain methods

The XV-15 tilt-rotor wing has six major aeroelastic modes that are close in frequency. To precisely excite individual modes during flight test, dual flaperon exciters with automatic frequency-sweep controls were installed. The resulting structural data were analyzed in the frequency domain (Fourier transformed). All spectral data were computed using chirp z-transforms. Modal frequencies and damping were determined by fitting curves to frequency-response magnitude and phase data. The results given in this report are for the XV-15 with its original metal rotor blades. Also, frequency and damping values are compared with theoretical predictions made using two different programs, CAMRAD and ASAP. The frequency-domain data-analysis method proved to be very reliable and adequate for tracking aeroelastic modes during flight-envelope expansion. This approach required less flight-test time and yielded mode estimations that were more repeatable, compared with the exponential-decay method previously used.

Acree, C. W., Jr.↗

Tutorial on Chemical Pressure Analysis: How Atomic Packing Drives Laves/Zintl Intergrowth in K3Au5Tl

The tight atomic packing generally exhibited by alloys and intermetallics can create the impression of their being composed of hard spheres arranged to maximize their density. As such, the atomic size factor has historically been central to explanations of the structural chemistry of these systems. However, the role atomic size plays structurally has traditionally been inferred from empirical considerations. The recently developed DFT-Chemical Pressure (CP) analysis has opened a path to investigating these effects with theory. In this article, we provide a step-by-step tutorial on the DFT-CP method for non-specialists, along with advances in the approach that broaden its applicability. A new version of the CP software package is introduced, which features an interactive system that guides the user in preparing the necessary electronic structure data and generating the CP scheme, with the results being readily visualized with a web browser (and easily incorporated into websites). For demonstration purposes, we investigate the origins of the crystal structure of K3Au5Tl, which represents an intergrowth of Laves and Zintl phase domains. Here, CP analysis reveals that the intergrowth is supported by complementary CP features of NaTl-type KTl and MgCu2-type KAu2 phases. In this way, K3Au5Tl exemplifies how CP effects can drive the merging for geometrical motifs derived from different families of intermetallics through a mechanism referred to as epitaxial stabilization.

36 MATERIALS SCIENCE↗

Computer assistance for the structural chemist

A description is presented of the approaches used to modify the molecular structure generator program, CONGEN. The CONGEN program for constructing structures under constraints has been discussed by Carhart et al. (1975). The modifications reported are to lead to a more efficient structure generation on the basis of a translation of structural data input to the program. From an algorithmic standpoint, CONGEN is successful if it can, in a reasonable amount of time and without exhausting storage resources, produce a list of candidate structures satisfying the chemist's constraints. However, this list is often quite large, and it remains for the chemist to discriminate among the candidates, eventually reducing the possibilities to just one structure. Ways are studied for providing computer assistance in examining and further constraining lists of structural candidates.

Carhart, R. E.↗

Yet another method for triangulation and contouring for automated cartography

An algorithm is presented for hierarchical subdivision of a set of three-dimensional surface observations. The data structure used for obtaining the desired triangulation is also singularly appropriate for extracting contours. Some examples are presented, and the results obtained are compared with those given by Delaunay triangulation. The data points selected by the algorithm provide a better approximation to the desired surface than do randomly selected points.

De Floriani, L.↗

MBX V1.2: Accelerating Data-Driven Many-Body Molecular Dynamics Simulations

The MBX software provides an advanced platform for molecular dynamics simulations, leveraging state-of-the-art MB-pol and MB-nrg data-driven many-body potential energy functions. Developed over the past decade, these potential energy functions integrate physics-based and machine-learned many-body terms trained on electronic structure data calculated at the "gold standard" coupled-cluster level of theory. Recent advancements in MBX have focused on optimizing its performance, resulting in the release of MBX v1.2. While the inherently many-body nature of MB-pol and MB-nrg ensures high accuracy, it poses computational challenges. MBX v1.2 addresses these challenges with significant performance improvements, including enhanced parallelism that fully harnesses the power of modern multicore CPUs. In conclusion, these advancements enable simulations on nanosecond time scales for condensed-phase systems, significantly expanding the scope of high-accuracy, predictive simulations of complex molecular systems powered by data-driven many-body potential energy functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Binding site for coenzyme A revealed in the structure of pyruvate:ferredoxin oxidoreductase from Moorella thermoacetica

Pyruvate:ferredoxin oxidoreductase (PFOR) is a microbial enzyme that uses thiamine pyrophosphate (TPP), three [4Fe-4S] clusters, and coenzyme A (CoA) in the reversible oxidation of pyruvate to generate acetyl-CoA and carbon dioxide. The two electrons that are generated as a result of pyruvate decarboxylation are used in the reduction of low potential ferredoxins, which provide reducing equivalents for central metabolism, including the Wood–Ljungdahl pathway. PFOR is a member of the 2-oxoacid:ferredoxin oxidoreductase (OFOR) superfamily, which plays major roles in both microbial redox reactions and carbon dioxide fixation. Here, we present a set of crystallographic snapshots of the best-studied member of this superfamily, the PFOR from Moorella thermoacetica ( Mt PFOR). These snapshots include the native structure, those of lactyl-TPP and acetyl-TPP reaction intermediates, and the first of an OFOR with CoA bound. These structural data reveal the binding site of CoA as domain III, the function of which in OFORs was previously unknown, and establish sequence motifs for CoA binding in the OFOR superfamily. Mt PFOR structures further show that domain III undergoes a conformational change upon CoA binding that seals off the active site and positions the thiolate of CoA directly adjacent to the TPP cofactor. Finally, these structural findings provide a molecular basis for the experimental observation that CoA binding accelerates catalysis by 10 5 -fold.

59 BASIC BIOLOGICAL SCIENCES↗

Deep Hierarchical Super Resolution for Scientific Data

We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform gridwith minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches.The key is to use a hierarchy of SR NNs, each trained to perform 2x SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up.We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.

97 MATHEMATICS AND COMPUTING↗