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.
Anti-PT symmetry; Comparison with PT-symmetric and Hermitian cases; Density Matrix: Time Dependent Dyson Map; Decoherence Function; von Neumann Entropy; Fisher Information; Spin Vector Representation; Conclusion
The Internet, much like our universe, is ever-expanding. Information, in the most varied formats, is continuously added to the point of information overload. Consequently, the ability to navigate this ocean of data is crucial in our day-to-day lives, with familiar tools such as search engines carving a path through this unknown. In the research world, articles on a myriad of topics with distinct complexity levels are published daily, requiring specialized tools to facilitate the access and assessment of the information within. Recent endeavors in artificial intelligence, and in natural language processing in particular, can be seen as potential solutions for breaking information overload and provide enhanced search mechanisms by means of advanced algorithms. As the advent of transformer-based language models contributed to a more comprehensive analysis of both text-encoded intents and true document semantic meaning, there is simultaneously a need for additional computational resources. Information retrieval methods can act as low-complexity, yet reliable, filters to feed heavier algorithms, thus reducing computational requirements substantially. In this work, a new search engine is proposed, addressing machine reading at scale in the context of scientific and academic research. It combines state-of-the-art algorithms for information retrieval and reading comprehension tasks to extract meaningful answers from a corpus of scientific documents. The solution is then tested on two current and relevant topics, cybersecurity and energy, proving that the system is able to perform under distinct knowledge domains while achieving competent performance.
There are pressing problems with traditional computing, especially for accomplishing data-intensive and real-time tasks, that motivate the development of in-memory computing devices to both store information and perform computation. Magnetic tunnel junction memory elements can be used for computation by manipulating a domain wall, a transition region between magnetic domains, but the experimental study of such devices has been limited by high current densities and low tunnel magnetoresistance. Here, we study prototypes of three-terminal domain wall-magnetic tunnel junction in-memory computing devices that can address data processing bottlenecks and resolve these challenges by using perpendicular magnetic anisotropy, spin–orbit torque switching, and an optimized lithography process to produce average device tunnel magnetoresistance TMR = 171% and average resistance-area product RA = 29 Ω μm2, close to the RA of the unpatterned film. Device initialization variation in switching voltage is shown to be curtailed to 7%–10% by controlling the domain wall initial position, which we show corresponds to 90%–96% accuracy in a domain wall-magnetic tunnel junction full adder simulation. Repeatability of writing and resetting the device is shown. A circuit shows an inverter operation between two devices, showing that a voltage window is large enough, compared to the variation noise, to repeatably operate a domain wall-magnetic tunnel junction circuit. These results make strides in using magnetic tunnel junctions and domain walls for in-memory and neuromorphic computing applications.
Abstract The growth of computing needs for artificial intelligence and machine learning is critically challenging data communications in today’s data-centre systems. Data movement, dominated by energy costs and limited ‘chip-escape’ bandwidth densities, is perhaps the singular factor determining the scalability of future systems. Using light to send information between compute nodes in such systems can dramatically increase the available bandwidth while simultaneously decreasing energy consumption. Through wavelength-division multiplexing with chip-based microresonator Kerr frequency combs, independent information channels can be encoded onto many distinct colours of light in the same optical fibre for massively parallel data transmission with low energy. Although previous high-bandwidth demonstrations have relied on benchtop equipment for filtering and modulating Kerr comb wavelength channels, data-centre interconnects require a compact on-chip form factor for these operations. Here we demonstrate a massively scalable chip-based silicon photonic data link using a Kerr comb source enabled by a new link architecture and experimentally show aggregate single-fibre data transmission of 512 Gb s −1 across 32 independent wavelength channels. The demonstrated architecture is fundamentally scalable to hundreds of wavelength channels, enabling massively parallel terabit-scale optical interconnects for future green hyperscale data centres.
Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.
This presentation discusses the MCNP6.3 release package and examines how it offers more MCNP6-specific executables and options available than ever before. It also discusses the installer and that it streamlines the MCNP6.3 installation and automatically downloads all production nuclear data and generates xsdir files for the user. Additionally, the nd_manager is also discussed regarding how it allows the LANL Nuclear Data and Monte Carlo teams to work and distribute their products independently. It also allows updates, fixes (errata), and newly released data to be made available in a much faster timescale than ever before.
We present the results from combining machine learning with the profile likelihood fit procedure, using data from the Large Underground Xenon (LUX) dark matter experiment. This approach demonstrates reduction in computation time by a factor of 30 when compared with the previous approach, without loss of performance on real data. We establish its flexibility to capture non-linear correlations between variables (such as smearing in light and charge signals due to position variation) by achieving equal performance using pulse areas with and without position-corrections applied. Its efficiency and scalability furthermore enables searching for dark matter using additional variables without significant computational burden. We demonstrate this by including a light signal pulse shape variable alongside more traditional inputs such as light and charge signal strengths. Furthermore, this technique can be exploited by future dark matter experiments to make use of additional information, reduce computational resources needed for signal searches and simulations, and make inclusion of physical nuisance parameters in fits tractable.
We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.
SAND2024-08570O Mnemosyne is an interactive tool for finding, retrieving, and exploring information about U.S. nuclear tests documented in the National Nuclear Security Administration’s NV-209 report. It also acts as an information architecture and codebase for integrating additional information and computational tools related to these tests at the unclassified and classified levels. Users can search by any number of nuclear test attributes—name, yield range, altitude ranges, purpose of a test—and find all matching tests. Users can also retrieve specific test information published in NV-209. The tool displays geospatial and topological data about test location, and it provides an information architecture for storing additional contextual material, such as photographs. Mnemosyne provides a capability of interfacing with HYCHEM, Sandia's nuclear detonation optical waveform tool. The software is designed for use by government, academia, military, and research institutions. The software will likely be advanced to integrate seismic data and the nuclear detonation optical signal simulation code radCTH. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
This presentation discusses the results of a MCNP user survey. Example of questions asked include: "Which MCNP particle types do you typically use?," "What sort of simulations do you run most often?," "Do you build the code?," "Which variance reduction methods do you use?," "Opinions on HDF5," with frequent discussions regarding each question.
This presentation discusses the past year and the many accomplishments of the MCNP6.3 team. It states that the MCNP6.3 release is imminent and that the approved, final documents have been making their way to the website. The code executables and source are already packaged up for distribution and the new installer is being finalized and tested now, for all platforms. The package will be sent to RSICC before the end of October 2022. Additionally, the presentation discusses some things to think about as MCNP6.3 is requested and/or used. For example, many of the recent efforts have been focused on making development, updates, and distribution of the code and documents more robust and streamlined. They will be revising/updating documents more frequently than ever before and they will be exploring avenues to distribute official patches to MCNP6.3. As they explain, this allows them to be more responsive to bugs and issues that are identified. In conclusion, the application of a patch to MCNP6.3 will require having the source code.
We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.
The current study provides a microstructurally-based computational framework to predict the fatigue life of additive manufactured (AM), i.e., powder bed fused–laser beam (PBF-LB), AlSi10Mg specimens using the crystal plasticity finite element method (CPFEM). The fractography analysis, electron backscatter diffraction (EBSD), uniaxial and cyclic responses, and fatigue life of specimens were used to inform the computational framework. CPFE simulation was used to compute fatigue indicator parameters (FIPs) as fatigue driving forces. A new fatigue criterion is introduced based on FIPs, which was calibrated using experimental fatigue data. The proposed fatigue measure was evaluated versus the specimens with critical defects of various sizes and locations subjected to different stress amplitudes. The results show that the developed framework can capture the fatigue life of samples with different critical defect locations and sizes along with different stress amplitudes for both high-cycle fatigue (HCF) and very high-cycle fatigue (VHCF) regimes.
Outline: Describe principle of magnetically-confined nuclear fusion; Explain the role of Poincaré maps in fusion reactor design; Describe a new method for rapidly computing Poincaré maps using physics-informed machine learning
Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.
Abstract For decades, Arctic temperatures have increased twice as fast as average global temperatures. As a first step toward quantifying parametric uncertainty in Arctic climate, we performed a variance‐based global sensitivity analysis (GSA) using a fully coupled, ultra‐low resolution (ULR) configuration of version 1 of the U.S. Department of Energy's Energy Exascale Earth System Model (E3SMv1). Specifically, we quantified the sensitivity of six quantities of interests (QOIs), which characterize changes in Arctic climate over a 75 year period, to uncertainties in nine model parameters spanning the sea ice, atmosphere, and ocean components of E3SMv1. Sensitivity indices for each QOI were computed with a Gaussian process emulator using 139 random realizations of the random parameters and fixed preindustrial forcing. Uncertainties in the atmospheric parameters in the Cloud Layers Unified by Binormals (CLUBB) scheme were found to have the most impact on sea ice status and the larger Arctic climate. Our results demonstrate the importance of conducting sensitivity analyses with fully coupled climate models. The ULR configuration makes such studies computationally feasible today due to its low computational cost. When advances in computational power and modeling algorithms enable the tractable use of higher‐resolution models, our results will provide a baseline that can quantify the impact of model resolution on the accuracy of sensitivity indices. Moreover, the confidence intervals provided by our study, which we used to quantify the impact of the number of model evaluations on the accuracy of sensitivity estimates, have the potential to inform the computational resources needed for future sensitivity studies.
The geothermal community is well established with long-standing events, organizations, and tools that are known across the geothermal community. But many of these tools and resources are located behind pay walls, require memberships, or are otherwise difficult to find, especially for people looking to join the geothermal community. These barriers to access can prevent outsiders from discovering valuable geothermal resources, limiting the geothermal community's potential for collaboration with other communities, such as clean energy entrepreneurs looking to expand into geothermal energy. The Department of Energy's (DOE) GeoBridge serves to bring these communities together by acting as a single, publicly accessible, searchable portal that facilitates easy access to available geothermal knowledge and information. It works to expand and diversify the pool of geothermal stakeholders by providing in-roads to geothermal information and community resources. It helps build a stronger geothermal community; one inclusive of individuals and groups from a variety of different backgrounds, including potential investors and start-up companies looking to accelerate innovation in geothermal technologies. By linking communities to geothermal information, analysis and expertise, GeoBridge serves as a launch point, directing interested parties to existing data and tools, events, educational resources, STEM programs, permitting and regulatory information, and other resources that can be used to evaluate, promote, and discover geothermal opportunities.
Airfoil shape design is a classical problem in engineering, science, and manufacturing. Our motivation is to combine principled physics-based considerations for the shape design problem with modern computational techniques informed by a data-driven approach. Traditional analyses of airfoil shapes emphasize a flow-based sensitivity to deformations which can be represented generally by affine transformations (rotation, scaling, shearing, shifting). We present a novel representation of shapes which decouples affine-style deformations from a rich set of data-driven deformations over a submanifold of the Grassmannian. The Grassmannian representation, informed by a database of physically relevant airfoils, offers (i) a rich set of novel 2D airfoil deformations not previously captured in the data, (ii) improved low-dimensional parameter domain for inferential statistics, and (iii) consistent 3D blade representation and perturbation over a sequence of nominal shapes.