Search NASA⌕ Search

SEARCH · Search NASA

Results for “computers”

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 217 records · Page 12

7th World Congress on Integrated Computational Materials Engineering (ICME 2023) (Final Technical Report)

Integrated Computational Materials Engineering (ICME) has received international attention due to its potential to shorten product development time, while lowering cost and improving design and manufacturing outcomes. ICME is an approach to designing materials solutions for specific applications that use computer modeling programs to predict the behavior of materials and integrate this information into the overall materials, processing, and manufacturing design cycle. The 7th World Congress on Integrated Computational Materials Engineering (ICME 2023) was held in Orlando, Florida from May 21–25, 2023 with the goal to convene stakeholders from across all areas of modeling and simulation, experimental specialization, and design, as well as from across academia, government, and industry, to address ICME tools and techniques and their integration, as well as to examine their application in engineering. This atmosphere facilitated rich interactions between the experimentalists, modelers, and computational and design, from academia, government, and industry, to discuss ICME tools and techniques and their application in engineering.

36 MATERIALS SCIENCE↗

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↗

Evaluation of fluxon synapse device based on superconducting loops for energy efficient neuromorphic computing

With Moore’s law nearing its end due to the physical scaling limitations of CMOS technology, alternative computing approaches have gained considerable attention as ways to improve computing performance. Here, we evaluate performance prospects of a new approach based on disordered superconducting loops with Josephson-junctions for energy efficient neuromorphic computing. Synaptic weights can be stored as internal trapped fluxon states of three superconducting loops connected with multiple Josephson-junctions (JJ) and modulated by input signals applied in the form of discrete fluxons (quantized flux) in a controlled manner. The stable trapped fluxon state directs the incoming flux through different pathways with the flow statistics representing different synaptic weights. We explore implementation of matrix–vector-multiplication (MVM) operations using arrays of these fluxon synapse devices. We investigate the energy efficiency of online-learning of MNIST dataset. Our results suggest that the fluxon synapse array can provide ~100× reduction in energy consumption compared to other state-of-the-art synaptic devices. This work presents a proof-of-concept that will pave the way for development of high-speed and highly energy efficient neuromorphic computing systems based on superconducting materials.

42 ENGINEERING↗

DUNE Software and Computing Research and Development

The international collaboration designing and constructing the Deep Underground Neutrino Experiment (DUNE) at the Long-Baseline Neutrino Facility (LBNF) has developed a two-phase strategy toward the implementation of this leading-edge, large-scale science project. The ambitious physics program of Phase I and Phase II of DUNE is dependent upon deployment and utilization of significant computing resources, and successful research and development of software (both infrastructure and algorithmic) in order to achieve these scientific goals. This submission discusses the computing resources projections, infrastructure support, and software development needed for DUNE during the coming decades as an input to the European Strategy for Particle Physics Update for 2026. The DUNE collaboration is submitting four main contributions to the 2026 Update of the European Strategy for Particle Physics process. This submission to the 'Computing' stream focuses on DUNE software and computing. Additional inputs related to the DUNE science program, DUNE detector technologies and R&D, and European contributions to Fermilab accelerator upgrades and facilities for the DUNE experiment, are also being submitted to other streams.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Mathematics Integrated with Computer Science through Scratch: Curricular Modules for the Middle Grades

A project funded by the National Science Foundation, Computer Science Integrated with Mathematics in Middle Schools (CSIMMS) (DRL-1640039), brought middle-school mathematics teachers together with university computer science (CS) faculty and STEM education faculty to design, develop, and test curriculum modules in which CS is integrated into instruction for middle-school general-mathematics courses. The project developed integrated math/CS curriculum modules (for grades 6, 7, and 8), complete with student tasks and teacher materials to guide classroom implementation. Across the project, sixteen teachers from four middle schools representing different school contexts (both urban and suburban, serving students from a range of demographic and socioeconomic backgrounds) participated as members of the design team and trial testers of the math/CS modules. All modules underwent multiple years of testing and refinement, with extensive input from the teachers who co-designed and implemented them. Approximately 50-100 middle-school students participated in the classes of those who taught each year. The modules in this volume feature a range of models for integrating mathematics and computer science at the 6th and 7th grade levels. All modules foreground the teaching of grade-level mathematics content, with computer science functioning to motivate and/or reinforce these ideas.

Andrews larson, Christine↗

Fusing Edge Computing with Transport Security by Leveraging the Controller Area Network Transport Security Tracking and Reporting (C-STAR) Unit

Rapid advances in embedded system complexity and capability provides exciting opportunities for transportation security deployment. Manufacturers and developers of these embedded systems continue to provide lower cost and more powerful solutions that can be leveraged by researchers and engineers. Furthermore, deploying these devices at the “edge” of the Internet-of-Things (IoT) infrastructure provides opportunities for highly capable applications in transport security. In an edge computation architecture, the device is co-located at the source of the data in the larger IoT structure – this provides computational capability at the location directly where the data is collected. For shipment transport security, this provides a direct compute node for digestion of data and mitigation actions in real-time. In our application, the vehicle provides a significant amount of this data that can be processed in real-time via the Controller Area Network Transport Security Tracking and Reporting (C-STAR) edge device. Utilization of a computational node located on the vehicle, such as the C-STAR, capitalizes on previously discussed opportunities of edge architectures. In this paper, we will discuss this security solution’s usability, current deployments, and scalability to further applications in transport security. First, we will cover the supported vehicle platforms that can leverage the C-STAR technology. This will be particularly relevant to medium- and heavy-duty vehicles transporting high-risk shipments. Second, we will speak to current deployments of the C-STAR that are ongoing. Finally, we will discuss additional areas for expansion such as maturing the onboard algorithms through continuing collaborations.

Cook, Adian [ORNL] (ORCID:0000000160825395)↗

A Quantum Computational Determination of the Weak Mixing Angle in the Standard Model

The weak mixing angle $s_W$ is a fundamental constant in the Standard Model (SM) and measured at the $Z$ boson mass to be $\widehat{s}^2_W(m_Z) = 0.23129 \pm 0.00004$ in the $\overline{\rm MS}$ renormalization scheme, where $m_Z=91.2\ \text{GeV}$. On the other hand, non-stabilizerness - the magic - characterizes the computational advantage of a quantum system over classical computers. We consider the production of magic from stabilizer initial states, which carry zero magic, in the 2-to-2 scattering of charged leptons in the SM at the tree level, which is mediated by the photon and the $Z$ boson. Using the second order stabilizer Rényi entropy, and averaging over all 60 initial stabilizer states and the scattering angle, we compute and minimize the magic production as a function of $s^2_W$ in the Møller scattering $e^-e^-\to e^-e^-$, which is free of kinematic thresholds. At the centre-of-mass energy $\sqrt{s}=m_Z$, there is a unique minimum in magic production at $\mathbf{s}^{2}_W(m_Z)=0.2317$, which agrees with the measured $\widehat{s}^2_W(m_Z)$ at the sub-percent level. At higher energies, the magic-minimizing $\mathbf{s}^{2}_W$ continues to agree with the empirical value at the percent level or better, up to 10 TeV. The finding suggests the electroweak sector of the SM tends to generate minimal quantum resources from the computational viewpoint.

Liu, Qiaofeng [Northwestern U.]↗

Agentic Diagrammatica: Towards Autonomous Symbolic Computation in High Energy Physics

We present Diagrammatica, a symbolic computation extension to the HEPTAPOD agentic framework, which enables LLM agents to plan and execute multi-step theoretical calculations. Symbolic computation poses a distinctive reliability challenge for LLM agents, as correctness is governed by implicit mathematical conventions that are not encoded in a form that can be easily checked in the computational backend. We identify two complementary remedies, tool-constrained computation and targeted knowledge grounding, and pursue the first as the primary architecture. Concretely, we concentrate the agent's action distribution onto tool calls with convention-fixing semantics, in which the agent specifies a compact, human-auditable diagram specification and a trusted backend performs the symbolic or numerical manipulations exactly. The toolkit provides two complementary calculation paths consuming a shared diagram specification: Naive Dimensional Analysis (NDA) for order-of-magnitude rate estimates and Exact Diagrammatic Analysis (EDA) for tree-level symbolic calculations via automatic FeynCalc code generation, both supplemented by automatic Feynman diagram enumeration and a navigable theory knowledge base. The architecture is validated on two benchmarks: (1) an exhaustive catalog of all tree-level, single-vertex $1\to 2$ partial decay widths across scalar, fermion, and vector parents, with complete massless and threshold limits and Standard Model validation; and (2) an NDA sensitivity study of the muon decay multiplicity $μ^+ \to ν_μ\barν_e + n(e^+e^-) + e^-$, determining the maximum observable $n$ at current and planned muon experiments.

Menzo, Tony [Alabama U.; Fermilab] (ORCID:00000002↗

A Quantum Computational Determination of the Weak Mixing Angle in the Standard Model

The weak mixing angle $s_W$ is a fundamental constant in the Standard Model (SM) and measured at the $Z$ boson mass to be $\widehat{s}^2_W(m_Z) = 0.23129 \pm 0.00004$ in the $\overline{\rm MS}$ renormalization scheme, where $m_Z=91.2\ \text{GeV}$. On the other hand, non-stabilizerness - the magic - characterizes the computational advantage of a quantum system over classical computers. We consider the production of magic from stabilizer initial states, which carry zero magic, in the 2-to-2 scattering of charged leptons in the SM at the tree level, which is mediated by the photon and the $Z$ boson. Using the second order stabilizer Rényi entropy, and averaging over all 60 initial stabilizer states and the scattering angle, we compute and minimize the magic production as a function of $s^2_W$ in the Møller scattering $e^-e^-\to e^-e^-$, which is free of kinematic thresholds. At the centre-of-mass energy $\sqrt{s}=m_Z$, there is a unique minimum in magic production at $\mathbf{s}^{2}_W(m_Z)=0.2317$, which agrees with the measured $\widehat{s}^2_W(m_Z)$ at the sub-percent level. At higher energies, the magic-minimizing $\mathbf{s}^{2}_W$ continues to agree with the empirical value at the percent level or better, up to 10 TeV. The finding suggests the electroweak sector of the SM tends to generate minimal quantum resources from the computational viewpoint.

Liu, Qiaofeng [Northwestern U.]↗

A Quantum Computational Determination of the Weak Mixing Angle in the Standard Model

The weak mixing angle $s_W$ is a fundamental constant in the Standard Model (SM) and measured at the $Z$ boson mass to be $\widehat{s}^2_W(m_Z) = 0.23129 \pm 0.00004$ in the $\overline{\rm MS}$ renormalization scheme, where $m_Z=91.2\ \text{GeV}$. On the other hand, non-stabilizerness - the magic - characterizes the computational advantage of a quantum system over classical computers. We consider the production of magic from stabilizer initial states, which carry zero magic, in the 2-to-2 scattering of charged leptons in the SM at the tree level, which is mediated by the photon and the $Z$ boson. Using the second order stabilizer Rényi entropy, and averaging over all 60 initial stabilizer states and the scattering angle, we compute and minimize the magic production as a function of $s^2_W$ in the Møller scattering $e^-e^-\to e^-e^-$, which is free of kinematic thresholds. At the centre-of-mass energy $\sqrt{s}=m_Z$, there is a unique minimum in magic production at $\mathbf{s}^{2}_W(m_Z)=0.2317$, which agrees with the measured $\widehat{s}^2_W(m_Z)$ at the sub-percent level. At higher energies, the magic-minimizing $\mathbf{s}^{2}_W$ continues to agree with the empirical value at the percent level or better, up to 10 TeV. The finding suggests the electroweak sector of the SM tends to generate minimal quantum resources from the computational viewpoint.

Liu, Qiaofeng [Northwestern U.]↗

Symbolic construction of the chemical Jacobian of quasi-steady state (QSS) chemistries for Exascale computing platforms

The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of chemical mechanisms for implementation in computational reacting flow solvers. However, for many applications, the resulting model still requires implicit methods for efficient time integration. Here, in this paper, we outline an approach to formulating the QSSA reduction that is coupled with a strategy to generate C++ source code to evaluate the net species production rates, and the chemical Jacobian. The code-generation component employs a symbolic approach enabling a simple and effective strategy to analytically compute the chemical Jacobian. For computational tractability, the symbolic approach needs to be paired with common subexpression elimination which can negatively affect memory usage. Several solutions are outlined and successfully tested on a 3D multipulse ignition problem, thus allowing portable application across chemical model sizes and GPU capabilities. The implementation of the proposed method is available at https://github.com/AMReX-Combustion/PelePhysics under an open-source license.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum computing universal thermalization dynamics in a (2 + 1)D Lattice Gauge Theory

Simulating non-equilibrium phenomena in strongly-interacting quantum many-body systems, including thermalization, is a promising application of near-term and future quantum computation. By performing experiments on a digital quantum computer consisting of fully-connected optically-controlled trapped ions, we study the role of entanglement in the thermalization dynamics of a Z 2 lattice gauge theory in 2+1 spacetime dimensions. Using randomized-measurement protocols, we efficiently learn a classical approximation of non-equilibrium states that yields the gap-ratio distribution and the spectral form factor of the entanglement Hamiltonian. These observables exhibit universal early-time signals for quantum chaos, a prerequisite for thermalization. Our work, therefore, establishes quantum computers as robust tools for studying universal features of thermalization in complex many-body systems, including in gauge theories.

97 MATHEMATICS AND COMPUTING↗

Computationally restoring the potency of a clinical antibody against Omicron

The COVID-19 pandemic underscored the promise of monoclonal antibody-based prophylactic and therapeutic drugs and revealed how quickly viral escape can curtail effective options. When the SARS-CoV-2 Omicron variant emerged in 2021, many antibody drug products lost potency, including Evusheld and its constituent, cilgavimab. Cilgavimab, like its progenitor COV2-2130, is a class 3 antibody that is compatible with other antibodies in combination4 and is challenging to replace with existing approaches. Rapidly modifying such high-value antibodies to restore efficacy against emerging variants is a compelling mitigation strategy. We sought to redesign and renew the efficacy of COV2-2130 against Omicron BA.1 and BA.1.1 strains while maintaining efficacy against the dominant Delta variant. Here we show that our computationally redesigned antibody, 2130-1-0114-112, achieves this objective, simultaneously increases neutralization potency against Delta and subsequent variants of concern, and provides protection in vivo against the strains tested: WA1/2020, BA.1.1 and BA.5. Deep mutational scanning of tens of thousands of pseudovirus variants reveals that 2130-1-0114-112 improves broad potency without increasing escape liabilities. Our results suggest that computational approaches can optimize an antibody to target multiple escape variants, while simultaneously enriching potency. Our computational approach does not require experimental iterations or pre-existing binding data, thus enabling rapid response strategies to address escape variants or lessen escape vulnerabilities.

60 APPLIED LIFE SCIENCES↗

Co-Active Subspace Methods for the Joint Analysis of Adjacent Computer Models

Active subspace (AS) methods are a valuable tool for understanding the relationship between the inputs and outputs of a Physics simulation. In this article, an elegant generalization of the traditional ASM is developed to assess the co-activity of two computer models. This generalization, which we refer to as a Co-Active Subspace (Co-AS) Method, allows for the joint analysis of two or more computer models allowing for thorough exploration of the alignment (or non-alignment) of the respective gradient spaces. We define co-active directions, co-sensitivity indices, and a scalar “concordance” metric (and complementary “discordance” pseudo-metric) and we demonstrate that these are powerful tools for understanding the behavior of a class of computer models, especially when used to supplement traditional AS analysis. Details for efficient estimation of the Co-AS and an accompanying R package (concordance) are provided. Practical application is demonstrated through analyzing a set of simulated rate stick experiments for PBX 9501, a high explosive, offering insights into complex model dynamics.

97 MATHEMATICS AND COMPUTING↗

Analysis and Benchmarking of feature reduction for classification under computational constraints

Abstract Machine learning is most often expensive in terms of computational and memory costs due to training with large volumes of data. Current computational limitations of many computing systems motivate us to investigate practical approaches, such as feature selection and reduction, to reduce the time and memory costs while not sacrificing the accuracy of classification algorithms. In this work, we carefully review, analyze, and identify the feature reduction methods that have low costs/overheads in terms of time and memory. Then, we evaluate the identified reduction methods in terms of their impact on the accuracy, precision, time, and memory costs of traditional classification algorithms. Specifically, we focus on the least resource intensive feature reduction methods that are available in Scikit-Learn library. Since our goal is to identify the best performing low-cost reduction methods, we do not consider complex expensive reduction algorithms in this study. In our evaluation, we find that at quadratic-scale feature reduction, the classification algorithms achieve the best trade-off among competitive performance metrics. Results show that the overall training times are reduced 61%, the model sizes are reduced 6×, and accuracy scores increase 25% compared to the baselines on average with quadratic scale reduction.

97 MATHEMATICS AND COMPUTING↗

Enhancing quantum utility: Simulating large-scale quantum spin chains on superconducting quantum computers

We present the quantum simulation of the frustrated quantum spin- 1 2 antiferromagnetic Heisenberg spin chain with competing nearest-neighbor ( J 1 ) and next-nearest-neighbor ( J 2 ) exchange interactions in the real superconducting quantum computer with qubits ranging up to 100. In particular, we implement the Hamiltonian with the next-nearest neighbor exchange interaction in conjunction with the nearest-neighbor interaction on IBM's superconducting quantum computer and carry out the time evolution of the spin chain by employing the first-order Trotterization. Furthermore, our implementation of the second-order Trotterization for the isotropic Heisenberg spin chain, involving only nearest-neighbor exchange interaction, enables precise measurement of the expectation values of staggered magnetization observable across a range of up to 100 qubits. Notably, in both cases, our approach results in a constant circuit depth in each Trotter step, independent of the number of qubits. Our demonstration of the accurate measurement of expectation values for the large-scale quantum system using superconducting quantum computers designates the quantum utility of these devices for investigating various properties of many-body quantum systems. This will be a stepping stone to achieving the quantum advantage over classical ones in simulating quantum systems before the fault tolerance quantum era. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Report of the 2025 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science

This report summarizes insights from the 2025 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science, which convened more than 40 experts from national laboratories, academia, industry, and community organizations to chart a path toward more powerful, sustainable, and collaborative scientific software ecosystems. To address urgent challenges at the intersection of high-performance computing (HPC), AI, and scientific software, participants envisioned agile, robust ecosystems built through socio-technical co-design—the intentional integration of social and technical components as interdependent parts of a unified strategy. This approach combines advances in AI, HPC, and software with new models for cross-disciplinary collaboration, training, and workforce development. Key recommendations include building modular, trustworthy AI-enabled scientific software systems; enabling scientific teams to integrate AI systems into their workflows while preserving human creativity, trust, and scientific rigor; and creating innovative training pipelines that keep pace with rapid technological change. Pilot projects were identified as near-term catalysts, with initial priorities focused on hybrid AI/HPC infrastructure, cross-disciplinary collaboration and pedagogy, responsible AI guidelines, and prototyping of public-private partnerships. This report presents a vision of next-generation ecosystems for scientific computing where AI, software, hardware, and human expertise are interwoven to drive discovery, expand access, strengthen the workforce, and accelerate scientific progress.

97 MATHEMATICS AND COMPUTING↗

Deployment and Evaluation of SciStream on OLCF's Advanced Computing Ecosystem (ACE)

The growing demand for real-time analysis, experimental steering, and decision-making in scientific workflows has created a need for tightly coupled integrations between experimental facilities and high-performance computing (HPC) systems. The Department of Energy’s Integrated Research Infrastructure (IRI) initiative highlights data streaming as a key capability for enabling memory-to-memory data transfers, bypassing the limitations of traditional store-and-forward models. SciStream is a toolkit developed by researchers at Argonne National Laboratory (ANL) to support such streaming by addressing cross-domain security, delegated authentication, and application transparency. We deployed and evaluated SciStream on the Oak Ridge Leadership Computing Facility’s (OLCF) Advanced Computing Ecosystem (ACE) infrastructure, leveraging the Olivine OpenShift cluster and its high-bandwidth Data Streaming Nodes (DSNs) as gateway nodes. Our evaluation included synthetic streaming workloads derived from IRI science workflows, a streaming simulator, and integration with RabbitMQ to handle low-level messaging. This report documents the deployment process, performance evaluation, and challenges encountered, along with opportunities for future improvements.

97 MATHEMATICS AND COMPUTING↗