Search NASA⌕ Search

SEARCH · Search NASA

Results for “Task complexity”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Group Structure Machine Learning Proposal

Nuclear data is the linchpin underwriting several fundamental capabilities and mission needs at LANL. New techniques such as machine learning can be brought to bear to solve old problems such as multigroup cross-section accuracy. In neutron transport, generating multigroup cross sections is a complex and arcane task, but a crucial one, as accurate solutions require appropriate cross sections. There are two key challenges when generating multigroup cross sections: (1) choosing an accurate weight function, and (2) choosing appropriate energy boundaries. Often, energy boundaries are chosen using “expert judgment” that is not documented and is difficult to replicate. The long-standing Los Alamos 30-group structure has been in use since at least 1969 and is still in use today. Simplistic attempts over the years since to improve on the 30-group structure have been met with limited success. Machine learning algorithms would enable the selection of appropriate, problem-dependent group boundaries without an inordinate investment of scientist time. We will develop workflows and tools to enable these improved group boundary choices, which will reduce uncertainty and increase predictive capability of neutron-transport applications at LANL.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Automatic Detection of Defects in High-Reliability Components

Disastrous consequences can result from defects in manufactured parts—particularly the high consequence parts developed at Sandia. Identifying flaws in as-built parts can be done with nondestructive means, such as X-ray Computed Tomography (CT). However, due to artifacts and complex imagery, the task of analyzing the CT images falls to humans. Human analysis is inherently unreproducible, unscalable, and can easily miss subtle flaws. We hypothesized that deep learning methods could improve defect identification, increase the number of parts that can effectively be analyzed, and do it in a reproducible manner. We pursued two methods: 1) generating a defect-free version of a scan and looking for differences (PandaNet), and 2) using pre-trained models to develop a statistical model of normality (Feature-based Anomaly Detection System: FADS). Both PandaNet and FADS provide good results, are scalable, and can identify anomalies in imagery. In particular, FADS enables zero-shot (training-free) identification of defects for minimal computational cost and expert time. It significantly outperforms prior approaches in computational cost while achieving comparable results. FADS’ core concept has also shown utility beyond anomaly detection by providing feature extraction for downstream tasks.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Unlocking Autonomous Telescopes through Reinforcement Learning: An Offline Framework and Insights from a Case Study

Optimizing observational astronomy campaigns is becoming a complex and expensive task for next-generation telescopes, where manual planning of observations may tend to reach suboptimal results in terms of optimization.Reinforcement Learning (RL) has been well-demonstrated as a valuable approach for training autonomous systems, and it may provide the basis for self-driving telescopes capable of scanning the sky and optimizing the scheduling for astronomy campaigns.We have developed a framework for the optimization of telescope scheduling using RL techniques, based on a dataset containing data on a discrete set of sky locations that the telescope should visit, and a reward metric. We compared several RL algorithms applied to an offline simulation dataset based at the Stone Edge Observatory, considering a discrete set of sky locations to visit and using “t-effective” as a reward metric, a measure of the quality of the data.Deep Q-Networks (DQNs), belonging to the class of value-based methods, have shown remarkable success in the optimization of astronomical observations in our dataset. In the full environment, the average reward value in each state was found to be 92%±5% of the maximum possible reward, while on the test set it resulted in 87%±9% of the maximum possible reward.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Nanoporous Materials Genome Center Final Technical Report

Nanoporous materials (NPMs), including zeolites/zeotypes, metal-organic frameworks (MOFs), covalent organic frameworks, polymers with intrinsic microporosity, and molecular cages, possess enormous potential in diverse areas relevant to the DOE Office of Science Basic Energy Sciences (BES) mission and objectives. The Nanoporous Materials Genome Center (NMGC) has developed exascale-ready software, computational/theoretical chemistry methods, and data-driven science approaches that enable (i) the de-novo design of functional NPMs for chemical separation and catalysis tasks of increasing complexity, (ii) the discovery of the most promising functional NPMs from databases of synthesized and hypothetical adsorbent structures and the optimization of process conditions for specific applications, and (iii) the microscopic-level understanding of the fundamental interactions underlying the function of NPMs including hierarchical architectures, composite materials, responsive frameworks that may undergo phase transitions or post-synthetic modifications, and materials containing defects, partial disorder, or interfaces. A pivotal part of the NMGC project has been a tight collaboration between leading experimental groups for synthesis and characterization of NPMs and of computational groups that allowed for iterative feedback. The NMGC project has resulted in the publication of more than 290 research and review articles including more than 60 publications in high-impact journals and more than 15 journal covers. NMGC publications have already received more than 20,000 citations (with more than 3,000 citations per year in 2021, 2022, and 2023) and contribute to an h-index of more than 72. The NMGC award has supported collaborative research involving 28 research groups and contributed to the training of more than 40 postdocs, more than 60 graduate students, and more than 20 undergraduate students with broad expertise in data-driven science approaches, computational chemistry methods, and high-performance computing, in addition to the skills to thrive in an integrated experimental and computational research environment.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

An Approach to Shared Research Systems

World-leading research requires state-of-the-art systems for research and innovation. Operational excellence is the key component of scientific excellence by implementing ubiquitous security, repeatable processes, streamlined policies, and reliable and robust infrastructure. Building a research environment to meet these needs is a complex and expensive task. In many cases, it can be financially advantageous for one or more programs, projects, and/or stakeholder(s) to pool resources to build a shared research system to meet common goals. However, such a system brings some unique challenges that need to be addressed. This document describes the process to mitigate these challenges by documenting how the interested parties contribute to the overall success of the system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale k-mer Analysis

Traditional filter data structures, such as Bloom filters, do not offer necessary features that modern high-performance data analytics applications need in order to efficiently perform complex data analysis tasks. For example, MetaHipMer, a de novo metagenome assembler, can use filters to weed out singleton k-mers and reduce memory usage by 30%-70%. However, the filter needs the ability to associate values with k-mers in order to perform the analysis in a single communication pass. Bloom filters do not support value associations and cause the application to perform an extra communication pass, thereby increasing the run time. Therefore, MetaHipMer faces a trade off between memory and speed due to the limited capabilities of traditional filters. In this paper, we overcome the memory and speed trade off in MetaHipMer by integrating a GPU-based feature-rich filter, the Two-Choice filter (TCF), in the MetaHipMer pipeline. The TCF uses key-value association to approximately store k-mers with extensions. This allows MetaHipMer to perform k-mer analysis on the GPUs in a single communication pass. Our empirical analysis shows a 50% reduction in memory usage in k-mer analysis on each node in MetaHipMer without any effect on the overall run time or assembly quality. The memory reduction in turn results in a 43% reduction in the number of nodes required to assemble datasets and enables MetaHipMer to scale to much larger datasets.

McCoy, Hunter↗
DOE OSTI2025

Demystifying the Resilience of Large Language Models: An End-to-End Perspective

Deep neural networks are known to be resilient to random bit-wise faults in their parameters. However, this resilience has primarily been established through evaluations of classification models. The extent to which this claim holds for large-language models remains underexplored. In this work, we conduct an extensive measurement study on the impact of random bitwise faults in commercial-scale language models. We perform an in-depth analysis of the resulting generation outputs. We first expose that these language models are not truly resilient to random bit-flips. While aggregate metrics such as accuracy may suggest resilience, an in-depth inspection of the generated outputs shows significant degradation in text quality. Our analysis also shows that tasks requiring more complex reasoning suffer more from performance and quality degradation. Moreover, we extend our analysis to models with augmented reasoning capabilities, such as Chain-of-Thought or Mixture of Experts architectures, and characterize their failure scenarios under random bit-flips.

Sun, Yu↗
DOE OSTI2023

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

SECARB-USA: Needs Assessment Framework for Storage Complexes

The goal of this task is to develop an assessment to identify data needed to advance geologic storage projects, with a focus on the SECARB region. The GCCC team considers the needs of CO2 source, storage, and utilization operators and stakeholders, finance and insurance institutions, state and local government relators and agencies, property owners, local stakeholders at prospective storage complexes, and environmental non-governmental organizations (NGOs). Many of these needs are spelled out in the requirements of the Class VI permit. However, at the initial stages of project development, the workflow will not start with permit writing. A number of other factors must be evaluated prior to this major investment. The team’s goal in this report is to inventory the range of typical needs for a wide variety of projects. For subsequent tasks, the team will consider how these needs vary among projects and through the stages of investment, so that project developers can plan the early stages of capitalization.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Pore-scale simulation of gas flow in microscopic permeable media with complex geometries

Lattice Boltzmann method (LBM) is an efficient tool to perform direct numerical simulation of gas flow in micro-size pores. Despite great advances in LBM and its use in describing gas flow in micro-size channels in slip and transitional flow regimes, exploring formulations that are able to capture flow behavior in domains with complex boundary geometries remains a challenging task. As a result, the impact of complexities in pore structures on gas flow may not be fully explored using LBM. In this study, we propose to use the combined bounce-back and Maxwellian diffusive reflection scheme to capture the slip velocity with a new set of slip coefficients. Optimal values of slip coefficients are determined using a gradient based method, where the results from the linearized Boltzmann equation is used as the reference solution. The proposed formulation is further validated against predictions from molecular dynamics simulation in the presence of complex geometries by introducing obstacles of different shapes in straight channels. LBM with the proposed boundary treatment is then used to investigate gas flow in a synthetic microscopic permeable medium. Here, results indicate that gas exhibits different flow configurations as Knudsen number varies, and apparent gas permeability appears to have up to a second-order dependency on the reciprocal mean pressure in slip and transitional flow regimes.

03 NATURAL GAS↗
DOE OSTI2026

Generative large language models for predictive maintenance planning

Maintenance planning and the generation of necessary components for tasks can prove time-consuming and complex. Automating the creation of recurring or similar tasks by leveraging previous planning packages and data, while uncovering insights to automate planning package generation, presents an opportunity to conserve valuable time and resources. This work aims to harness the textual and probabilistic capabilities of large language models (LLMs) to automate the generation of planning packages. Utilizing diverse data sources ranging from raw data to handwritten text, both singular and collaborative LLMs are trained and tested. Results demonstrate their capability to generate essential planning package components, effectively replicating the statistical patterns in the data. This demonstrates the use of these tools inside a digital asset for automated planning. This work outlines a methodology for constructing datasets, a training suite, and evaluation methods for LLM-based textual and conversational planning tools utilized in an asset digital twin. Results indicate that the fine-tuned models generate estimated planning information within the statistical ranges observed in real maintenance data. The models achieve high accuracy (>90%) in document question-answering and instruction generation tasks. Furthermore, the conversational retrieval-augmented generation (RAG) assistant system achieves 100% document retrieval accuracy, while conversational information capture exceeds 98% across the majority of work-package assistant modules.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

El Agente: An autonomous agent for quantum chemistry

Computational chemistry tools are widely used to study the behavior of chemical phenomena. Yet, the complexity of these tools can make them inaccessible to non-specialists and challenging even for experts. In this work, we introduce El Agente Q, an LLM-based multi-agent system that dynamically generates and executes quantum chemistry workflows from natural language user prompts. The system is built on a novel cognitive architecture featuring a hierarchical memory framework that enables flexible task decomposition, adaptive tool selection, post-analysis, and autonomous file handling and submission. El Agente Q is benchmarked on six university-level course exercises and two case studies, demonstrating robust problem-solving performance (averaging >87% task success) and adaptive error handling through in situ debugging. It also supports longer-term, multi-step task execution for more complex workflows, while maintaining transparency through detailed action trace logs. Together, these capabilities lay the foundation for increasingly autonomous and accessible quantum chemistry.

agentic systems↗
DOE OSTI2024

Decode the Workload: Training Deep Learning Models for Efficient Compute Cluster Representation

Monitoring the status of a high throughput computing cluster running computationally intensive production jobs is a crucial yet challenging system administration task due to the complexity of such systems. To this end, we train autoencoders using the Linux kernel CPU metrics of the cluster. Additionally, we explore assisting these models with graph neural networks to share information across threads within a compute node. The models are compared in terms of their ability to: 1) Produce a compressed latent representation that captures the salient features of the input, 2) Detect anomalous activity, and 3) Make distinction between different kinds of jobs run at Jefferson Lab. The goal is to have a robust encoder whose compressed embeddings are used for several downstream tasks. We extend this study further by deploying these models in a human-in-the-loop production-based setting for the anomaly detection task and discuss the associated implementation aspects such as continual learning and the criterion to generate alarms. This study represents a first step in the endeavor towards building self-supervised large-scale foundation models for computing centers.

Mohammed, Ahmed↗
DOE OSTI2022

Results of Storage Complex Readiness Evaluation

In this report, the results from Task 4.2.1 and 2.1.b are used to evaluate storage complex readiness. In this subtask we compare the results of the traditional formation-by-formation storage assessment to a new method designed to consider all the potential storage resource. This work has been in part coordinated with a study funded as part of the Lawrence Livermore National Laboratory led “Road to Removal” study. This overview is a at national scale and places the SECARB region in that context.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Synaptic Functionality and Neuromorphic Information Processing in Membrane Ion Channel Junctions

The human brain performs complex memory and computational tasks with high energy efficiency by regulating ion transport through membrane channels. These signaling mechanisms have been inspiring the development of nanofluidic memristors that emulate synaptic behavior. Here, in this study, we describe a membrane ion channel synapse (MICS), constructed from aqueous droplets linked by gramicidin A channels, that achieves neuromorphic functionality. MICS exhibits memristive ion transport with hysteretic current–voltage behavior arising from voltage-dependent channel formation and ion transport dynamics. MICS emulates a range of synaptic behaviors including associative learning. We further demonstrate its application in reservoir computing by performing handwritten digit classification and tic-tac-toe game and explore the system parameters that improve the computational performance. This droplet-based biomimetic synapse offers a potentially scalable and energy-efficient platform for next-generation neuromorphic computing systems.

Droplet interface bilayer↗
DOE OSTI2024

Interpretable Machine Learning Models for Practical Antimonate Electrocatalyst Performance

Computationally predicting the performance of catalysts under reaction conditions is a challenging task due to the complexity of catalytic surfaces and their evolution in situ, different reaction paths, and the presence of solid-liquid interfaces in the case of electrochemistry. We demonstrate here how relatively simple machine learning models can be found that enable prediction of experimentally observed onset potentials. Inputs to our model are comprised of data from the oxygen reduction reaction on non-precious transition-metal antimony oxide nanoparticulate catalysts with a combination of experimental conditions and computationally affordable bulk atomic and electronic structural descriptors from density functional theory simulations. From human-interpretable genetic programming models, we identify key experimental descriptors and key supplemental bulk electronic and atomic structural descriptors that govern trends in onset potentials for these oxides and deduce how these descriptors should be tuned to increase onset potentials. Here, we finally validate these machine learning predictions by experimentally confirming that scandium as a dopant in nickel antimony oxide leads to a desired onset potential increase. Macroscopic experimental factors are found to be crucially important descriptors to be considered for models of catalytic performance, highlighting the important role machine learning can play here even in the presence of small datasets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Privacy-Preserving Knowledge Transfer with Bootstrap Aggregation of Teacher Ensembles

There is a need to transfer knowledge among institutions and organizations to save effort in annotation and labeling or in enhancing task performance. However, knowledge transfer is difficult because of restrictions that are in place to ensure data security and privacy. Institutions are not allowed to exchange data or perform any activity that may expose personal information. With the leverage of a differential privacy algorithm in a high-performance computing environment, we propose a new training protocol, Bootstrap Aggregation of Teacher Ensembles (BATE), which is applicable to various types of machine learning models. The BATE algorithm is based on and provides enhancements to the PATE algorithm, maintaining competitive task performance scores on complex datasets with underrepresented class labels.We conducted a proof-of-the-concept study of the information extraction from cancer pathology report data from four cancer registries and performed comparisons between four scenarios: no collaboration, no privacy-preserving collaboration, the PATE algorithm, and the proposed BATE algorithm. The results showed that the BATE algorithm maintained competitive macro-averaged F1 scores, demonstrating that the suggested algorithm is an effective yet privacy-preserving method for machine learning and deep learning solutions.

Yoon, Hong-Jun↗
DOE OSTI2020

Intelligent multi-zone residential HVAC control strategy based on deep reinforcement learning

Residential heating, ventilation, and air conditioning (HVAC) has been considered as an important demand response resource. However, the optimization of residential HVAC control is no trivial task due to the complexity of the thermal dynamic models of buildings and uncertainty associated with both occupant-driven heat loads and weather forecasts. In this paper, we apply a novel model-free deep reinforcement learning (RL) method, known as the deep deterministic policy gradient (DDPG), to generate an optimal control strategy for a multi-zone residential HVAC system with the goal of minimizing energy consumption cost while maintaining the users’ comfort. Here, the applied deep RL-based method learns through continuous interaction with a simulated building environment and without referring to any prior model knowledge. Simulation results show that compared with the state-of-art deep Q network (DQN), the DDPG-based HVAC control strategy can reduce the energy consumption cost by 15% and reduce the comfort violation by 79%; and when compared with a rule-based HVAC control strategy, the comfort violation can be reduced by 98%. In addition, experiments with different building models and retail price models demonstrate that the well-trained DDPG-based HVAC control strategy has high generalization and adaptability to unseen environments, which indicates its practicability for real-world implementation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗