Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Tool”

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,513 records · Page 84
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Deciphering the evolution of flavin-dependent monooxygenase stereoselectivity using ancestral sequence reconstruction

Controlling the selectivity of a reaction is critical for target-oriented synthesis. Accessing complementary selectivity profiles enables divergent synthetic strategies, but is challenging to achieve in biocatalytic reactions given enzymes’ innate preferences of a single selectivity. Thus, it is critical to understand the structural features that control selectivity in biocatalytic reactions to achieve tunable selectivity. Here, we investigate the structural features that control the stereoselectivity in an oxidative dearomatization reaction that is key to making azaphilone natural products. Crystal structures of enantiocomplementary biocatalysts guided the development of multiple hypotheses centered on the structural features that control the stereochemical outcome of the reaction; however, in many cases, direct substitutions of active site residues in natural proteins led to inactive enzymes. Ancestral sequence reconstruction (ASR) and resurrection were employed as an alternative strategy to probe the impact of each residue on the stereochemical outcome of the dearomatization reaction. These studies suggest that two mechanisms are active in controlling the stereochemical outcome of the oxidative dearomatization reaction: one involving multiple active site residues in AzaH and the other dominated by a single Phe to Tyr switch in TropB and AfoD. Moreover, this study suggests that the flavin-dependent monooxygenases (FDMOs) adopt simple and flexible strategies to control stereoselectivity, which has led to stereocomplementary azaphilone natural products produced by fungi. This paradigm of combining ASR and resurrection with mutational and computational studies showcases sets of tools for understanding enzyme mechanisms and provides a solid foundation for future protein engineering efforts.

Science & Technology - Other Topics↗
DOE OSTI2020

Enhancement of Unsteady and 3D Aerodynamics Models using Machine Learning

Unsteady aerodynamics will be an important part of the floating wind turbines of the future operating under high shear across the rotor disk coupled with platform motion and atmospheric turbulence. We develop an unsteady aerodynamics and dynamic stall model using a long short-term memory variant of recurrent neural networks. The neural network model is trained using the oscillating airfoil data set from Ohio State University. The predictions from our machine learning (ML)-based model show good agreement with the experimental data and other state-of-the-art dynamic stall models for a wide range of airfoils, Reynolds numbers and reduced frequencies. In some cases the predictions are better than the Beddoes-Leishman model implementation in OpenFAST, when using the default coefficients. The ML-based model is also able to capture the key physics associated with dynamic stall, such as the precedence of moment stall before lift stall and cycle-to-cycle variations in the aerodynamic response. The new unsteady aerodynamics model is expected to improve prediction of fatigue loads for yaw-based wake-steering control scenarios in actuator-line and actuator-disc simulations of wind farms. Our methodology for training the ML-model provides a pathway for improving design level tools using high-fidelity computational fluid dynamics (CFD) simulations in the future.

17 WIND ENERGY↗
DOE OSTI2023

Sparse Convolutional Neural Networks for particle classification in ProtoDUNE-SP events

Deep Learning (DL) methods and Computer Vision are becoming important tools for event reconstruction in particle physics detectors. In this work, we report on the use of submanifold sparse convolutional neural networks (SparseNets) for the classification of track and shower hits from a DUNE prototype liquid-argon detector at CERN (ProtoDUNE-SP). By taking advantage of the three-dimensional nature of the problem we use a set of nine input features to classify sparse and locally dense hits associated to track or shower particles. The SparseNet has been trained on a test sample and shows promising results: efficiencies and purities greater than 90%. This has also been achieved with a considerable speedup and substantially less resource utilization with respect to other DL networks such as graph neural networks. This method offers great scalability advantages for future large neutrino detectors such as the planned DUNE experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Optimizing the Fast Fourier Transform Using Mixed Precision on Tensor Core Hardware

The Fast Fourier Transform is a fundamental tool in scientific and technical computation. The highly parallelizable nature of the algorithm makes it a suitable candidate for GPU acceleration. This paper focuses on exploiting the speedup due to using the half precision multiplication capability of the latest GPUs' tensor core hardware without significantly degrading the precision of the Fourier Transform result. We develop an algorithm that dynamically splits the input single precision dataset into two half precision sets at the lowest level, uses half precision multiplication, and recombines the result at a later step. This work paves the way for using tensor cores for high precision inputs.

Sorna, Anumeena↗
DOE OSTI2023

Towards Redefining the Reproducibility in Quantum Computing: A Data Analysis Approach on NISQ Devices

Although the building of quantum computers has kept making rapid progress in recent years, noise is still the main challenge for any application to leverage the power of quantum computing. Existing works addressing noise in quantum devices proposed noise reduction when deploying a quantum algorithm to a specified quantum computer. The reproducibility issue of quantum algorithms has been raised since the noise levels vary on different quantum computers. Importantly, existing works largely ignore the fact that the noise of quantum devices varies as time goes by. Therefore, reproducing the results on the same hardware will even become a problem. We analyze the reproducibility of quantum machine learning (QML) algorithms based on daily model training and execution data collection. Our analysis shows a correlation between our QML models’ test accuracy and quantum computer hardware’s calibration features. We also demonstrate that noisy simulators for quantum computers are not a reliable tool for quantum machine learning applications.

Senapati, Priyabrata↗
DOE OSTI2025

Self-Supervised and Interpretable Anomaly Detection Using Network Transformers

Machine learning and deep neural networks (DNNs) have been proposed as a tool to identify anomalies in computer network communications. However, due the obfuscated nature of off-the-shelf machine learning models, their output often does not provide enough information to isolate the source of the anomaly to take corrective measures. In this article, we introduce the network transformer (NeT), a DNN model for anomaly detection that incorporates the graph structure of the communication network in order to improve interpretability. Further, the presented approach has the following advantages: first, enhanced interpretability by incorporating the graph structure of computer networks; second, provides a hierarchical set of features that enables analysis at different levels of granularity; second, self-supervised training that does not require labeled data. The NeT model was evaluated on a set of anomalous scenarios executed in a real industrial control system. The presented approach successfully identified the anomalies, the devices affected, and the specific connections causing the anomalies, providing a data-driven hierarchical approach to analyze the behavior of a cyber network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

MO-FG-CAMPUS-IeP1-03: Establishment of Provincial Diagnostic Reference Levels in Pediatric Imaging

Purpose: To establish provincial diagnostic reference levels (DRLs) in pediatric general radiography and computed tomography (CT) as a tool for the optimization of exposure parameters. Methods: Patient dose survey was conducted in the only pediatric hospital in the province of Nova Scotia. The DRLs were established as the 75th percentile of patient dose distributions in different age groups. For routine radiography projections the DRLs were determined in terms of entrance surface dose (ESD) calculated from the radiation output measurements and the tube current-exposure time product (mAs) recorded for each examination. Patient thickness was measured by the technologist during the examination. The CR and DR systems, employing respectively a fixed technique and phototiming, were evaluated separately; a two-tailed Student’s t-test was used to determine the significance of differences between the means of dose distributions. The CT studies included routine head, chest, abdomen/pelvis, and chest/abdomen/pelvis. The volume CT dose index (CTDIvol) and dose-length product (DLP) values were extracted retrospectively from PACS. The correction factors based on the effective diameter of the patient were applied to the CT dosimetry metrics based on the standard phantoms. Results: The provincial DRLs were established in the following age groups: newborn, 1, 5, 10, and 15 year olds. In general radiography the DR systems demonstrated slightly lower dose than the CR for all views, however the differences were not statistically significant (p > 0.05) for all examinations. In CT the provincial DRLs were lower than the published data, except for head DLPs in all age categories. This might be due to the small patient sample size in the survey. Future work will include additional CT data collection over an extended period of time. Conclusion: Provincial DRLs were established in the dedicated children’s hospital to provide guidance for the other facilities in examinations of pediatric patients.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2026

SetGo: Metadata Readiness for Scientific AI Datasets

Scientific datasets intended for AI use require both computational readiness for model training and metadata readiness for discovery, sharing, and reuse. The Readiness Engine for Data Integration (REDI) addresses computational readiness, but no corresponding tool evaluates whether a dataset’s metadata are sufficiently complete, governed, and standards-compliant for publication and agent-based consumption. Existing FAIR assessors operate only on published repository records, and no single system covers FAIR compliance, licensing, provenance, governance, reproducibility, and catalog readiness together. We present SetGo, an open-source Python toolkit that assesses and repairs metadata readiness across these six dimensions before a dataset is published or archived. Applied to four scientific corpora, SetGo surfaces deficiencies that general-purpose tools do not detect: ERA5 climate metadata scores 4% on ACDD 1.3 compliance; materials datasets fail OPTIMADE species-definition requirements; and PDB-derived proteomics data carries licensing terms incompatible with standard SPDX identifiers. Guided enrichment raises overall FAIR scores from 52–57% to 81–91%, and a single setgo publish command pushes to Hugging Face Hub, CKAN, or OpenMetadata with ML Commons Croissant 1.0 metadata sidecars. To support interactive and automated workflows, SetGo integrates with coding agents powered by large language models (LLMs) through a /setgo skill that enables natural-language execution of the full assess–enrich–publish loop, with user involvement limited to supplying missing metadata values.

Wilkinson, Sean [ORNL] (ORCID:0000000214437479)↗
DOE OSTI2012

SystemBurn

SystemBurn is a tool for creating a synthetic computational load for the purpose of measuring how much power a computer will draw under that type of load. The loads include fundamental library function calls like matrix multiply, memory copies, fourier transforms, bit manipulation, I/O, network packet transfers, and some code contrived to cause the processor to dray more or less power. The code produces some diagnostic and progress output, but the actual measurements would be recorded from the power panels within the computer room.

Josh Lothian, JeffKuehn↗
DOE OSTI2017

Center for Efficient Exascale Discretizations Software Suite

The CEED Software suite is a collection of generally applicable software tools focusing on the following computational motives: PDE discretizations on unstructured meshes, high-order finite element and spectral element methods and unstructured adaptive mesh refinement. All of this software is being developed as part of CEED, a co-design Center for Efficient Exascale Discretizations, within DOE's Exascale Computing Project (ECP) program.

Kolev, Tzanio↗
DOE OSTI2020

slacgismo/loadshape_analysis

Loadshape analysis tool: The loadshape analysis module computes loadshapes for arbitary CSV load data sets.

Chassin, David P.↗
DOE OSTI2020

pnnl/capratTX

Thermoelectric Capacity at Risk Analysis Tool for ERCOT. capratTX is a unique R package, featuring algorithms for simulating water storages that provide cooling water for thermoelectric power plants. The tool may be used to compute long-term "capacity at risk" under a range of future climate projections.

Turner, Sean W D↗
DOE OSTI2018

NOvA Reconstruction using Deep Learning [Slides]

The NOvA experiment has made measurements of the disappearance of νμ and the appearance of νe in the NuMI beam at Fermilab. Key to these measurements is the identification of the neutrino flavor and measurement of the neutrino energy, for which NOvA has implemented deep learning algorithms utilizing tools from the field of computer vision. These algorithms, first applied to NOvA's 2016 results, showed significant improvement over previous reconstruction methods. I will present NOvA's implementation of deep learning algorithms using convolutional neural networks for identification of event neutrino flavor and single particles used in the 2018 analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2013

Computationally Efficient Modeling of High Efficiency Clean Combustion Engines

This project focuses on the development and application of computationally efficient and accurate simulation tools for prediction of engine combustion. Simulation of combustion aids in development of new high-efficiency and low-emissions engines by allowing detailed characterization of in-cylinder engine processes that are difficult to measure directly. Simulation also allows exploratory investigations of new concepts, such as new combustion chamber geometry, allowing valuable and limited experimental resources to be focused on the most promising strategies.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2023

In-Network DAQ Functions

A revolution in networking is changing how we compute, but we lack the tools that can channel this new capability to benefit science. It is now possible to write programs that operate "in" the network—on network cards (NICs) and network switches themselves, rather than on servers. These programs can analyze and reduce huge volumes of data as they flow through the network—at higher throughput, lower latency, and lower power consumption than if servers (containing CPUs or GPUs) were used. That equipment offers appealing features for scientific experiments that involve huge quantities of data. This poster describes a prototype LArTPC raw-waveform hit finder based on DUNE’s Trigger Primitives generator. We built this as part of ongoing research to better understand how to put programmable network hardware to use in large scientific experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Refining Processing Engines from SAPHIRE: Initialization of Fault Tree/Event Tree Solver

SAPHIRE has been extensively employed for over 35 years to model risk-important systems and quantify risk models. As a well-established and thoroughly documented Probabilistic Risk Assessment (PRA) tool, SAPHIRE has continuously tracked computational trends and received regular updates. Despite its ongoing evolution, there remains a need for further enhancements, particularly in dealing with the quantification of exceptionally large models. These improvements could take the form of algorithmic advancements, harnessing the power of parallel computing, and exploring the potential benefits of cloud computing solutions. Considering these aspirations, the notion of a remote solve option was introduced and subsequently evolved into a dedicated project within the SAPHIRE development team. A significant outcome of this initiative is SAPHSOLVE, an engine extracted from the SageRisk API designed specifically for remote solving capabilities. The ongoing project is nearing its culmination, marked by a series of discoveries that have brought undocumented aspects to light. Among these revelations is the intricacy of the input and output format for the SAPHSOLVE engine. This document serves the crucial purpose of meticulously delineating the precise formats for both input and output, as they form an indispensable foundation. The importance of documenting these formats cannot be overstated, as it is a pivotal step in facilitating rigorous testing and comparison. Whether it involves scrutinizing SAPHSOLVE results against those of the internal integrated solver or other external solvers, the ability to construct models or transform existing ones into a compatible SAPHSOLVE format is imperative. Chapter 1 offers a succinct introduction to both SAPHIRE and SAPHSOLVE, followed by Chapter 2 which outlines the roadmap for enhancing SAPHSOLVE. The core of this report is Chapter 3, which intricately elucidates the intricacies of the input and output file formats. To provide a tangible illustration of these formats, a rudimentary example has been compiled and is available in Appendix. SAPHSOLVE represents a novel external solving mechanism developed by the SAPHIRE team, although it has not yet reached the full spectrum of capabilities possessed by SAPHIRE's internal solver. However, the SAPHIRE team has set a comprehensive course for incorporating the functionalities of SAPHSOLVE. A comprehensive outlook on the future of SAPHSOLVE is expounded upon in Chapter 4.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Advancement of hybrid fluid-kinetic modeling for HEDP and ICF science

We report on the development progress of a hybrid fluid-kinetic code for simulating fluids and plasmas in a wide range of environments, such as laser–matter interactions, inertial confinement fusion, magnetic confinement fusion, and pulsed power. The suite of numerical tools under development utilizes heterogeneous computer architectures and leverages the benefits of particle–based simulation techniques. By working to combine the kinetic particle-in-cell (PIC) model with a particle-based fluid simulation technique, such as smoothed particle hydrodynamics, we are developing a flexible framework capable of accurately modeling complex flows within and between kinetic and fluid regimes. The TriForce code is under development as a C++ framework for parallel, 3D, particle-based, hybrid fluid-kinetic plasma simulations. The fluid half of TriForce will be based upon the meshless smoothed-particle-hydrodynamics (SPH) approach, well-suited for shear, mixing, and turbulence, whereas the kinetic half resembles a traditional particle-in-cell (PIC) code; other particle-based approaches to fluid modeling that do use a mesh are also possible to use and are under investigation. Maxwell’s electromagnetic field equations are solved either via explicit or implicit algorithms or approximated via resistive magnetohydrodynamics (MHD) using an Ohm’s law and resulting induction equation (extended MHD is under development). A primary goal of enabling direct comparisons, from the same code, between results from the variants of MHD and implicit electromagnetic solutions is to improve our fundamental understanding of systems with magnetic fields. The code is under development to recover results from both radiation-MHD and fully kinetic codes in those limits, and is continuing to be developed from other follow-on grants to operate in between where both descriptions may co-exist and interact. For certain applications, it is desired for a simulation to contain fluid ions and electrons as well as kinetic ions and electrons. Typically, it is too computationally intensive to model a full-scale ICF or HEDP experiment fully kinetically since many cycles are expended with very small time steps on modeling the fluid part of a material that is well treated by the fluid approximation. In this case, many traditional PIC particles can be replaced with a single fluid particle representing the thermal part of the distribution function, and there are fewer needed kinetic particles, which describe the non-thermal part and can be sub-cycled relative to the fluid particle advance. Furthermore, a pure fluid code may, depending on the problem, simply lack many physically important details that are beyond the scope of its reduced approximations and assumptions. In this report, we summarize the objectives achieved in the development of the collisional and kinetic half of the code, and the physics problems to which the code has been applied in the areas of advanced and innovative fusion concepts, pulsed power, and magneto-inertial fusion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Learning to Predict and Improve Build Successes in Package Ecosystems

Software has become increasingly complex, with a typical application depending on tens or hundreds of packages. Finding compatible versions and build configurations of these packages is challenging. This paper presents a method to learn the likelihood of software build success, and techniques for leveraging this information to guide dependency solvers to better software configurations. We leverage the heavily parameterized package recipes from the Spack package manager to produce a training data set of builds, and we use Graph Neural Networks to learn whether a given package configuration will build successfully or not. We apply our tool to the U.S. Exascale Computing Project’s software stack. We demonstrate its effectiveness in predicting whether a given package will build successfully. We show that our technique can be used to improve the solutions generated by dependency solvers, reducing the need for developers to find working builds by trial and error.

97 MATHEMATICS AND COMPUTING↗