Electronic and Steric Influences of Pendant Amine Groups on the Protonation of Molybdenum Bis(dinitrogen) Complexes
Explore the source record for details and available documents.
bio-inspired↗
SEARCH · Search NASA
Results for “Computer Science - Distributed”
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.
Scientific Discovery with Physics-Informed System Identification (Abbreviated Report)
My fellowship research focused on making physics-based simulations faster and more useful through machine learning. Many problems in science and engineering are governed by partial differential equations, but high-fidelity simulations are often too expensive to run repeatedly. I worked on improving Latent Space Dynamics Identification (LaSDI), a reduced-order modeling framework that compresses large simulation data sets into a smaller representation and then learns how that representation evolves over time. The motivation was to develop reduced models that remain accurate for more challenging systems, especially when predictions must remain reliable over long time intervals or when the underlying dynamics are more complicated than standard methods can easily handle. I also contributed to related work on Quandary, a high-performance software effort for simulation and control of open quantum systems, before focusing primarily on Latent Space Dynamics Identification methods. The main outcomes of the fellowship were two new algorithms (both of which were published), Rollout-LaSDI and Higher-Order LaSDI, together with supporting work on multi-stage Latent Space Dynamics Identification. Rollout-LaSDI improved long-term prediction by training the model to stay accurate over extended time horizons, and Higher-Order LaSDI broadened the method so it could model systems with higher-order time dynamics. My contributions to multistage Latent Space Dynamics Identification also helped show that its later training stages could be simplified without losing effectiveness, and that this behavior held across different model architectures and training strategies. Taken together, these advances improved the accuracy, flexibility, and practical value of reduced-order modeling tools for computational science.
97 MATHEMATICS AND COMPUTING↗
CASL Dakota Capabilities Summary
The Dakota software project serves the mission of Sandia National Laboratories and supports a worldwide user community by delivering state-of-the-art research and robust, usable software for optimization and uncertainty quantification. These capabilities enable advanced exploration and riskinformed prediction with a wide range of computational science and engineering models. Dakota is the verification and validation (V&V) / uncertainty quantification (UQ) software delivery vehicle for CASL, allowing analysts across focus areas to apply these capabilities to myriad nuclear engineering analyses.
97 MATHEMATICS AND COMPUTING↗
A review of low-rank methods for time-dependent kinetic simulations
Time-dependent kinetic models are ubiquitous in computational science and engineering. The underlying integro-differential equations in these models are high-dimensional, comprised of a six–dimensional phase space, making simulations of such phenomena extremely expensive. In this article we demonstrate that in many situations, the solution to kinetics problems lives on a low dimensional manifold that can be described by a low-rank matrix or tensor approximation. We then review the recent development of so-called low-rank methods that evolve the solution on this manifold. The two classes of methods we review are the dynamical low-rank (DLR) method, which derives differential equations for the low-rank factors, and a Step-and-Truncate (SAT) approach, which projects the solution onto the low-rank representation after each time step. Thorough discussions of time integrators, tensor decompositions, and method properties such as structure preservation and computational efficiency are included. We further show examples of low-rank methods as applied to particle transport and plasma dynamics.
97 MATHEMATICS AND COMPUTING↗
Fixed-head star tracker attitude updates on the Hubble Space Telescope
The Hubble Space Telescope (HST) was launched in April 1990 to begin observing celestial space to the edge of the universe. National Aeronautics and Space Administration (NASA) standard fixed-head star trackers (FHST's) are used operationally onboard the HST to regularly adjust ('update') the spacecraft attitude before the acquisition of guide stars for science observations. During the first 3 months of the mission, the FHST's updated the spacecraft attitude successfully only 85 percent of the time. During the other periods, the trackers were unable to find the selected stars -- either they failed to find any star, or worse, they selected incorrect stars and produced erroneous attitude updates. In July 1990, the HST project office at Goddard Space Flight Center (GSFC) requested that Computer Sciences Corporation (CSC) form an investigative 'tiger' team to examine these FHST update failures. This paper discusses the work of the FHST tiger team, describes the investigations that led the team to identify the sources of the errors, and defines the solutions that were subsequently developed, which ultimately increased the success rate of FHST updates to approximately 98 percent.
Nadelman, Matthew S.↗
Cross Domain Deterrence: Livermore Technical Report, 2014-2016
Lawrence Livermore National Laboratory (LLNL) is an original collaborator on the project titled “Deterring Complex Threats: The Effects of Asymmetry, Interdependence, and Multi-polarity on International Strategy,” (CDD Project) led by the UC Institute on Global Conflict and Cooperation at UCSD under PIs Jon Lindsay and Erik Gartzke , and funded through the DoD Minerva Research Initiative. In addition to participating in workshops and facilitating interaction among UC social scientists, LLNL is leading the computational modeling effort and assisting with empirical case studies to probe the viability of analytic, modeling and data analysis concepts. This report summarizes LLNL work on the CDD Project to date, primarily in Project Years 1-2, corresponding to Federal fiscal year 2015. LLNL brings two unique domains of expertise to bear on this Project: (1) access to scientific expertise on the technical dimensions of emerging threat technology, and (2) high performance computing (HPC) expertise, required for analyzing the complexity of bargaining interactions in the envisioned threat models. In addition, we have a small group of researchers trained as social scientists who are intimately familiar with the International Relations research. We find that pairing simulation scientists, who are typically trained in computer science, with domain experts, social scientists in this case, is the most effective route to developing powerful new simulation tools capable of representing domain concepts accurately and answering challenging questions in the field.
97 MATHEMATICS AND COMPUTING↗
Quantum Machine Learning over Infinite Dimensions
Machine learning is a fascinating and exciting eld within computer science. Recently, this ex- citement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the nite-dimensional substrate of discrete variables. Here we generalize quantum machine learning to the more complex, but still remarkably practi- cal, in nite-dimensional systems. We present the critical subroutines of quantum machine learning algorithms for an all-photonic continuous-variable quantum computer that achieve an exponential speedup compared to their equivalent classical counterparts. Finally, we also map out an experi- mental implementation which can be used as a blueprint for future photonic demonstrations.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Machine learning in cardiovascular flows modeling: Predicting arterial blood pressure from non-invasive 4D flow MRI data using physics-informed neural networks
Advances in computational science offer a principled pipeline for predictive modeling of cardiovascular flows and aspire to provide a valuable tool for monitoring, diagnostics and surgical planning. Such models can be nowadays deployed on large patient-specific topologies of systemic arterial networks and return detailed predictions on flow patterns, wall shear stresses, and pulse wave propagation. However, their success heavily relies on tedious pre-processing and calibration procedures that typically induce a significant computational cost, thus hampering their clinical applicability. Here, we put forth a machine learning framework that enables the seamless synthesis of non-invasive in-vivo measurement techniques and computational flow dynamics models derived from first physical principles. We illustrate this new paradigm by showing how one-dimensional models of pulsatile flow can be used to constrain the output of deep neural networks such that their predictions satisfy the conservation of mass and momentum principles. Once trained on noisy and scattered clinical data of flow and wall displacement, these networks can return physically consistent predictions for velocity, pressure and wall displacement pulse wave propagation, all without the need to employ conventional simulators. A simple post-processing of these outputs can also provide a relatively cheap and effective way for estimating Windkessel model parameters that are required for the calibration of traditional computational models. Finally, the effectiveness of the proposed techniques is demonstrated through a series of prototype benchmarks, as well as a realistic clinical case involving in-vivo measurements near the aorta/carotid bifurcation of a healthy human subject.
96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
The Oak Ridge National Laboratory Glenn T. Seaborg Institute: 2025 highlights
The Glenn T. Seaborg Institute (GTSI) at Oak Ridge National Laboratory (ORNL) serves as a dedicated hub for advancing actinide R&D, aimed at strengthening the United States’ capabilities in actinide science. With a focus on medical, industrial, and national security applications, the ORNL GTSI seeks to foster the next generation of scientists and engineers. Collaborating closely with corresponding Seaborg Institutes at Lawrence Livermore National Laboratory (LLNL), Lawrence Berkeley National Laboratory (LBNL), Los Alamos National Laboratory (LANL), and Idaho National Laboratory, the ORNL GTSI leverages its unique strengths. These include unparalleled expertise in isotope production, handling of rare isotopes, and leadership in neutron and computational sciences. Notably, the ORNL GTSI is positioned as the nation’s cornerstone for actinide R&D, capitalizing on the exceptional capabilities of the High Flux Isotope Reactor—the premier reactor for isotope production—and the Hazard Category 2 Radiochemical Engineering Development Center, which supports advanced production, processing, and applications research. Furthermore, the GTSI is committed to serving as a national center of excellence for training across all levels of actinide science education. This report provides an overview of the activities, milestones, and accomplishments of the ORNL GTSI over the past year.
38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
Quantum Optimization: Potential, Challenges, and the Path Forward
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.
97 MATHEMATICS AND COMPUTING↗
Quantum Fourier transform revisited
Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.
Camps, Daan↗
A tool and a methodology to use macros for abstracting variations in code for different computational demands
Scientific software used on high-performance computing platforms is in a phase of transformation because of the combined increase in the heterogeneity and complexity of models and hardware platforms. Having separate implementations for different platforms can easily lead to combinatorial explosions; therefore, the computational science community has been looking for mechanisms to express code through abstractions that can be specialized for different platforms. Most existing approaches use template meta-programming in C++, and are, therefore language specific. Here, we have developed a tool that uses customized expansion of macros to mimic some of C++ behavior in other languages. It enables unification of any code variants that may be necessary to run efficiently on different target architectures and different computational environments through use of macros with multiple alternative definitions and ability to arbitrate on definition selection for expansion. Combined with two other tools, a custom runtime, and a user specified recipe translator, our custom macroprocessor becomes a part of an overall performance portability solution that does not depend on any specific programming language. We also use macros as code-shorthand that lets code snippets become building blocks that allow variations in control flow to explore performance options. We demonstrate use of macros in Flash-X, a multiphysics multicomponent code with many Fortran legacy components derived from an earlier community code FLASH.
Heterogenous computing↗
Using XR for Improving Scientific Discovery With Numerical Weather Models
Earth science (ES) digital twins will help us understand the complex interactions and interrelationships that make up our Earth system and the impacts of earth science phenomena on it. Our work addresses two underdeveloped areas in current ES digital twin work: improving the understanding and interaction with ES model outputs by using Virtual and Mixed Reality (XR) tools and improving the non-intuitive mapping of continuous ES natural phenomena to gridded reference frames in current numerical models. Traditionally, scientists working on ES view and analyze the results of calculated or measured observables with static 1-dimensional (1D), 2D or 3D plots displayed on flat computer screens or paper. Using such limited mediums, it can be very difficult to identify, track and understand the evolution of key features due to poor viewing angles and the nature of flat computer screens. In addition, numerical models, such as the NASA Goddard Earth Observing System (GEOS) ES model, are almost exclusively formulated, visualized and analyzed in an Eulerian reference frame with fixed grid points in space and time. However, ES phenomena such as convective clouds, hurricanes and wildfire smoke plumes are visualized and analyzed in a Lagrangian reference frame: therefore it is often difficult and unnatural to understand these phenomena in relation to each other, visualized either in an Eulerian or Lagrangian context. In 3D visualizations, data generally takes one of three forms: gridded (e.g., voxelized) data, where space is divided into regions; point clouds, where data is represented as a set of points; and meshes, where objects are rendered as surfaces composed of small polygons (usually triangles). A gridded, Eulerian reference frame has been the default representation for the 2D visual analysis of atmospheric data in part because the numerical methods used to generate atmospheric model data in the first place use a gridded approach, with equations defining the relationships between the physical variables in each of a grid's cells across successive timesteps. In our work, we are particularly interested in data from GEOS. Another reason why gridded representations tend to be used for visualizing data from such models is because trajectories are difficult to interpret from representations on 2D surfaces, due to line-of-sight ambiguity. Instead of a fixed grid from GEOS, we embed a trajectory model to simulate particles' movement throughout a GEOS run. We then ingest these particle trajectories as animated point clouds with a NASA open source XR toolkit, the Mixed Reality Exploration Toolkit (MRET), and merge GEOS data with ES phenomena data onto one combined visualization that the user can intuitively interact with. Efficient rendering of arbitrarily large point clouds is an ongoing challenge being addressed by the computer science community, with the GPU-based optimizations and efficient GPU memory utilization a common theme of recent advances, especially for XR, where sustained high frame rate is mandatory to save the user from suffering due to simulation sickness. In this work, we describe and evaluate our progress in choosing and implementing appropriate methods for rendering arbitrarily large point clouds within MRET for XR. While tracking the XR headset enables the immersion of a user within a 3D scene of a data visualization, tracking of XR handheld controllers or user’s hands enables us to implement intuitive user interactions with the visualized datasets. Conventional tools require a user working with an ES visualization to conduct many interactions to commit their intended selections or manipulations with a visualized dataset; for example to specify a set of points in 3D space. Doing so in a 2D flat screen interface has traditionally required specifying a set of points in three distinct 2D coordinate systems (XY, XZ, and YZ), which is cumbersome. In other scientific domains, it has been shown that specifying or selecting a location or volume in XR using handheld controllers or tracked hands allows for greater speed and accuracy. We anticipate the same will hold true for atmospheric data, and we will share initial results of measuring the utility of such an interface. Notably, as the data being visualized is generated by GEOS as a prediction based on initial conditions, an intended application of our tool is to serve as part of an iterative feedback loop. Through XR, a scientist will review and manipulate a GEOS model run, modifying the conditions as needed to do subsequent runs of GEOS. Thereby, XR-based improvements to speed and accuracy of 3D tagging of points minimizes the effort required by both the scientist and the computer cluster conducting the necessary calculations.
Thomas Grubb↗
Tusas: A fully implicit parallel approach for coupled phase-field equations
In this study, we develop a fully-coupled, fully-implicit approach for phase-field modeling of solidification in metals and alloys. Predictive simulation of solidification in pure metals and metal alloys remains a significant challenge in the field of materials science, as microstructure formation during the solidification process plays a critical role in the properties and performance of the solid material. Our simulation approach consists of a finite element spatial discretization of the fully-coupled nonlinear system of partial differential equations at the microscale, which is treated implicitly in time with a preconditioned Jacobian-free Newton-Krylov method. The approach is algorithmically scalable as well as efficient due to an effective preconditioning strategy based on algebraic multigrid and block factorization. We implement this approach in the open-source Tusas framework, which is a general, flexible tool developed in C++ for solving coupled systems of nonlinear partial differential equations. The performance of our approach is analyzed in terms of algorithmic scalability and efficiency, while the computational performance of Tusas is presented in terms of parallel scalability and efficiency on emerging heterogeneous architectures. We demonstrate that modern algorithms, discretizations, and computational science, and heterogeneous hardware provide a robust route for predictive phase-field simulation of microstructure evolution during additive manufacturing.
97 MATHEMATICS AND COMPUTING↗
A Code Generator for High-Performance Tensor Contractions on GPUs
Tensor contractions are higher dimensional generalizations of matrix-matrix multiplication. They form the compute-intensive core for many applications in computational science and data science. Although high-performance library implementations are widely available for dense matrix-matrix multiplication on GPUs, the same is not true for contraction of dense tensors. In this paper, we describe a high- performance GPU code generator for arbitrary tensor contractions. It exploits domain-specific properties about data reuse in tensor contractions to devise an effective code generation schema, coupled with an effective model-driven search to determine parameters for mapping of computation to threads and staging of data through the GPU memory hierarchy. Experimental evaluation using a set of tensor contraction benchmarks demonstrates performance improvement and/or significantly reduced code generation time over other state-of-the-art tensor contraction libraries and code generators.
Kim, Jinsung↗
R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators
Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.
97 MATHEMATICS AND COMPUTING↗
Los Alamos National Laboratory R&D Intern
This report details the responsibilities, outcomes, and project details of a summer R&D internship at Los Alamos National Laboratory (LANL). LANL is a multidisciplinary laboratory that focuses on current cutting-edge research in many fields such as national security, engineering, materials science, computational modeling, and advanced manufacturing. The goal of the internship project was to work with lab engineers and resources to develop an energy absorbing structure for high-velocity impact applications. The successful development of this technology and methodology would not only positively impact future project funding but also contribute to the laboratory's commitment to solve national security challenges through simultaneous excellence. Such devices would also support efforts surrounding the research and development of energy absorbing structures and would provide new vital information backed by experimentation. Different computational and modeling methods were used to design these structures, in addition to qualitative background information provided by past literature. The resultant designs were successfully tested, and the test results were successfully quantified. From these results, new computational methods were developed through python programming and modeling to predict ideal materialistic properties for these structures given a sufficiently defined application.
36 MATERIALS SCIENCE↗
Human Exploration Ethnography of the Haughton-Mars Project, 1998-1999
During the past two field seasons, July 1988 and 1999, we have conducted research about the field practices of scientists and engineers at Haughton Crater on Devon Island in the Canadian Arctic, with the objective of determining how people will live and work on Mars. This broad investigation of field life and work practice, part of the Haughton-Mars Project lead by Pascal Lee, spans social and cognitive anthropology, psychology, and computer science. Our approach involves systematic observation and description of activities, places, and concepts, constituting an ethnography of field science at Haughton. Our focus is on human behaviors-what people do, where, when, with whom, and why. By locating behavior in time and place-in contrast with a purely functional or "task oriented" description of work-we find patterns constituting the choreography of interaction between people, their habitat, and their tools. As such, we view the exploration process in terms of a total system comprising a social organization, facilities, terrain/climate, personal identities, artifacts, and computer tools. Because we are computer scientists seeking to develop new kinds of tools for living and working on Mars, we focus on the existing representational tools (such as documents and measuring devices), learning and improvization (such as use of the internet or informal assistance), and prototype computational systems brought to the field. Our research is based on partnership, by which field scientists and engineers actively contribute to our findings, just as we participate in their work and life.
Clancey, William J.↗