Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational challenge”

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 937 records · Page 52

Theory VI. Computational Materials Sciences Network (CMSN)

The Computational Materials Sciences Network (CMSN) is a virtual center consisting of scientists interested in working together, across organizational and disciplinary boundaries, to formulate and pursue projects that reflect challenging and relevant computational research in the materials sciences. The projects appropriate for this center involve those problems best pursued through broad cooperative efforts, rather than those key problems best tackled by single investigator groups. CMSN operates similarly to the DOE Center of Excellence for the Synthesis and Processing of Advanced Materials, coordinated by George Samara at Sandia. As in the Synthesis and Processing Center, the intent of the modest funding for CMSN is to foster partnering and collective activities. All CMSN proposals undergo external peer review and are judged foremost on the quality and timeliness of the science and also on criteria relevant to the objective of the center, especially concerning a strategy for partnering. More details about CMSN can be found on the CMSN webpages at: http://cmpweb.ameslab.gov/ccms/CMSN-homepage.html.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scientific Grand Challenges: Discovery In Basic Energy Sciences: The Role of Computing at the Extreme Scale - August 13-15, 2009, Washington, D.C.

The U.S. Department of Energy’s (DOE) Office of Basic Energy Sciences (BES) and Office of Advanced Scientific Computing Research (ASCR) workshop in August 2009 on extreme-scale computing provided a forum for more than 130 researchers to explore the needs and opportunities that will arise due to expected dramatic advances in computing power over the next decade. This scientific community firmly believes that the development of advanced theoretical tools within chemistry, physics, and materials science—combined with the development of efficient computational techniques and algorithms—has the potential to revolutionize the discovery process for materials and molecules with desirable properties. Doing so is necessary to meet the energy and environmental challenges of the 21 st century as described in various DOE BES Basic Research Needs reports. Furthermore, computational modeling and simulation are a crucial complement to experimental studies, particularly when quantum mechanical processes controlling energy production, transformations, and storage are not directly observable and/or controllable. Many processes related to the Earth’s climate and subsurface need better modeling capabilities at the molecular level, which will be enabled by extreme-scale computing.

97 MATHEMATICS AND COMPUTING↗

PQML: Enabling the Predictive Reproducibility on NISQ Machines for Quantum ML Applications

Quantum computing represents a groundbreaking approach to high-performance computing. In recent years, quantum computers have progressed from single-qubit processors to systems boasting over 400 qubits. The presence of such a large number of qubits offers significant advantages, including enhanced computational speed—a capability beyond classical computing methods. However, the current stage of quantum computing is referred to as the noisy intermediate-scale quantum (NISQ) era. The existence of noise in this era presents challenges in testing quantum computing applications, leading to considerable variance in application results. Furthermore, the diverse noise characteristics observed across different machines exacerbate this issue, complicating the selection of the appropriate machine for application execution. In response to these challenges, we introduce our Predictive Quantum Machine Learning (PQML) tool. This tool is designed to predict outcomes when executing identical quantum machine learning applications—specifically, a critical suite of variational quantum algorithms—across various quantum computers during the NISQ era. This effort relies on data collected over a 12-month period. To the best of our knowledge, this study represents the first attempt to ensure reproducibility across quantum computers for complex circuits. Additionally, we have developed a model capable of forecasting the accuracy of quantum computers for variational quantum algorithms, with a particular emphasis on quantum machine learning as a case study.

Senapati, Priyabrata [Kent State University]↗

N2A: a computational tool for modeling from neurons to algorithms

The exponential increase in available neural data has combined with the exponential growth in computing (“Moore’s law”) to create new opportunities to understand neural systems at large scale and high detail. The ability to produce large and sophisticated simulations has introduced unique challenges to neuroscientists. Computational models in neuroscience are increasingly broad efforts, often involving the collaboration of experts in different domains. Furthermore, the size and detail of models have grown to levels for which understanding the implications of variability and assumptions is no longer trivial. Here, we introduce the model design platform N2A which aims to facilitate the design and validation of biologically realistic models. N2A uses a hierarchical representation of neural information to enable the integration of models from different users. N2A streamlines computational validation of a model by natively implementing standard tools in sensitivity analysis and uncertainty quantification. The part-relationship representation allows both network-level analysis and dynamical simulations. We will demonstrate how N2A can be used in a range of examples, including a simple Hodgkin-Huxley cable model, basic parameter sensitivity of an 80/20 network, and the expression of the structural plasticity of a growing dendrite and stem cell proliferation and differentiation.

biologically realistic modeling↗

Tracking Non-rigid Structures in Computer Simulations

A key challenge in tracking moving objects is the correspondence problem, that is, the correct propagation of object labels from one time step to another. This is especially true when the objects are non-rigid structures, changing shape, and merging and splitting over time. In this work, we describe a general approach to tracking thousands of non-rigid structures in an image sequence. We show how we can minimize memory requirements and generate accurate results while working with only two frames of the sequence at a time. We demonstrate our results using data from computer simulations of a fluimix problem.

99 GENERAL AND MISCELLANEOUS↗

Vortex lift research: Early contributions and some current challenges

The trend towards slender wing aircraft for supersonic cruise and the early chronology of research directed towards their vortex-lift characteristics are briefly reviewed. An overview of the development of vortex-lift theoretical methods is presented, and some current computational and experimental challenges related to the viscous flow aspects of this vortex flow are discussed.

Polhamus, E. C.↗

Computational Spectrum of Agent Model Simulation

The study of human social behavioral systems is finding renewed interest in military, homeland security and other applications. Simulation is the most generally applied approach to studying complex scenarios in such systems. Here, we outline some of the important considerations that underlie the computational aspects of simulation-based study of human social systems. The fundamental imprecision underlying questions and answers in social science makes it necessary to carefully distinguish among different simulation problem classes and to identify the most pertinent set of computational dimensions associated with those classes. We identify a few such classes and present their computational implications. The focus is then shifted to the most challenging combinations in the computational spectrum, namely, large-scale entity counts at moderate to high levels of fidelity. Recent developments in furthering the state-of-the-art in these challenging cases are outlined. A case study of large-scale agent simulation is provided in simulating large numbers (millions) of social entities at real-time speeds on inexpensive hardware. Recent computational results are identified that highlight the potential of modern high-end computing platforms to push the envelope with respect to speed, scale and fidelity of social system simulations. Finally, the problem of shielding the modeler or domain expert from the complex computational aspects is discussed and a few potential solution approaches are identified.

97 MATHEMATICS AND COMPUTING↗

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗

Computers in neutron science

Abstract Neutron scattering provides a sensitive probe for materials structure and dynamics and has had a profound impact on research ranging from quantum topological materials to archaeology to aerospace alloys. These experiments are incredibly data-rich and often challenging to interpret. Computational studies have been integral in the growing success of neutron science. From data collection and reduction to analysis and interpretation, computers are used at every stage of modern neutron experiments. State-of-the-art software allows for a deeper understanding of these powerful unique experiments. This themed issue, guest-edited by Dr. Jeff Armstrong, Dr. Keith T Butler, and Dr. Matthew R Ryder, brings together a collection of research highlighting the state-of-the-art in the application of computers in neutron science.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Transdisciplinary Foundations of Geospatial Data Science

Recent developments in data mining and machine learning approaches have brought lots of excitement in providing solutions for challenging tasks (e.g., computer vision). However, many approaches have limited interpretability, so their success and failure modes are difficult to understand and their scientific robustness is difficult to evaluate. Thus, there is an urgent need for better understanding of the scientific reasoning behind data mining and machine learning approaches. This requires taking a transdisciplinary view of data science and recognizing its foundations in mathematics, statistics, and computer science. Focusing on the geospatial domain, we apply this crucial transdisciplinary perspective to five common geospatial techniques (hotspot detection, colocation detection, prediction, outlier detection and teleconnection detection). We also describe challenges and opportunities for future advancement.

Xie, Yiqun↗

Investigating applications portability with the Uintah DAG-based runtime system on PetaScale supercomputers

Present trends in high performance computing present formidable challenges for applications code using multicore nodes possibly with accelerators and/or co-processors and reduced memory while still attaining scalability. Software frameworks that execute machine-independent applications code using a runtime system that shields users from architectural complexities offer a possible solution. The Uintah framework for example, solves a broad class of large-scale problems on structured adaptive grids using fluid-flow solvers coupled with particle-based solids methods. Uintah executes directed acyclic graphs of computational tasks with a scalable asynchronous and dynamic runtime system for CPU cores and/or accelerators/co-processors on a node. Uintah's clear separation between application and runtime code has led to scalability increases of 1000x without significant changes to application code. This methodology is tested on three leading Top500 machines; OLCF Titan, TACC Stampede and ALCF Mira using three diverse and challenging applications problems. This investigation of scalability with regard to the different processors and communications performance leads to the overall conclusion that the adaptive DAG-based approach provides a very powerful abstraction for solving challenging multi-scale multi-physics engineering problems on some of the largest and most powerful computers available today.

Meng, Qingyu↗

Structure Based Drug Design for HIM Protease: From Molecular Modeling to Cheminformatics

Significant progress over the past decade in virtual representations of molecules and their physicochemical properties has produced new drugs from virtual screening of the structures of single protein molecules by conventional modeling methods. The development of clinical antiviral drugs from structural data for HIV protease has been a major success in structure based drug design. Techniques for virtual screening involve the ranking of the affinity of potential ligands for the target site on a protein. Two main alternatives have been developed: modeling of the target protein with a series of related ligand molecules, and docking molecules from a database to the target protein site. The computational speed and prediction accuracy will depend on the representation of the molecular structure and chemistry, the search or simulation algorithm, and the scoring function to rank the ligands. Moreover, the general challenges in modern computational drug design arise from the profusion of data, including whole genomes of DNA, protein structures, chemical libraries, affinity and pharmacological data. Therefore, software tools are being developed to manage and integrate diverse data, and extract and visualize meaningful relationships. Current areas of research include the development of searchable chemical databases, which requires new algorithms to represent molecules and search for structurally or chemically similar molecules, and the incorporation of machine learning techniques for data mining to improve the accuracy of predictions. Examples will be presented for the virtual screening of drugs that target HIV protease.

59 BASIC BIOLOGICAL SCIENCES↗

Benchmarking of massively parallel phase-field codes for directional solidification

We present a detailed benchmark comparing two state-of-the-art phase-field implementations for simulating alloy solidification under experimentally relevant conditions. The study investigates the directional solidification of Al-3wt%Cu under high-velocity solidification conditions and SCN-0.46wt% camphor under microgravity conditions from National Aeronautics and Space Administration (NASA) DECLIC-DSI-R experiments. Both codes, one employing finite-difference discretization with uniform mesh and GPU-acceleration (GPU-PF) and the other one employing finite-element discretization with adaptive-mesh and CPU-parallelization (PRISMS-PF), solve the same quantitative phase-field formulation that incorporates an anti-trapping current for the solidification of dilute alloys. We evaluate the predictions of each code for dendritic morphology, primary spacing, and tip dynamics in both 2D and 3D, as well as their numerical convergence and computational performance. While existing benchmark problems have primarily focused on simplified or small-scale simulations, they do not reflect the computational and modeling challenges posed by employing experimentally relevant time and length scales. Our results provide a practical framework for assessing phase-field code performance as well as validating and facilitating their application in integrated computational materials engineering (ICME) workflows that require integration with realistic experimental data.

36 MATERIALS SCIENCE↗

Boson sampling with Gaussian input states: Toward efficient scaling and certification

A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the Extended Church-Turing Thesis. One of these models based on single photons interacting via linear optics is called Boson Sampling. Although Boson Sampling was demonstrated and the threshold to claim quantum computational advantage was achieved, the question of how to scale up Boson Sampling experiments remains. To make progress with this problem, here we present a practically achievable pathway to scale Boson Sampling experiments by combining continuous-variable quantum information and temporal encoding. Here, we propose the combination of switchable dual-homodyne and single-photon detections, the temporal loop technique, and scattershot-based Boson Sampling. We detail the required assumptions for concluding computational hardness for this configuration. Furthermore, this particular combination of techniques moves towards an efficient scaling and certification of Boson Sampling, all in a single experimental setup.

79 ASTRONOMY AND ASTROPHYSICS↗

Physics-Informed Machine Learning-Aided System Space Discretization

Decision-making is the process of identifying and choosing alternatives based on an agreed-upon set of metrics and preferences established by the decision-maker. There are options to be considered during the decision-making process and each option offers a different trajectory and associated success profile in moving from a given system state to the desired system state. The decision-making process typically involves uncertainties associated with the current component and system states. In this sense, probabilistic risk assessment (PRA) can be an analytical method and tool for accomplishing the probabilistic aspect of the decision-making process. Dynamic PRA is an evolution of conventional PRA methodology in which driving forces on modeled plant elements and the element behaviors are explicitly modeled over time. In the recent past, risk assessment methodologies have evolved to address risk issues in a continuously evolving environment and a novel probabilistic dynamics framework in continuous time and state-space discretization forms has been proposed. While state-space discretization has shown its strength in both consequence and causal reasoning modes, several challenges, including the computational requirement and physically meaningful system state identification, exist. Conventional system space discretization has usually been done by either the equal width discretization method or a data-driven method. Those methods naturally possess challenges coming from the physical understanding of discretized system space (i.e., system state) and the trajectory moving from a given system state to another system state. The purpose of this paper is to present a physics-based and data-driven system state discretization method such that one can justify what the discretized system space implies and understand the state trajectory from the viewpoint of operational actions.

Kim, Junyung↗

Transforming Energy Through Computational Excellence: High-Performance Computing for Energy Innovation

The challenges associated with energy efficiency of manufacturing and advanced materials often cannot be addressed through experimentation alone, whether because of scale, complexity, or practicality. High-performance computing (HPC) enables fast tackling of these challenges in the manufacturing sector - vital to achieving net-zero carbon emissions by 2050. The National Renewable Energy Laboratory (NREL) and industry partners leverage HPC to apply advanced modeling, simulation, and data analysis to improve manufacturing efficiency, explore new materials for energy applications, and develop technologies to manage carbon across the life cycle. From improving additive manufacturing processes to increasing the energy efficiency of jet-engine components, advanced computing can help manage emissions produced by manufacturing in a wide variety of ways.

advanced materials↗

An automatic performance model-based scheduling tool for coupled climate system models

The prediction of the climate system is highly depended on the efficient integration of observations and simulations of the Earth. This is regarded as a canonical example of the cyber-physical system. The climate system model, the simulation engine in this cyber-physical system, is one of most challenging applications in scientific computing. It utilizes the multi-physics simulation that couples multiple components, conducts decadal to millennium simulations, and has long been an important application on supercomputers. However, current climate system models suffer from the inefficient task scheduling methods resulting in an intolerable simulation time. Take the Community Earth System Model (CESM), the most widely used climate system model, as an example, one major reason that CESM suffers from bad performances is the huge overhead to rationally distribute processes among the coupled heterogeneous components. According to the report of NCAR, every percent improvement in CESM performance frees up to the equivalent of $250,000 in computing resources in their scientific experiments. To address such challenge, our paper firstly constructs a lightweight and accurate performance model for effectively capturing and predicting the heterogeneous time-to-solution performance of end-to-end CESM components with a given simulation configuration. Then, based on the performance model, we further propose an efficient scheduling strategy based on rectangular packing method to determine the best process layout among different components, and the process numbers assigned to each component. Our evaluations show that we can achieve 58% average run time reductions on CESM comparing to the widely used sequential process layout for a scale of 144 to 480 cores on typical CPU clusters. And we can save 4 million CPU hours when we conduct one standard scientific experiment (a 2870-year simulation), which equals to save $40,089 with a charge of $0.01 per CPU hour. Meanwhile, 26% extra performance improvements could also be gained in our methods comparing to the heuristic branch and bound algorithm with the guidance of the known curve-fitting performance model.

58 GEOSCIENCES↗

Nonvolatile Electrochemical Random‐Access Memory under Short Circuit

Abstract Electrochemical random‐access memory (ECRAM) is a recently developed and highly promising analog resistive memory element for in‐memory computing. One longstanding challenge of ECRAM is attaining retention time beyond a few hours. This short retention has precluded ECRAM from being considered for inference classification in deep neural networks, which is likely the largest opportunity for in‐memory computing. In this work, an ECRAM cell with orders of magnitude longer retention than previously achieved is developed, and which is anticipated to exceed ten years at 85 °C. This study hypothesizes that the origin of this exceptional retention is phase separation, which enables the formation of multiple effectively equilibrium resistance states. This work highlights the promises and opportunities to use phase separation to yield ECRAM cells with exceptionally long, and potentially permanent, retention times.

Kim, Diana S.↗