Search NASA⌕ Search

SEARCH · Search NASA

Results for “leverage”

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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Emissions and Energy Impacts of the Inflation Reduction Act

If goals set under the Paris Agreement are met, the world may hold warming well below 2 degrees C (1); however, parties are not on track to deliver these commitments (2), increasing focus on policy implementation to close the gap between ambition and action. Recently, the US government passed its most prominent piece of climate legislation to date - the Inflation Reduction Act of 2022 (IRA) - designed to invest in a wide range of programs that, among other provisions, incentivize clean energy and carbon management, encourage electrification and efficiency measures, reduce methane emissions, promote domestic supply chains, and address environmental justice concerns (3). IRA's scope and complexity make modeling important to understand impacts on emissions and energy systems. We leverage results from nine independent, state-of-the-art models to examine potential implications of key IRA provisions, showing economy-wide emissions reductions between 43 and 48% below 2005 levels by 2035.

electricity↗
DOE OSTI2019

Using the Endogenous CRISPR-Cas System of Heliobacterium modesticaldum To Delete the Photochemical Reaction Center Core Subunit Gene

In Heliobacterium modesticaldum , as in many Firmicutes , deleting genes by homologous recombination using standard techniques has been extremely difficult. The cells tend to integrate the introduced plasmid into the chromosome by a single recombination event rather than perform the double recombination required to replace the targeted locus. Transformation with a vector containing only a homologous recombination template for replacement of the photochemical reaction center gene pshA produced colonies with multiple genotypes, rather than a clean gene replacement. To address this issue, we required an additional means of selection to force a clean gene replacement. In this study, we report the genetic structure of the type I-A and I-E CRISPR-Cas systems from H. modesticaldum , as well as methods to leverage the type I-A system for genome editing. In silico analysis of the CRISPR spacers revealed a potential consensus protospacer adjacent motif (PAM) required for Cas3 recognition, which was then tested using an in vivo interference assay. Introduction of a homologous recombination plasmid that carried a miniature CRISPR array targeting sequences in pshA (downstream of a naturally occurring PAM sequence) produced nonphototrophic transformants with clean replacements of the pshA gene with ~80% efficiency. Mutants were confirmed by PCR, sequencing, optical spectroscopy, and growth characteristics. This methodology should be applicable to any genetic locus in the H. modesticaldum genome. The heliobacteria are the only phototrophic members of the largely Gram-positive phylum Firmicutes , which contains medically and industrially important members, such as Clostridium difficile and Clostridium acetobutylicum . Heliobacteria are of interest in the study of photosynthesis because their photosynthetic system is unique and the simplest known. Since their discovery in the early 1980s, work on the heliobacteria has been hindered by the lack of a genetic transformation system. The problem of introducing foreign DNA into these bacteria has been recently rectified by our group; however, issues still remained for efficient genome editing. The significance of this work is that we have characterized the endogenous type I CRISPR-Cas system in the heliobacteria and leveraged it to assist in genome editing. Using the CRISPR-Cas system allowed us to isolate transformants with precise replacement of the pshA gene encoding the main subunit of the photochemical reaction center.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Contrasting effects of glutamate and branched-chain amino acid metabolism on acid tolerance in a Castellaniella isolate from acidic groundwater

Groundwater acidification co-occurring with nitrate pollution is a common, global environmental health hazard. Denitrifying bacteria have been leveraged for the in situ removal of nitrate in groundwater. However, co-existing stressors—such as low pH—reduce the efficacy of biological removal processes. Castellaniella sp. str. MT123 is a complete denitrifier that was isolated from acidic, nitrate-contaminated groundwater. The strain grows robustly by nitrate respiration at pH < 6.0, completely reducing nitrate to dinitrogen gas. Genomic analyses of MT123 revealed few previously characterized acid tolerance genes. Thus, we utilized a combination of proteomics, metabolomics, and competitive mutant fitness to characterize the genetic mechanisms of MT123 acclimation to growth under mildly acidic conditions. We found that glutamate accumulation is critical in the acid acclimation of MT123, possibly through consumption of intracellular protons via glutamate decarboxylation to GABA. This is despite the fact that MT123 lacks the canonical glutamate decarboxylase-glutamate/GABA antiporter system implicated in acid tolerance in other bacteria. In contrast, branched-chain amino acid (BCAA) accumulation was detrimental to cell growth at lower pHs, possibly through indirect mechanisms impacting the cellular glutamate pool. Genetic analysis previously linked MT123 to a population of Castellaniella that bloomed—concurrent to nitrate removal—during a biostimulation effort to reduce groundwater nitrate concentrations at MT123’s location of origin. Thus, our analyses provide novel insight into mechanisms of acclimation to acidic conditions in a strain with significant potential for nitrate bioremediation.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Enrichable consortia of microbial symbionts degrade macroalgal polysaccharides in Kyphosus fish

ABSTRACT Coastal herbivorous fishes consume macroalgae, which is then degraded by microbes along their digestive tract. However, there is scarce genomic information about the microbiota that perform this degradation. This study explores the potential of Kyphosus gastrointestinal microbial symbionts to collaboratively degrade and ferment polysaccharides from red, green, and brown macroalgae through in silico study of carbohydrate-active enzyme and sulfatase sequences. Recovery of metagenome-assembled genomes (MAGs) from previously described Kyphosus gut metagenomes and newly sequenced bioreactor enrichments reveals differences in enzymatic capabilities between the major microbial taxa in Kyphosus guts. The most versatile of the recovered MAGs were from the Bacteroidota phylum, whose MAGs house enzyme collections able to decompose a variety of algal polysaccharides. Unique enzymes and predicted degradative capacities of genomes from the Bacillota (genus Vallitalea ) and Verrucomicrobiota (order Kiritimatiellales ) highlight the importance of metabolic contributions from multiple phyla to broaden polysaccharide degradation capabilities. Few genomes contain the required enzymes to fully degrade any complex sulfated algal polysaccharide alone. The distribution of suitable enzymes between MAGs originating from different taxa, along with the widespread detection of signal peptides in candidate enzymes, is consistent with cooperative extracellular degradation of these carbohydrates. This study leverages genomic evidence to reveal an untapped diversity at the enzyme and strain level among Kyphosus symbionts and their contributions to macroalgae decomposition. Bioreactor enrichments provide a genomic foundation for degradative and fermentative processes central to translating the knowledge gained from this system to the aquaculture and bioenergy sectors. IMPORTANCE Seaweed has long been considered a promising source of sustainable biomass for bioenergy and aquaculture feed, but scalable industrial methods for decomposing terrestrial compounds can struggle to break down seaweed polysaccharides efficiently due to their unique sulfated structures. Fish of the genus Kyphosus feed on seaweed by leveraging gastrointestinal bacteria to degrade algal polysaccharides into simple sugars. This study reconstructs metagenome-assembled genomes for these gastrointestinal bacteria to enhance our understanding of herbivorous fish digestion and fermentation of algal sugars. Investigations at the gene level identify Kyphosus guts as an untapped source of seaweed-degrading enzymes ripe for further characterization. These discoveries set the stage for future work incorporating marine enzymes and microbial communities in the industrial degradation of algal polysaccharides.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

The Pele Simulation Suite for Reacting Flows at Exascale

In this work, we present the Pele suite of software tools for compressible and incompressible reacting flows. The Pele suite leverages several different libraries, notably AMReX and SUNDIALS, to achieve performance portability on heterogeneous computing architectures across the supercomputing landscape. The Pele suite is comprised of PeleC, a compressible reacting flow block-structured adaptive mesh refinement solver, PeleLMeX, a low-Mach number reacting flow block-structured adaptive mesh refinement solver, Pele-Physics, a library for transport, thermodynamics, finite rate chemistry, soot, spray and radiation physics. The objective of this paper is (i) to present the code development efforts necessary to achieve highly effective and scalable applications for exascale machines and (ii) to detail the performance results of the Combustion-Pele project applications on Oak Ridge National Laboratory's Frontier. We show good weak and strong scaling results for both PeleC and PeleLMeX up to more than 50 billion cells on more than 4096 Frontier graphics processing unit nodes. We also present a capability demonstration simulation of a dual-fuel pulse compression ignition engine (six adaptive mesh refinement levels, and 60 billion cells or 2.1 trillion degrees of freedom) on Frontier, to date one of the largest simulations performed on the first exascale-class supercomputer.

adaptive mesh refinement↗
DOE OSTI2022

Ensemble approximate control variate estimators: Applications to multi-fidelity importance sampling.

The recent growth in multifidelity uncertainty quantification has given rise to a large set of variance reduction techniques that leverage information from model ensembles to provide variance reduction for estimates of the statistics of a high-fidelity model. In this paper we provide two contributions: (1) we utilize an ensemble estimator to account for uncertainties in the optimal weights of approximate control variate (ACV) approaches and derive lower bounds on the number of samples required to guarantee variance reduction; and (2) we extend an existing multifidelity importance sampling (MFIS) scheme to leverage control variates. Our approach directly addresses a limitation of many multifidelity sampling strategies that require the usage of pilot samples to estimate covariances. As such we make significant progress towards both increasing the practicality of approximate control variates—for instance, by accounting for the effect of pilot samples—and using multifidelity approaches more effectively for estimating low-probability events. The numerical results indicate our hybrid MFIS-ACV estimator achieves up to 50% improvement in variance reduction over the existing state-of-the-art MFIS estimator, which had already shown an outstanding convergence rate compared to the Monte Carlo method, on several problems of computational mechanics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Subsampling of Parametric Models with Bifidelity Boosting

Least squares regression is a ubiquitous tool for building emulators (a.k.a. surrogate models) of problems across science and engineering for purposes such as design space exploration and uncertainty quantification. When the regression data are generated using an experimental design process (e.g., a quadrature grid) involving computationally expensive models, or when the data size is large, sketching techniques have shown promise at reducing the cost of the construction of the regression model while ensuring accuracy comparable to that of the full data. However, random sketching strategies, such as those based on leverage scores, lead to regression errors that are random and may exhibit large variability. To mitigate this issue, we present a novel boosting approach that leverages cheaper, lower-fidelity data of the problem at hand to identify the best sketch among a set of candidate sketches. This in turn specifies the sketch of the intended high-fidelity model and the associated data. We provide theoretical analyses of this bifidelity boosting (BFB) approach and discuss the conditions the low- and high-fidelity data must satisfy for a successful boosting. In doing so, we derive a bound on the residual norm of the BFB sketched solution relating it to its ideal, but computationally expensive, high-fidelity boosted counterpart. Finally, empirical results on both manufactured and PDE data corroborate the theoretical analyses and illustrate the efficacy of the BFB solution in reducing the regression error, as compared to the nonboosted solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Covariance-Free Bifidelity Control Variates Importance Sampling for Rare Event Reliability Analysis

Multifidelity modeling has been steadily gaining attention as a tool to address the problem of exorbitant model evaluation costs that makes the estimation of failure probabilities a significant computational challenge for complex real-world problems, particularly when failure is a rare event. To implement multifidelity modeling, estimators that efficiently combine information from multiple models/sources are necessary. In past works, the variance reduction techniques of control variates (CV) and importance sampling (IS) have been leveraged for this task. In this paper, we present the CVIS framework—a creative take on a coupled CV and IS estimator for bifidelity reliability analysis. The framework addresses some of the practical challenges of the CV method by using an estimator for the control variate mean and sidestepping the need to estimate the covariance between the original estimator and the control variate through a clever choice for the tuning constant. Furthermore, the task of selecting an efficient IS distribution is also considered, with a view towards maximally leveraging the bifidelity structure and maintaining expressivity. Additionally, a diagnostic is provided that indicates both the efficiency of the algorithm as well as the relative predictive quality of the models utilized. Finally, the behavior and performance of the framework is explored through analytical and numerical examples.

Markov chain Monte Carlo↗
DOE OSTI2024

Robustness of topological persistence in knowledge distillation for wearable sensor data

Topological data analysis (TDA) has shown great success in various applications involving wearable sensor data. However, there are difficulties in leveraging topological features in machine learning and wearable sensors because of the large time consumption and computational resources required to extract the features. To address this problem, knowledge distillation (KD) is utilized to generate a small model and accommodate topological features with persistence image (PI) representations from the raw time series data. Deploying topological knowledge in KD enables the student to achieve better performance compared to the one trained solely on raw time series data. However, it is not yet known if there are coherent characteristics for topological features in PI, which can aid in improving the performance during KD. In this paper, we investigate the suitability and challenges of utilizing topological features in KD for wearable sensor data, thereby contributing to the advancement of the field. Our study explores the impact of transferred topological features by comparing the Teacher-to-Student framework with Multiple Teachers-to-Student where teachers utilize both time series data and persistence images obtained by TDA as inputs. Additionally, we conduct a rigorous examination of topological knowledge effects by testing under various corruptions, knowledge types, and learning strategies in the context of human activity recognition tasks. Our analysis of topological features in KD presents the optimal strategy for incorporating these features. This study includes datasets of varying scales, window lengths, and activity classes, providing a comprehensive evaluation. Our results demonstrate that leveraging topological features in KD to enhance performance across databases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Potential Demand Reduction from Buildings in a Simulated Utility

The availability of large-area sensing, scalable algorithms, and high-performance computing has enabled the possibility of urban-scale building energy modeling using new methods not limited to the scalability of manual building energy model creation or retrieval of county-by-county tax assessor’s data. Automatic Building detection and Energy Model creation (AutoBEM) has created 178,368 building energy models for the Electric Power Board (EPB) of Chattanooga, TN, and compared simulation performance to 15-minute data from each building. These models leverage several data sources (e.g. imagery, GIS, utility), software tools to extract building properties (e.g. footprint, height, façade type, window-to-wall ratio, occupancy, building type), simulate at scale on two of the world’s #1 fastest supercomputers, and provide web-based visual analytics.Grid-interactive efficient buildings offer the potential to reduce utility and rate-payer energy costs during each calendar month’s hour of critical generation – when the least efficient, most costly, and often dirtiest generation assets must be brought online. In this paper, EnergyPlus is used to simulate over 150,000 buildings to assess the technical potential of utility-controlled smart thermostats. This is analyzed under a couple scenarios leveraging buildings as thermal batteries via pre-conditioning to coast through peak hours. Results are provided in box and whisker plots assessing the distribution of peak demand reduction at the utility-scale along with breakouts of energy and demand savings by building type and vintage.

Bass, Brett↗
DOE OSTI2020

QCOR; A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation

Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR, which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. Additionally, QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Shepherding Metadata Through the Building Lifecycle

Many different digital representations of a building are produced over the course of its lifecycle. These representations contain the metadata required to support different stages of the building, from initial planning and design, to construction and commissioning, through operations, audits, retrofits and maintenance. However, because of differences in the semantics, structure and syntax of these representations, the metadata they contain is not interoperable. We present a novel method for leveraging these representations to create a unified, authoritative Brick metadata model for a building that can be continually maintained over the course of the building lifecycle. A simple synchronization protocol relays inferred Brick metadata from existing metadata sources such as gbXML, BuildingSync, Project Haystack and Modelica to a central integration server, which merges the metadata into a valid Brick model.

Fierro, Gabe↗
DOE OSTI2021

Extending C++ for Heterogeneous Quantum-Classical Computing

In this report we present qcor - a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language agnostic manner, as well as a hardware-agnostic, retargetable compiler workflow targeting a number of physical and virtual quantum computing backends. qcor leverages novel Clang plugin interfaces and builds upon the XACC system-level quantum programming framework to provide a state-of-the-art integration mechanism for quantum-classical compilation that leverages the best from the community at-large. qcor translates quantum kernels ultimately to the XACC intermediate representation, and provides user-extensible hooks for quantum compilation routines like circuit optimization, analysis, and placement. This work details the overall architecture and compiler workflow for qcor, and provides a number of illuminating programming examples demonstrating its utility for near-term variational tasks, quantum algorithm expression, and feed-forward error correction schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗
DOE OSTI2023

High-Level Synthesis of Irregular Applications: A Case Study on Influence Maximization

The Influence Maximization problem is the problem of identifying a small cohort of actors from a broader population that, when initially activated in a diffusion process, are expected to result in a large number of activations in the population. While the problem is known to be NP-hard, several approximation algorithms have been devised by leveraging its submodular structure. While these algorithms are theoretically efficient, they are computationally very expensive in practice. This work advances the current state-of-the-art parallelization scheme for the IMM algorithm by devising the adoption of custom hardware accelerators implemented on FPGAs by leveraging High Level Synthesis from OpenCL. We study the performance of our proposed approach by exploring optimizations tailored at improving the parallel efficiency of the accelerators and highlight their effects and limitations in accelerating complex graph analytic applications. Our experimental evaluation shows that FPGA acceleration can improve the performance of the LT diffusion model up to 1.72x for the entire application and up to 2.90x for its most important kernel with respect to a CPU only parallel execution. The FPGA acceleration of the LT model shows also a 1.54x reduction in energy consumption when compared to a parallel CPU only run.

Neff, Reece W.↗
DOE OSTI2023

Scalable Incremental Checkpointing using GPU-Accelerated De-Duplication

Writing large amounts of data concurrently to stable storage is a typical I/O pattern of many HPC workflows. This pattern introduces high I/O overheads and results in increased storage space utilization especially for workflows that need to capture the evolution of data structures with high frequency as checkpoints. In this context, many applications, such as graph pattern matching, perform sparse updates to large data structures between checkpoints. For these applications, incremental checkpointing techniques that save only the differences from one checkpoint to another can dramatically reduce the checkpoint sizes, I/O bottlenecks, and storage space utilization. However, such techniques are not without challenges: it is non-trivial to transparently determine what data has changed since a previous checkpoint and assemble the differences in a compact fashion that does not result in excessive metadata. State-of-art data reduction techniques (e.g., compression and de-duplication) have significant limitations when applied to modern HPC applications that leverage GPUs: slow at detecting the differences, generate a large amount of metadata to keep track of the differences, and ignore crucial spatiotemporal checkpoint data redundancy. This paper addresses these challenges by proposing a Merkle tree-based incremental checkpointing method to exploit GPUs' high memory bandwidth and massive parallelism. Experimental results at scale show a significant reduction of the I/O overhead and space utilization of checkpointing compared with state-of-the-art incremental checkpointing and compression techniques.

Tan, Nigel↗
DOE OSTI2023

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗
DOE OSTI2026

JANUS: Resilient and Adaptive Data Transmission for Enabling Timely and Efficient Cross-Facility Scientific Workflows

In modern science, the growing complexity of large-scale scientific projects has led to an increasing reliance on cross-facility scientific workflows, where resources and expertise from multiple institutions and geographic locations are leveraged to accelerate scientific discovery. These workflows often require transmitting huge amounts of scientific data through wide-area networks. Although high-speed networks like ESnet and transfer services such as Globus have improved data mobility, several challenges remain. The sheer volume of data can overwhelm network bandwidth, widely used transport protocols such as TCP suffer from inefficiencies due to retransmissions triggered by packet loss, and existing fault-tolerance mechanisms like erasure coding introduce substantial overhead. In this paper, we propose Janus, a resilient and adaptable data transmission approach designed for cross-facility scientific workflows. Unlike traditional TCP-based methods, Janus leverages UDP, integrates erasure coding for fault tolerance, and combines it with error-bounded lossy compression to reduce overhead. This novel design allows users to balance data transmission time and accuracy, optimizing transfer performance based on specific scientific requirements. Additionally, Janus dynamically adjusts erasure coding parameters in response to real-time network conditions, ensuring efficient data transfers even in fluctuating environments. We develop optimization models for determining ideal configurations and implement adaptive data transfer protocols to enhance reliability. Through extensive simulations and real-network experiments, we demonstrate that Janus significantly improves transfer efficiency while maintaining data fidelity.

Esaulov, Vladislav [Georgia State University, Atla↗