Supervised Learning in Physical Networks: From Machine Learning to Learning Machines
Not Available
36 MATERIALS SCIENCE↗
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.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
ExaTN: Scalable GPU-Accelerated High-Performance Processing of General Tensor Networks at Exascale
We present ExaTN (Exascale Tensor Networks), a scalable GPU-accelerated C++ library which can express and process tensor networks on shared- as well as distributed-memory high-performance computing platforms, including those equipped with GPU accelerators. Specifically, ExaTN provides the ability to build, transform, and numerically evaluate tensor networks with arbitrary graph structures and complexity. It also provides algorithmic primitives for the optimization of tensor factors inside a given tensor network in order to find an extremum of a chosen tensor network functional, which is one of the key numerical procedures in quantum many-body theory and quantum-inspired machine learning. Numerical primitives exposed by ExaTN provide the foundation for composing rather complex tensor network algorithms. We enumerate multiple application domains which can benefit from the capabilities of our library, including condensed matter physics, quantum chemistry, quantum circuit simulations, as well as quantum and classical machine learning, for some of which we provide preliminary demonstrations and performance benchmarks just to emphasize a broad utility of our library.
97 MATHEMATICS AND COMPUTING↗
Mean Field Theory of Self‐Organizing Memristive Connectomes
Abstract Biological neuronal networks are characterized by nonlinear interactions and complex connectivity. Given the growing impetus to build neuromorphic computers, understanding physical devices that exhibit structures and functionalities similar to biological neural networks is an important step toward this goal. Self‐organizing circuits of nanodevices are at the forefront of the research in neuromorphic computing, as their behavior mimics synaptic plasticity features of biological neuronal circuits. However, an effective theory to describe their behavior is lacking. This study provides for the first time an effective mean field theory for the emergent voltage‐induced polymorphism of circuits of a nanowire connectome, showing that the behavior of these circuits can be explained by a low‐dimensional dynamical equation. The equation can be derived from the microscopic dynamics of a single memristive junction in analytical form. The effective model is tested on experiments of nanowire networks and show that it fits both the potentiation and depression of these synapse‐mimicking circuits. It is shown that this theory applies beyond the case of nanowire networks by formulating a general mean‐field theory of conductance transitions in self‐organizing memristive connectomes.
Caravelli, Francesco↗
Surrogate Model for Distribution Networks Influenced by Weather
Here, we propose a method for generating reduced representations of time series and for constructing low dimensional surrogate models for time dependent calculations of power and voltage in distribution networks. We employ Fourier polynomials. The surrogate model strategy is aimed at reducing the computational cost of time dependent simulations, albeit, at the expense of fidelity. The reduced representation is achieved by identifying a small and most consequential subset of degrees of freedom. In power and voltage distribution networks dynamics that are heavily influenced by strong cyclic weather events, e.g., the hourly, diurnal and seasonal cycles, the weather/climate time series spectrum exposes these most energetic components. Once the degrees of freedom are identified their amplitudes are optimized using training data. The key challenge in using spectral methods in power network surrogates is addressing the computation of quotients. For this we propose a numerically-stable deconvolution strategy.
Weather events↗
An Evaluation of the Effect of Network Cost Optimization for Leadership Class Supercomputers
Dragonfly-based networks are an extensively deployed network topology in large-scale high-performance computing due to their cost-effectiveness and efficiency. The US will soon have three Exascale supercomputers for leadership class workloads deployed using dragonfly networks. Compared to indirect networks of similar scale, the dragonfly network has considerably reduced cable lengths, cable counts, and switch counts, resulting in significant network cost savings for a given system size, however, these cost reductions result in reduced global minimal paths and more challenging routing. Additionally, large scale dragonfly networks often require a taper at the global link level, resulting in less bisection bandwidth than is achievable in other traditional non-blocking topologies of equivalent scale. While dragonfly networks have been extensively studied, they have yet to be fully evaluated in an extreme scale (i.e., exascale) system that targets capability workloads. In this paper, we present the results of the first large scale evaluation of a dragonfly network on an exascale system (Frontier) and compare its behavior to a similar scale fat-tree network on a previous generation TOP500 system (Summit). This evaluation aims to determine the effect of network cost optimizations by measuring a tapered topology’s impact on capability workloads. Our evaluation is based on a collection of synthetic microbenchmarks, mini-apps, and full scale applications. It compares the scaling efficiencies of each benchmark between the dragonfly-based Frontier and the fat-tree-based Summit systems. Our results show that a dragonfly network is $\sim \mathbf{3 0 \%}$ more cost efficient than a fat-tree topology, which amortizes to $\sim 3 \%$ of an exascale system cost. Furthermore, while tapered dragonfly networks impose significant tradeoffs, the impacts are not as broad as initially thought and are mostly seen in applications with global communication patterns, particularly all-to-all (e.g., FFT-based algorithms), but also local communication patterns (e.g., nearest-neighbor algorithms) that are sensitive to network performance variability.
Khan, Awais↗
Investigating Scientific Workload Acceleration using BlueField SmartNICs [Slides]
Modern computing platforms whose workloads generate large amounts of network traffic, such as cloud and HPC systems, often suffer from performance bottlenecks associated with the network interface. In order to alleviate the effects of this obstacle, a new generation of accelerators known as ‘SmartNICs’, which are designed to offload low level networking tasks from the processor into the NIC, have emerged.
42 ENGINEERING↗
MassTran Theory Guide (v0.19.1)
The purpose of this report is to document the theoretical models utilized by the computer code MassTran. This report will focus on the theoretical models used to analyze high Mach number, fully compressible, transonic flows in pipes and networks.
97 MATHEMATICS AND COMPUTING↗
Performing a local reduction operation on a parallel computer
A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.
97 MATHEMATICS AND COMPUTING↗
Performing a local reduction operation on a parallel computer
A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.
97 MATHEMATICS AND COMPUTING↗
Systems and methods for fast detection of elephant flows in network traffic
In a system for efficiently detecting large/elephant flows in a network, the rate at which the received packets are sampled is adjusted according to a top flow detection likelihood computed for a cache of flows identified in the arriving network traffic. After observing packets sampled from the network, Dirichlet-Categorical inference is employed to calculate a posterior distribution that captures uncertainty about the sizes of each flow, yielding a top flow detection likelihood. The posterior distribution is used to find the most likely subset of elephant flows. The technique rapidly converges to the optimal sampling rate at a speed O(1/n), where n is the number of packet samples received, and the only hyperparameter required is the targeted detection likelihood.
Gudibanda, Aditya↗
Characterizing 4-string contact interaction using machine learning
Abstract The geometry of 4-string contact interaction of closed string field theory is characterized using machine learning. We obtain Strebel quadratic differentials on 4-punctured spheres as a neural network by performing unsupervised learning with a custom-built loss function. This allows us to solve for local coordinates and compute their associated mapping radii numerically. We also train a neural network distinguishing vertex from Feynman region. As a check, 4-tachyon contact term in the tachyon potential is computed and a good agreement with the results in the literature is observed. We argue that our algorithm is manifestly independent of number of punctures and scaling it to characterize the geometry ofn-string contact interaction is feasible.
Physics↗
Efficient Training of Deep Neural Operator Networks via Randomized Sampling
Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.
Karumuri, Sharmila [Department of Civil & Systems ↗
Exascale Deep Learning to Accelerate Cancer Research
Deep learning, through the use of neural networks, has demonstrated remarkable ability to automate many routine tasks when presented with sufficient data for training. The neural network architecture (e.g. number of layers, types of layers, connections between layers, etc.) plays a critical role in determining what, if anything, the neural network is able to learn from the training data. The trend for neural network architectures, especially those trained on ImageNet, has been to grow ever deeper and more complex. The result has been ever increasing accuracy on benchmark datasets with the cost of increased computational demands. In this paper we demonstrate that neural network architectures can be automatically generated, tailored for a specific application, with dual objectives: accuracy of prediction and speed of prediction. Using MENNDL- an HPC-enabled software stack for neural architecture search-we generate a neural network with comparable accuracy to state-of-the-art networks on a cancer pathology dataset that is also 16× faster at inference. The speedup in inference is necessary because of the volume and velocity of cancer pathology data; specifically, the previous state-of-the-art networks are too slow for individual researchers without access to HPC systems to keep pace with the rate of data generation. Our new model enables researchers with modest computational resources to analyze newly generated data faster than it is collected.
Patton, Robert↗
MD/DPD Multiscale Framework for Predicting Morphology and Stresses of Red Blood Cells in Health and Disease
Healthy red blood cells (RBCs) have remarkable deformability, squeezing through narrow capillaries as small as 3 microns in diameter without any damage. However, in many hematological disorders the spectrin network and lipid bilayer of diseased RBCs may be significantly altered, leading to impaired functionality including loss of deformability. We employ a two-component whole-cell multiscale model to quantify the biomechanical characteristics of the healthy and diseased RBCs, including Plasmodium falciparum-infected RBCs (Pf-RBCs) and defective RBCs in hereditary disorders, such as spherocytosis and elliptocytosis. In particular, we develop a two-step multiscale framework based on coarse-grained molecular dynamics (CGMD) and dissipative particle dynamics (DPD) to predict the static and dynamic responses of RBCs subject to tensile forcing, using experimental information only on the structural defects in the lipid bilayer, cytoskeleton, and their interaction. We first employ CGMD on a small RBC patch to compute the shear modulus, bending stiffness, and network parameters, which are subsequently used as input to a whole-cell DPD model to predict the RBC shape and corresponding stress field. For Pf-RBCs at trophozoite and schizont stages, the presence of cytoadherent knobs elevates the shear response in the lipid bilayer and stiffens the RBC membrane. For RBCs in spherocytosis and elliptocytosis, the bilayer-cytoskeleton interaction is weakened, resulting in substantial increase of the tensile stress in the lipid bilayer. Furthermore, we investigate the transient behavior of stretching deformation and shape relaxation of the normal and defective RBCs. Different from the normal RBCs possessing high elasticity, our simulations reveal that the defective RBCs respond irreversibly, i.e., they lose their ability to recover the normal biconcave shape in successive loading cycles of stretching and relaxation. Our findings provide fundamental insights into the microstructure and biomechanics of RBCs, and demonstrate that the two-step multiscale framework presented here can be used effectively for in silico studies of hematological disorders based on first principles and patient-specific experimental input at the protein level.
Biochemistry & Molecular Biology↗
TH-A-12A-01: Medical Physicist's Role in Digital Information Security: Threats, Vulnerabilities and Best Practices
I. Information Security Background (Speaker = Kevin McDonald) Evolution of Medical Devices Living and Working in a Hostile Environment Attack Motivations Attack Vectors Simple Safety Strategies Medical Device Security in the News Medical Devices and Vendors Summary II. Keeping Radiation Oncology IT Systems Secure (Speaker = Bruce Curran) Hardware Security Double-lock Requirements “Foreign” computer systems Portable Device Encryption Patient Data Storage System Requirements Network Configuration Isolating Critical Devices Isolating Clinical Networks Remote Access Considerations Software Applications / Configuration Passwords / Screen Savers Restricted Services / access Software Configuration Restriction Use of DNS to restrict accesse. Patches / Upgrades Awareness Intrusion Prevention Intrusion Detection Threat Risk Analysis Conclusion Learning Objectives: Understanding how Hospital IT Requirements affect Radiation Oncology IT Systems. Illustrating sample practices for hardware, network, and software security. Discussing implementation of good IT security practices in radiation oncology. Understand overall risk and threats scenario in a networked environment.
98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
4-Clique network minor embedding for quantum annealers
Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
A Graph Analytic Metric for Mitigating Advanced Persistent Threat
This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary node in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.
cybersecurity↗
Uncertainty quantification of machine learning models to improve streamflow prediction under changing climate and environmental conditions
Machine learning (ML) models, and Long Short-Term Memory (LSTM) networks in particular, have demonstrated remarkable performance in streamflow prediction and are increasingly being used by the hydrological research community. However, most of these applications do not include uncertainty quantification (UQ). ML models are data driven and can suffer from large extrapolation errors when applied to changing climate/environmental conditions. UQ is required to quantify the influence of data noises on model predictions and avoid overconfident projections in extrapolation. In this work, we integrate a novel UQ method, called PI3NN, with LSTM networks for streamflow prediction. PI3NN calculates Prediction Intervals by training 3 Neural Networks. It can precisely quantify the predictive uncertainty caused by the data noise and identify out-of-distribution (OOD) data in a non-stationary condition to avoid overconfident predictions. We apply the PI3NN-LSTM method in the snow-dominant East River Watershed in the western US and in the rain-driven Walker Branch Watershed in the southeastern US. Results indicate that for the prediction data which have similar features as the training data, PI3NN precisely quantifies the predictive uncertainty with the desired confidence level; and for the OOD data where the LSTM network fails to make accurate predictions, PI3NN produces a reasonably large uncertainty indicating that the results are not trustworthy and should avoid overconfidence. PI3NN is computationally efficient, robust in performance, and generalizable to various network structures and data with no distributional assumptions. It can be broadly applied in ML-based hydrological simulations for credible prediction.
54 ENVIRONMENTAL SCIENCES↗