Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 649 records · Page 36

miniGAN: a proxy application for generative adversarial networks

miniGAN is a python-based machine learning proxy application for generative adversarial networks, developed through the Exascale Computing Project's (ECP) ExaLearn project. It will be included in the main ECP proxy application and the machine learning proxy application suite. It is a proxy for ECP cosmological(CosmoFlow, ExaGAN) and wind energy(ExaWind) applications. miniGAN will be distributed to ECP hardware vendors as part of hardware codesign. miniGAN uses the Numpy/PyTorch/TensorFlow/Keras/Horovod frameworks and libraries. It also relies on the Kokkos and Kokkos-Kernels packages developed here at Sandia Labs. SAND2020-2038 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Ellis, John↗

pnnl/arena

CFA ARENA is a novel programming model with the support of a runtime targeting asynchronous data-centric execution paradigm in a distributed system. All the machine nodes in ARENA are connected by a ring network to bring the specialized computation to the data rather than the reverse to minimize data movement. The programming interfaces are implemented using C++

Tan, Cheng↗

Scalable manufacturing of quantum light emitters in silicon under rapid thermal annealing

Quantum light sources play a fundamental role in quantum technologies ranging from quantum networking to quantum sensing and computation. The development of these technologies requires scalable platforms, and the recent discovery of quantum light sources in silicon represents an exciting and promising prospect for scalability. The usual process for creating color centers in silicon involves carbon implantation into silicon, followed by rapid thermal annealing. However, the dependence of critical optical properties, such as the inhomogeneous broadening, the density, and the signal-to-background ratio, on centers implantation steps is poorly understood. We investigate the role of rapid thermal annealing on the dynamic of the formation of single color centers in silicon. We find that the density and the inhomogeneous broadening greatly depend on the annealing time. We attribute the observations to nanoscale thermal processes occurring around single centers and leading to local strain fluctuations. Our experimental observation is supported by theoretical modeling based on first principles calculations. The results indicate that annealing is currently the main step limiting the scalable manufacturing of color centers in silicon.

42 ENGINEERING↗

Degradation of Ta 2 O 5 / SiO 2 dielectric cavity mirrors in ultra-high vacuum

In order for optical cavities to enable strong light-matter interactions for quantum metrology, networking, and scalability in quantum computing systems, their mirrors must have minimal losses. However, high-finesse dielectric cavity mirrors can degrade in ultra-high vacuum (UHV), increasing the challenges of upgrading to cavity-coupled quantum systems. We observe the optical degradation of high-finesse dielectric optical cavity mirrors after high-temperature UHV bake in the form of a substantial increase in surface roughness. We provide an explanation of the degradation through atomic force microscopy (AFM), X-ray fluorescence (XRF), selective wet etching, and optical measurements. We find the degradation is explained by oxygen reduction in Ta 2 O 5 followed by growth of tantalum sub-oxide defects with height to width aspect ratios near ten. We discuss the dependence of mirror loss on surface roughness and finally give recommendations to avoid degradation to allow for quick adoption of cavity-coupled systems.

Optics↗

Modeling Astrophysical Explosions and Nucleosynthesis (Final Technical Report)

The goal of this project was to further our theoretical understanding of the extreme physics and heavy element nucleosynthesis occurring in stellar explosions, in particular supernovae and neutron star mergers. To study these systems, we further developed and applied numerical simulations (radiation hydrodynamical models and nuclear reaction networks) run on high performance computers. The numerical calculations and companion theoretical analysis helped to better define the sites of astrophysical nucleosynthesis, and make predictions of the associated observables (nucleosynthetic yields and electromagnetic signals) that can be used to anticipate and interpret experimental data. This project enhances the scientific value of the nuclear data obtained from current and future experimental facilities (e.g., rare isotope beams) by improving our understanding of the astrophysical context and specific physical conditions under which we expect such reactions to take place in Nature.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

How is statistical thinking useful for evaluating foundation models?

Good’s statement appears to be rather prescient – while humanity has marched on through to the 21st century, modern artificial intelligence (AI), driven by a menagerie of immense deep-neural-network architectures aided with parallel computation, seems positioned to change life as we know it. It would be an understatement to say that the world has been captivated by AI. Recent engineering feats, such as autonomous vehicles and generative AI, have gripped the public sphere, and AI is poised to disrupt a host of industries – including software, pharmaceuticals, healthcare, manufacturing, entertainment, and a slew of others; indeed, one is hard pressed to find any industry that does not claim to bear an impact from the so-called AI revolution.

97 MATHEMATICS AND COMPUTING↗

Implementation of Detailed Polyethylene Pyrolysis Kinetics into CFD Simulations using Machine Learning

Municipal solid waste (MSW) and waste plastics have received significant attention due to the issues of waste generation and storage, as well as their potential as an energy resource. High-density polyethylene (HDPE) makes up a large portion of plastic waste and has been the subject of several conversion studies. However, the mechanisms associated with converting HDPE through pyrolysis and gasification are extensive and complex making them difficult to implement into high-fidelity computational fluid dynamic (CFD) simulations. For this project, a primary pyrolysis mechanism containing 42 unique species and 737 heterogeneous reactions was used to generate kinetic data over a range of operating conditions. A machine learning (ML) model was developed to replicate the results of the detailed pyrolysis mechanism while significantly increasing the computational efficiency. A deep operator network (DeepONet) architecture was adopted to train the model using time steps relevant to CFD simulations. The ML used physics-based loss functions to ensure mass conservation. The ML model has been deployed in simple MFiX CFD simulations, single particle, and an experimental drop tube reactor, and has shown promising performance compared to the original scheme.

Houston, Ross↗

Explosion Detection using Transfer Learning via YAMNet [Poster]

The acoustic data of explosions and noise collected on smartphones were fed to the YAMNet model to obtain the scores of each class. The data was split 60/20/20 for training, validation, and testing. A single-layered neural network was trained using the computed scores to predict if the data was an explosion or noise. The trained model was then combined with the YAMNet model. The combined model was tested with the ESC-50 dataset to investigate overall accuracy and class based false positive rates.

98 - NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL↗

High-Voltage DC MULTI-terminal SIMulation (HVDC MULTISIM): Technical Program Summary

Expansion of the power grid in the USA is essential to fulfilling the rising energy demand of the country. In particular, the transmission grid, a network of electrical energy corridors that enable the flow of large amounts of energy from the point of generation to the point of consumption, needs significant expansion to cater to this growth of electrification. The current infrastructure is also dated, and any new transmission corridor should be based on a vision of building a modern infrastructure that is futureproof. High voltage DC (HVDC) transmission technology falls in this category: it is the most economical way to build large transmission lines and relies on sophisticated electronics and flexible controls, rather than just passive components like switchgear and transformers. This project is aimed at establishing the technical and economic feasibility of a network of HVDC lines that are interconnected to form a multi-terminal DC network. HVDC transmission is not a new technology and United States has a number of such lines; however, these are point to point transmissions and do not form a DC grid. Modeling and analyzing DC grids is challenging since there are no established modeling tools and the traditional ways of modeling AC grids fall short of providing the fidelity required the fast dynamics of the DC grid. This project aims to build a software-in-the-loop simulator for a multi-terminal HVDC grid, called MULTISIM and, establish new control and protection algorithms to operate such a connected DC system. NLR, a key partner, established the core framework of the MULTISIM simulator and validated its functionality. The GE Vernova team, created a full-scale model of a four-terminal HVDC network using PSCAD (Power Systems Computer Aided Design) software and established the baseline performance of the system during normal and fault operation. The project was started on 10/12024 with a kick-off meeting held on 12/11/2024 and ran through two quarters till termination. All the tasks, milestones and deliverables during this period were met. Several interim reports detailing the various tasks were submitted. The following sections provide details on the completed tasks till the project pause and termination after Q2.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Confinement and Kink Entanglement Asymmetry on a Quantum Ising Chain

In this work, we explore the interplay of confinement, string breaking and entanglement asymmetry on a 1D quantum Ising chain. We consider the evolution of an initial domain wall and show that, surprisingly, while the introduction of confinement through a longitudinal field typically suppresses entanglement, it can also serve to increase it beyond a bound set for free particles. Our model can be tuned to conserve the number of domain walls, which gives an opportunity to explore entanglement asymmetry associated with link variables. We study two approaches to deal with the non-locality of the link variables, either directly or following a Kramers-Wannier transformation that maps bond variables (kinks) to site variables (spins). We develop a numerical procedure for computing the asymmetry using tensor network methods and use it to demonstrate the different types of entanglement and entanglement asymmetry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Wide neural networks with bottlenecks are deep Gaussian processes

There has recently been much work on the "wide limit" of neural networks, where Bayesian neural networks (BNNs) are shown to converge to a Gaussian process (GP) as all hidden layers are sent to infinite width. However, these results do not apply to architectures that require one or more of the hidden layers to remain narrow. In this paper, we consider the wide limit of BNNs where some hidden layers, called "bottlenecks", are held at finite width. The result is a composition of GPs that we term a "bottleneck neural network Gaussian process" (bottleneck NNGP). Although intuitive, the subtlety of the proof is in showing that the wide limit of a composition of networks is in fact the composition of the limiting GPs. We also analyze theoretically a single-bottleneck NNGP, finding that the bottleneck induces dependence between the outputs of a multi-output network that persists through extreme post-bottleneck depths, and prevents the kernel of the network from losing discriminative power at extreme post-bottleneck depths.

97 MATHEMATICS AND COMPUTING↗

Solving inverse problems in stochastic models using deep neural networks and adversarial training

Inverse problems associated with stochastic models constitute a significant portion of scientific and engineering applications. In such cases the unknown quantities are distributions. The applicability of traditional methods is limited because of their demanding assumptions or prohibitive computational consumption; for example, maximum likelihood methods require closed-form density functions, and Markov Chain Monte Carlo needs a large number of simulations. We propose a new method that estimates the unknown distribution by matching the statistical properties between observed and simulated random processes. We leverage the expressive power of neural networks to approximate the unknown distribution and use a discriminative neural network for computing the statistical discrepancies between the observed and simulated random processes. Here we demonstrated numerically that the proposed methods can estimate both the model parameters and learn complicated unknown distributions.

42 ENGINEERING↗

Encoding integers and rationals on neuromorphic computers using virtual neuron

Abstract Neuromorphic computers emulate the human brain while being extremely power efficient for computing tasks. In fact, they are poised to be critical for energy-efficient computing in the future. Neuromorphic computers are primarily used in spiking neural network–based machine learning applications. However, they are known to be Turing-complete, and in theory can perform all general-purpose computation. One of the biggest bottlenecks in realizing general-purpose computations on neuromorphic computers today is the inability to efficiently encode data on the neuromorphic computers. To fully realize the potential of neuromorphic computers for energy-efficient general-purpose computing, efficient mechanisms must be devised for encoding numbers. Current encoding mechanisms (e.g., binning, rate-based encoding, and time-based encoding) have limited applicability and are not suited for general-purpose computation. In this paper, we present the virtual neuron abstraction as a mechanism for encoding and adding integers and rational numbers by using spiking neural network primitives. We evaluate the performance of the virtual neuron on physical and simulated neuromorphic hardware. We estimate that the virtual neuron could perform an addition operation using just 23 nJ of energy on average with a mixed-signal, memristor-based neuromorphic processor. We also demonstrate the utility of the virtual neuron by using it in some of the μ -recursive functions, which are the building blocks of general-purpose computation.

97 MATHEMATICS AND COMPUTING↗

Analysis and mitigation of parasitic resistance effects for analog in-memory neural network acceleration

To support the increasing demands for efficient deep neural network processing, accelerators based on analog in-memory computation of matrix multiplication have recently gained significant attention for reducing the energy of neural network inference. However, analog processing within memory arrays must contend with the issue of parasitic voltage drops across the metal interconnects, which distort the results of the computation and limit the array size. This work analyzes how parasitic resistance affects the end-to-end inference accuracy of state-of-the-art convolutional neural networks, and comprehensively studies how various design decisions at the device, circuit, architecture, and algorithm levels affect the system's sensitivity to parasitic resistance effects. Here, a set of guidelines are provided for how to design analog accelerator hardware that is intrinsically robust to parasitic resistance, without any explicit compensation or re-training of the network parameters.

97 MATHEMATICS AND COMPUTING↗

A survey of techniques for optimizing transformer inference

Recent years have seen a phenomenal rise in the performance and applications of transformer neural networks. The family of transformer networks, including Bidirectional Encoder Representations from Transformer (BERT), Generative Pretrained Transformer (GPT) and Vision Transformer (ViT), have shown their effectiveness across Natural Language Processing (NLP) and Computer Vision (CV) domains. Transformer-based networks such as ChatGPT have impacted the lives of common men. However, the quest for high predictive performance has led to an exponential increase in transformers' memory and compute footprint. Researchers have proposed techniques to optimize transformer inference at all levels of abstraction. Further, this paper presents a comprehensive survey of techniques for optimizing the inference phase of transformer networks. We survey techniques such as knowledge distillation, pruning, quantization, neural architecture search and lightweight network design at the algorithmic level. We further review hardware-level optimization techniques and the design of novel hardware accelerators for transformers. We summarize the quantitative results on the number of parameters/FLOPs and the accuracy of several models/techniques to showcase the tradeoff exercised by them. We also outline future directions in this rapidly evolving field of research. We believe that this survey will educate both novice and seasoned researchers and also spark a plethora of research efforts in this field.

97 MATHEMATICS AND COMPUTING↗

Detecting hidden layers from spreading dynamics on complex networks

When dealing with spreading processes on networks it can be of the utmost importance to test the reliability of data and identify potential unobserved spreading paths. In this paper we address these problems and propose methods for hidden layer identification and reconstruction. We also explore the interplay between difficulty of the task and the structure of the multilayer network describing the whole system where the spreading process occurs. Our methods stem from an exact expression for the likelihood of a cascade in the susceptible-infected model on an arbitrary graph. We then show that by imploring statistical properties of unimodal distributions and simple heuristics describing joint likelihood of a series of cascades one can obtain an estimate of both existence of a hidden layer and its content with success rates far exceeding those of a null model. Furthermore, we conduct our analyses on both synthetic and real-world networks providing evidence for the viability of the approach presented.

97 MATHEMATICS AND COMPUTING↗

Deep Nonparametric Estimation of Operators between Infinite Dimensional Spaces

Learning operators between infinitely dimensional spaces is an important learning task arising in machine learning, imaging science, mathematical modeling and simulations, etc. This paper studies the nonparametric estimation of Lipschitz operators using deep neural networks. Non-asymptotic upper bounds are derived for the generalization error of the empirical risk minimizer over a properly chosen network class. Under the assumption that the target operator exhibits a low dimensional structure, our error bounds decay as the training sample size increases, with an attractive fast rate depending on the intrinsic dimension in our estimation. Our assumptions cover most scenarios in real applications and our results give rise to fast rates by exploiting low dimensional structures of data in operator estimation. We also investigate the influence of network structures (e.g., network width, depth, and sparsity) on the generalization error of the neural network estimator and propose a general suggestion on the choice of network structures to maximize the learning efficiency quantitatively.

97 MATHEMATICS AND COMPUTING↗

GraphCH: A Deep Framework for Assessing Cyber-Human Aspects in Insider Threat Detection

Insider threat is one of the most damaging cyber attacks that could cause the loss of intellectual property and enterprise data security breaches. Action sequence data such as host logs are used to investigate such threats and develop anomaly-based AI detectors. However, insider threat actions are similar to legitimate user activities, causing AI detectors to fail and suffer from high false alarm rates. Therefore, user cyber activity logs are inadequate to fully unfold insider threats. In this study, we adopt human psychological principles of risk-taking and impulsiveness along with host data to assess the influence and usefulness of human behavioral aspects in insider threat detection. Here, we hypothesize that individuals' impulsive and risk-taking behavior correlates with cyberspace activities. To validate our hypothesis, we conducted an IRB-approved study recruiting 35 participants who work in a large U.S. university and collected their cyber and psychological data for 90 days. Host and human-behavioral data analysis and mapping indicate that impulsive and risk-taking users trigger more system errors causing (un)intentional insider threats and are susceptible to attackers' social engineering and cognitive hacking. Utilizing cyber-human aspects, we introduce a Cyber-Human Graph Neural Network (GNN) based framework GraphCH to identify abnormal user behaviors and detect insider threats.

97 MATHEMATICS AND COMPUTING↗