Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network analyzer”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Improved heavy-ion PID using scintillation light detector with neural network analysis: a Monte Carlo simulation study

The photon collection efficiency of gaseous scintillator detectors varies according to the position of the impinging charged particles in the medium that generates scintillation light. Thus, when impinging particles are distributed over a large area, the intrinsic photon-number resolution of the system is affected by a large variation. This work presents and discusses a method for adjusting the total number of detected photons to account for variation in the photon collection efficiency as a function of the position of the light source within the scintillating medium. The method was developed and validated by processing data from systematic simulation studies based on GEANT4 that model the response of the Energy Loss Optical Scintillation System (ELOSS) detector. The position of the charged particle is calculated using a deep neural network algorithm. This is accomplished by analyzing the distribution of scintillation light recorded by the array of photosensors. The estimated particle position is then used to calculate the correction factor and adjust the amount of captured light to account for variations in the photon collection efficiency. The neural network algorithm provides excellent tracking capabilities, achieving sub-millimeter position resolution and an angular resolution of 12 mrad, approaching the performance of traditional tracking detectors (e.g., drift chambers). The present method can be generalized to any optical scintillation system where the photon collection efficiency depends on the position of the impinging particle.

Heavy-ion detectors↗
DOE OSTI2021

Digital Twin Network (DTN): Concepts, Architecture, and Key Technologies

With the commercial deployment of 5G and the migration of internet from IPv4 to IPv6, the new development of the network technology has highly attracted the attention of the industry. The intelligentization of network is believed as the trend of the new generation of network development. The network provides the foundation for the information transmission in the digital society, and the digitalization of the network itself is the prerequisite for the intelligent development. Facing the goal of the new generation of digital and intelligent network, this paper introduces the new concept of "digital twin network (DTN)", designs the system architecture, and analyzes the key technologies of DTN. By investigating the challenges of DTN, this paper points out the future development direction of digital twin network.

digital twin network↗
DOE OSTI2025

Discrete fracture network model benchmarks developed and applied in a DECOVALEX-2023 repository performance assessment study

This study presents newly developed benchmarks for modeling flow and transport within discrete fracture networks (DFNs) and useful methods for analyzing the results. The new benchmarks are designed to test modeling approaches for use in probabilistic performance assessment models of deep geologic repositories in fractured rock. The benchmarks simulate flow and transport through a 1 km 3 block of fractured rock. The first simulates migration of a short pulse of tracer through a simple network of four intersecting fractures. The second adds 1089 stochastically generated fractures. The third changes the pulse to a continuous point source. Evaluation of model performance relies on moment analysis and comparison of the results of different models. The expected nondimensional first moment of the conservative tracer for each benchmark is 1. The benchmarks were simulated by teams from Canada, Czechia, Germany, Korea, Sweden, Taiwan, and the United States as part of a DECOVALEX-2023 study (decovalex.org). The teams used various approaches, including explicit DFN modeling, DFN upscaling to an equivalent continuous porous medium (ECPM), and a combination of both methods. Transport mechanisms are modeled using either the advection-dispersion equation or particle tracking. Results demonstrate strong agreement among the models in breakthrough behavior up to the 75th percentile. Significant deviations in first moments and well-clustered outputs led to the identification of inaccuracies in several models. Such findings exemplify the benefit of exercising these benchmarks and using the presented methods to test DFN flow and transport models.

Benchmark↗
DOE OSTI2023

Analytic Theory for the Dynamics of Wide Quantum Neural Networks

Here, parametrized quantum circuits can be used as quantum neural networks and have the potential to outperform their classical counterparts when trained for addressing learning problems. To date, much of the results on their performance on practical problems are heuristic in nature. In particular, the convergence rate for the training of quantum neural networks is not fully understood. Here, we analyze the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. We define wide quantum neural networks as parametrized quantum circuits in the limit of a large number of qubits and variational parameters. Then, we find a simple analytic formula that captures the average behavior of their loss function and discuss the consequences of our findings. For example, for random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system. Finally, we validate our analytic results with numerical experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

In-Network DAQ Functions

A revolution in networking is changing how we compute, but we lack the tools that can channel this new capability to benefit science. It is now possible to write programs that operate "in" the network—on network cards (NICs) and network switches themselves, rather than on servers. These programs can analyze and reduce huge volumes of data as they flow through the network—at higher throughput, lower latency, and lower power consumption than if servers (containing CPUs or GPUs) were used. That equipment offers appealing features for scientific experiments that involve huge quantities of data. This poster describes a prototype LArTPC raw-waveform hit finder based on DUNE’s Trigger Primitives generator. We built this as part of ongoing research to better understand how to put programmable network hardware to use in large scientific experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Uncoordinated Spectrum Sharing in Millimeter Wave Networks Using Carrier Sensing

Here, we propose using Carrier Sensing (CS) for distributed interference management in millimeter-wave (mmWave) cellular networks where spectrum is shared by multiple operators that do not coordinate among themselves. In addition, even the base station sites can be shared by the operators. We describe important challenges in using traditional CS in this setting and propose enhanced CS protocols to address these challenges. Using stochastic geometry, we develop a general framework for downlink coverage probability analysis of our shared mmWave network in the presence of CS and derive the downlink coverage probability expressions for several CS protocols. Our work is the first to investigate and analyze (using stochastic geometry) CS for mmWave networks with spectrum and BS sites shared among non-coordinating operators. We evaluate the downlink coverage probability of our shared mmWave network using simulations as well as numerical examples based on our analysis. Our evaluations show that our proposed approach leads to an improvement in coverage probability, compared to the coverage probability with no CS, for higher values of signal-to-interference and noise ratio (SINR). Interestingly, our evaluations also reveal that for lower values of SINR, not using any CS is the best strategy in terms of the downlink coverage probability.

42 ENGINEERING↗
DOE OSTI2023

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals’ affected neighbors, such a spreading process becomes a “complex contagion”. This non-linearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g. for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g. for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary non-linear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of ”selection” (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Self-Supervised and Interpretable Anomaly Detection Using Network Transformers

Machine learning and deep neural networks (DNNs) have been proposed as a tool to identify anomalies in computer network communications. However, due the obfuscated nature of off-the-shelf machine learning models, their output often does not provide enough information to isolate the source of the anomaly to take corrective measures. In this article, we introduce the network transformer (NeT), a DNN model for anomaly detection that incorporates the graph structure of the communication network in order to improve interpretability. Further, the presented approach has the following advantages: first, enhanced interpretability by incorporating the graph structure of computer networks; second, provides a hierarchical set of features that enables analysis at different levels of granularity; second, self-supervised training that does not require labeled data. The NeT model was evaluated on a set of anomalous scenarios executed in a real industrial control system. The presented approach successfully identified the anomalies, the devices affected, and the specific connections causing the anomalies, providing a data-driven hierarchical approach to analyze the behavior of a cyber network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Event-Driven Predictive Approach for Real-Time Volt/VAR control with CVR in solar PV rich Active Distribution Network

The focus of this paper is on analyzing the impact of conservation voltage reduction in the presence of active devices such as solar photovoltaic (PV) and developing controls that leverage these distributed energy resources. An event-driven predictive approach for real-time volt/volt-ampere reactive (VAR) optimization, along with local two-level adaptive volt/VAR droop-based control algorithm for advanced distribution management systems, is introduced. The methodology covers aggregated and autonomous controls under different timescale operations, including the impact and effect of unpredicted events such as cloud transients on PV power production. In addition, the control schemes include the uncertainties in PV power generation and load power demand. The proposed methodology is validated in a real-time framework using the real-time digital simulator platform through co-simulation with models based on Python and OpenDSS (Open Distribution System Simulator). The developed methodology is tested on the modified IEEE 123-feeder test system. The results reveal that the proposed methodology works well in the presence of high penetrations of PV power, produces significant energy savings, and mitigates over-/undervoltage problems.

14 SOLAR ENERGY↗
DOE OSTI2021

Slip-free multiplication and complexity of dislocation networks in FCC metals

Abstract During plastic deformation of crystalline solids, intricate networks of dislocation lines form and evolve. To capture dislocation density evolution, prominent theories of crystal plasticity assume that 1) multiplication is driven by slip in active slip systems and 2) pair-wise slip system interactions dominate network evolution. In this work, we analyze a massive database of over 100 discrete dislocation dynamics simulations (with cross-slip suppressed), and our findings bring both of these assumptions into question. We demonstrate that dislocation multiplication is commonly observed on slip systems with no applied stress and no plastic strain rate, a phenomenon we refer to as slip-free multiplication. We show that while the formation of glissile junctions provides one mechanism for slip-free multiplication, additional mechanisms which account for the influence of coplanar interactions are needed to fully explain the observations. Unlike glissile junction formation which results from a binary reaction between a pair of slip systems, these new multiplication mechanisms require higher order reactions that lead to complex network configurations. While these complex configurations have not been given much attention previously, they account for about 50% of the line intersections in our database.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Unsupervised learning from three-component accelerometer data to monitor the spatiotemporal evolution of meso-scale hydraulic fractures

Enhanced geothermal systems can provide a substantial share of the global energy demand. There exist several hurdles in the engineering implementations of such geothermal systems. One such hurdle is the accurate monitoring of the fracture networks created in subsurface through hydraulic stimulation of these systems. Micro seismicity associated with the stimulation is the primary means to locate the event hypocenters for estimating the stimulated rock volume. Existing methods for location the hypocenters are restricted to only the highest amplitude impulsive signals that are simultaneously detected on several sensors. Consequently, a large portion (usually ~99%) of the measurements are left unused. In this paper, an unsupervised manifold-approximation followed by clustering of 3-component accelerometer data is used to analyze the seismicity recorded on a monitoring well. With this method, a larger portion of the measured signal is used for the monitoring of the hydraulic fracture network. We analyze the EGS Collab experiment 1 microseismic data, recorded at the Sanford Underground Research Facility, South Dakota. Using the data from a single three-component accelerometer, the polarization features viz. Azimuth, incidence, rectilinearity, and planarity are used as inputs for the unsupervised manifold approximation followed by clustering. Our study shows that density-based clusters in the projected 3D space correspond to distinct types of hydraulically fractured zones around the injection point. Finally, we show that the temporal evolution of these clusters can be used to track fracture creation and propagation.

58 GEOSCIENCES↗
DOE OSTI2025

Machine-learning-enabled on-the-fly analysis of RHEED patterns during thin film deposition by molecular beam epitaxy

Thin film deposition is a fundamental technology for the discovery, optimization, and manufacturing of functional materials. Deposition by molecular beam epitaxy (MBE) typically employs reflection high-energy electron diffraction (RHEED) as a real-time in situ probe of the growing film. However, the state-of-the-art for RHEED analysis during deposition requires human observation. Here, we present an approach using machine learning (ML) methods to monitor, analyze, and interpret RHEED images on-the-fly during thin film deposition. In the analysis workflow, RHEED pattern images are collected at one frame per second and featurized using a pretrained deep convolutional neural network. The feature vectors are then statistically analyzed to identify changepoints; these changepoints can be related to changes in the deposition mode from initial film nucleation to a transition regime, smooth film deposition, and in some cases, an additional transition to a rough, islanded deposition regime. The feature vectors are additionally analyzed via graph analysis and community classification. The graph is quantified as a stabilization plot, and we show that inflection points in the stabilization plot correspond to changes in the growth regime. The full RHEED analysis workflow is termed RHAAPsody and includes data transfer and output to a visual dashboard. We demonstrate the functionality of RHAAPsody by analyzing the precaptured RHEED images from epitaxial depositions of anatase TiO2 on SrTiO3(001) and show that the analysis workflow can be executed in less than 1 s. Our approach shows promise as one component of ML-enabled real-time feedback control of the MBE deposition process.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Dynamic Network Analysis of Nuclear Science Literature for Research Influence Assessment

Analyzing nuclear science literature via data-driven methods is a critical step for assessing research influence and technology advancements. Indicators of scholarly activities may be buried in large volumes of nuclear research publications and collaboration networks over time. Mining for relevant scholarly influence trends in large volumes of text can be computationally challenging; however, open-source information on research collaborations over time can offer opportunities to extract meaningful insights. While network centrality analysis of scholarly research provides topology-based insights, additional emphasis on dynamics associated with the diffusion of information through these networks is important. Here this paper represents a step in that direction through the development of a novel dynamic network analysis framework and computational engine to identify key entities and capabilities over time within global scholarly nuclear science collaboration networks. Network theoretic, stochastic simulation, and optimization methods are leveraged to address variability in scholarly interactions, influence propagation, and collaboration patterns via network connections. A topic-aware influence maximization algorithm is developed to address the goal of identifying key influential authors in diverse research topics over time. Efficient parallelized implementation of the algorithm is applied to reduce computational costs. A proof-of-concept case study using open-source Scopus data with 33,517 published nuclear research papers from 2000-2019 is presented and representative analytic insights are generated. Broad implications of these insights are discussed and future research directions are also identified.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2022

Improved Architectures and Training Algorithms for Deep Operator Networks

Operator learning techniques have recently emerged as a powerful tool for learning maps between infinite-dimensional Banach spaces. Trained under appropriate constraints, they can also be effective in learning the solution operator of partial differential equations (PDEs) in an entirely self-supervised manner. In this work we analyze the training dynamics of deep operator networks (DeepONets) through the lens of Neural Tangent Kernel theory, and reveal a bias that favors the approximation of functions with larger magnitudes. To correct this bias we propose to adaptively re-weight the importance of each training example, and demonstrate how this procedure can effectively balance the magnitude of back-propagated gradients during training via gradient descent. We also propose a novel network architecture that is more resilient to vanishing gradient pathologies. Taken together, our developments provide new insights into the training of DeepONets and consistently improve their predictive accuracy by a factor of 10-50x, demonstrated in the challenging setting of learning PDE solution operators in the absence of paired input-output observations.

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 OSTI2022

Search for flavor-changing neutral current interactions of the top quark and the Higgs boson decaying to a bottom quark-antiquark pair at $ \sqrt{s} $ = 13 TeV

A search for flavor-changing neutral current interactions of the top quark (t) and the Higgs boson (H) is presented. The search is based on a data sample corresponding to an integrated luminosity of 137 fb-1 recorded by the CMS experiment at the LHC in proton-proton collisions at √s = 13 TeV. Events containing exactly one lepton (muon or electron) and at least three jets, among which at least two are identified as originating from the hadronization of a bottom quark, are analyzed. A set of deep neural networks is used for kinematic event reconstruction, while boosted decision trees distinguish the signal from the background events. No significant excess over the background predictions is observed, and upper limits on the signal production cross sections are extracted. These limits are interpreted in terms of top quark decay branching fractions (B) to the Higgs boson and an up (u) or a charm quark (c). Assuming one nonvanishing extra coupling at a time, the observed (expected) upper limits at 95% confidence level are B(t → Hu) < 0.079 (0.11)% and B(t → Hc) < 0.094 (0.086)%.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

IoT-based retrofit information diffusion in future smart communities

Community-scale building retrofits are not merely scaled-up versions of single-building retrofits. They involve complex challenges, such as reconciling individual interests with collective goals and managing the dynamic interplay between buildings through mechanisms like power grids and social connections. Internet of Things (IoT) connectivity holds the potential to leverage these interplays to balance individual and collective interests effectively in smart communities. One critical aspect of this interplay is information diffusion, which shapes how retrofit decisions spread among neighbors, influencing individual choices and ultimately impacting community-level retrofit outcomes. In other words, IoT-based smart devices automatically push tailored retrofit notifications to homeowners, which completely changes the format of information diffusion in the future. To investigate this influence by such information diffusion, the study used CityBES to simulate energy performance for different retrofits and applied an information diffusion model to analyze how decisions spread in a networked community of 192 buildings. The diffusion process was modeled on a weighted, directed network, capturing the dynamics of information flow and decision-making across 16 scenarios. Individual retrofit benefits were evaluated through payback years, while community-level retrofit outcomes were assessed using greenhouse gas (GHG) emission reductions. The results demonstrate that easier information diffusion among neighbors encourages households to prioritize retrofit measures that align with the majority’s optimal choices, even at the expense of individual financial benefits. In this case, such collective prioritization enhanced community-level retrofit performance, increasing GHG emission reductions by up to 29.4 %. However, this improvement came with trade-offs, as the average payback period for households extended by approximately 1.74 years. These findings highlight the potential of IoT-based information diffusion in future smart communities to coordinate individual interests with collective goals, ultimately accelerating community-level building retrofits.

Shu, Lei↗