SEARCH · Search NASA

Results for “Computer Networks”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Semantic segmentation with a sparse convolutional neural network for event reconstruction in MicroBooNE

We present the performance of a semantic segmentation network, SparseSSNet, that provides pixel-level classification of MicroBooNE data. The MicroBooNE experiment employs a liquid argon time projection chamber for the study of neutrino properties and interactions. SparseSSNet is a submanifold sparse convolutional neural network, which provides the initial machine learning based algorithm utilized in one of MicroBooNE's ν e -appearance oscillation analyses. The network is trained to categorize pixels into five classes, which are re-classified into two classes more relevant to the current analysis. The output of SparseSSNet is a key input in further analysis steps. This technique, used for the first time in liquid argon time projection chambers data and is an improvement compared to a previously used convolutional neural network, both in accuracy and computing resource utilization. Here, the accuracy achieved on the test sample is ≥ 99%. For full neutrino interaction simulations, the time for processing one image is ≈ 0.5 sec, the memory usage is at 1 GB level, which allows utilization of most typical CPU worker machine.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2022

Thermal modeling of directed energy deposition additive manufacturing using graph theory

Purpose: The purpose of this paper is to develop, apply and validate a mesh-free graph theory–based approach for rapid thermal modeling of the directed energy deposition (DED) additive manufacturing (AM) process. Design/methodology/approach: Here, the authors develop a novel mesh-free graph theory–based approach to predict the thermal history of the DED process. Subsequently, the authors validated the graph theory predicted temperature trends using experimental temperature data for DED of titanium alloy parts (Ti-6Al-4V). Temperature trends were tracked by embedding thermocouples in the substrate. The DED process was simulated using the graph theory approach, and the thermal history predictions were validated based on the data from the thermocouples. Findings: The temperature trends predicted by the graph theory approach have mean absolute percentage error of approximately 11% and root mean square error of 23°C when compared to the experimental data. Moreover, the graph theory simulation was obtained within 4 min using desktop computing resources, which is less than the build time of 25 min. By comparison, a finite element–based model required 136 min to converge to similar level of error. Research limitations/implications: This study uses data from fixed thermocouples when printing thin-wall DED parts. In the future, the authors will incorporate infrared thermal camera data from large parts. Practical implications: The DED process is particularly valuable for near-net shape manufacturing, repair and remanufacturing applications. However, DED parts are often afflicted with flaws, such as cracking and distortion. In DED, flaw formation is largely governed by the intensity and spatial distribution of heat in the part during the process, often referred to as the thermal history. Accordingly, fast and accurate thermal models to predict the thermal history are necessary to understand and preclude flaw formation. Originality/value: This paper presents a new mesh-free computational thermal modeling approach based on graph theory (network science) and applies it to DED. The approach eschews the tedious and computationally demanding meshing aspect of finite element modeling and allows rapid simulation of the thermal history in additive manufacturing. Although the graph theory has been applied to thermal modeling of laser powder bed fusion (LPBF), there are distinct phenomenological differences between DED and LPBF that necessitate substantial modifications to the graph theory approach.

42 ENGINEERING↗

DOE OSTI2021

Quantum networks based on color centers in diamond

With the ability to transfer and process quantum information, large-scale quantum networks will enable a suite of fundamentally new applications, from quantum communications to distributed sensing, metrology, and computing. This Perspective reviews requirements for quantum network nodes and color centers in diamond as suitable node candidates. We give a brief overview of state-of-the-art quantum network experiments employing color centers in diamond and discuss future research directions, focusing, in particular, on the control and coherence of qubits that distribute and store entangled states, and on efficient spin–photon interfaces. We discuss a route toward large-scale integrated devices combining color centers in diamond with other photonic materials and give an outlook toward realistic future quantum network protocol implementations and applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2024

Establishing capabilities for quantum computing and simulations for energy applications

Quantum information science (QIS) is creating potential transformative opportunities to exploit intricate quantum mechanical phenomena in new ways for obtaining and processing information to advance many areas of science and engineering. Since the National Quantum Initiative Act was signed into law in 2018, developing QIS capability and competency is one of the most urgent tasks of DOE to make sure the US win the quantum race. The QIS contains four pillars: quantum computing, quantum simulations, quantum sensing, and quantum networking. To apply QIS in energy related applications, the key is to develop the capability of quantum computing & simulation tools. In this project, we propose to develop the capability of quantum computing and simulations at NETL to target fossil energy related problems. We will install a simulator (e. g. IBM qiskit) on the NETL supercomputer to simulate the environments of quantum computer. Based on the current available quantum algorithms for quantum chemistry, we will develop quantum computing codes to perform simulation which will focus on fossil energy sector challenges, including CO2 capture & conversion, sensing, and fuel conversion. We then will seek opportunities to run our codes on real quantum computers (such as IBM-Q, google Sycamore, etc.). Through this project, the new capability of quantum computing and simulations will be established at NETL. In addition, the NETL workforce in this area will be trained ready to conduct more complicated tasks in line with NETL missions to enhance the nation’s energy foundation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Final Reports of the 2021 Los Alamos National Laboratory Computational Physics Student Summer Workshop

Since 2011, the Los Alamos National Laboratory Computational Physics Student Summer Workshop has been bringing together a highly talented and diverse group of students every summer. Students work in teams of two, alongside typically two mentors, on research projects reflecting a broad range of topics within computational physics. In addition, students attend a series of lectures on topics within computational physics, facility tours, and networking events. The program lasts ten weeks, with this year’s workshop running from June 7 to August 13. At the end of the summer, students give a final presentation, along with a written report. Those reports are what make up the remaining sections of this document. Admission to the workshop is by a competitive process, with the mentors forming the selection committee. One of the important accomplishments of the workshop has been to create a student pipeline from diverse schools that sometimes are not normally tapped by LANL recruiting. Many workshop students maintain a continuing relationship with LANL, returning as student interns, post-doctoral researchers, and staff members. Additionally, workshop alumni act as ambassadors for LANL. The result is a wider awareness both of LANL as a potential employer, and of the technical work that happens at LANL. This year, the workshop was once again in an off-site, virtual format. Students worked on LANL virtual desktop systems remotely, also accessing LANL HPC resources. In order to facilitate communication, student were given accounts on both Webex, a video teleconferencing platform, and Mattermost, an online team collaboration and chat platform, similar to Slack. Daily communication between students and mentors was primarily on Mattermost, with Webex conferencing as needed. The lectures were all done on Webex. Given the difficulty of the virtual format, and a concern that students might have video teleconferencing burn-out, all lectures were optional this year. In spite of this, the attendance was generally high. Lecturers were asked to try to move to a more high-level, ”What is it?,” format. Once again, the students did a tremendous job. Over the course of ten weeks, they did important research across a staggering array of disciplines. The following pages contain the final report for each team’s research efforts. Enjoy!

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

DOE OSTI2020

Final Reports of the 2020 Los Alamos National Laboratory Computational Physics Student Summer Workshop

For the past ten years, the workshop has been bringing a highly talented and diverse group of student every summer. Students work in teams of two, alongside typically two mentors, on research projects reflecting a broad range of topics within computational physics. In addition, students attend a series of lectures on topics within computational physics, facility tours, and networking events. The program lasts ten weeks, with this year’s workshop running from June 8 to August 14. At the end of the summer, students give a final presentation, along with a written report. Those reports are what make up the remaining sections of this document. Admission to the workshop is by a competitive process, with the mentors forming the selection committee. One of the important accomplishments of the workshop has been to create a student pipeline from diverse schools that sometimes are not normally tapped by LANL recruiting. Many workshop students maintain a continuing relationship with LANL, returning as students interns, post-doctoral researchers, and staff members. Additionally, workshop alumni act as ambassadors for LANL. The result is a wider awareness both of LANL as a potential employer, and of the technical work that happens at LANL. This year, the workshop format was changed in several ways, in order to accommodate the off-site, virtual format. Students worked on LANL virtual desktop systems remotely, also accessing LANL HPC resources. In order to facilitate communication, student were given accounts on both Webex, a video teleconferencing platform, and Mattermost, an online team collaboration and chat platform, similar to Slack. Daily communication between students and mentors was primarily on Mattermost, with Webex conferencing as needed. The lectures were all done on Webex. Given the difficulty of the virtual format, and a concern that students might have video teleconferencing burn-out after an academic semester largely moved to that format, all lectures were optional this year. In spite of this, the attendance was generally high. Lecturers were asked to try to move to a more high-level, ”What is it?,” format. Once again, the students did a tremendous job. Over the course of ten weeks, they did important research across a staggering array of disciplines. The following pages contain the final report for each team’s research efforts. We hope you will find reading them as exciting as it was for us to produce them.

36 MATERIALS SCIENCE↗

DOE OSTI2021

MLPF: efficient machine-learned particle-flow reconstruction using graph neural networks

In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a comprehensive particle-level view of the event by combining information from the calorimeters and the trackers, significantly improving the detector resolution for jets and the missing transverse momentum. In view of the planned high-luminosity upgrade of the CERN Large Hadron Collider (LHC), it is necessary to revisit existing reconstruction algorithms and ensure that both the physics and computational performance are sufficient in an environment with many simultaneous proton–proton interactions (pileup). Machine learning may offer a prospect for computationally efficient event reconstruction that is well-suited to heterogeneous computing platforms, while significantly improving the reconstruction quality over rule-based algorithms for granular detectors. We introduce MLPF, a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, computationally efficient, and scalable graph neural network optimized using a multi-task objective on simulated events. We report the physics and computational performance of the MLPF algorithm on a Monte Carlo dataset of top quark–antiquark pairs produced in proton–proton collisions in conditions similar to those expected for the high-luminosity LHC. The MLPF algorithm improves the physics response with respect to a rule-based benchmark algorithm and demonstrates computationally scalable particle-flow reconstruction in a high-pileup environment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

A Scale‐Adaptive Urban Hydrologic Framework: Incorporating Network‐Level Storm Drainage Pipes Representation

Abstract Below‐ground urban stormwater networks (BUSNs) significantly influence urban flood dynamics, yet their representation at the watershed or larger scales remains challenging. We introduce a scalable urban hydrologic framework that centers on a novel network‐level BUSN representation, balancing the needs for physical basis, parameter parsimony, and computational efficiency. Our framework conceptualizes an urban watershed into four interacting zones: hillslopes (natural), storm‐sewersheds (urban), a sub‐network channel (tributaries), and a main channel. We develop an innovative Graph Theory‐based algorithm to derive network‐level BUSN parameters from publicly available datasets, enabling efficient, scalable parameterization. We demonstrate this framework's applicability at nine representative watersheds in the Houston metropolitan region, USA, with urban imperviousness ranging from 0% to 64% and drainage areas ranging from 24 to 302 . Our model achieves satisfying computational efficiency, completing hourly time step simulations for 18 years in less than 5 sec per watershed on a standard PC. Validation against observed daily streamflow confirms that the model can capture small‐to‐large flood peaks and seasonal and annual water balance over these watersheds. Comparisons with the National Water Model show better performance in predicting flood peaks and overall water balance, underscoring the promises of our new framework for urban hydrologic modeling at large scales. Furthermore, analysis reveals nonlinear relationships between BUSNs' designed capacities and flood reduction effects. Our approach bridges the gap between detailed hydraulic and large‐scale hydrologic models, providing a valuable tool for urban flood prediction and management across broader spatial and temporal scales.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

Sequentially coupled flow and geomechanical simulation with a discrete fracture model for analyzing fracturing fluid recovery and distribution in fractured ultra-low permeability gas reservoirs

More accurate characterization and prediction of the in-situ distribution of fracturing fluid in fractured reservoirs are needed for enhancing well productivity. In this study, an implicit-sequentially coupled flow/geomechanics simulator incorporating an efficient discrete fracture model is developed to model fluid distribution and recovery performance of ultra-low permeability gas reservoirs. The finite-volume and finite-element methods are used for space discretization of the flow and geomechanics equations, respectively, while the backward Euler method is employed for time discretization. The flow and geomechanics equations are solved sequentially based on fixed-stress splitting. An efficient discrete-fracture model is used to explicitly model the fractured system. Flexible unstructured gridding is employed to model arbitrarily-oriented fractures. The interrelations among pore volume, permeability and geomechanical conditions are considered dynamically using two-way coupled flow and geomechanics computations. The geometry of fracture (networks) due to hydraulic fracturing has significant impacts on the fracturing fluid recovery efficiency and ensuing fluid distribution. Under the same injection volume, the fracturing fluid recovery is higher when the fracture geometry is planar. Fluid recovery is relatively lower whenever natural fractures are activated during fracturing treatments; flowback time is also shortened when complex fracture network with enlarged fracture interface is present. Fracturing fluid in hydraulic fractures may leak off into the natural fractures and subsequently imbibes into the surrounding matrix due to capillarity effects. The fracturing fluid recovery and in-situ fluid distribution are sensitive to the shut-in duration and fracture closure behavior. This study analyzes the coupled flow-geomechanical responses of fractured gas reservoirs during the post-fracturing periods. Understanding the fate of the fracturing fluid can provide insights on, to some extent, the stimulated fracture volume, size of the water invasion zone, and efficiency of the fracturing design. The simulation predictions can also provide more accurate initial reservoir conditions (e.g. distributions of different phases and pressure) for long-term well performance estimation.

42 ENGINEERING↗

DOE OSTI2020

Physics for neuromorphic computing

Neuromorphic computing takes inspiration from the brain to create energy-efficient hardware for information processing, capable of highly sophisticated tasks. Systems built with standard electronics achieve gains in speed and energy by mimicking the distributed topology of the brain. Scaling-up such systems and improving their energy usage, speed and performance by several orders of magnitude requires a revolution in hardware. Here, we discuss how including more physics in the algorithms and nanoscale materials used for data processing could have a major impact in the field of neuromorphic computing. We review striking results that leverage physics to enhance the computing capabilities of artificial neural networks, using resistive switching materials, photonics, spintronics and other technologies. We discuss the paths that could lead these approaches to maturity, towards low-power, miniaturized chips that could infer and learn in real time.

device physics↗

DOE OSTI2023

Effective cosmic density field reconstruction with convolutional neural network

ABSTRACT We present a cosmic density field reconstruction method that augments the traditional reconstruction algorithms with a convolutional neural network (CNN). Following previous work, the key component of our method is to use the reconstructed density field as the input to the neural network. We extend this previous work by exploring how the performance of these reconstruction ideas depends on the input reconstruction algorithm, the reconstruction parameters, and the shot noise of the density field, as well as the robustness of the method. We build an eight-layer CNN and train the network with reconstructed density fields computed from the Quijote suite of simulations. The reconstructed density fields are generated by both the standard algorithm and a new iterative algorithm. In real space at z = 0, we find that the reconstructed field is 90 per cent correlated with the true initial density out to $k\sim 0.5 \, \mathrm{ h}\, \rm {Mpc}^{-1}$, a significant improvement over $k\sim 0.2 \, \mathrm{ h}\, \rm {Mpc}^{-1}$ achieved by the input reconstruction algorithms. We find similar improvements in redshift space, including an improved removal of redshift space distortions at small scales. We also find that the method is robust across changes in cosmology. Additionally, the CNN removes much of the variance from the choice of different reconstruction algorithms and reconstruction parameters. However, the effectiveness decreases with increasing shot noise, suggesting that such an approach is best suited to high density samples. This work highlights the additional information in the density field beyond linear scales as well as the power of complementing traditional analysis approaches with machine learning techniques.

Astronomy & Astrophysics↗

DOE OSTI2023

Tree-based solvers for adaptive mesh refinement code FLASH – III: a novel scheme for radiation pressure on dust and gas and radiative transfer from diffuse sources

Radiation is an important contributor to the energetics of the interstellar medium, yet its transport is difficult to solve numerically. We present a novel approach towards solving radiative transfer of diffuse sources via backwards ray tracing. Here, we focus on the radiative transfer of infrared radiation and the radiation pressure on dust. The new module, TREERAY/RADPRESSURE, is an extension to the novel radiative transfer method TREERAY implemented in the grid-based Magneto-Hydrodynamics code FLASH. In TREERAY/RADPRESSURE, every cell and every star particle is a source of infrared radiation. We also describe how gas, dust, and radiation are coupled via a chemical network. This allows us to compute the local dust temperature in thermal equilibrium, leading to a significantly improvement over the classical grey approximation. In several tests, we demonstrate that the scheme produces the correct radiative intensities as well as the correct momentum input by radiation pressure. Subsequently, we apply our new scheme to model massive star formation from a collapsing, turbulent core of 150 M ⊙ . We include the effects of both, ionizing and infrared radiation on the dynamics of the core. We find that the newborn massive star prevents fragmentation in its proximity due to radiative heating. Over time, dust and radiation temperature equalize, while the gas temperature can be either warmer due to shock heating or colder due to insufficient dust–gas coupling. Compared to gravity, the effects of radiation pressure are insignificant for the stellar mass on the simulated time-scale in this work.

(ISM:) HII regions↗

DOE OSTI2024

Essay: Quantum Sensing with Atomic, Molecular, and Optical Platforms for Fundamental Physics

Atomic, molecular, and optical (AMO) physics has been at the forefront of the development of quantum science while laying the foundation for modern technology. With the growing capabilities of quantum control of many atoms for engineered many-body states and quantum entanglement, a key question emerges: what critical impact will the second quantum revolution with ubiquitous applications of entanglement bring to bear on fundamental physics? In this Essay, we argue that a compelling long-term vision for fundamental physics and novel applications is to harness the rapid development of quantum information science to define and advance the frontiers of measurement physics, with strong potential for fundamental discoveries. As quantum technologies, such as fault-tolerant quantum computing and entangled quantum sensor networks, become much more advanced than today’s realization, we wonder what doors of basic science can these tools unlock. We anticipate that some of the most intriguing and challenging problems, such as quantum aspects of gravity, fundamental symmetries, or new physics beyond the minimal standard model, will be tackled at the emerging quantum measurement frontier. . Published by the American Physical Society 2024

Physics↗

DOE OSTI2025

Inference of response functions with the help of machine-learning algorithms

Response functions are a key quantity to describe the near-equilibrium dynamics of strongly interacting many-body systems. Recent techniques that attempt to overcome the challenges of calculating these ab initio have employed expansions in terms of orthogonal polynomials. We employ a neural network prediction algorithm to reconstruct a response function 𝑆⁡(𝜔) defined over a range in frequencies 𝜔. Here, we represent the calculated response function as a truncated Chebyshev series whose coefficients can be optimized to reduce the representation error. We compare the quality of response functions obtained using coefficients calculated using a neural network (NN) algorithm with those computed using the Gaussian integral transform (GIT) method. In the regime where only a small number of terms in the Chebyshev series are retained, we find that the NN scheme outperforms the GIT method.

Kurkcuoglu, Doga Murat [Fermi National Accelerator↗

DOE OSTI2022

Analyzing Data Privacy for Edge Systems

Internet-of-Things (IoT)-based streaming applications are all around us. Currently, we are transitioning from IoT processing being performed on the cloud to the edge. While moving to the edge provides significant networking efficiency benefits, IoT edge computing creates significant data privacy concerns. We propose a methodology that can successfully privacy protect the continual data streams generated by sensors on the edge device. We implement local differential privacy on streaming data and incorporate Bayesian inference and Gaussian process to evaluate the privacy policy. We demonstrate our methodology on a real-world smart meter testbed and identify the optimal privacy protection settings.

Kotevska, Olivera↗

DOE OSTI2026

Netload Range Cost Curves for Coordinated Transmission-Distribution Planning Under DER Growth Uncertainty

The increasing penetration of distributed energy resources (DERs) requires better coordination between transmission and distribution (T&D) planning to ensure system security and cost efficiency. However, misaligned planning horizons, computational burdens, and privacy concerns hinder effective coordination, leading to either underutilized resources caused by overinvestments or reliability risks due to underinvestment. To address this challenge, we introduce netload range cost curves (NRCCs), a novel approach for managing long-term DER growth uncertainty through T&D coordination, while preserving existing data-sharing and regulatory structures. NRCCs provide pairs of (i) peak substation netload guarantees and (ii) corresponding distribution upgrade options and costs, enabling their seamless integration into transmission planning workflows. To compute NRCCs efficiently, we develop a transmission-aware distribution network planning (TADNP), which is subsequently integrated to an iterative computation procedure. These NRCCs are then embedded into an NRCC-informed transmission planning model to enable resource-efficient coordination. We illustrate our proposed approach with a case study based on realistic distribution and transmission systems in the San Francisco Bay Area, California. Our results indicate the possibility of dramatic savings in transmission investments by incorporating the proposed NRCC-integrated T&D coordination framework.

Li, Yujia↗

DOE OSTI2025

Ocelot: An Interactive, Efficient Distributed Compression-As-a-Service Platform With Optimized Data Compression Techniques

Large volumes of data generated by scientific simulations, genome sequencing, and other applications need to be moved among clusters for data collection/analysis. Data compression techniques have effectively reduced data storage and transfer costs. However, users' requirements on interactively controlling both data quality and compression ratios are non-trivial to fulfill. Here, we propose a novel Compression-as-a-Service (CaaS) platform called Ocelot with four important contributions: (1) It offers real-time visualization, interactive compression, and transfer of scientific datasets. (2) It incorporates new strategies for compressing diverse types of datasets more effectively than traditional methods. (3) It provides an effective method for estimating the compression ratio and execution time of compression tasks. (4) Experiments on multiple real-world datasets on geographically distributed computers show that Ocelot can significantly improve data transfer efficiency with a performance gain of more than 10x in computing clusters with relatively slow networks.

compression as a service (CaaS)↗

DOE OSTI2022

DFSynthesizer: Dataflow-based Synthesis of Spiking Neural Networks to Neuromorphic Hardware

Spiking Neural Networks (SNNs) are an emerging computation model that uses event-driven activation and bio-inspired learning algorithms. SNN-based machine learning programs are typically executed on tile-based neuromorphic hardware platforms, where each tile consists of a computation unit called a crossbar, which maps neurons and synapses of the program. However, synthesizing such programs on an off-the-shelf neuromorphic hardware is challenging. This is because of the inherent resource and latency limitations of the hardware, which impact both model performance, e.g., accuracy, and hardware performance, e.g., throughput. We propose DFSynthesizer, an end-to-end framework for synthesizing SNN-based machine learning programs to neuromorphic hardware. The proposed framework works in four steps. First, it analyzes a machine learning program and generates SNN workload using representative data. Second, it partitions the SNN workload and generates clusters that fit on crossbars of the target neuromorphic hardware. Third, it exploits the rich semantics of the Synchronous Dataflow Graph (SDFG) to represent a clustered SNN program, allowing for performance analysis in terms of key hardware constraints such as number of crossbars, dimension of each crossbar, buffer space on tiles, and tile communication bandwidth. Finally, it uses a novel scheduling algorithm to execute clusters on crossbars of the hardware, guaranteeing hardware performance. We evaluate DFSynthesizer with 10 commonly used machine learning programs. Our results demonstrate that DFSynthesizer provides a much tighter performance guarantee compared to current mapping approaches.

Computer Science↗