SEARCH · Search NASA

Results for “space exploration proposals”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2026

IOTA experiment for proton pulse compression at extreme space-charge

The longitudinal compression of intense proton bunches with strong space-charge force is an essential component of a proton driver for a muon collider. We propose a proton bunch compression experiment at the Integrable Optics Test Accelerator (IOTA) storage ring at Fermilab to explore optimal radio frequency (RF) cavity and lattice configurations. IOTA is a compact fixed-energy storage ring dedicated to beam physics R&D that can circulate a 2.5-MeV proton beam with extreme space-charge. Using ImpactX and its 3D space-charge solver, simulations indicate that bunch length can be rapidly reduced by a factor of at least two, without appreciable degradation in transverse beam quality, even under strong space-charge conditions. However, longitudinal defocusing presents a large effect in short-pulsed proton beams, and the optimization of bunch compression under such conditions is discussed.

Simons, Benjamin [Northern Illinois U.; Fermilab]↗

DOE OSTI2026

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Bayesian optimization with active learning of design constraints using an entropy-based approach

Abstract The design of alloys for use in gas turbine engine blades is a complex task that involves balancing multiple objectives and constraints. Candidate alloys must be ductile at room temperature and retain their yield strength at high temperatures, as well as possess low density, high thermal conductivity, narrow solidification range, high solidus temperature, and a small linear thermal expansion coefficient. Traditional Integrated Computational Materials Engineering (ICME) methods are not sufficient for exploring combinatorially-vast alloy design spaces, optimizing for multiple objectives, nor ensuring that multiple constraints are met. In this work, we propose an approach for solving a constrained multi-objective materials design problem over a large composition space, specifically focusing on the Mo-Nb-Ti-V-W system as a representative Multi-Principal Element Alloy (MPEA) for potential use in next-generation gas turbine blades. Our approach is able to learn and adapt to unknown constraints in the design space, making decisions about the best course of action at each stage of the process. As a result, we identify 21 Pareto-optimal alloys that satisfy all constraints. Our proposed framework is significantly more efficient and faster than a brute force approach.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Decoding the Broadband Emission of 2D Pb-Sn Halide Perovskites through High-Throughput Exploration

Unlike single-component 2D metal halide perovskites (MHPs) exhibiting sharp excitonic photoluminescence (PL), a broadband PL emerges in mixed Pb-Sn 2D lattices. Two physical models –self-trapped exciton and defect-induced Stokes-shift – are proposed to explain this unconventional phenomenon. However, the explanations provide limited rationalizations without consideration of the formidable compositional space, and thus, the fundamental origin of broadband PL remains elusive. Herein, the high-throughput automated experimental workflow is established to systematically explore the broadband PL in mixed Pb-Sn 2D MHPs, employing PEA (Phenethylammonium) as a model cation known to work as a rigid organic spacer. Spectrally, the broadband PL becomes further broadened with rapid PEA 2 PbI 4 phase segregation with increasing Pb concentrations during early-stage crystallization. Counterintuitively, MHPs with high Pb concentrations exhibit prolonged PL lifetimes. Hyperspectral microscopy identifies substantial PEA 2 PbI 4 phase segregation in those films, hypothesizing that the establishment of charge transfer excitons by the phase segregation upon crystallization at high-Pb compositions results in distinctive PL properties. In conclusion, these results indicate that two independent mechanisms—defect-induced Stoke-shifts and the establishment of charge transfer excitons by phase segregation—coexist which significantly correlates with the Pb:Sn ratio, thereby simultaneously contributing to the broadband PL emission in 2D mixed Pb-Sn HPs.

2D Pb-Sn halide perovskites↗

DOE OSTI2020

Chemistry on Quantum Computers with Virtual Quantum Subspace Expansion

Several novel methods for performing calculations relevant to quantum chemistry on quantum computers have been proposed but not yet explored experimentally. Virtual quantum subspace expansion is one such algorithm developed for modeling complex molecules using their full orbital space and without the need for additional quantum resources. Here, we implement this method on the IBM Q platform and calculate the potential energy curves of the hydrogen and lithium dimers using only two qubits and simple classical post-processing. A comparable level of accuracy would require twenty qubits with previous approaches. We also develop an approach to minimize the impact of experimental noise on the stability of a generalized eigenvalue problem that is a crucial component of the algorithm. Our results demonstrate that virtual quantum subspace expansion works well in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

A Proposed Forward Silicon Tracker for the Future Electron-Ion Collider and Associated Physics Studies

The future Electron-Ion Collider (EIC) will explore several fundamental questions in a broad Bjorken-x (x BJ ) and Q 2 phase space. Heavy flavor and jet products are ideal probes to precisely study the tomography of nucleon/nuclei structure, help solve the proton spin puzzle and understand the hadronizaton processes in vacuum or in the QCD medium. Due to the asymmetric collisions at the EIC, most of the final state hadrons are produced in the nucleon/nuclei beam going (forward) direction. A silicon vertex/tracking is critical to precisely measure these forward hadrons at the EIC. Details of different conceptual designs of the proposed Forward Silicon Tracker (FST) and the relevant detector performance are presented in this technical note. The associated heavy flavor and jet studies with the evaluated FST performance are discussed as well.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Using Electrochemistry to Benchmark, Understand, and Develop Noble Metal Nanoparticle Syntheses

The complex chemical nature of metal nanoparticle synthesis presents obstacles for the mechanistic understanding of nanoparticle growth and predictive synthesis design, despite significant progress in this area. Real-time characterization of the chemical processes that take place throughout nanoparticle growth will enable progress toward addressing outstanding challenges in metal nanoparticle synthesis, such as mitigating synthetic reproducibility issues, defining chemical mechanisms that direct nanoparticle growth, and designing synthetic conditions for previously unachievable combinations of nanoparticle shape and composition. In this Perspective, we present open-circuit potential (OCP) measurements as an in situ, real-time method for characterizing chemical changes during nanoparticle growth and discuss the method’s strengths in comparison to and in combination with other characterization techniques. We propose the use of OCP measurements as benchmarks for troubleshooting irreproducibility and streamlining synthetic optimization. Finally, we explore possibilities for using the increased parameter space accessible by electrodeposition to accelerate the development of shape-selective nanoparticle syntheses.

benchmarking↗

DOE OSTI2026

FY27 Annual LDRD Call for Proposals - external release

Proposals are now being accepted for the fiscal year 2027 (FY-27) Laboratory Directed Research and Development (LDRD) call, the FY-27 Annual LDRD Call for Proposals. Idaho National Laboratory (INL) has renewed its research and development (R&D) portfolio to align with its strategy, and this call seeks high-quality proposals that address these renewed research priorities. The LDRD Office encourages proposals that offer the potential to achieve breakthroughs in the three science and technology (S&T) strategic initiatives: • Unleashing America’s Energy Abundance: Enabling the Quadrupling of Nuclear Power by 2050; • Securing America’s Future by Developing Domestic Supply Chains for Critical and Strategic Minerals and Materials (CSMM); and • Delivering Critical National Security Technology. Proposals that support INL’s four strategic thrust areas are also encouraged: • Enabling Future Fusion Energy Systems; • Delivering Small Nuclear Reactor Technology for Space Exploration and Defense Missions; • Accelerating Technologies for Hybrid Energy and Nuclear Applications; and • Securing America’s Energy Future Through Artificial Intelligence (AI).

99 - GENERAL AND MISCELLANEOUS↗

DOE OSTI2025

Stripline Block Sensor System

The Long Baseline Neutrino Facility requires a secondary sensor system to aid in the installation and replacement of the stripline blocks. These blocks are responsible for delivering large amounts of current to the horn and must be installed with high precision to avoid possible physical damage. There are many constraints due to the modules' surroundings, such as small clearances and a highly radioactive environment. Existing systems have already been implemented within the process; however, these systems offer limited information, leaving much risk during operations. This calls for a sufficiently accurate sensor system, which has a small space requirement and provides valuable information throughout the replacement period. A variety of methods and technologies were explored to provide an applicable approach to the issue. The proposed solution consisted of the use of retroreflective and target, however, it cannot provide positional feedback throughout the entire process. A proposed alternative utilizes a three-dimensional indoor positioning system to provide the operator with real-time positioning and rotational information. Sensors placed on the module and stripline would communicate with fixed receivers surrounding the target hall to provide precise positional feedback. However, this solution may still contain line-of-sight issues as well as installation complications due to the radioactive environment. Future work would consist of finding vendors capable of providing technology that fits our constraints, proof of concept tests for both solutions, implementation planning, and trials within the target hall itself. Due to its ability to provide continuous positional and rotational feedback, the indoor positioning system is the most suitable solution for accurately installing the stripline block.

Espinoza, David [Unlisted, US]↗

DOE OSTI2025

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2026

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗

DOE OSTI2022

Exploring the Use of Novel Spatial Accelerators in Scientific Applications

Driven by the need to find alternative accelerators which can viably replace GPUs in next-generation Supercomputing systems, this paper proposes a methodology to enable agile application/hardware co-design. The application-first methodology provides the ability to come up with design of accelerators while working with real-world workloads, available accelerators, and system software. The iterative design process targets a set of kernels in a workload for performance estimates that can prune the design space for later phases of detailed architectural evaluations. To this effect, in this paper, a novel data-parallel device model is introduced that simulates the latency of performance-sensitive operations in an accelerator including data transfers and kernel computation using multi-core CPUs. The use of off-the-shelf simulators, such as pre-RTL simulator Aladdin or multiple tools available for exploring the design of deep neural network accelerators (e.g., Timeloop) is demonstrated for evaluation of various accelerator designs using applications with realistic inputs. Examples of multiple device configurations that are instantiable in a system are explored to evaluate the performance benefit of deploying novel accelerators. The proposed device is integrated with a programming model and system software to potentially explore the impacts of high-level programming languages/compilers and low-level effects such as task scheduling on multiple accelerators. We analyze our methodology for a set of applications that represent high-performance computing (HPC) and graph analytics. The applications include a computational chemistry kernel realized using tensor contractions, triangle counting, GraphSAGE and Breadth-first Search. These applications include kernels such as dense matrix-dense matrix multiplication, sparse matrix-spare matrix multiplication, and sparse matrix-dense vector multiplication. Our results indicate potential performance benefits and insights for system design by including accelerators that realize these kernels along-side general purpose accelerators.

AI, codesign, Accelerated Computing, Modeling and ↗

DOE OSTI2022

Virtual Infrastructure Twins: Software Testing Platforms for Computing-Instrument Ecosystems

Science ecosystems are being built by federating computing systems and instruments located at geographically distributed sites over wide-area networks. These computing-instrument ecosystems are expected to support complex workflows that incorporate remote, automated AI-driven science experiments. Their realization, however, requires various designs to be explored and software components to be developed, in order to support the orchestration of distributed computations and experiments. It is often too expensive, infeasible, or disruptive for the entire ecosystem to be available during the typically long software development and testing periods. We propose a Virtual Infrastructure Twin (VIT) of the ecosystem that emulates its network and computing components, and incorporates its instrument software simulators. It provides a software environment nearly identical to the ecosystem to support early development and testing, and design space exploration. We present a brief overview of previous digital infrastructure twins that culminated in the VIT concept, including (i) the virtual science network environment for developing software-defined networking solutions, and (ii) the virtual federated science instrument environment for testing the federation software stack and remote instrument control software. We briefly describe VITs for Nion microscope steering and access to GPU systems.

Rao, Nageswara↗

DOE OSTI2023

Virtual Infrastructure Twins: Software Testing Platforms for Computing-Instrument Ecosystems

Rao, Nageswara↗

DOE OSTI2025

Explainable AI for Multivariate Time Series Pattern Exploration: Latent Space Visual Analytics With Temporal Fusion Transformer and Variational Autoencoders in Power Grid Event Diagnosis

Detecting and analyzing complex patterns in multivariate time-series data is crucial for decision-making in urban and environmental system operations. However, challenges arise from the high dimensionality, intricate complexity, and interconnected nature of complex patterns, which hinder the understanding of their underlying physical processes. Existing AI methods often face limitations in interpretability, computational efficiency, and scalability, reducing their applicability in real-world scenarios. This paper proposes a novel visual analytics framework that integrates two generative AI models, Temporal Fusion Transformer (TFT) and Variational Autoencoders (VAEs), to reduce complex patterns into lower-dimensional latent spaces and visualize them in 2D using dimensionality reduction techniques such as PCA, t-SNE, and UMAP with DBSCAN. These visualizations, presented through coordinated and interactive views and tailored glyphs, enable intuitive exploration of complex multivariate temporal patterns, identifying patterns’ similarities and uncover their potential correlations for a better interpretability of the AI outputs. The framework is demonstrated through a case study on power grid signal data, where it identifies multi-label grid event signatures, including faults and anomalies with diverse root causes. Additionally, novel metrics and visualizations are introduced to validate the models and assess the performance, efficiency, and consistency of latent maps generated by VAE, which have been utilized in prior studies for latent space cartography and used as a benchmark in this study, and the emerging TFT architecture under various configurations. These analyses provide actionable insights for model parameter tuning and reliability improvements. Comparative results highlight that TFT achieves shorter run times and superior scalability to diverse time-series data shapes compared to VAE. This work advances fault diagnosis in multivariate time series, fostering explainable AI to support critical system operations.

Explainable AI↗

DOE OSTI2021

3D-Scaffold: A Deep Learning Framework to Generate 3D Coordinates of Drug-like Molecules with Desired Scaffolds

The prerequisite of therapeutic drug design is to identify novel molecules with desired biophysical and biochemical properties. Deep generative models have demonstrated their ability to find such molecules by exploring a huge chemical space efficiently. An effective way to obtain molecules with desired target properties is the preservation of critical scaffolds in the generation process. To this end, we propose a domain aware generative framework called 3D-Scaffold that takes 3D coordinates of a desired scaffold as an input and generates 3D coordinates of novel therapeutic candidates as an output while always preserving the desired scaffolds in generated structures. We show that our framework generates predominantly valid, unique, novel, and experimentally synthesizable molecules that have drug-like properties similar to the molecules in the training set. Using domain specific datasets, we generate covalent and non-covalent antiviral inhibitors. Therefore, to measure the success of our framework in generating therapeutic candidates, generated structures were subjected to high throughput virtual screening via docking simulations, which shows favorable interaction against SARS-CoV-2 main protease and non-structural protein endoribonuclease (NSP15) targets. Most importantly, our model performs well with relatively small volumes of training data and generalizes to new scaffolds, making it applicable to other domain.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

SpecSims: A Scalable Speculative Tree-based Simulation Cloning Framework for Finite Memory Machines

Simulation cloning is a technique in which cloned simulations whose state spaces differ partially from their parent simulation due to intervening events are spawned at runtime and concurrently advanced. It is a powerful method to carry out what-if analysis by speculatively exploring and evaluating the impact of various permutations of intervening cascade of events. Due to the exponential growth in the number of possible clones even for a small number of distinct intervening events, the practical efficacy of the approach is often severely limited by the maximum available memory of the computing host. In this paper, we introduce a novel speculative simulation cloning framework that executes a simulation cloning campaign capable of efficiently exploring an exponentially large space of clone simulations created by permutation of intervening events under a finite memory constraint. We provide a theoretical analysis of the runtime characteristics of our proposed approach and highlight its novel advantages such as memory-aware and as-long-as-needed execution. Furthermore, in support of our analytical findings and to demonstrate its practical feasibility, we implement a prototype of the cloning framework on a shared memory system and report its performance characteristics in the context of a heat diffusion simulation, and a power grid simulation subject to cascading disruptions from geomagnetic disturbances.

Simulation framework↗

DOE OSTI2024

Semi-supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach

Modeling dynamical systems is crucial for a wide range of tasks, but it remains challenging due to complex nonlinear dynamics, limited observations, or lack of prior knowledge. Recently, data-driven approaches such as Neural Ordinary Differential Equations (NODE) have shown promising results by leveraging the expressive power of neural networks to model unknown dynamics. However, these approaches often suffer from limited labeled training data, leading to poor generalization and suboptimal predictions. On the other hand, semi-supervised algorithms can utilize abundant unlabeled data and have demonstrated good performance in classification and regression tasks. We propose TS-NODE, the first semi-supervised approach to modeling dynamical systems with NODE. TS-NODE explores cheaply generated synthetic pseudo rollouts to broaden exploration in the state space and to tackle the challenges brought by lack of ground-truth system data under a teacher-student model. TS-NODE employs an unified optimization framework that corrects the teacher model based on the student's feedback while mitigating the potential false system dynamics present in pseudo rollouts. TS-NODE demonstrates significant performance improvements over a baseline Neural ODE model on multiple dynamical system modeling tasks.

Wang, Yu↗