Investigation of Carbohydrate Recognition via Computer Simulation
Explore the source record for details and available documents.
biofuels (including algae and biomass), bio-inspir↗
SEARCH · Search NASA
Results for “future of computing”
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.
A First Step Towards Quantum Simulating Jet Evolution in a Dense Medium
The fast development of quantum technologies over the last decades has offered a glimpse to a future where the quantum properties of multi particle systems might be more fully understood. In particular, quantum computing might prove crucial to explore many aspects of high energy physics unaccessible to classical methods. In this talk, we will describe how one can use digital quantum computers to study the evolution of QCD jets in quark gluons plasmas. We construct a quantum circuit to study single particle evolution in a dense QCD medium. Focusing on the jet quenching parameter $\hat{q}$, we present some early numerical results for a small quantum circuit. Future extensions of this strategy are also addressed.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
A Conceptual Architecture for a Quantum-HPC Middleware
Abstract-Quantum computing promises potential for science and industry by solving certain computationally complex problems faster than classical computers. Quantum computing systems evolved from coupled to classical computing nodes (HPC). With the increasing monolithic systems towards modular architectures comprising multiple quantum processing units (QPUs) scale, middleware systems that facilitate the efficient coupling of quantum-classical computing are becoming critical. Through an in-depth analysis of quantum applications, integration patterns and systems, we identified a gap in understanding Quantum HPC middleware systems. We present a conceptual middleware to facilitate reasoning about quantum-classical integration and serve as the basis for a future middleware system. An essential contribution of this paper lies in leveraging well-established high performance computing abstractions for managing workloads, tasks, and resources to integrate quantum computing into HPC systems seamlessly
97 MATHEMATICS AND COMPUTING↗
Deep Modeling: Circuit Characterization Using Theory Based Models in a Data Driven Framework
Analog computational circuits have been demonstrated to provide substantial improvements in power and speed relative to digital circuits, especially for applications requiring extreme parallelism but only modest precision. Deep machine learning is one such area and stands to benefit greatly from analog and mixed-signal implementations. However, even at modest precisions, offsets and non-linearity can degrade system performance. Furthermore, in all but the simplest systems, it is impossible to directly measure the intermediate outputs of all sub-circuits. The result is that circuit designers are unable to accurately evaluate the non-idealities of computational circuits in-situ and are therefore unable to fully utilize measurement results to improve future designs. In this paper we present a technique to use deep learning frameworks to model physical systems. Recently developed libraries like TensorFlow make it possible to use back propagation to learn parameters in the context of modeling circuit behavior. Offsets and scaling errors can be discovered even for sub-circuits that are deeply embedded in a computational system and not directly observable. The learned parameters can be used to refine simulation methods or to identify appropriate compensation strategies. We demonstrate the framework using a mixed-signal convolution operator as an example circuit.
Bolme, David S↗
Simulations of future particle accelerators: issues and mitigations
The ever increasing demands placed upon machine performance have resulted in the need for more comprehensive particle accelerator modeling. Computer simulations are key to the success of particle accelerators. Many aspects of particle accelerators rely on computer modeling at some point, sometimes requiring complex simulation tools and massively parallel supercomputing. Examples include the modeling of beams at extreme intensities and densities (toward the quantum degeneracy limit), and with ultra-fine control (down to the level of individual particles). In the future, adaptively tuned models might also be relied upon to provide beam measurements beyond the resolution of existing diagnostics. Much time and effort has been put into creating accelerator software tools, some of which are highly successful. However, there are also shortcomings such as the general inability of existing software to be easily modified to meet changing simulation needs. In this paper possible mitigating strategies are discussed for issues faced by the accelerator community as it endeavors to produce better and more comprehensive modeling tools. This includes lack of coordination between code developers, lack of standards to make codes portable and/or reusable, lack of documentation, among others.
43 PARTICLE ACCELERATORS↗
High entropy functional materials
Presented by NETL at World Congress on High Entropy Alloys (HEA 2019), 11/19
Miracle, Daniel B.↗
Quantum Computing and Visualization: A Disruptive Technological Change Ahead
The focus of this Visualization Viewpoints article is to provide some background on quantum computing (QC), to explore ideas related to how visualization helps in understanding QC, and examine how QC might be useful for visualization with the growth and maturation of both technologies in the future. In a quickly evolving technology landscape, QC is emerging as a promising pathway to overcome the growth limits in classical computing. In some cases, QC platforms offer the potential to vastly outperform the familiar classical computer by solving problems more quickly or that may be intractable on any known classical platform. As further performance gains for classical computing platforms are limited by diminishing Moore’s Law scaling, QC platforms might be viewed as a potential successor to the current field of exascale-class platforms. Importantly, while present-day QC hardware platforms are still limited in scale, the field of quantum computing is robust and rapidly advancing in terms of hardware capabilities, software environments for developing quantum algorithms, and educational programs for training the next generation of scientists and engineers. After a brief introduction to QC concepts, the focus of this article is to explore the interplay between the fields of visualization and QC. First, visualization has played a role in QC by providing the means to show representations of the quantum state of single-qubits in superposition states and multiple-qubits in entangled states. Second, there are a number of ways in which the field of visual data exploration and analysis may potentially benefit from this disruptive new technology though there are challenges going forward.
97 MATHEMATICS AND COMPUTING↗
Initial study on cross-section generation requirements for a PBR equilibrium core
A Serpent model of the equilibrium core HTR-PM small modular nuclear reactor in China, was developed for use in cross-section preparation studies in order to guide methods development for the Griffin reactor multiphysics application. The model includes detailed isotopics for 10 distinct pebble burnup groups in 126 core zones with unique fuel and moderator temperatures obtained from a coupled neutronics-thermal-fluids equilibrium core calculation using Griffin-Pronghorn. A sensitivity study of the fuel and moderator temperatures for various core regions was performed with the MOOSE stochastic tools. The results show that the uncertainties are, not unexpectedly, dominated by the value of the fluid temperature and that the power level, heat transfer coefficient and effective conduction to neighboring pebbles and fluid constitute, at best, second order effects. The temperature uncertainty range varies from 28 K to 57 K between the core entry and exit planes, respectively, but these values are probably higher. We still have to quantify the significance of these uncertainties in the preparation of cross-sections in future work. In addition, we verified that the effective pebble approximation used in the PEBBED and V.S.O.P. computer codes works well for the preparation of region averaged cross-sections. Nevertheless, there are some discrepancies in the cross-sections when compared to the multi-pebble model, which could affect the prediction of peak values and the depletion calculation. We conclude that is highly desirable for future studies with Griffin to be able to handle both the 'effective' pebble approximation and the multi-pebble approach for various pebble burnup groups. This enables Griffin users with the flexibility to perform higher-fidelity studies. Finally, we initiated the preparation of cross-sections for various core regions from the full core Serpent reference model. We quantified the differences in 26 group cross-sections from infinite domain models versus the full core approach. These reference cross-sections will serve to verify the double heterogeneity, self-shielding, and spectrum-correction methods in Griffin. (authors)
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Detecting Soft Errors in Stencil based Computations
Given the growing emphasis on system resilience, it is important to develop software-level error detectors that help trap hardware-level faults with reasonable accuracy while minimizing false alarms as well as the performance overhead introduced. We present a technique that approaches this idea by taking stencil computations as our target, and synthesizing detectors based on machine learning. In particular, we employ linear regression to generate computationally inexpensive models which form the basis for error detection. Our technique has been incorporated into a new open-source library called SORREL. In addition to reporting encouraging experimental results, we demonstrate techniques that help reduce the size of training data. We also discuss the efficacy of various detectors synthesized, as well as our future plans.
97 MATHEMATICS AND COMPUTING↗
Model Package Report: Hanford Soil Inventory Model SIM v.2 Build 1
The Hanford Soil Inventory Model (SIM) is a tool for the estimation of inventory of contaminants that were released to soil from liquid discharges during the U.S. Department of Energy’s Hanford Site operations. This model package report documents the construction and development of a second version of SIM (SIM-v2) to support the needs of Hanford Site Composite Analysis. The SIM-v2 is implemented using GoldSim Pro® 1 software with a new model architecture that preserves the uncertainty in inventory estimates while reducing the computational burden (compared to the previous version) and allowing more traceability and transparency in calculation methodology. The calculation architecture is designed in such a manner that future updates to the waste stream composition along with addition or deletion of waste sites can be performed with relative ease. In addition, the new computational platform allows for continued hardware upgrade.
12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
Enterprise Risks for Scientific Software in the Post Exascale Era
The Department of Energy’s Office of Science’s Advanced Scientific Computing Research (ASCR) Office hosts three high performance computing Facilities and one high performance networking Facility. ASCR’s Facilities Division and these four Facilities established a joint working group to address the most severe threats to the software capabilities that can prevent the Facilities from supporting a diverse array of mission critical scientific research carried out by thousands of researchers from national labs, academia, and industry. This report outlines the risk categories, threat matrix calculations, and number of risks in each of the categories along with the threat levels. Two categories—programming environment/tools and system software—account for 13 out of the 20 risks encountered in the risk register. A significant risk to ASCR’s software ecosystem also arises from the possible loss of personnel and expertise past the end of the exascale computing project. The working group recommends that the software enterprise risks are reevaluated regularly, and are considered in future decision making regarding system acquisition, knowledge sharing, partnership development, and strategic planning
97 MATHEMATICS AND COMPUTING↗
Evidential Deep Learning for Probabilistic Modelling of Extreme Storm Events
Uncertainty quantification (UQ) methods play an important role in reducing errors in weather forecasting. Conventional approaches in UQ for weather forecasting rely on generating an ensemble of forecasts from physics-based simulations to estimate the uncertainty. However, it is computationally expensive to generate many forecasts to predict real-time extreme weather events. Evidential Deep Learning (EDL) is an uncertainty-aware deep learning approach designed to provide confidence about its predictions using only one forecast. It treats learning as an evidence acquisition process where more evidence is interpreted as increased predictive confidence. We apply EDL to storm forecasting using real-world weather datasets and compare its performance with traditional methods. Our findings indicate that EDL not only reduces computational overhead but also enhances predictive uncertainty. This method opens up novel opportunities in research areas such as climate risk assessment, where quantifying the uncertainty about future climate is crucial.
97 MATHEMATICS AND COMPUTING↗
High Fidelity Simulations of a Non-Premixed Rotating Detonation Engine
Over the last two decades, detonation based propulsion concepts have received a great deal of attention as a means to achieve significant improvement in the performance of air-breathing and rocket engines. Detonative combustion mode is particularly interesting due to the resulting pressure gain from reactants to products, faster heat release, decreased entropy generation, more available work and higher thrust compared to conventional deflagrative combustion. Rotating detonation engine (RDE) is one such class of novel combustor concepts. Realistic RDE configurations utilize separate fuel and air injection schemes, hence are not perfectly premixed. Moreover, the performance of RDEs is governed by a large number of design parameters and operating conditions. In this context, computational fluid dynamics (CFD) has the potential to enhance the understanding of RDE combustion and aid future development/optimization of this technology. In the present work, a CFD model was developed to simulate a representative non-premixed RDE combustor at the US Air Force Research Laboratory (AFRL). To resolve the reacting flow in the combustor, a finite-rate chemistry model was employed. In addition, adaptive mesh refinement (AMR) was incorporated to achieve a good trade-off between model accuracy and computational expense. Unsteady Reynolds-Averaged Navier-Stokes (RANS) simulations were performed for the full combustor (including the separate fuel and air injection ports) geometry, with hydrogen as fuel and air as the oxidizer. A 10-species detailed kinetic mechanism was employed to describe the H2-Air combustion chemistry. Two different operating conditions were simulated, corresponding to the same global equivalence ratio of unity but different fuel and air mass flow rates. For both conditions, the capability of the model to capture the essential detonation wave dynamics was assessed. A validation study was performed against a wide variety of experimental data available on detonation wave frequency/height, reactant fill height, oblique shock angle, axial pressure distribution in the channel, and fuel/air plenum pressure. The CFD model predicted the sensitivity of all these wave characteristics to the operating conditions with good accuracy, both qualitatively and quantitatively. The present CFD model offers a potential capability to perform rapid design space exploration and/or performance optimization studies for realistic full-scale RDE configurations.
Cocks, Peter A.↗
A computationally efficient moment-preserving Monte Carlo electron transport method with implementation in Geant4
This paper presents the theoretical development and numerical demonstration of a moment-preserving Monte Carlo electron transport method. Foremost, a full implementation of the moment-preserving (MP) method within the Geant4 particle simulation toolkit is demonstrated. Beyond implementation details, it is shown that the MP method is a viable alternative to the condensed history (CH) method for inclusion in current and future generation transport codes through demonstration of the key features of the method including: systematically controllable accuracy, computational efficiency, mathematical robustness, and versatility. A wide variety of results common to electron transport are presented illustrating the key features of the MP method. In particular, it is possible to achieve accuracy that is statistically indistinguishable from analog Monte Carlo, while remaining up to three orders of magnitude more efficient than analog Monte Carlo simulations. Lastly, it is shown that the MP method can be generalized to any applicable analog scattering DCS model by extending previous work on the MP method beyond analytical DCSs to the partial-wave (PW) elastic tabulated DCS data.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Industrial Deployment of Computer Aided Manufacturing Software for Hybrid Advanced Manufacturing
GibbsCAM, 3D Systems’ software product, is a full-featured CAM system that provides powerful CNC programming, capabilities, and solutions, delivering high quality parts without sacrificing ease of use. Oak Ridge National Laboratory (ORNL) collaborated with GibbsCAM to evaluate their toolpath generating software being developed for both blown powder and hybrid CNC/additive manufacturing machinery. The current approach in toolpath solutions for additive manufacturing is to utilize subtractive toolpaths created by existing CAM software and reversing it for additive manufacturing applications. GibbsCAM is working to develop a full solution to mitigate the challenges that arise with this approach and deploy a fully customized solution for producing quality, reliable components for a range of different DED systems. When successful, this will be an automated solution deployed through a future release of GibbsCAM software.
97 MATHEMATICS AND COMPUTING↗
Contrasting advantages of learning with random weights and backpropagation in non-volatile memory neural networks
Recently, a Cambrian explosion of novel, non-volatile memory (NVM) devices known as memristive devices have inspired effort in building hardware neural networks that learn like the brain. Early experimental prototypes built simple perceptrons from nanosynapses, and recently, fully-connected multi-layer perceptron (MLP) learning systems have been realized. However, while backpropagating learning systems pair well with high-precision computer memories and achieve state-of-the-art performances, this typically comes with a massive energy budget. For future Internet of Things/peripheral use cases, system energy footprint will be a major constraint, and emerging NVM devices may fill the gap by sacrificing high bit precision for lower energy. In this work, we contrast the well known MLP approach with the Extreme Learning Machine (ELM) or NoProp approach, which uses a large layer of random weights to improve the separability of high-dimensional tasks, and is usually considered inferior in a software context. However, we find that when taking device non-linearity into account, NoProp manages to equal hardware MLP system in terms of accuracy. While also using a sign-based adaptation of the delta rule for energy-savings, we find that NoProp can learn effectively with four to six ’bits’ of device analog capacity, while MLP requires eight bit capacity with the same rule. This may allow the requirements for memristive devices to be relaxed in the context of online learning. By comparing the energy footprint of these systems for several candidate nanosynapses, as well as realistic peripherals, we confirm that memristive NoProp systems save energy compared to MLP systems. Lastly, we show that ELM/NoProp systems can achieve better generalization abilities than nanosynaptic MLP systems when paired with pre-processing layers (which do not require backpropagated error). Collectively, these advantages make such systems worthy of consideration in future accelerators or embedded hardware.
97 MATHEMATICS AND COMPUTING↗
Report from the 2016 CrossConnects workshop: improving data mobility & management for bioinformatics
Due to significant declines in the price of genome sequencing technology, the bioinformatics sciences are experiencing a massive upswing in data generation resulting in an increasing need for data distribution and access. The sheer number of biological areas of study, many of which benefit from the scientific breakthroughs of one another, are adding to the increase of shared data usage. The need for effective data management, analysis, and access are becoming more critical. While there are commonalities facing both precision medicine and metagenomics, each area has its own unique challenges and needs. A workshop was held in April 2016 at Lawrence Berkeley National Laboratory that brought together scientists from both fields, along with experts in computing and networking. Presenters and attendees discussed current research and pressing data issues facing the bioinformatics field today and in the near future.
97 MATHEMATICS AND COMPUTING↗
Time-sliced quantum circuit partitioning for modular architectures
Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future time slices. We compare our approach to a traditional statically-mapped, owner-computes model. Our results show strict improvement over the static mapping baseline. Here, we reduce the non-local communication overhead by 89.8% in the best case and by 60.9% on average. Our techniques, unlike many exact solver methods, are computationally tractable.
Baker, Jonathan M.↗