Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Performance analysis”

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 793 records · Page 44

Response of thermal and fast-ion transport to beam ion population, rotation and T e / T i in the DIII-D steady state hybrid scenario

The thermal and fast-ion transport properties of DIII-D steady-state hybrid discharges with normalized beta β N ≳ 3 are studied at low injected torque and an increased electron to ion temperature ratio T e / T i . Linear stability analysis performed with the TGLF turbulent code indicates that a high-k mode is usually dominant at smaller radii, whereas a low-k mode is usually dominant at larger radii in these plasmas. A reduction in the net injected torque from 8.6 to 4.3 N-m leads to reduced E × B shear and hence, an enhanced turbulence that was observed on the Doppler backscattering diagnostic and was also computed with TGLF. As T e / T i in the core was increased from 0.57 to 0.66 by adding electron cyclotron current drive (ECCD) to these plasmas, higher levels of transport are observed with increased high-k modes indicated by TGLF. The fast-ion transport level varied over an order of magnitude in these discharges depending on whether Alfvén eigenmodes, fishbones, or no instabilities were observed. Hybrid plasmas with fishbones have decreased fast-ion transport, compared to plasmas with Alfvén eigenmodes, since they are resonant with a smaller portion of phase space and their resonance is farther from the wall. This reduction in fast-ion transport with ECCD mitigates the increase in turbulent transport, resulting in higher performance than expected during strong electron heating. Similarly, the lowest fast-ion transport was observed in the low torque plasma, which also led to better than expected performance at this torque value. Finally, the thermal and fast-ion transport changes observed as the torque/rotation and T e / T i are varied indicate possible methods for transferring this scenario to a reactor.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Design of the cryostat for High Field Vertical Magnet Testing Facility at Fermilab

High Field Vertical Magnet Test Facility (HFVMTF) is a joint project between the Office of High Energy Physics (HEP) and the Office of Fusion Energy Sciences (FES). Its construction is currently under way at Fermi National Accelerator Laboratory (Fermilab). As a part of the project a new double bath superfluid helium cryostat has been designed. The cryostat can accommodate magnets with up to 20 tonne weight and 1.3 m diameter. This paper discusses challenges and solutions for cryostat, lambda plate and heat exchanger design, and presents results of performance analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of data collection bias of third molar stages of mineralisation for age estimation in the living

Abstract Age assessment of the living is a fundamental procedure in the process of human identification, in order to guarantee fair treatment of individuals, which has ethical, civil, legal, and medical repercussions. The careful selection of the appropriate methods requires evaluation of several parameters: accuracy, precision of the method, as well as its reproducibility. The approach proposed by Mincer et al. adapted from Demirjian et al. exploring third molar mineralisation, is one of the most frequently considered for age estimation of the living. Thus, this work aims to assess potential bias in the data collection when applying the classification stages for dental mineralisation adapted by Mincer et al. A total of 102 orthopantomographs, of clinical origin, belonging to individuals aged between 12 and 25 years ($ \bar{\textit x} $ = 20.12 years, SD = 3.49 years; 65 females, 37 males, all of Portuguese nationality) were included and a retrospective analysis performed by five observers with different levels of experience (high, average, and basic). The performance and agreement between five observers were evaluated using Weighted Cohen’s Kappa and the Intraclass Correlation Coefficient. To access the influence of impaction on third molar classification, variables were tested using ordinal logistic regression Generalised Linear Model. It was observed that there were variations in the number of teeth identified among the observers, but the agreement levels ranged from moderate to substantial (0.4–0.8). Upon closer examination of the results, it was observed that although there were discernible differences between highly experienced observers and those with less experience, the gap was not as significant as initially hypothesised, and a greater disparity between the classifications of the upper (0.24–0.49) and lower third molars (>0.55) was observed. When bone superimposition is present, the classification process is not significantly influenced; however, variation in teeth angulation affects the assessment. The results suggest that with an efficient preparation, the level of experience as a factor can be overcome. Mincer and colleague's classification system can be replicated with ease and consistency, even though the classification of upper and lower third molars presents distinct challenges.

de Oliveira Santos, Inês (ORCID:0000000267324347)↗

Line confusion in spectroscopic surveys and its possible effects: shifts in Baryon Acoustic Oscillations position

ABSTRACT Roman Space Telescope will survey about 17 million emission-line galaxies over a range of redshifts. Its main targets are Hα emission-line galaxies at low redshifts (z < 2) and [O iii] emission-line galaxies at high redshifts (z > 2). The Roman Space Telescope will estimate the redshift of these galaxies with single-line identification. This suggests that other emission-line galaxies may be misidentified as the main targets. In particular, it is hard to distinguish between the H β and [O iii] lines as the two lines are close in wavelength and hence the photometric information may not be sufficient to separate them reliably. Misidentifying H β emitter as [O iii] emitter will cause a shift in the inferred radial position of the galaxy by approximately 90 Mpc h−1. This length-scale is similar to the Baryon Acoustic Oscillation (BAO) scale and could shift and broaden the BAO peak, possibly introduce errors in determining the BAO peak position. We qualitatively describe the effect of this new systematic and further quantify it with a light-cone simulation with emission-line galaxies. Our results show a systematic shift in the recovered isotropic BAO positions that depends on the percentage of interlopers (percentage of ${\rm H}\,\beta$) in the sample. The systematic shift can be as large as $0.1{-}0.3\,\mathrm{ per}\,\mathrm{ cent} \, {\rm x}\, {{\%}}{\rm H}\,\beta$ for analysis performed at redshifts z = 1.3−1.9.

79 ASTRONOMY AND ASTROPHYSICS↗

Rosenbluth-like separation of the $J/ψ$ near-threshold photoproduction: An access to the gluon gravitational form factors at high t

Here, we perform analysis of the near-threshold $J/\psi $ photoproduction data off the proton based on two theoretical approaches, GPD \cite{Guo3} and holographic \cite{Zahed2}, that represent the differential cross sections as powers of the skewness parameter with coefficients that depend only on the momentum transfer $t$. This allows to separate kinematically the corresponding coefficient functions, in much the same way as this is done for the electric and magnetic form factors using the Rosenbluth separation. We examine the independence of the extracted functions with the photon beam energy. These functions, under additional assumptions, are related to the proton's gluon Gravitational Form Factors (gGFFs). We compare the extracted functions with lattice calculations of the gGFFs in the region of $0.5<|t|<2$~GeV$^{2}$, where they overlap. Such analysis demonstrates the possibility of extracting some combinations of the gGFFs from the data at high $t$, complementary to the lattice calculations available in the low $t$ region. However, higher statistics are needed to more accurately check the predicted scaling behavior of the data and compare with the lattice results, thus testing and comparing the theoretical assumptions used in the GPD and holographic models.

Pentchev, Lubomir [Thomas Jefferson National Accel↗

Gauge constrained algorithm of variational discrete action theory at N = 3 for the multiorbital Hubbard model

The recently developed variational discrete action theory (VDAT) provides a systematic variational approach to the ground state of the quantum many-body problem, where the quality of the solution is controlled by an integer N, and increasing N monotonically approaches the exact solution. VDAT can be exactly evaluated in the d = ∞ multiorbital Hubbard model using the self-consistent canonical discrete action theory (SCDA), which requires a self-consistency condition for the integer time Green's functions. Previous work demonstrates that N = 3 accurately captures multiorbital Mott/Hund physics at a cost similar to the Gutzwiller approximation. Here we employ a gauge constraint to automatically satisfy the self-consistency condition of the SCDA at N = 3, yielding an even more efficient algorithm with enhanced numerical stability. We derive closed form expressions of the gauge constrained algorithm for the multiorbital Hubbard model with general density-density interactions, allowing VDAT at N = 3 to be straightforwardly applied to the seven-orbital Hubbard model. We present results and a performance analysis using N = 2 and N = 3 for the SU⁡(2⁢N orb ) Hubbard model in d = ∞ with N orb = 2–8, and compare to numerically exact dynamical mean-field theory solutions where available. Finally, the developments in this work will greatly facilitate the application of VDAT at N = 3 to strongly correlated electron materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Isospin decomposition of γ N → N * transitions within a dynamical coupled-channels model

Here, by extending the dynamical coupled-channels analysis performed in our previous work to include the available data of photoproduction of pi mesons off neutrons, the transition amplitudes for the photoexcitation of the neutron-to-nucleon resonances, γn → N*, at the resonance pole positions are determined. The combined fits to the data for both the proton- and neutron-target reactions also revise our results for the resonance pole positions and the γp → N* transition amplitudes. Our results allow an isospin decomposition of the γN → N* transition amplitudes for the isospin I = 1/2 N* resonances, which is necessary for testing hadron structure models and gives crucial inputs for constructing models of neutrino-induced reactions in the nucleon resonance region.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dark Energy Survey Year 3 results: Cosmological constraints from galaxy clustering and weak lensing

We present the first cosmology results from large-scale structure using the full 5000 deg 2 of imaging data from the Dark Energy Survey (DES) Data Release 1. We perform an analysis of large-scale structure combining three two-point correlation functions ( 3 × 2 pt ): (i) cosmic shear using 100 million source galaxies, (ii) galaxy clustering, and (iii) the cross-correlation of source galaxy shear with lens galaxy positions, galaxy–galaxy lensing. To achieve the cosmological precision enabled by these measurements has required updates to nearly every part of the analysis from DES Year 1, including the use of two independent galaxy clustering samples, modeling advances, and several novel improvements in the calibration of gravitational shear and photometric redshift inference. The analysis was performed under strict conditions to mitigate confirmation or observer bias; we describe specific changes made to the lens galaxy sample following unblinding of the results and tests of the robustness of our results to this decision. We model the data within the flat Λ CDM and w CDM cosmological models, marginalizing over 25 nuisance parameters. We find consistent cosmological results between the three two-point correlation functions; their combination yields clustering amplitude S 8 = 0.77 6 - 0.017 + 0.017 and matter density Ω m = 0.33 9 - 0.031 + 0.032 in Λ CDM , mean with 68% confidence limits; S 8 = 0.77 5 - 0.024 + 0.026 , Ω m = 0.35 2 - 0.041 + 0.035 , and dark energy equation-of-state parameter w = - 0.9 8 - 0.20 + 0.32 in w CDM . These constraints correspond to an improvement in signal-to-noise of the DES Year 3 3 × 2 pt data relative to DES Year 1 by a factor of 2.1, about 20% more than expected from the increase in observing area alone. This combination of DES data is consistent with the prediction of the model favored by the Planck 2018 cosmic microwave background (CMB) primary anisotropy data, which is quantified with a probability-to-exceed p = 0.13 –0.48. We find better agreement between DES 3 × 2 pt and Planck than in DES Y1, despite the significantly improved precision of both. When combining DES 3 × 2 pt data with available baryon acoustic oscillation, redshift-space distortion, and type Ia supernovae data, we find p = 0.34 . Combining all of these datasets with Planck CMB lensing yields joint parameter constraints of S 8 = 0.81 2 - 0.008 + 0.008 , Ω m = 0.30 6 - 0.005 + 0.004 , h = 0.68 0 - 0.003 + 0.004 , and ∑ m ν < 0.13 eV (95% C.L.) in Λ CDM ; S 8 = 0.81 2 - 0.008 + 0.008 , Ω m = 0.30 2 - 0.006 + 0.006 , h = 0.68 7 - 0.007 + 0.006 , and w = - 1.03 1 - 0.027 + 0.030 in w CDM .

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum algorithm to simulate Lindblad master equations

We present a quantum algorithm for simulating a family of Markovian master equations that can be realized through a probabilistic application of unitary channels and state preparation. Our approach employs a second-order product formula for the Lindblad master equation, achieved by decomposing the dynamics into dissipative and Hamiltonian components and replacing the dissipative segments with randomly compiled, easily implementable elements. The sampling approach eliminates the need for ancillary qubits to simulate the dissipation process and reduces the gate complexity in terms of the number of jump operators. We provide a rigorous performance analysis of the algorithm. We also extend the algorithm to time-dependent Lindblad equations, generalize the family of Markovian master equations it can be applied to, and explore applications beyond the Markovian noise model. A new error bound, in terms of the diamond norm, for second-order product formulas for time-dependent Liouvillians is provided that might be of independent interest. Published by the American Physical Society 2025

Borras, Evan (ORCID:000900017709037X)↗

Computational Fluid Dynamics Simulation Study of Active Power Control in Wind Plants

This paper presents an analysis performed on a wind plant's ability to provide active power control services using a high-fidelity computational fluid dynamics-based wind plant simulator. This approach allows examination of the impact on wind turbine wake interactions within a wind plant on performance of the wind plant controller. The paper investigates several control methods for improving performance in waked conditions. One method uses wind plant wake controls, an active field of research in which wind turbine control systems are coordinated to account for their wakes, to improve the overall performance. Results demonstrate the challenge of providing active power control in waked conditions but also the potential methods for improving this performance.

17 WIND ENERGY↗

Parallel I/O Evaluation Techniques and Emerging HPC Workloads: A Perspective

Emerging workloads such as artificial intelligence, big data analytics and complex multi-step workflows alongside future exascale applications are anticipated future HPC workloads, which will result in a more diverse I/O system workload and even less predictable I/O behavior and access patterns. Along with the ever increasing gap between the compute and storage performance capabilities, the in-depth understanding of extreme-scale I/O behavior and the I/O performance modeling and prediction are essential tools of the large-scale I/O evaluation process for addressing the needs of extreme-scale hybrid workloads. In this survey article, we focus on the state-of-the-art of the I/O behavior and performance analysis process for HPC systems in a 5-year time window and identify future research challenges.

Neuwirth, Sarah↗

Design, Optimization, and Validation of GaN-Based DAB Converter for Active Cell Balancing in BTMS Applications

This paper focuses on the design of a bidirectional dual active bridge (DAB) DC/DC converter that utilizes Gallium Nitride (GaN) switches as active components. In the existing literature, MOSFET-based DAB for active cell balancing is available, but GaN-based DAB converter for active cell balancing is still new. The proposed modular isolated GaN-based DAB converter is designed as an individual module of active cell balancing for behind-the-meter storage (BTMS) applications, targeting high-power charging stations. Modular isolated converters are connected to each cell (low voltage bus), and each cell is connected in series to build up a battery module. According to the reference current command of supervisory control, each DAB converter can transfer power back and forth through the high voltage (HV) bus to balance the State of Charge (SoC) between the cells. Each module DAB converter is designed at a 50 W power rating. Switch power and transformer losses are analyzed for different switching frequencies, showing the optimum switching frequency for minimum losses. Furthermore, the procedure to select the required gate driver and the PCB layout optimization are discussed. Finally, the DAB performance analysis of GaN-based DAB and Si-based DAB is provided for a battery module operating with a LiFeMnPO4 prismatic cell with 3.2V 20Ah rated values.

active cell balancing↗

Scaling and Quality of Modularity Optimization Methods for Graph Clustering

Real-world graphs exhibit structures known as “communities” or “clusters” consisting of a group of vertices with relatively high connectivity between them, as compared to the rest of the vertices in the network. Graph clustering or community detection is a fundamental graph operation used to analyze real-world graphs occurring in the areas of computational biology, cybersecurity, electrical grids, etc. Similar to other graph algorithms, owing to irregular memory accesses and inherently sequential nature, current algorithms for community detection are challenging to parallelize. However, in order to analyze large networks, it is important to develop scalable parallel implementations of graph clustering that are capable of exploiting the architectural features of modern supercomputers. In response to the 2019 Streaming Graph Challenge, we present quality and performance analysis of our distributed- memory community detection using Vite, which is our distributed memory implementation of the popular Louvain method, on the ALCF Theta supercomputer. Clustering methods such as Louvain that rely on modularity maximization are known to suffer from the resolution limit problem, preventing identification of clusters of certain sizes. Hence, we also include quality analysis of our shared-memory implementation of the Fast-tracking Resistance method, in comparison with Louvain on the challenge datasets. Furthermore, we introduce an edge-balanced graph distribution for our distributed memory implementation, that significantly reduces communication, offering up to 80% improvement in the overall execution time. In addition to performance/quality analysis, we also include details on the power/energy consumption, and memory traffic of the distributed-memory clustering implementation using real-world graphs with over a billion edges.

Ghosh, Sayan↗

SWAP-Assembler 2: Optimization of De Novo Genome Assembler at Large Scale

In this paper, we analyze and optimize the most time-consuming steps of the SWAP-Assembler, a parallel genome assembler, so that it can scale to a large number of cores for huge genomes with the size of sequencing data ranging from terabyes to petabytes. According to the performance analysis results, the most time-consuming steps are input parallelization, k-mer graph construction, and graph simplification (edge merging). For the input parallelization, the input data is divided into virtual fragments with nearly equal size, and the start position and end position of each fragment are automatically separated at the beginning of the reads. In k-mer graph construction, in order to improve the communication efficiency, the message size is kept constant between any two processes by proportionally increasing the number of nucleotides to the number of processes in the input parallelization step for each round. The memory usage is also decreased because only a small part of the input data is processed in each round. With graph simplification, the communication protocol reduces the number of communication loops from four to two loops and decreases the idle communication time. The optimized assembler is denoted as SWAP-Assembler 2 (SWAP2). In our experiments using a 1000 Genomes project dataset of 4 terabytes (the largest dataset ever used for assembling) on the supercomputer Mira, the results show that SWAP2 scales to 131,072 cores with an efficiency of 40%. We also compared our work with both the HipMER assembler and the SWAP-Assembler. On the Yanhuang dataset of 300 gigabytes, SWAP2 shows a 3X speedup and 4X better scalability compared with the HipMer assembler and is 45 times faster than the SWAP-Assembler. The SWAP2 software is available at https://sourceforge.net/projects/swapassembler.

Meng, Jintao↗

The Ongoing Evolution of OpenMP

Here, this paper presents an overview of the past, present and future of the OpenMP application programming interface (API). While the API originally specified a small set of directives that guided shared memory fork-join parallelization of loops and program sections, OpenMP now provides a richer set of directives that capture a wide range of parallelization strategies that are not strictly limited to shared memory. As we look toward the future of OpenMP, we immediately see further evolution of the support for that range of parallelization strategies and the addition of direct support for debugging and performance analysis tools. Looking beyond the next major release of the specification of the OpenMP API, we expect the specification eventually to include support for more parallelization strategies and to embrace closer integration into its Fortran, C and, in particular, C++ base languages, which will likely require the API to adopt additional programming abstractions.

97 MATHEMATICS AND COMPUTING↗

Impedance-Aware Graph Convolutional Networks for Voltage Estimation in Active Distribution Networks

Voltage estimation plays a key role in ensuring the effective control and reliability of distribution networks. However, traditional machine learning methods often fail to capture the details of the distribution network’s topology. To overcome this challenge, graph convolutional networks (GCN) have emerged as an alternative. Graph convolutional networks inherently capture the topology of the grid, utilizing correlations to achieve precise voltage estimation. Other machine learning models and conventional GCNs fail to account for the distribution line characteristics found in the real world, limiting their effectiveness. This paper proposes an advanced variant of GCN called the Impedance-Aware Graph Convolutional Network (IA-GCN). The IA-GCN layer incorporates the magnitude of the impedance into the graph convolution mechanism, allowing it to capture topological nuances and provide valuable insights into node interrelationships by considering impedance as an intrinsic dimension. The performance of the IA-GCN layer is then compared with that of GCN and GraphSAGE layers through a surrogate model for voltage estimation. The performance analysis demonstrates that IA-GCN outperforms GCN by reducing the MAE by 87.55% and improving the R-squared value by 98%.

Ravi, Abhijith↗

Support Structure Design of the $\hbox{Nb}_{3}\hbox{Sn}$ Quadrupole for the High Luminosity LHC

New low-β quadrupole magnets are being developed within the scope of the High Luminosity LHC (HL-LHC) project in collaboration with the US LARP program. The aim of the HLLHC project is to study and implement machine upgrades necessary for increasing the luminosity of the LHC. The new quadrupoles, which are based on the Nb₃Sn superconducting technology, will be installed in the LHC Interaction Regions and will have to generate a gradient of 140 T/m in a coil aperture of 150 mm. In this paper, we describe the design of the short model magnet support structure and discuss results of the detailed 3D numerical analysis performed in preparation for the first short model test.

43 PARTICLE ACCELERATORS↗

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗