Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed”

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 1,243 records · Page 69

Does inhomogeneous big bang nucleosynthesis produce an inhomogeneous element distribution today?

Inhomogeneous big bang nucleosynthesis (BBN) produces a spatially inhomogeneous distribution of element abundances at $T \sim 10^9$ K , but subsequent element diffusion will tend to erase these inhomogeneities. In this work, we calculate the cosmological comoving diffusion length for the BBN elements. This diffusion length is limited by atomic scattering and is therefore dominated by diffusion when the atoms are neutral, between the redshifts of recombination and reionization. We find that the comoving diffusion length today is $d_{\text{com}} ≈ 70$ pc for all of the elements of interest except 7 Li , for which $d_{\text{com}}$ is an order of magnitude smaller because 7 Li remains ionized throughout the relevant epoch. This comoving diffusion length corresponds to a substellar baryonic mass scale and is roughly equal to the horizon scale at BBN. These results lend support to the possibility that inhomogeneities on scales larger than the horizon at BBN could lead to a spatially inhomogeneous distribution of elements today, while purely subhorizon fluctuations at BBN can result only in a homogeneous element distribution at present.

79 ASTRONOMY AND ASTROPHYSICS↗

Gluon helicity from global analysis of experimental data and lattice QCD Ioffe time distributions

We perform a new global analysis of spin-dependent parton distribution functions with the inclusion of Ioffe time pseudodistributions computed in lattice QCD (LQCD), which are directly sensitive to the gluon helicity distribution, Δ g . These lattice data have an analogous relationship to parton distributions as do experimental cross sections, and can be readily included in global analyses. We focus in particular on the constraining capability of current LQCD data on the sign of Δ g at intermediate parton momentum fractions x , which was recently brought into question by analysis of data in the absence of parton positivity constraints. We find that present LQCD data cannot discriminate between positive and negative Δ g solutions, although significant changes in the solutions for both the gluon and quark sectors are observed. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Systematic improvement of x -dependent unpolarized nucleon generalized parton distributions in lattice-QCD calculation

We present a first study of the effects of renormalization-group resummation (RGR) and leading-renormalon resummation (LRR) on the systematic errors of the unpolarized isovector nucleon generalized parton distribution in the framework of large-momentum effective theory. This work is done using lattice gauge ensembles generated by the MILC Collaboration, consisting of 2 + 1 + 1 flavors of highly improved staggered quarks with a physical pion mass at lattice spacing a ≈ 0.09 fm and a box width L ≈ 5.76 fm . We present results for the nucleon H and E generalized parton distributions (GPDs) with average boost momentum P z ≈ 2 GeV at momentum transfers Q 2 = [ 0 , 0.97 ] GeV 2 at skewness ξ = 0 as well as Q 2 ∈ 0.23 GeV 2 at ξ = 0.1 , renormalized in the modified minimal subtraction ( MS ¯ ) scheme at scale μ = 2.0 GeV , with two- and one-loop matching, respectively. We demonstrate that the simultaneous application of RGR and LRR significantly reduces the systematic errors in renormalized matrix elements and distributions for both the zero and nonzero skewness GPDs, and that it is necessary to include both RGR and LRR at higher orders in the matching and renormalization processes. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Azimuthal magnetic field distribution in gas-puff Z -pinch implosions with and without external magnetic stabilization

An experimental study of the magnetic field distribution in gas-puff Z pinches with and without a preembedded axial magnetic field (B z0 ) is presented. Spatially resolved, time-gated spectroscopic measurements were made at the Weizmann Institute of Science on a 300 kA, 1.6 μs rise time pulsed-power driver. The radial distribution of the azimuthal magnetic field, B θ , during the implosion, with and without a preembedded axial magnetic field of B z0 = 0.26 T, was measured using Zeeman polarization spectroscopy. The spectroscopic measurements of B θ were consistent with the corresponding values of B θ inferred from current measurements made with a B-dot probe. One-dimensional magnetohydrodynamic simulations, performed with the code TRAC-II, showed agreement with the experimentally measured implosion trajectory, and qualitatively reproduced the experimentally measured radial B θ profiles during the implosion when B z0 = 0.26 T was applied. Simulation results of the radial profile of B θ without a preembedded axial magnetic field did not qualitatively match experimental results due to magneto-Rayleigh-Taylor (MRT) instabilities. Furthermore, our analysis emphasizes the importance of MRT instability mitigation when studying the magnetic field and current distributions in Z pinches. Discrepancies of the simulation results with experiment are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Generation of arbitrary probability distributions from chaotic dynamics

A framework is developed to derive nonlinear dynamical systems that chaotically generate arbitrary multivariate probability distributions with smooth, deterministic trajectories. Herein, the ideas are used to extend the Nosé-Hoover thermostat methodology to three-dimensional cases where the momentum distribution is nonisotropic and/or non-Gaussian. Toy models that generate several well-known distributions in physics are given as pedagogical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evidence of non-Maxwellian ion velocity distributions in spherical shock-driven implosions

The ion velocity distribution functions of thermonuclear plasmas generated by spherical laser direct drive implosions are studied using deuterium-tritium (DT) and deuterium-deuterium (DD) fusion neutron energy spectrum measurements. A hydrodynamic Maxwellian plasma model accurately describes measurements made from lower temperature (< 10 keV), hydrodynamiclike plasmas, but is insufficient to describe measurements made from higher temperature more kineticlike plasmas. The high temperature measurements are more consistent with Vlasov-Fokker-Planck (VFP) simulation results which predict the presence of a bimodal plasma ion velocity distribution near peak neutron production. Furthermore, these measurements provide direct experimental evidence of non-Maxwellian ion velocity distributions in spherical shock driven implosions and provide useful data for benchmarking kinetic VFP simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Exploring the Three-Dimensional Momentum Distribution of Longitudinally Polarized Quarks in the Proton

By analyzing experimental data on semi-inclusive deep inelastic scattering off longitudinally polarized targets, we extract the transverse momentum dependence of the quark helicity distribution, i.e., the difference between the three-dimensional motion of quarks with polarization parallel or antiparallel to the longitudinal polarization of the parent hadron. We perform the analysis at next-to-leading and next-to-next-to-leading perturbative accuracy. The quality of the fit is very good for both cases, reaching a χ 2 per number of data points equal to 1.11 and 1.09, respectively. Although the limited number of data points leads to significant uncertainties, the data are consistent with an interpretation in which the helicity distribution is narrower in transverse momentum than the unpolarized distribution. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum-enhanced distributed phase sensing with a truncated SU(1,1) interferometer

In recent years, distributed quantum sensing has gained interest for a range of applications requiring networks of sensors, from global-scale clock synchronization to high energy physics. In particular, a network of entangled sensors can improve not only the sensitivity beyond the shot noise limit, but also enable a Heisenberg scaling with the number of sensors. Here, using bright entangled twin beams, we theoretically and experimentally demonstrate the detection of a linear combination of two distributed phases beyond the shot noise limit with a truncated SU(1,1) interferometer. Specifically, we show a quantum noise reduction of 1.7 ± 0.3 dB below what is possible with the corresponding classical configuration. Additionally, we theoretically extend the use of a truncated SU(1,1) interferometer to a multi-phase-distributed sensing scheme that leverages entanglement as a resource to achieve a quantum improvement in the scaling with the number of sensors in the network. Our results pave the way for developing quantum-enhanced sensor networks that can achieve an entanglement-enhanced sensitivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution

We study the properties of output distributions of noisy random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the “useless” uniform distribution. These bounds are tight with respect to the dependence on circuit depth. Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits. We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation. Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques. We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cyber-Secure and Safe Operation of Solar Photovoltaic Power Distribution Systems

Solar photovoltaic (PV)-rich power distribution systems are networked Cyber-Physical Systems (CPS). These are control systems where multiple computing nodes and diverse intelligent agents interact with the physical world in real-time. However, the presence of networked components renders them vulnerable to potential cyber-attacks, cyber-intrusions, and other malicious events. This is because these systems depend on the measurements reported from their heterogeneous sensors. This makes them vulnerable to potential cyber-attacks where malicious agents can compromise the sensors or the communication networks carrying the sensor measurements. This paper proposes a novel methodology for enhancing the cyber-security and cyber-resilient post-attack safe operation of solar PV-rich power distribution systems against potential cyber-attacks through the Dynamic Watermarking (DW), using online system identification. The resiliency of the proposed technique is tested and validated with several attack scenarios on both a lab-scale 3kW grid-connected PV inverter and a Hardware-in-the-Loop (HiL) system. The proposed approach can be applied to other types of power distribution systems to enhance their cyber-secure and cyber-resilient safe operation. This paper thereby contributes to the field of cyber-security of Cyber-Physical Energy Systems (CPES).

Kim, Jaewon↗

Network Anomaly Detection in Distributed Edge Computing Infrastructure

As networks continue to grow in complexity and scale, detecting anomalies has become increasingly challenging, particularly in diverse and geographically dispersed environments. Traditional approaches often struggle with managing the computational burden associated with analyzing large-scale network traffic to identify anomalies. This paper introduces a distributed edge computing framework that integrates federated learning with Apache Spark and Kubernetes to address these challenges. We hypothesize that our approach, which enables collaborative model training across distributed nodes, significantly enhances the detection accuracy of network anomalies across different network types. We show that by leveraging distributed computing and containerization technologies, our framework not only improves scalability and fault tolerance but also achieves superior detection performance compared to state-of-the-art methods. Extensive experiments on the UNSW-NB15 and ROAD datasets validate the effectiveness of our approach, demonstrating statistically significant improvements in detection accuracy and training efficiency over baseline models, as confirmed by MannWhitney U and Kolmogorov-Smirnov tests (p<0.05).

Marfo, William [University of Texas at El Paso,Dep↗

Impacts of Distributed Speed Harmonization and Optimal Maneuver Planning on Multi-Lane Roads

A commonly proposed method for improving traffic flow on freeways is speed harmonization. The effectiveness of current speed harmonization approaches, such as variable speed limits, is extremely reliant on human driver compliance. Connected and automated vehicles (CAVs) are expected to come to market within this decade, offering the opportunity to eliminate or reduce the reliance on human compliance. However, extending current roadside infrastructure-based approaches of assigning centrally computed harmonization speeds to individual vehicles is, costly. An alternative approach is to have individual vehicles estimate the traffic state on-board and make distributed decisions to achieve the harmonization goal autonomously. In this work, we present a distributed algorithm for estimating the current average speed of traffic. We couple this with a distributed 2D maneuver planning approach. Then, we study the impact on traffic efficiency in terms of energy consumption and travel time at varying CAV penetration rates.

Goulet, Nathan↗

MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs

Graph Neural Networks (GNN) are indispensable in learning from graph-structured data, yet their rising computational costs, especially on massively connected graphs, pose significant challenges in terms of execution performance. To tackle this, distributed-memory solutions such as partitioning the graph to concurrently train multiple replicas of GNNs are in practice. However, approaches requiring a partitioned graph usually suffer from communication overhead and load imbalance, even under optimal partitioning and communication strategies due to irregularities in the neighborhood minibatch sampling. This paper proposes practical trade-offs for improving the sampling and communication overheads for representation learn- ing on distributed graphs (using popular GraphSAGE architecture) by developing a parameterized prefetch and eviction scheme on top of the state-of-the-art Amazon DistDGL distributed GNN framework, demonstrating about 15–40% improvement in end-to-end training performance on the NERSC Perlmutter supercomputer for various OGB datasets.

Machine Leanring, high performance comptuing, grap↗

A Medium Voltage Three-Stage Power Converter Topology for Distribution Grid Scale Energy Storage Systems

This work proposes a three-stage converter topology with a medium frequency isolation transformer for direct integration of energy storage systems into medium voltage distribution grids. The distributed architecture of the topology, using standard AC/DC converters, has been developed with the aim of plug-and-play capability and voltage and power scalability. The medium frequency transformer facilitates improved power density, while its 20:1 voltage translation capability enables the use of limited voltage level (500 Vdc) of the commercially available batteries. This paper presents the topology structure and details how it can be scaled to reach the full range of the distribution grid voltages and the required power levels. A transformer design for 500 Hz rated frequency is discussed. The control scheme of the converter equipped with voltage support, frequency support, and black start capabilities is also presented. Control hardware-in-the-loop results using OPAL-RT, with converter switching models connected to a weak IEEE-4 node test feeder modified for the aforementioned grid services, are provided to show the topology feasibility.

Chinthavali, Madhu Sudhan↗

Wireless Pulse-Width Modulation Control of Power Converters Using Ultra-Wideband Technology for Distributed High-Voltage Systems

In this study, we present a new approach for wireless pulse-width modulation (PWM) control of a power converter, applicable to numerous power converters within a complex electrical distribution system. This method eliminates the need for multiple physical connections of gating/PWM signals among distributed converter modules. By using ultra-wideband-based communication, the PWM control signals can be wirelessly transmitted from a central controller to multiple converters simultaneously and seamlessly. System stability is thoroughly analyzed, and experimental results validate the efficacy of the wireless control scheme for a buck converter operating at a 50-kHz switching frequency. The minimum latency obtained from this setup is 5.38 ..mu..s. This control concept offers easier implementation of distributed control in high-voltage power systems, especially in multilevel architectures, even under harsh conditions with ambient noise.

ADVANCED PROPULSION SYSTEMS↗

Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graphs are ubiquitous in modeling complex systems and representing interactions between entities to uncover structural information of the domain. Traditionally, graph analytics workloads are challenging to efficiently scale (both strong and weak cases) on distributed memory due to the irregular memory-access driven nature (with little or no computations) of the methods. The structure of graphs and their relative distribution over the processing elements poses another level of complexity, making it difficult to attain sustainable scalability across platforms. In this paper, we discuss enhancements to TriC, a distributed-memory implementation of graph triangle counting using Message Passing Interface (MPI), which was featured in the 2020 Graph Challenge competition. We have made some incremental enhancements to TriC, primarily adopting a user-defined buffering strategy to overcome the startup problem for large graphs (by fixing the memory for intermediate data), and experimenting with probabilistic data structures such as bloom filter to improve the query response time for assessing edge existence, at the expense of increasing the overall false positive rate. These adjustments have led to a modest improvements in most cases, as compared to the previous version.

Graph Analytics, HPC↗

Instrumentation for Assessing DC Electrical Distribution Systems in Buildings

Direct current (DC) distribution systems is emerging as a favorable option over alternating current in buildings due to its energy and non-energy benefits (e.g., efficiency, resilience, safety). However, limited guidelines exist to evaluate the DC electrical distribution infrastructure. This paper aims to fill that gap by detailing our experience with metering a building-level electrical DC distribution system. Our case study is a DC microgrid at the Direct Energy Partners Research & Development facility located in Charlotte, North Carolina. This paper presents our approach, technical challenges, and lessons learned with DC metering and instrumentation.

buildings↗

Elastic distributed training with fast convergence and efficient resource utilization

Distributed learning is now routinely conducted on cloud as well as dedicated clusters. Training with elastic resources brings new challenges and design choices. Prior studies focus on runtime performance and assume a static algorithmic behavior. In this work, by analyzing the impact of of resource scaling on convergence, we introduce schedules for synchronous stochastic gradient descent that proactively adapt the number of learners to reduce training time and improve convergence. Our approach no longer assumes a constant number of processors throughout training. In our experiment, distributed stochastic gradient descent with dynamic schedules and reduction momentum achieves better convergence and significant speedups over prior static ones. Numerous distributed training jobs running on cloud may benefit from our approach.

Cong, Guojing↗