SEARCH · Engineering Papers
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.
Chapter 6 reviews the current status of resolving the phonon mean free path distribution in real materials from both the computational and experimental perspectives, which is essential for engineering materials at the nanoscale to achieve desirable thermal transport properties.
Real-time data processing is a frontier field in experimental particle physics. The application of FPGAs at the trigger level is used by many current and planned experiments (CMS, LHCb, Belle2, PANDA). Usually they use conventional processing algorithms. LHCb has implemented Machine Learning (ML) elements for real-time data processing with a triggered readout system that runs most of the ML algorithms on a computer farm. The work described in this article aims to test the ML-FPGA algorithms for streaming data acquisition. Herein, there are many experiments working in this area and they have a lot in common, but there are many specific solutions for detector and accelerator parameters that are worth exploring further. This report describes the purpose of the work and progress in evaluating the ML-FPGA application.
We describe our ongoing research in adaptive computing and multi-fidelity modeling strategies. Our goal is to use a combination of low- and high-fidelity simulation models to enable computationally efficient optimization and uncertainty quantification. We develop optimization formulations that take into account the compute resources currently available, which act as a constraint with regards to the fidelity level simulation we can run while maximizing information gain. These strategies are being implemented into a software framework with a generalized API allowing its application to a broad range of applications, from power grid stability and buildings control to material synthesis and biofuels processing. We will discuss a few examples from these applications that can benefit from this approach, especially when considering challenges arising in scaling up experiments and simulations.
Decoding visual experiences from fMRI offers a powerful avenue to understand human perception and develop advanced brain-computer interfaces. However, current progress often prioritizes maximizing reconstruction fidelity while overlooking interpretability, an essential aspect for deriving neuroscientific insight. To address this gap, we propose MoRE-Brain, a neuro-inspired framework designed for high-fidelity, adaptable, and interpretable visual reconstruction. MoRE-Brain uniquely employs a hierarchical Mixture-of-Experts architecture where distinct experts process fMRI signals from functionally related voxel groups, mimicking specialized brain networks. The experts are first trained to encode fMRI into the frozen CLIP space. A finetuned diffusion model then synthesizes images, guided by expert outputs through a novel dual-stage routing mechanism that dynamically weighs expert contributions across the diffusion process. MoRE-Brain offers three main advancements: First, it introduces a novel Mixture-of-Experts architecture grounded in brain network principles for neuro-decoding. Second, it achieves efficient cross-subject generalization by sharing core expert networks while adapting only subject-specific routers. Third, it provides enhanced mechanistic insight, as the explicit routing reveals precisely how different modeled brain regions shape the semantic and spatial attributes of the reconstructed image. Extensive experiments validate MoRE-Brain’s high reconstruction fidelity, with bottleneck analyses further demonstrating its effective utilization of fMRI signals, distinguishing genuine neural decoding from over-reliance on generative priors. Consequently, MoRE-Brain marks a substantial advance towards more generalizable and interpretable fMRI-based visual decoding.
International marine shipping is a growing component of international trade; a vast majority of all the world’s goods are being transported on large ocean-going vessels. The International Maritime Organization (IMO) introduced the Energy Efficiency Design Index in 2013, a regulatory framework of associated metrics for reducing emissions of CO 2 per tonne-mile from shipping by approximately 10% each decade. Therefore, decarbonizing the maritime sector requires the development of new fuel sources. Because of the extremely large physical size of the internal combustion engines present in shipping vessels, experimental iterative development of the engine and fuel system is cost-prohibitive. Thus, the ability to perform combustion system development in a scaled platform that can be more easily operated and modeled computationally is of interest. To that end, scaling relationships are needed to translate the results from a smaller engine to a larger counterpart. Scaling studies to date have been restricted to low scaling ratios, four-stroke light-duty engines, and under-resolved computational fluid dynamic simulations that likely do not accurately capture the physics of scaling. In this work, computational models of a 1:10 scale and a full-scale two-stroke crosshead low-speed marine engine were created and validated against experiments obtained in a real 1:10 scale engine installed at Oak Ridge National Laboratory. Further, due to the large size of the full-scale engine, the model required large high-performance computing resources to be evaluated. The availability of high-performance computing resources at the Department of Energy’s Leadership Computing Facilities is an enabler of the current work. The results of the small- and large-scale engine simulations were compared to analyze the effectiveness of the appropriate scaling laws under these extreme scaling ratio conditions.
BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the complexity-theoretic hardness arguments and current experiments. One of the largest gaps involves the ratio of {particles} to modes -- all current hardness evidence assumes a dilute regime in which the number of linear optical modes scales at least quadratically in the number of particles. By contrast, current experiments operate in a saturated regime with a linear number of modes. In this paper we bridge this gap, bringing the hardness evidence for experiments in the saturated regime to the same level as had been previously established for the dilute regime. This involves proving a new worst-to-average-case reduction for computing the Permanent which is robust to both large numbers of row repetitions and also to distributions over matrices with correlated entries. We also apply similar arguments to give evidence for hardness of Gaussian BosonSampling in the saturated regime.
We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.
This report will describe an improved computer code for two-photon opacity. The new code incorporates many recent advances and is ready to start to face the experiments. It incorporates the difficult mathematical techniques for handling free states and free-free matrix elements.
This presentation discusses the Verified, Archived Library of Inputs and Data (VALID) procedure which is managed per computational procedure under the overall SCALE quality assurance plan. The principle behind VALID is that two independent, qualified people prepare and review the model, while a dual, independent check acts as a primary barrier to prevent errors in the library. A final check by VALID QAC of procedural compliance is then performed. The future for VALID includes plans to add more experiments, a review for all ICSBEP cases containing Deuterium, ZEUS intermediate and fast spectrum evaluations, intermediate enrichment experiments, other cases of interest to sponsors, and mixed/intermediate spectrum experiments.
A predictive density tool has been developed in Python to reduce bias and uncertainty in nuclear criticality safety calculations for plutonium nitrate systems. The Pitzer Method and an empirical method were implemented into the tool, allowing for plutonium nitrate density calculations. Additionally, the Python tool can generate atom densities for a MCNP6.2 material card using the density from the selected method and directly the densities into a prepared MCNP6 input text file. The material card and density are calculated based on customizable user inputs of plutonium content, nitric acid content, temperature, plutonium isotope weight percentages and impurity concentrations. The Python tool has been validated and verified against the International Handbook of Evaluated Criticality Safety Benchmark Experiments to predict densities within a root mean square error of 1.0% for the Pitzer method and 1.8% for the empirical method. These errors in density were shown to lead to a ±0.5% error in MCNP6.2 calculated k effective for the Pitzer method and a ±1.7% error for the Empirical method. Simultaneous work is also being done at the University of New Mexico and Los Alamos National Laboratory to create a similar tool for plutonium chloride solutions, which aims to provide the accreditation of the chlorine absorption. These capabilities will not only provide more accurate models but also lead the way towards a better understanding of solution systems and potential relaxation in the conservatism of the current aqueous plutonium processing limits.
The File Transfer Service (FTS3) is a data movement service developed at CERN which is used to distribute the majority of the Large Hadron Collider's data across the Worldwide LHC Computing Grid (WLCG) infrastructure. At Fermilab, we have deployed a couple of FTS3 instances for Intensity Frontier experiments (e.g. DUNE) to transfer data in America and Europe, using a container-based strategy. During this talk, we are going to present the two different configurations currently running at Fermilab, comparing and contrasting a Docker-based OKD deployment against a traditional RPM-based deployment and giving an overview of the possible issues encountered. In addition, we discuss our method of certificate management and maintenance utilizing Kubernetes cronjobs.
This study presents scaled experiments using steam condensation with non-condensable gas (NCG)—helium, simulating hydrogen—as these experiments are pivotal for water-cooled reactor passive containment cooling system (PCCS) design and analysis. Research into PCCSs for small modular reactors (SMRs) is especially important in light of SMR system design; however, studies in the literature reflect limitations due to test geometry and operational condition variations, without considering SMR prototypic design. To address these challenges, a scaled test facility was developed to accurately replicate SMR PCCSs. This facility includes vertical down-flow condensing test sections with 1-, 2-, and 4-in.-diameter condensing tubes, accompanied by annular water cooling. Experiments were conducted using both superheated and saturated steam, with steam mass flow rates varying from 55 to 66 kg/hr., in the presence of helium as the NCG mass flow rate ranges from 1.8 to 22 kg/hr. Test data were collected on (a) the axial temperatures of the annular cooling water; (b) the outer wall temperature of the condensers; and (c) the mass flow rate, temperature, and pressure at the test section inlets and outlets. These primary test data were used in conjunction with a standard data reduction methodology to estimate essential thermal parameters such as heat fluxes, heat transfer coefficients, and condensation rates. The effects of NCGs on steam condensation within the geometry of the scaled test sections were then presented in regard to various testing conditions.
Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.
We present an extension of the [Takeda et al., J. Opt. Soc. Am. 72, 156 (1982)] phase extraction method to heterodyne photonic Doppler velocimetry applications. The method yields results equivalent to those obtained by the short-time Fourier transform (STFT), while offering potential improvements in time resolution. Unlike STFT, which relies on window functions, such as the Hamming window, that emphasize central data points and diminish the influence of edges, the extended Takeda method utilizes all data uniformly. This uniform treatment allows for the derivation of empirical equations that directly relate velocity error to the actual time resolution rather than to the local analysis duration. The established equation provides a useful metric for both optimizing hardware configuration and guiding data analysis. Simulation and experimental results confirm that, for a given dataset, specifying a target time resolution yields consistent velocity errors for both methods. These findings underscore the Takeda method’s advantages, particularly its potential higher time resolution and reduced computational burden, making it a valuable tool for high-throughput applications such as laser dynamic compression experiments.
Cortical neurons exhibit highly variable responses over trials and time. Theoretical works posit that this variability arises potentially from chaotic network dynamics of recurrently connected neurons. Here, we demonstrate that chaotic neural dynamics, formed through synaptic learning, allow networks to perform sensory cue integration in a sampling-based implementation. We show that the emergent chaotic dynamics provide neural substrates for generating samples not only of a static variable but also of a dynamical trajectory, where generic recurrent networks acquire these abilities with a biologically plausible learning rule through trial and error. Furthermore, the networks generalize their experience in the stimulus-evoked samples to the inference without partial or all sensory information, which suggests a computational role of spontaneous activity as a representation of the priors as well as a tractable biological computation for marginal distributions. These findings suggest that chaotic neural dynamics may serve for the brain function as a Bayesian generative model.
Abstract We present a simplified model of data flow on processors in a high-performance computing framework involving computations necessitating inter-processor communications. From this ordinary differential model, we take its asymptotic limit, resulting in a model which treats the computer as a continuum of processors and data flow as an Eulerian fluid governed by a conservation law. We derive a Hamilton–Jacobi equation associated with this conservation law for which the existence and uniqueness of solutions can be proven. We then present the results of numerical experiments for both discrete and continuum models; these show a qualitative agreement between the two and the effect of variations in the computing environment’s processing capabilities on the progress of the modelled computation.
Abstract All plasma facing surfaces in a fusion reactor, whether initially pure or an alloy, will rapidly evolve into a mixed material due to plasma-induced erosion, migration and redeposition. Beryllium (Be) erosion from the main chamber, and its transport and deposition on to a tungsten (W) divertor results in the growth of mixed Be-W layers, which can evolve to form beryllides. These Be-W mixed materials exhibit generally less desirable properties than pure tungsten or pure beryllium, such as lower melting points. In order to better understand the parameter space for growth of these alloys, this paper reviews the literature on Be-W mixed material formation experiments—in magnetically confined fusion reactors, in linear plasma test stands, and during thin-film deposition—and on computational modeling of Be-W interactions, as well as briefly assesses the Be-W growth kinetics. We conclude that the following kinetic steps drive the material mixing: adsorption of the implanted/deposited ion on the metal surface; diffusion of the implanted/deposited ion from surface into the bulk, which is accelerated by defects; and loss of deposited material through erosion. Adsorption dominates (or prevents) material mixing in thin-film deposition experiments, whereas diffusion drives material mixing in plasma exposures due to the energetic ion implantation.
All plasma facing surfaces in a fusion reactor, whether initially pure or an alloy, will rapidly evolve into a mixed material due to plasma-induced erosion, migration and redeposition. Beryllium (Be) erosion from the main chamber, and its transport and deposition on to a tungsten (W) divertor results in the growth of mixed Be-W layers, which can evolve to form beryllides. These Be-W mixed materials exhibit generally less desirable properties than pure tungsten or pure beryllium, such as lower melting points. In order to better understand the parameter space for growth of these alloys, this paper reviews the literature on Be-W mixed material formation experiments—in magnetically confined fusion reactors, in linear plasma test stands, and during thin-film deposition—and on computational modeling of Be-W interactions, as well as briefly assesses the Be-W growth kinetics. We conclude that the following kinetic steps drive the material mixing: adsorption of the implanted/deposited ion on the metal surface; diffusion of the implanted/deposited ion from surface into the bulk, which is accelerated by defects; and loss of deposited material through erosion. Adsorption dominates (or prevents) material mixing in thin-film deposition experiments, whereas diffusion drives material mixing in plasma exposures due to the energetic ion implantation.