Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “networking”

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

Feasibility of critical infrastructure protection using network functions for programmable and decoupled ICS policy enforcement over WAN

Industrial control systems (ICS) represent a major component of our critical infrastructure. With the increasing need for more control and monitoring of such systems, ICS have seen an increase in connectivity to wide area networks (WAN) exposing aging equipment to rapidly evolving cybersecurity threats. Furthermore, the ICS data requires a reliability measure from the networks for critical functions for infrastructure monitoring and control. Especially when remote plant sites are involved such as pipelines, energy distribution networks, and transportation, WAN transport impairments most often provide a best effort delivery with no strict reliability guarantees. Network functions can provide a vendor agnostic, programmable critical infrastructure protection with a single maintenance, policy determination, and reliability assurance surface. A network function (NF) can be utilized for policy enforcement over the communication between remote entities and the main control office. This paper presents the research on transparent integration with existing ICS without disrupting communications, resulting in minimal downtime while decoupling the fast paced evolution of defensive security measures from the upgrade cycle of expensive long term hardware. We report our measurements on the resource requirements and overhead in the network for successful NF insertion under a wide variety of network impairments (network packet delay, reordering, and loss). Our paired NF implementation provides a policy enforcement platform extensible to cover myriad cybersecurity-related communication goals, including packet signing for verification, encryption for data privacy, packet filtering and data diode operation (i.e. protecting against eavesdropping, packet injection, and denial-of-service). Furthermore, bundling communication specifications into packet flows allows for tunability in applying policies as coarse- or fine-grained as the needs of the operator. We report on network function resource requirements in the form of required queue depth and network utilization overhead to inform the decision making against hardware cost constraints.

42 ENGINEERING↗
DOE OSTI2023

Non-unimodal and non-concave relationships in the network Macroscopic Fundamental Diagram caused by hierarchical streets

Unimodal, concave relationships between average network productivity and accumulation or density aggregated across spatially compact regions of urban networks—so called network Macroscopic Fundamental Diagrams (MFDs)—have recently been shown to exist on homogeneous street networks. When present, MFD relationships facilitate the modeling of traffic congestion at a regional level and have led to the development of various regional traffic control strategies. However, real street networks are not homogeneous—they generally have a hierarchical structure where some streets (e.g., arterials) promote higher mobility than others (e.g., local roads). Here, this paper examines how the presence of hierarchical roadway structures may potentially cause non-unimodal patterns in a network's MFD. These are observed using three types of tools: analytical models of simple network structures, simulations of various idealized roadway networks, and empirical data. The impacts of street hierarchy depend on how vehicles use different roadway types to move within the network; i.e., their routing strategy. The findings suggest that the presence of roadway hierarchies may lead to MFDs that have non-unimodal or non-concave patterns on the free-flow branch when vehicles route themselves according to user equilibrium principles, which is closest to what would be observed in realistic situations. Such patterns are contrary to what is traditionally assumed in most MFD-based modeling frameworks. However, the unimodal and concave MFD should be expected under system optimal routing conditions that maximize network productivity for a given traffic state.

42 ENGINEERING↗
DOE OSTI2025

Evolved Gas Analysis–Mass Spectrometry Exposes Polymer Network Structures

Polymer network structures in epoxy thermosets play an important role in the final thermoset material properties. However, analytical characterization of these network structures is difficult due to their amorphous nature. In this work, the application of evolved gas analysis–mass spectrometry (EGA-MS) to characterize the polymer network structures of bisphenol A (BPA)-based thermosets is demonstrated. Analytical characterization of the polymer network structures is accomplished by monitoring the Product-Specific Kinetics (PSK) of BPA monomer formation during thermal degradation investigations. We relate observed differences in the activation energy (E a ) of BPA monomer formation to the local packing environment around the BPA monomer units within the polymer network. Variations in the local environment related to the polymer networks manifest qualitatively as broadening in the thermal profile of the BPA monomer evolution and quantitatively as changes in the activation energy (E a ). Three BPA thermoset formulations were investigated; two amine-cured thermoset with 4,4′-diaminodiphenylmethane (DDM) or poly(propylene glycol) bis(2-amino-propyl ether) (PPG400) and a homopolymerized thermoset via curing with Epikure 3253 catalyst (3253). Results revealed that the 3253 thermoset contained two distinct packing densities in the polymer network, while DDM and PPG400 thermosets had uniform distributions of packing densities. Results from the DDM thermoset revealed a gradually decreasing E a , while the apparent E a of PPG400 was consistent over the entire degradation. Furthermore, these differences in E a were concluded to stem from the flexibility of the corresponding polymer networks and the ability of the network components to rearrange and occupy formed voids. Due to the minimal sample required for analysis (100–200 μg), this EGA-MS technique has great potential for postproduction evaluation of composite parts to identify changes in the polymer networks from use and aging, which could signal compromised performance.

Degradation↗
DOE OSTI2026

Throughput Estimation of Data Transport Networks From Digital Twin Measurements

Digital twins of networked infrastructures, known as Virtual Infrastructure Twins (VITs), are increasingly used for software development, pre-deployment testing, and design space exploration. While VITs avoid the costs and potential disruptions associated with experiments on operational networks, their throughput measurements are typically not sufficiently accurate for performance profiling of wide-area networks that they emulate. Here, machine learning (ML) methods are developed to transform these inaccurate VIT network throughput measurements to closely match in peak and overall profile of those from a physical testbed or production network. First, a micro kernel network reflecting a physical network is utilized to collect one-time measurements on a host to support this ML transformation. Then, a generic multi-modal ML method is developed to learn a map that transforms measurements from subsequent VITs on the same host to match past, current and follow-on testbed and cloud networks. ML generalization equations are derived to establish its correctness and probabilistically guarantee its generalization accuracy. Experimental results are presented for a variety of VIT hosts with target testbed and cloud networks; they include a case study of a four-site science ecosystem wherein inaccurate convex VIT measurement profiles are transformed into accurate concave profiles of target networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hybrid PDES Simulation of HPC Networks Using Zombie Packets

Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. Here, we present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76× speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.

HPC networks↗
DOE OSTI2021

Forecasting Solar-Thermal Systems Performance under Transient Operation Using a Data-Driven Machine Learning Approach Based on the Deep Operator Network Architecture

Modeling and prediction of the dynamic behavior of thermal systems operating under intermittent energy input and variable load requirements represent one of the greatest challenges in the development of efficient and reliable renewable-based power generation technologies. In this work, a data-driven machine learning modeling framework was developed based on a modified version of the Deep Operator Network architecture where the time coordinate in the trunk net is replaced with historical data of the predicting quantity. The modeling framework can be used to accurately predict the performance of renewable-based energy conversion technologies including wind- and solar-based power plants. This novel framework was applied on a solar-thermal system that consists of a solar collection loop using a flat plate collector, a power generation loop comprising an Organic Rankine Cycle, and a thermal energy storage tank connecting both loops. Variable solar irradiance, air temperature, and power load profiles were used by the Deep Operator Network to predict the State-of-Charge and the efficiency of the thermal system for several days. The results were compared with the State-of-Charge and efficiency functions calculated using a physics-based model. For a simple operation scenario, characterized by a clear sky solar irradiance profile and constant load, the standard deviation in the State-of-Charge prediction by Deep Operator Network is below 0.9% during a seven-day prediction time horizon. For the most realistic operation scenario that considers real solar irradiance and a rough load profile, the maximum standard deviation in the predictions for the State-of-Charge and efficiency are below 6.8% and 2.5%, respectively. A comparison between Deep Operator Network and Long Short Term Memory network was also performed. In general, both networks predict very well the State-of-Charge for different data density conditions; however, a higher accuracy, with a standard deviation below 2.0%, is obtained by the Deep Operator Network during three and half days using sparser training data of 20-minute points. The same accuracy for the State-of-Charge prediction with the Long Short Term Memory network is achieved only for 14 h. Average standard deviations for the State-of-Charge prediction of 1.1% with the Deep Operator Network and 1.5% with the Long Short Term Memory network are obtained for a four-day prediction time using a denser training data of 5-minute points.

DeepONet↗
DOE OSTI2023

Deep material network via a quilting strategy: visualization for explainability and recursive training for improved accuracy

Recent developments integrating micromechanics and neural networks offer promising paths for rapid predictions of the response of heterogeneous materials with similar accuracy as direct numerical simulations. The deep material network is one such approaches, featuring a multi-layer network and micromechanics building blocks trained on anisotropic linear elastic properties. Once trained, the network acts as a reduced-order model, which can extrapolate the material’s behavior to more general constitutive laws, including nonlinear behaviors, without the need to be retrained. However, current training methods initialize network parameters randomly, incurring inevitable training and calibration errors. Here, we introduce a way to visualize the network parameters as an analogous unit cell and use this visualization to “quilt” patches of shallower networks to initialize deeper networks for a recursive training strategy. The result is an improvement in the accuracy and calibration performance of the network and an intuitive visual representation of the network for better explainability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗
DOE OSTI2023

Inferring microbial co-occurrence networks from amplicon data: a systematic evaluation

Microbes commonly organize into communities consisting of hundreds of species involved in complex interactions with each other. 16S ribosomal RNA (16S rRNA) amplicon profiling provides snapshots that reveal the phylogenies and abundance profiles of these microbial communities. These snapshots, when collected from multiple samples, can reveal the co-occurrence of microbes, providing a glimpse into the network of associations in these communities. However, the inference of networks from 16S data involves numerous steps, each requiring specific tools and parameter choices. Moreover, the extent to which these steps affect the final network is still unclear. In this study, we perform a meticulous analysis of each step of a pipeline that can convert 16S sequencing data into a network of microbial associations. Through this process, we map how different choices of algorithms and parameters affect the co-occurrence network and identify the steps that contribute substantially to the variance. We further determine the tools and parameters that generate robust co-occurrence networks and develop consensus network algorithms based on benchmarks with mock and synthetic data sets. The Microbial Co-occurrence Network Explorer, or MiCoNE (available at https://github.com/segrelab/MiCoNE) follows these default tools and parameters and can help explore the outcome of these combinations of choices on the inferred networks. We envisage that this pipeline could be used for integrating multiple data sets and generating comparative analyses and consensus networks that can guide our understanding of microbial community assembly in different biomes.

16S rRNA↗
DOE OSTI2021

Integrating deep neural networks with full-waveform inversion: Reparameterization, regularization, and uncertainty quantification

Full-waveform inversion (FWI) is an accurate imaging approach for modeling the velocity structure by minimizing the misfit between recorded and predicted seismic waveforms. However, the strong nonlinearity of FWI resulting from fitting oscillatory waveforms can trap the optimization in local minima. We have adopted a neural-network-based full-waveform inversion (NNFWI) method that integrates deep neural networks with FWI by representing the velocity model with a generative neural network. Neural networks can naturally introduce spatial correlations as regularization to the generated velocity model, which suppresses noise in the gradients and mitigates local minima. Furthermore, the velocity model generated by neural networks is input to the same partial differential equation (PDE) solvers used in conventional FWI. The gradients of the neural networks and PDEs are calculated using automatic differentiation, which back propagates gradients through the acoustic PDEs and neural network layers to update the weights of the generative neural network. Experiments on 1D velocity models, the Marmousi model, and the 2004 BP model determine that NNFWI can mitigate local minima, especially for imaging high-contrast features such as salt bodies, and it significantly improves the inversion in the presence of noise. Adding dropout layers to the neural network model also allows analyzing the uncertainty of the inversion results through Monte Carlo dropout. NNFWI opens a new pathway to combine deep learning and FWI for exploiting the characteristics of deep neural networks and the high accuracy of PDE solvers. Because NNFWI does not require extra training data and optimization loops, it provides an attractive and straightforward alternative to conventional FWI.

58 GEOSCIENCES↗
DOE OSTI2022

2022 Peer Review Project Summary: Advanced Protection for Microgrids and DER in Secondary Networks and Meshed Distribution Systems

Although there are increasing numbers of distributed energy resources (DERs) and microgrids being deployed, current IEEE and utility standards generally strictly limit their interconnection inside secondary networks. Secondary networks are low-voltage meshed (non-radial) distribution systems that create redundancy in the path from the main grid source to each load. This redundancy provides a high level of immunity to disruptions in the distribution system, and thus extremely high reliability of electric power service. There are two main types of secondary networks, called grid and spot secondary networks, both of which are used worldwide. In the future, primary networks in distribution systems that might include looped or meshed distribution systems at the primary-voltage (mediumvoltage) level may also become common as a means for improving distribution reliability and resilience. The objective of this multiyear project is to increase the adoption of microgrids in secondary networks and meshed distribution systems by developing novel protection schemes that allow for safe reliable operation of DERs in secondary networks. We will address these challenges by working with the appropriate stakeholders of secondary network operators, protection vendors, and standards committee. The outcomes of this project include: a) development and/or demonstration of candidate methods for enabling protection of secondary networks containing high levels of DER; b) development of modeling and testing tools for protection systems designed for use with secondary networks including DERs; and c) development of new industrial partnerships to facilitate widespread results dissemination and eventual commercialization of results as appropriate.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Game-Theoretic Strategies for Quantum-Conventional Network Infrastructures

Fundamentally and practically, quantum networks and conventional networks are inextricably tied, since the basic quantum protocols such as teleportation require both networks and the conventional network fiber is also used for the quantum network. A Recursive System of Systems (RSOS) model is developed for quantum-conventional (QC) networks by modeling the correlations at various levels based on the failure and attack modes of quantum, conventional and hybrid components and the propagative effects across QC boundaries. A game-theoretic formulation is developed to capture the cost-benefit trade-offs of the provider in defending against component attacks, using sum-form utility functions. By applying the Nash Equilibrium results, the conditions and sensitivity functions of the survivalprobabilities of a QC network at different levels are derived using the strong dependencies between quantum and conventional infrastructures. The results provide insights into the dependenciesbetween conventional and quantum networks, including cross QC boundary effects in terms of disruption impact of conventional networks on quantum networks, and vice versa.

Rao, Nageswara↗
DOE OSTI2022

Representativeness assessment of the pan-Arctic eddy covariance site network and optimized future enhancements

Abstract. Large changes in the Arctic carbon balance are expected as warming linked to climate change threatens to destabilize ancient permafrost carbon stocks. The eddy covariance (EC) method is an established technique to quantify net losses and gains of carbon between the biosphere and atmosphere at high spatiotemporal resolution. Over the past decades, a growing network of terrestrial EC tower sites has been established across the Arctic, but a comprehensive assessment of the network's representativeness within the heterogeneous Arctic region is still lacking. This creates additional uncertainties when integrating flux data across sites, for example when upscaling fluxes to constrain pan-Arctic carbon budgets and changes therein. This study provides an inventory of Arctic (here > = 60∘ N) EC sites, which has also been made available online (https://cosima.nceas.ucsb.edu/carbon-flux-sites/, last access: 25 January 2022). Our database currently comprises 120 EC sites, but only 83 are listed as active, and just 25 of these active sites remain operational throughout the winter. To map the representativeness of this EC network, we evaluated the similarity between environmental conditions observed at the tower locations and those within the larger Arctic study domain based on 18 bioclimatic and edaphic variables. This allows us to assess a general level of similarity between ecosystem conditions within the domain, while not necessarily reflecting changes in greenhouse gas flux rates directly. We define two metrics based on this representativeness score: one that measures whether a location is represented by an EC tower with similar characteristics (ER1) and a second for which we assess if a minimum level of representation for statistically rigorous extrapolation is met (ER4). We find that while half of the domain is represented by at least one tower, only a third has enough towers in similar locations to allow reliable extrapolation. When we consider methane measurements or year-round (including wintertime) measurements, the values drop to about 1/5 and 1/10 of the domain, respectively. With the majority of sites located in Fennoscandia and Alaska, these regions were assigned the highest level of network representativeness, while large parts of Siberia and patches of Canada were classified as underrepresented. Across the Arctic, mountainous regions were particularly poorly represented by the current EC observation network. We tested three different strategies to identify new site locations or upgrades of existing sites that optimally enhance the representativeness of the current EC network. While 15 new sites can improve the representativeness of the pan-Arctic network by 20 %, upgrading as few as 10 existing sites to capture methane fluxes or remain active during wintertime can improve their respective ER1 network coverage by 28 % to 33 %. This targeted network improvement could be shown to be clearly superior to an unguided selection of new sites, therefore leading to substantial improvements in network coverage based on relatively small investments.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Combustion control using spiking neural networks

A system that controls a combustion engine stores network vectors in a memory that represent diverse and distinct spiking neural networks. The system decodes the network vectors and trains and evaluates the spiking neural networks. The system duplicates selected network vectors and crosses-over the duplicated network vectors that represent modified spiking neural networks. The system mutates the crossed-over duplicated network vectors by randomly modifying one or more portions of the crossing-over duplicated network vectors. The system meter exhaust gas into an intake manifold when an engine temperature exceeds a threshold, an engine load exceeds a threshold, an engine's rotation-per-minute rate exceeds a threshold, and a fuel flow exceeds a threshold. The system modifies fuel flow into an engine's combustion chamber on a cycle-to-cycle basis by the trained spiking neural network.

Puente, Brian P. Maldonado↗
DOE OSTI2023

A Data Processing Pipeline for Adversarial Socio-Technical Network Analysis

With the rapid adoption of emerging technologies, there is a need to catalog and model sociotechnical interdependencies that have been historically used to influence the operation of Critical Infrastructure networks including the impacts of mergers and acquisitions, hostile takeovers, and foreign investment. Our research intends to address this need with two primary contributions. First, we have developed a data curation and processing pipeline to generate sociotechnical networks extracted from a variety of data sources including SEC filings and infrastructure asset databases. The pipeline, implemented in Apache Airflow, extracts and normalizes the representation of entities and relations, specified within ontologies. Our intent is to provide an extensible, machine-actionable approach to quickly communicate such models, reproduce previous results, and adapt them to new, unanticipated situations. Second, networks produced by our pipeline enable the development of graph-theoretic metrics that consider the properties of network components in addition to its topology. Metadata associated with network components---whether semantic, temporal, or geospatial---affects the alignment of generated networks with assumptions underlying complexity metrics. Validation of generated networks relative to component types defined by an ontology, may allow the research community to adapt metrics to the semantics of the domains being studied. Generated networks may be processed as knowledge, dynamic, or spatial graphs and enables a variety of analyses including automated reasoning and measures of network complexity. Automated reasoning views extracted entities and relations as a knowledge graph; this enables application of inference rules that represent historically-attested adversarial business methods and applies that behavior to a specific geographic context. Measures of network complexity, including degree distribution, reachability analyses, temporal analysis, and community detection can be adapted to indicate adversarial organizational influence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Distributed and Secure Spectrum Sharing for 5G and 6G Networks

Secure spectrum sharing or spectrum co-existence of multiple 5G networks and future 6G networks is a powerful enabler technology. The National Spectrum Strategy (NSS) published by the White House in November, 2023, and the subsequent NSS implementation plan led by the National Telecommunication and Information Administration (NTIA) is the driver of a national effort to enable co-existence of government incumbents and commercial networks in selected spectrum bands. Cellular networks such as 5G & 6G and non-cellular Wi-Fi 6E & 7 are the prominent wireless technologies considered for co-existence with incumbent wireless links. Security of the spectrum sharing solutions is a must to make this transformation of spectrum use possible, specially for mission critical communications. However, current spectrum sharing solutions rely on centralized data bases with inherent vulnerabilities. This paper focuses on secure spectrum sharing among multiple 5G networks using unlicensed and shared frequency bands. It presents an innovative AI/ML based distributed spectrum sharing approach that can be autonomously used by multiple networks. Each sharing network uses its own observation of the Radio Frequency (RF) environment, which consists of RF measurements reported from the 5G User Equipment (UE), to adjust the transmission power levels for secure co-existence. Data is presented to illustrate the superior performance of this solution compared to other spectrum sharing solutions where each network can utilize usage data of the other networks. Finally it discusses how this efficient spectrum sharing solution can evolve in the future for the 6G networks.

5G↗
DOE OSTI2022

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗
DOE OSTI2022

The Evolution of the Peridynamics Co-Authorship Network

We report peridynamics is a relatively new field in continuum mechanics that has developed over the past 20 years. This paper studies the evolution of collaborations in the field of peridynamics since its inception using social network analysis. For this purpose, we construct a network for each year from 2000 to 2019 describing co-authorship between scientists in peridynamics. In these networks, each node represents a scientist and each link connects two co-authoring scientists with a link weight representing the frequency and strength of their collaboration; each network as a whole can be thought of as a graph representation of the peridynamics community for the given year. By constructing a network for each year, we are able to analyze the evolution of the network in time and discuss the implications of this evolution for the peridynamics community. Our study demonstrates that the peridynamics community has been growing exponentially in size in recent years. Centrality metrics are also used to identify the most collaborative scientists in the community. Moreover, we compute link recommendations based on both elevating a scientist’s position in the network with respect to certain centrality metrics or closing structural holes in the network identified with persistent homology. We further extend the analysis to higher-order networks whose nodes represent groups of scientists in the community and whose links connect collaborating groups. In some sense, our work studies the past, present, and future of the peridynamics community.

97 MATHEMATICS AND COMPUTING↗