Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured”

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 1,135 records · Page 63

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

High-Order Methods↗

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

Direct Numerical Simulations↗

Efficient Extraction of Regional Subsets from Massive Climate Datasets using Parallel IO

The size of datasets produced by current climate models is increasing rapidly to the scale of petabytes. To handle data at this scale parallel analysis tools are required, however the majority of climate analysis software remains at the scale of workstations. Further, many climate analysis tools adequately process regularly gridded data but lack sufficient features when handling unstructured grids. This paper presents a data-parallel subsetter capable of correctly handling unstructured grids while scaling to over 2000 cores. The approach is based on the partitioned global address space (PGAS) parallel programming model and one-sided communication. The paper demonstrates that IO remains the single greatest bottleneck for this domain of applications and that parallel analysis of climate data succeeds in practice.

54 ENVIRONMENTAL SCIENCES↗

ParaText : scalable text modeling and analysis.

Automated processing, modeling, and analysis of unstructured text (news documents, web content, journal articles, etc.) is a key task in many data analysis and decision making applications. As data sizes grow, scalability is essential for deep analysis. In many cases, documents are modeled as term or feature vectors and latent semantic analysis (LSA) is used to model latent, or hidden, relationships between documents and terms appearing in those documents. LSA supplies conceptual organization and analysis of document collections by modeling high-dimension feature vectors in many fewer dimensions. While past work on the scalability of LSA modeling has focused on the SVD, the goal of our work is to investigate the use of distributed memory architectures for the entire text analysis process, from data ingestion to semantic modeling and analysis. ParaText is a set of software components for distributed processing, modeling, and analysis of unstructured text. The ParaText source code is available under a BSD license, as an integral part of the Titan toolkit. ParaText components are chained-together into data-parallel pipelines that are replicated across processes on distributed-memory architectures. Individual components can be replaced or rewired to explore different computational strategies and implement new functionality. ParaText functionality can be embedded in applications on any platform using the native C++ API, Python, or Java. The ParaText MPI Process provides a 'generic' text analysis pipeline in a command-line executable that can be used for many serial and parallel analysis tasks. ParaText can also be deployed as a web service accessible via a RESTful (HTTP) API. In the web service configuration, any client can access the functionality provided by ParaText using commodity protocols ... from standard web browsers to custom clients written in any language.

99 GENERAL AND MISCELLANEOUS↗

ParaText : scalable text analysis and visualization.

Automated analysis of unstructured text documents (e.g., web pages, newswire articles, research publications, business reports) is a key capability for solving important problems in areas including decision making, risk assessment, social network analysis, intelligence analysis, scholarly research and others. However, as data sizes continue to grow in these areas, scalable processing, modeling, and semantic analysis of text collections becomes essential. In this paper, we present the ParaText text analysis engine, a distributed memory software framework for processing, modeling, and analyzing collections of unstructured text documents. Results on several document collections using hundreds of processors are presented to illustrate the exibility, extensibility, and scalability of the the entire process of text modeling from raw data ingestion to application analysis.

99 GENERAL AND MISCELLANEOUS↗

Structural Insights into Membrane Targeting by the Flagellar Calcium-binding Protein (FCaBP) a Myristoylated and Palmitoylated Calcium Sensor in Trypanosoma cruzi

The flagellar calcium-binding protein (FCaBP) of the protozoan Trypanosoma cruzi is targeted to the flagellar membrane where it regulates flagellar function and assembly. As a first step toward understanding the Ca{sup 2+}-induced conformational changes important for membrane-targeting, we report here the x-ray crystal structure of FCaBP in the Ca{sup 2+}-free state determined at 2.2{angstrom} resolution. The first 17 residues from the N terminus appear unstructured and solvent-exposed. Residues implicated in membrane targeting (Lys-19, Lys-22, and Lys-25) are flanked by an exposed N-terminal helix (residues 26-37), forming a patch of positive charge on the protein surface that may interact electrostatically with flagellar membrane targets. The four EF-hands in FCaBP each adopt a 'closed conformation' similar to that seen in Ca{sup 2+}-free calmodulin. The overall fold of FCaBP is closest to that of grancalcin and other members of the penta EF-hand superfamily. Unlike the dimeric penta EF-hand proteins, FCaBP lacks a fifth EF-hand and is monomeric. The unstructured N-terminal region of FCaBP suggests that its covalently attached myristoyl group at the N terminus may be solvent-exposed, in contrast to the highly sequestered myristoyl group seen in recoverin and GCAP1. NMR analysis demonstrates that the myristoyl group attached to FCaBP is indeed solvent-exposed in both the Ca{sup 2+}-free and Ca{sup 2+}-bound states, and myristoylation has no effect on protein structure and folding stability. We propose that exposed acyl groups at the N terminus may anchor FCaBP to the flagellar membrane and that Ca{sup 2+}-induced conformational changes may control its binding to membrane-bound protein targets..

59 BASIC BIOLOGICAL SCIENCES↗

The coupling of the neutron transport application RATTLESNAKE to the nuclear fuels performance application BISON under the MOOSE framework

The MOOSE neutron transport application RATTLESNAKE was coupled to the fuels performance application BISON to provide a higher fidelity tool for fuel performance simulation. This project is motivated by the desire to couple a high fidelity core analysis program (based on the self-adjoint angular flux equations) to a high fidelity fuel performance program, both of which can simulate on unstructured meshes. RATTLESNAKE solves self-adjoint angular flux transport equation and provides a sub-pin level resolution of the multigroup neutron flux with resonance treatment during burnup or a fast transient. BISON solves the coupled thermomechanical equations for the fuel on a sub-millimeter scale. Both applications are able to solve their respective systems on aligned and unaligned unstructured finite element meshes. The power density and local burnup was transferred from RATTLESNAKE to BISON with the MOOSE Multiapp transfer system. Multiple depletion cases were run with one-way data transfer from RATTLESNAKE to BISON. The eigenvalues are shown to agree well with values obtained from the lattice physics code DRAGON. The one-way data transfer of power density is shown to agree with the power density obtained from an internal Lassman-style model in BISON.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

MapReduceXMT v. Beta 0.1

The MapReduceXMT library ports the MapReduce framework onto the Cray XMT. MapReduce is a programming paradigm and an approach to data management for unstructured problems. It has gained relevance due to its ability to map serial operations onto parallel distributed architectures, significantly improving developer/analyst productivity. The MapReduceXMT implements the key aspects of MapReduce for the Cray XMT, a massively threaded system that is inherently difficult to program. MapReduceXMT allows users to utilize the machine effectively and efficiently without extensive training in multi-threaded programming. The MapReduceXMT library ports the MapReduce framework onto the Cray XMT. MapReduce is a programming paradigm and an approach to data management for unstructured problems. It has gained relevance due to its ability to map serial operations onto parallel distributed architectures, significantly improving developer/analyst productivity. The MapReduceXMT implements the key aspects of MapReduce for the Cray XMT, a massively threaded system that is inherently difficult to program. MapReduceXMT allows users to utilize the machine effectively and efficiently without extensive training in multi-threaded programming.

Goodman, Eric↗

Algebraic Multigrid Benchmark

AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumps and an anisotropy in one part.

Source record↗

Aleph

Aleph is a PIC/DSMC (particle-in-cell/direct simulation Monte Carlo) software package for the simulation of low temperature plasmas. Aleph is intended to be a production quality code capable of handling complex 3D geometries. Unstructured triangular (2D) or tetrahedral (3D) meshes are used to represent simulation domains. Aleph runs either in serial on a single processor or desktop machine, or can be run in parallel using the MPI message-passing library, to enable faster performance on large problems. Aleph employs dynamic load balancing to efficiently harness thousands of processors on high performance computers and enable simulations of up to millions of mesh elements and billions of particles. Multiple decompositions of the same mesh are used: one for the particles, and one for the field solves. Electrostatic fields are computed using an unstructured mesh finite element method (FEM), and the resulting linear systems are solved using solvers from the Trilinos package (http://trilinos.org/).

Source record↗

Percept

The Percept software package is a collection of libraries and executables that provide tools for verifying computer simulations of engineering components and systems. Percept is useful for simulations using the finite element or finite volume methods on unstructured meshes. Percept includes API's for adaptive mesh refinement, geometry representation, the method of manufactured solutions, analysis of convergence including the convergence of vibrational eigenmodes, and metrics for analyzing the difference between fields represented on two different overlapping unstructured grids.

Source record↗

Revised Extended Grid Library

The Revised Eolus Grid Library (REGL) is a mesh-tracking library that was developed for use with the MCNP6TM computer code so that (radiation) particles can track on an unstructured mesh. The unstructured mesh is a finite element representation of any geometric solid model created with a state-of-the-art CAE/CAD tool. The mesh-tracking library is written using modern Fortran and programming standards; the library is Fortran 2003 compliant. The library was created with a defined application programmer interface (API) so that it could easily integrate with other particle tracking/transport codes. The library does not handle parallel processing via the message passing interface (mpi), but has been used successfully where the host code handles the mpi calls. The library is thread-safe and supports the OpenMP paradigm. As a library, all features are available through the API and overall a tight coupling between it and the host code is required. Features of the library are summarized with the following list: Can accommodate first and second order 4, 5, and 6-sided polyhedra; any combination of element types may appear in a single geometry model; parts may not contain tetrahedra mixed with other element types; pentahedra and hexahedra can be together in the same part; robust handling of overlaps and gaps; tracks element-to-element to produce path length results at the element level; finds element numbers for a given mesh location; finds intersection points on element faces for the particle tracks; produce a data file for post processing results analysis; reads Abaqus .inp input (ASCII) files to obtain information for the global mesh-model; supports parallel input processing via mpi; and support parallel particle transport by both mpi and OpenMP.

Martz, Roger L.↗

A Knowledge Graph Approach for the Secondary Use of Cancer Registry Data

Population-based central cancer registries collect valuable structured and unstructured data primarily for cancer surveillance and research, enhancing insights into clinical features associated with cancer occurrence, cancer treatment, and cancer outcomes to guide interventions which reduce the cancer burden. Cancer registries primarily collect data on (1) cancer type (case or tumor); (2) patient demographics such as age, gender, and residential address at time of diagnosis; (3) planned first course of treatment; and (4) date of last contact, vital status, and cause of death. Cancer registry data is dynamic, structured data, which is extracted from many unstructured sources such as electronic healthcare records, and consolidated for reporting and other purposes. While available advanced analytic tools such as SEER*Stat have the ability to build SAS queries, we, however, explore an innovative knowledge graph approach to organizing cancer registry data for advanced analytics and visualization, which has unique advantages over approaches of existing tools. This innovative knowledge graph approach semantically enriches the data and easily enables linkage with third-party data, which can better explain variation in outcomes. We have developed a prototype knowledge graph based on data from the Louisiana Tumor Registry and other publicly available datasets including Behavioral Risk Factor Surveillance System, Clinical Trials, DBpedia, GeoNames, Rural-Urban Continuum Codes, and Semantic MEDLINE. The resource description framework (RDF) data model was selected to represent our knowledge graph, which contains more than 25 billion triples and is ~4TB in storage size. To exhibit the benefits of the knowledge graph approach, we used scenario specific queries, which find the relationships between cancer treatment sequences and outcomes. To illustrate its ease of use in iterative analysis, the knowledge graph was linked to external datasets for performing complex queries across multiple datasets. In addition, we used knowledge graphs to identify data discrepancies and to handle schema changes. Finally, we visualized the knowledge graph to discover data patterns. Our results demonstrate this graph-based solution enables cancer researchers to execute complex queries and more easily perform iterative analyses to improve understanding of cancer registry data. In the future, we would like to use high-performance computing (HPC) resources for faster-generating hypotheses with clinical potential from our knowledge graph.

Hasan, S M Shamimul↗

JSONize: A Scalable Machine Learning Pipeline to Model Medical Notes as Semi-structured Documents

The Department of Veteran's Affairs (VA) archives the largest corpora of clinical notes in their corporate data warehouse (CDW) as unstructured text data. Unstructured text easily supports keyword searches and regular expressions. Often these simple searches do not adequately support the complex searches that need to be performed on notes. For example, a researcher may want all notes with a Duke Treadmill Score less than 5 or people that smoke more than 1 pack per day. Range queries like this and more can be supported by modelling text as semi-structured documents. In this paper, we implement a scalable machine learning pipeline that models plain medical text as useful semi-structured documents. We improve on existing models and achieve a F1-score of 0.912 and scale our methods to the entire VA corpus.

Rush III, Everett↗

Preparing an Incompressible-Flow Fluid Dynamics Code for Exascale-Class Wind Energy Simulations: Preprint

The US Department of Energy has identified Exascale-Class wind farm simulation tools as critical to wind energy scientific discovery. A primary objective of the Exawind project is to build high-performance, predictive Computational Fluid Dynamics tools that satisfy these modeling needs. GPU accelerators will serve as the computational thoroughbreds of next generation, Exascale-Class, platforms. Here, we report on our efforts for preparing the Exawind unstructured mesh solver, Nalu-Wind, for Exascale-Class machines. For computing at this scale, a simple port of the incompressible-flow algorithms to GPUs is not sufficient. One needs novel algorithms that are application aware, memory efficient, and optimized for latest generation GPU devices to get high-performance. The result of our efforts are unstructured mesh simulations of wind turbines that use 1/6 the compute resources of Summit supercomputer at Oak Ridge National Lab. In particular, we demonstrate a first-of-its-kind, simulation using Algebraic Multigrid solvers on over 4000 GPUs.

algebraic multigrid↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

How individual traces and interactive timelines could support outage execution - Toward an outage historian concept

In the context of a project that is designing innovative ICT-based solutions for the organizational concept of outage management, we focus on the informational process of the OCR (Outage Control Room) underlying the execution of the outages. Informational process are based on structured and unstructured documents that have a key role in the collaborative processes and management of the outage. We especially track the structured and unstructured documents, electronically or not, from creation to sharing. Our analysis allows us to consider that the individual traces produced by an individual participant with a specific role could be multi-purpose and support sharing between participants without creating duplication of work. The ultimate goal is to be able to generate an outage historian, that is not just focused on highly structured information, which could be useful to improve the continuity of information between participants. We study the implementation of this approach through web technologies and social media tools to address this issue. We also investigate the issue of data access through interactive visualization timelines coupled with other modality's to assist users in the navigation and exploration of the proposed historian. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Benchmarking of calculation schemes in APOLLO2 and COBAYA3 for WER lattices

This paper presents solutions of the NURISP WER lattice benchmark using APOLLO2, TRIPOLI4 and COBAYA3 pin-by-pin. The main objective is to validate MOC based calculation schemes for pin-by-pin cross-section generation with APOLLO2 against TRIPOLI4 reference results. A specific objective is to test the APOLLO2 generated cross-sections and interface discontinuity factors in COBAYA3 pin-by-pin calculations with unstructured mesh. The VVER-1000 core consists of large hexagonal assemblies with 2 mm inter-assembly water gaps which require the use of unstructured meshes in the pin-by-pin core simulators. The considered 2D benchmark problems include 19-pin clusters, fuel assemblies and 7-assembly clusters. APOLLO2 calculation schemes with the step characteristic method (MOC) and the higher-order Linear Surface MOC have been tested. The comparison of APOLLO2 vs. TRIPOLI4 results shows a very close agreement. The 3D lattice solver in COBAYA3 uses transport corrected multi-group diffusion approximation with interface discontinuity factors of Generalized Equivalence Theory (GET) or Black Box Homogenization (BBH) type. The COBAYA3 pin-by-pin results in 2, 4 and 8 energy groups are close to the reference solutions when using side-dependent interface discontinuity factors. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗