Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “large scale network”

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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗
NASA NTRS1991

The formation and evolution of domain walls

Domain walls are sheet-like defects produced when the low energy vacuum has isolated degenerate minima. The researchers' computer code follows the evolution of a scalar field, whose dynamics are determined by its Lagrangian density. The topology of the scalar field determines the evolution of the domain walls. This approach treats both wall dynamics and reconnection. The researchers investigated not only potentials that produce single domain walls, but also potentials that produce a network of walls and strings. These networks arise in axion models where the U(1) Peccei-Quinn symmetry is broken into Z sub N discrete symmetries. If N equals 1, the walls are bounded by strings and the network quickly disappears. For N greater than 1, the network of walls and strings behaved qualitatively just as the wall network shown in the figures given here. This both confirms the researchers' pessimistic view that domain walls cannot play an important role in the formation of large scale structure and implies that axion models with multiple minimum can be cosmologically disastrous.

Press, William H.↗
NASA NTRSDate not supplied

Contact Multigraph Routing: Overview and Implementation

In Delay Tolerant Networking (DTN), the standard routing algorithm used to navigate time-varying networks has been Contact Graph Routing (CGR). In CGR, a globally distributed list of contacts, periods during which two DTN nodes may communicate, is used to construct a contact graph, in which contacts are vertices. A version of Dijkstra’s algorithm can then be used to find paths through this model of the timevarying network. However, since contact graphs may be large compared to the network, potentially growing with the square of the number of network nodes and linearly with the time interval represented, the resulting algorithm does not scale well with the size of the network or time. Any improvement to the routing algorithm will bring significant returns to scale. In a previous paper, we briefly introduced an alternative to the contact graph model for routing. This alternative model is based on a multigraph (a graph in which there may be multiple edges between a pair of vertices) where vertices represent network nodes instead of contacts. A version of Dijkstra’s algorithm in these multigraph models reduces the time needed to perform the same routing computations done in the existing CGR algorithm. Moreover, a modified version of Yen’s algorithm for multigraphs is included. Our variation of CGR, which we call Contact Multigraph Routing (CMR), provides an in-line replacement for the previously used pathfinding algorithms. This paper describes an implementation created based on the CMR approach, and experimental comparisons to traditional CGR are given. In addition, we explore some additional modifications to the routing pipeline traditionally assumed in CGR. These modifications range from the theoretical to the practical in terms of size and scope. We step forward our understanding of sheaftheoretic networking and describe how to model the routing pipeline using sheaves. We detail some enhanced route selection criteria that addresses some of the added complexity of DTNbased systems. We also include a future works section on future improvements and implementations that would be of service to the broader DTN community.

contact graph routing↗
DOE OSTI2024

MDLoader: A Hybrid Model-Driven Data Loader for Distributed Graph Neural Network Training

Scalable data management is essential for processing large scientific dataset on HPC platforms for distributed deep learning. In-memory distributed storage is preferred for its speed, enabling rapid, random, and frequent data access required by stochastic optimizers. Processes use one-sided or collective communication to fetch remote data, with optimal performance depending on (i) dataset characteristics, (ii) training scale, and (iii) interconnection network. Empirical analysis shows collective communication excels with larger mini-batch sizes and/or fewer processes, whereas one-sided communication outperforms at larger scales. We propose MDLoader, a hybrid in-memory data loader for distributed graph neural network training. MDLoader features a model-driven performance estimator that dynamically selects between one-sided and collective communication at the beginning of training using Tree of Parzen Estimators (TPE). Evaluations on NERSC Perlmutter and OLCF Summit show MDLoader outperforms single-backend loaders by up to 2.83 × and predicts the suitable communication method with 96.3% (Perlmutter) and 94.3% (Summit) success rate.

Bae, Jonghyun↗
DOE OSTI2020

Learning to Count Grave Sites for Cemetery Observation Models With Satellite Imagery

Understanding how people occupy open spaces is important for research in support of population modeling, policy, national security, emergency response, and sustainability. For the past decade, there has been an increase in research toward capturing and reporting population dynamics and patterns of life at the building level and in some open public spaces such as cemeteries and parks. This is done through observation models developed from local sociocultural information acquired at various spatiotemporal scales to inform night, day, and episodic population occupancy estimates (people/1000 sq ft). Sociocultural information for cemeteries and parks is scarcely available and often collected manually. The process is not only marred by inconsistencies but is laborious and time consuming. In this study, we leverage convolutional neural networks (CNNs) and satellite imagery to derive grave site counts as proxy variables to support scalable and accurate sociocultural data required in a population observation model. Through a hybrid workflow (weak localization plus regression model), we characterize a large scale automation process to counting of grave sites. We evaluate and demonstrate the efficacy of proposed workflow using out-of-data set large satellite imagery and establish its broader impact on cemetery observation models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Architecture for Co-Simulation of Transportation and Distribution Systems with Electric Vehicle Charging at Scale in the San Francisco Bay Area

This work describes the Grid-Enhanced, Mobility-Integrated Network Infrastructures for Extreme Fast Charging (GEMINI) architecture for the co-simulation of distribution and transportation systems to evaluate EV charging impacts on electric distribution systems of a large metropolitan area and the surrounding rural regions with high fidelity. The current co-simulation is applied to Oakland and Alameda, California, and in future work will be extended to the full San Francisco Bay Area. It uses the HELICS co-simulation framework to enable parallel instances of vetted grid and transportation software programs to interact at every model timestep, allowing high-fidelity simulations at a large scale. This enables not only the impacts of electrified transportation systems across a larger interconnected collection of distribution feeders to be evaluated, but also the feedbacks between the two systems, such as through control systems, to be captured and compared. The findings are that with moderate passenger EV adoption rates, inverter controls combined with some distribution system hardware upgrades can maintain grid voltages within ANSI C.84 range A limits of 0.95 to 1.05 p.u. without smart charging. However, EV charging control may be required for higher levels of charging or to reduce grid upgrades, and this will be explored in future work.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Large-scale proteomic analysis of Alzheimer’s disease brain and cerebrospinal fluid reveals early changes in energy metabolism associated with microglia and astrocyte activation

Our understanding of Alzheimer’s disease (AD) pathophysiology remains incomplete. Here, for this work, we used quantitative mass spectrometry and coexpression network analysis to conduct the largest proteomic study thus far on AD. A protein network module linked to sugar metabolism emerged as one of the modules most significantly associated with AD pathology and cognitive impairment. This module was enriched in AD genetic risk factors and in microglia and astrocyte protein markers associated with an anti-inflammatory state, suggesting that the biological functions it represents serve a protective role in AD. Proteins from this module were elevated in cerebrospinal fluid in early stages of the disease. In this study of >2,000 brains and nearly 400 cerebrospinal fluid samples by quantitative proteomics, we identify proteins and biological processes in AD brains that may serve as therapeutic targets and fluid biomarkers for the disease.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Tensile Modeling PVC Gels for Electrohydraulic Actuators

Polyvinyl chloride (PVC)-dibutyl adipate (DBA) gels are a fascinating dielectric elastomer actuator showing promise in soft robotics. When actuated with high voltages, the gel deforms towards the anode. A recent application of PVC gels in electrohydraulic actuators motivates elastic and hyperelastic constitutive relationships for tensile loading modes. PVC gels with plasticizer-to-polymer weight ratios of 2:1, 4:1, 6:1, and 8:1 w/w were evaluated. PVC gels exhibit a linear elastic region up to 25% strain. The elastic modulus decreased with increasing plasticizer content from 288.8 kPa, 56.1 kPa, 24.7 kPa, to 11 kPa. Poisson’s ratio also decreased with increasing plasticizer content from 0.42, 0.43, 0.39, to 0.35. We suggest that the decrease in polymer concentration facilitates a weakly interconnected polymer network susceptible to chain slippage that hinders the network response, thus lowering Poisson’s ratio. Our work suggests that PVC gels can be treated as isotropic and incompressible for large strains and hyperelastic modeling; however, highly plasticized gels tend to act less incompressible at small strains. The power scaling law between the elastic modulus and plasticizer weight ratio showed high agreement, making the elastic modulus deterministic for any plasticizer content. The Neo–Hookean, Mooney–Rivlin, Yeoh, Gent, Ogden, and extended tube hyperelastic constitutive models are investigated. The Yeoh model shows the highest feasibility when evaluated up to 3.5 stretch, showing a maximum normalized root-mean-square-error of 6.85%. Together, these findings establish a constitutive basis for PVC-DBA gels, incorporating small strain elasticity, large strain non-linear behavior, and network analysis while providing suggestive insight into the network structure required for accurately modeling the EPIC.

Polymer Science↗
NASA NTRS2010

Distributed Disdrometer and Rain Gauge Measurement Infrastructure Developed for GPM Ground Validation

Global Precipitation Mission (GPM)retrieval algorithm validation requires datasets characterizing the 4-D structure, variability, and correlation properties of hydrometeor particle size distributions (PSD) and accumulations over satellite fields of view (FOV;<10 km). Collection of this data provides a means to assess retrieval errors related to beam filling and algorithm PSD assumptions. Hence, GPM Ground Validation is developing a deployable network of precipitation gauges and disdrometers to provide fine-scale measurements of PSD and precipitation accumulation variability. These observations will be combined with dual-frequency, polarimetric, and profiling radar data in a bootstrapping fashion to extend validated PSD measurements to a large coverage domain. Accordingly, a total of 24 Parsivel disdrometers(PD), 5 3rd-generation 2D Video Disdrometers (2DVD), 70 tipping bucket rain gauges (TBRG),9 weighing gauges, 7 Hot-Plate precipitation sensors (HP), and 3 Micro Rain Radars (MRR) have been procured. In liquid precipitation the suite of TBRG, PD and 2DVD instruments will quantify a broad spectrum of rain rate and PSD variability at sub-kilometer scales. In the envisioned network configuration 5 2DVDs will act as reference points for 16 collocated PD and TBRG measurements. We find that PD measurements provide similar measures of the rain PSD as observed with collocated 2DVDs (e.g., D0, Nw) for rain rates less than 15 mm/hr. For heavier rain rates we will rely on 2DVDs for PSD information. For snowfall we will combine point-redundant observations of SWER distributed over three or more locations within a FOV. Each location will contain at least one fenced weighing gauge, one HP, two PDs, and a 2DVD. MRRs will also be located at each site to extend the measurement to the column. By collecting SWER measurements using different instrument types that employ different measurement techniques our objective is to separate measurement uncertainty from natural variability in SWER and PSD. As demonstrated using C3VP polarimetric radar, gauge, and 2DVD/PD datasets these measurements can be combined to bootstrap an area wide SWER estimate via constrained modification of density-diameter and radar reflectivity-snowfall relationships. These data will be combined with snowpack, airborne microphysics, radar, radiometer, and tropospheric sounding data to refine GPM snowfall retrievals. The gauge and disdrometer instruments are being developed to operate autonomously when necessary using solar power and wireless communications. These systems will be deployed in numerous field campaigns through 2016. Planned deployment of these systems include field campaigns in Finland (2010), Oklahoma (2011), Canada (2012) and North Carolina (2013). GPM will also deploy 20 pairs of TBRGs within a 25 km2 region along the Virginia coast under NASA NPOL radar coverage in order to quantify errors in point-area rainfall measurements.

Petersen, Walter A.↗
DOE OSTI2022

Trainability of Dissipative Perceptron-Based Quantum Neural Networks

Several architectures have been proposed for quantum neural networks (QNNs), with the goal of efficiently performing machine learning tasks on quantum data. Rigorous scaling results are urgently needed for specific QNN constructions to understand which, if any, will be trainable at a large scale. Here, we analyze the gradient scaling (and hence the trainability) for a recently proposed architecture that we call dissipative QNNs (DQNNs), where the input qubits of each layer are discarded at the layer’s output. We find that DQNNs can exhibit barren plateaus, i.e., gradients that vanish exponentially in the number of qubits. Moreover, we provide quantitative bounds on the scaling of the gradient for DQNNs under different conditions, such as different cost functions and circuit depths, and show that trainability is not always guaranteed. Here our work represents the first rigorous analysis of the scalability of a perceptron-based QNN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Quantifying Atomically Dispersed Catalysts Using Deep Learning Assisted Microscopy

The catalytic performance of atomically dispersed catalysts (ADCs) is greatly influenced by their atomic configurations, such as atom–atom distances, clustering of atoms into dimers and trimers, and their distributions. Scanning transmission electron microscopy (STEM) is a powerful technique for imaging ADCs at the atomic scale; however, most STEM analyses of ADCs thus far have relied on human labeling, making it difficult to analyze large data sets. Here, we introduce a convolutional neural network (CNN)-based algorithm capable of quantifying the spatial arrangement of different adatom configurations. The algorithm was tested on different ADCs with varying support crystallinity and homogeneity. Results show that our algorithm can accurately identify atom positions and effectively analyze large data sets. Here, this work provides a robust method to overcome a major bottleneck in STEM analysis for ADC catalyst research. We highlight the potential of this method to serve as an on-the-fly analysis tool for catalysts in future in situ microscopy experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Deep-Learning Interatomic Potential Connects Molecular Structural Ordering to the Macroscale Properties of Polyacrylonitrile

Polyacrylonitrile (PAN) is an important commercial polymer, bearing atactic stereochemistry resulting from nonselective radical polymerization. As such, an accurate, fundamental understanding of governing interactions among PAN molecular units is indispensable for advancing the design principles of final products at reduced processability costs. While ab initio molecular dynamics (AIMD) simulations can provide the necessary accuracy for treating key interactions in polar polymers, such as dipole–dipole interactions and hydrogen bonding, and analyzing their influence on the molecular orientation, their implementation is limited to small molecules only. Herein, we show that the neural network interatomic potentials (NNIPs) that are trained on the small-scale AIMD data (acquired for oligomers) can be efficiently employed to examine the structures and properties at large scales (polymers). NNIP provides critical insight into intra- and interchain hydrogen-bonding and dipolar correlations and accurately predicts the amorphous bulk PAN structure validated by modeling the experimental X-ray structure factor. Furthermore, the NNIP-predicted PAN properties, such as density and elastic modulus, are in good agreement with their experimental values. Overall, the trend in the elastic modulus is found to correlate strongly with the PAN structural orientations encoded in the Hermans orientation factor. In conclusion, this study enables the ability to predict the structure–property relations for PAN and analogues with sustainable ab initio accuracy across scales.

36 MATERIALS SCIENCE↗
NASA NTRS1981

The information systems heritage

This paper addresses key developments in the evolution of information systems over the past five decades. Major areas covered include the growth of imaging sensors from such pioneering devices as the iconoscope and orthicon which ushered in television, through a wide range of vidicon tubes, to the solid-state arrays which characterize current systems; the phenomenal expansion of electronic communications from telegraph and telephone wires, through the introduction of broadcast and microwave relay services, to the present era of worldwide satellite communications and data networks; and the key role of digital computers from their ancient precursors like the abacus and the mechanical calculating engines, through the appearance of the first large-scale electronic computers and their transistorized successors, to the rapid proliferation of miniaturized processors which impact every aspect of aerospace systems today.

Kurzhals, P. R.↗
NASA NTRS1985

Tail phenomena

An overview of tail phenomena is presented based on worldwide submissions to the Large-Scale Phenomena Discipline Specialist Team of the International Halley Watch. Examples of tail phenomena and science are presented along with estimates of total expected yield from the Network. The archive of this material will clearly be very valuable for studying the solar-wind/comet interaction during the 1985-1986 apparition of Halley's Comet.

Brandt, J. C.↗
NASA NTRS2019

Terrestrial Water Storage

Terrestrial water storage can be defined as the summation of all water on the land surface and in the subsurface. It includes surface soil moisture, root zone soil moisture, groundwater, snow,ice, water stored in the vegetation, river and lake water. Terrestrial water storage (TWS) changes have been observed by the Gravity Recovery and Climate Experiment (GRACE) mission since 2002. GRACE has provided an unprecedented view of the terrestrial water storage variations at large scales. Extremes in water storage often are associated with droughts and flooding events because they are driven by the surplus or deficit of water. Few hydrologic observing networks yield sufficient data for comprehensive monitoring of changes in the total amount of water stored in a region. GRACE observations have helped to fill this gap. This book chapter is divided into 4 sections.Section 1 provides an overview of the GRACE mission. Section 2 reviews the terrestrial water storage solutions that are available. Section 3 describes regional to global applications of GRACE for monitoring extremes in the terrestrial water storage, including droughts and flooding events. Conclusions and future directions are reported in Section 4.

Terrestrial Water Storage↗
DOE OSTI2020

Data optimization for large batch distributed training of deep neural networks

Distributed training in deep learning (DL) is common practice as data and models grow. The current practice for distributed training of deep neural networks faces the challenges of communication bottlenecks when operating at scale, and model accuracy deterioration with an increase in global batch size. Present solutions focus on improving message exchange efficiency as well as implementing techniques to tweak batch sizes and models in the training process. The loss of training accuracy typically happens because the loss function gets trapped in a local minima. We observe that the loss landscape minimization is shaped by both the model and training data and propose a data optimization approach that utilizes machine learning to implicitly smooth out the loss landscape resulting in fewer local minima. Our approach filters out data points which are less important to feature learning, enabling us to speed up the training of models on larger batch sizes to improved accuracy.

Gahlot, Shubhankar↗
DOE OSTI2020

Union: An Automatic Workload Manager for Accelerating Network Simulation

With the rapid growth of the machine learning applications, the workloads of future HPC systems are anticipated to be a mix of scientific simulation, big data analytics, and machine learning applications. Simulation is a great research vehicle to understand the performance implications of co-running scientific applications with big data and machine learning workloads on large-scale systems. In this paper, we present Union, a workload manager that provides an automatic framework to facilitate hybrid workload simulation in CODES. Furthermore, we use Union, along with CODES, to investigate various hybrid workloads composed of traditional simulation applications and emerging learning applications on two dragonfly systems. The experiment results show that both message latency and communication time are important performance metrics to evaluate network interference. Network interference on HPC applications is more reflected by the message latency variation, whereas ML application performance depends more on the communication time.

heterogeneous workloads↗
DOE OSTI2022

Accelerating amorphous polymer electrolyte screening by learning to reduce errors in molecular dynamics simulated properties

Polymer electrolytes are promising candidates for the next generation lithium-ion battery technology. Large scale screening of polymer electrolytes is hindered by the significant cost of molecular dynamics (MD) simulation in amorphous systems: the amorphous structure of polymers requires multiple, repeated sampling to reduce noise and the slow relaxation requires long simulation time for convergence. Here, we accelerate the screening with a multi-task graph neural network that learns from a large amount of noisy, unconverged, short MD data and a small number of converged, long MD data. We achieve accurate predictions of 4 different converged properties and screen a space of 6247 polymers that is orders of magnitude larger than previous computational studies. Further, we extract several design principles for polymer electrolytes and provide an open dataset for the community. Our approach could be applicable to a broad class of material discovery problems that involve the simulation of complex, amorphous materials.

36 MATERIALS SCIENCE↗