Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel”

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 595 records · Page 33

Modelling and computational improvements to the simulation of single vector-boson plus jet processes for the ATLAS experiment

This paper presents updated Monte Carlo configurations used to model the production of single electroweak vector bosons (W, Z/γ$^{∗}$) in association with jets in proton-proton collisions for the ATLAS experiment at the Large Hadron Collider. Improvements pertaining to the electroweak input scheme, parton-shower splitting kernels and scale-setting scheme are shown for multi-jet merged configurations accurate to next-to-leading order in the strong and electroweak couplings. The computational resources required for these set-ups are assessed, and approximations are introduced resulting in a factor three reduction of the per-event CPU time without affecting the physics modelling performance. Continuous statistical enhancement techniques are introduced by ATLAS in order to populate low cross-section regions of phase space and are shown to match or exceed the generated effective luminosity. This, together with the lower per-event CPU time, results in a 50% reduction in the required computing resources compared to a legacy set-up previously used by the ATLAS collaboration. The set-ups described in this paper will be used for future ATLAS analyses and lay the foundation for the next generation of Monte Carlo predictions for single vector-boson plus jets production.[graphic not available: see fulltext]

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

N-jettiness beam functions at N3LO

We present the first complete calculation for the quark and gluon N -jettiness ( $$ {\mathcal{T}}_N $$ T N ) beam functions at next-to-next-to-next-to-leading order (N 3 LO) in perturbative QCD. Our calculation is based on an expansion of the differential Higgs boson and Drell-Yan production cross sections about their collinear limit. This method allows us to employ cutting edge techniques for the computation of cross sections to extract the universal building blocks in question. The class of functions appearing in the matching coefficents for all channels includes iterated integrals with non-rational kernels, thus going beyond the one of harmonic polylogarithms. Our results are a key step in extending the $$ {\mathcal{T}}_N $$ T N subtraction methods to N 3 LO, and to resum $$ {\mathcal{T}}_N $$ T N distributions at N 3 LL' accuracy both for quark as well as for gluon initiated processes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Transverse momentum dependent PDFs at N3LO

We compute the quark and gluon transverse momentum dependent parton distribution functions at next-to-next-to-next-to-leading order (N 3 LO) in perturbative QCD. Our calculation is based on an expansion of the differential Drell-Yan and gluon fusion Higgs production cross sections about their collinear limit. This method allows us to employ cutting edge multiloop techniques for the computation of cross sections to extract these universal building blocks of the collinear limit of QCD. The corresponding perturbative matching kernels for all channels are expressed in terms of simple harmonic polylogarithms up to weight five. As a byproduct, we confirm a previous computation of the soft function for transverse momentum factorization at N 3 LO. Our results are the last missing ingredient to extend the q T subtraction methods to N 3 LO and to obtain resummed q T spectra at N 3 LL' accuracy both for gluon as well as for quark initiated processes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Interface conformal anomalies

We consider two d ≥ 2 conformal field theories (CFTs) glued together along a codimension one conformal interface. The conformal anomaly of such a system contains both bulk and interface contributions. In a curved-space setup, we compute the heat kernel coefficients and interface central charges in free theories. The results are consistent with the known boundary CFT data via the folding trick. In d = 4, two interface invariants generally allowed as anomalies turn out to have vanishing interface charges. These missing invariants are constructed from components with odd parity with respect to flipping the orientation of the defect. We conjecture that all invariants constructed from components with odd parity may have vanishing coefficient for symmetric interfaces, even in the case of interacting interface CFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

BTZ one-loop determinants via the Selberg zeta function for general spin

We relate the heat kernel and quasinormal mode methods of computing the 1-loop partition function of arbitrary spin fields on a rotating (Euclidean) BTZ background using the Selberg zeta function associated with H 3 /Z, extending (arXiv:1811.08433) [1]. Previously, Perry and Williams [2] showed for a scalar field that the zeros of the Selberg zeta function coincide with the poles of the associated scattering operator upon a relabeling of integers. We extend the integer relabeling to the case of general spin, and discuss its relationship to the removal of non-square-integrable Euclidean zero modes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Four-point correlation modular bootstrap for OPE densities

In this work we apply the lightcone bootstrap to a four-point function of scalars in two-dimensional conformal field theory. We include the entire Virasoro symmetry and consider non-rational theories with a gap in the spectrum from the vacuum and no conserved currents. For those theories, we compute the large dimension limit (h/c >> 1) of the OPE spectral decomposition of the Virasoro vacuum. We then propose a kernel ansatz that generalizes the spectral decomposition beyond h/c >> 1. Finally, we estimate the corrections to the OPE spectral densities from the inclusion of the lightest operator in the spectrum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

One-loop structure of parton distribution for the gluon condensate and “zero modes”

We present results for one-loop corrections to the recently introduced “gluon condensate” PDF F(x). In particular, we give expression for the gg-part of its evolution kernel. To enforce strict compliance with the gauge invariance requirements, we have used on-shell states for external gluons, and have obtained identical results both in Feynman and light-cone gauges. No “zero mode” δ(x) terms were found for the twist-4 gluon PDF F(x). However a q 2 δ(x) term was found for the ξ = 0 GPD F(x, q 2 ) at nonzero momentum transfer q. Overall, our results do not agree with the original attempt of one-loop calculations of F(x) for gluon states, which sets alarm warning for calculations that use matrix elements with virtual external gluons and for lattice renormalization procedures based on their results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Target Detection via Cognitive Radars Using Change-Point Detection, Learning, and Adaptation

Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements

42 ENGINEERING↗

An efficient second-order adaptive procedure for inserting CAD geometries into hexahedral meshes using volume fractions

Here, this paper is concerned with inserting three-dimensional computer-aided design (CAD) geometries into meshes composed of hexahedral elements using a volume fraction representation. An adaptive procedure for doing so is presented. The procedure consists of two steps. The first step performs spatial acceleration using a k-d tree. The second step involves subdividing individual hexahedra in an adaptive mesh refinement (AMR)-like fashion and approximating the CAD geometry linearly (as a plane) at the finest subdivision. The procedure requires only two geometric queries from a CAD kernel: determining whether or not a queried spatial coordinate is inside or outside the CAD geometry and determining the closest point on the CAD geometry’s surface from a given spatial coordinate. We prove that the procedure is second-order accurate for sufficiently smooth geometries and sufficiently refined background meshes. We demonstrate the expected order of accuracy is achieved with several verification tests and illustrate the procedure’s effectiveness for several exemplar CAD geometries.

Adaptive↗

Effects of wind field characteristics on pitch bearing reliability: a case study of 5 MW reference wind turbine at onshore and offshore sites; Auswirkungen von Windfeldeigenschaften auf die Zuverlässigkeit von Rotorblattlagern: eine Fallstudie über eine 5-MW-Referenz-Windkraftanlage an Onshore- und Offshore-Standorten

This paper presents a study on pitch bearing basic rating life affected by wind field characteristics at both onshore and offshore wind sites. The National Renewable Energy Laboratory 5 MW reference wind turbine is selected for the study. Wind field characteristics including reference hub height mean wind speed, wind speed distribution, wind shear, and vertical inflow are studied. A decoupled approach is employed where global analysis is performed first. Second, the load effects from the global analysis are applied on a reference pitch bearing designed based on best industrial practices. For the case study onshore site, it is found that the Kernel density estimation best fits the wind distribution, while the International Electrotechnical Commission proposed distribution appears to be not suitable. Moreover, it is shown that the seed number has high effect on the bearing life in turbulence wind and the wind speeds around rated have the highest contribution in both bearing fatigue damage and extreme load failure. The results contribute to better understanding of the wind field characteristics on the pitch bearing life.

17 WIND ENERGY↗

Towards a unified nonlocal, peridynamics framework for the coarse-graining of molecular dynamics data with fractures

Molecular dynamics (MD) has served as a powerful tool for designing materials with reduced reliance on laboratory testing. However, the use of MD directly to treat the deformation and failure of materials at the mesoscale is still largely beyond reach. In this work, we propose a learning framework to extract a peridynamics model as a mesoscale continuum surrogate from MD simulated material fracture data sets. Firstly, we develop a novel coarse-graining method, to automatically handle the material fracture and its corresponding discontinuities in the MD displacement data sets. Inspired by the weighted essentially non-oscillatory (WENO) scheme, the key idea lies at an adaptive procedure to automatically choose the locally smoothest stencil, then reconstruct the coarse-grained material displacement field as the piecewise smooth solutions containing discontinuities. Then, based on the coarse-grained MD data, a two-phase optimization-based learning approach is proposed to infer the optimal peridynamics model with damage criterion. In the first phase, we identify the optimal nonlocal kernel function from the data sets without material damage to capture the material stiffness properties. Then, in the second phase, the material damage criterion is learnt as a smoothed step function from the data with fractures. As a result, a peridynamics surrogate is obtained. As a continuum model, our peridynamics surrogate model can be employed in further prediction tasks with different grid resolutions from training, and hence allows for substantial reductions in computational cost compared with MD. We illustrate the efficacy of the proposed approach with several numerical tests for the dynamic crack propagation problem in a single-layer graphene. Our tests show that the proposed data-driven model is robust and generalizable, in the sense that it is capable of modeling the initialization and growth of fractures under discretization and loading settings that are different from the ones used during training.

97 MATHEMATICS AND COMPUTING↗

Design and implementation of dynamic I/O control scheme for large scale distributed file systems

In this paper, we have analyzed the input/output (I/O) activities of Cori, which is a high-performance computing system at the National Energy Research Scientific Computing Center at Lawrence Berkeley National Laboratory. Our analysis results indicate that most users do not adjust storage configurations but rather use the default settings. In addition, owing to the interference from many applications running simultaneously, the performance varies based on the system status. To configure file systems autonomously in complex environments, we developed DCA-IO, a dynamic distributed file system configuration adjustment algorithm that utilizes the system log information to adjust storage configurations automatically. Our scheme aims to improve the application performance and avoid interference from other applications without user intervention. Moreover, DCA-IO uses the existing system logs and does not require code modifications, an additional library, or user intervention. To demonstrate the effectiveness of DCA-IO, we performed experiments using I/O kernels of real applications in both an isolated small-sized Lustre environment and Cori. Our experimental results shows that our scheme can improve the performance of HPC applications by up to 263% with the default Lustre configuration.

97 MATHEMATICS AND COMPUTING↗

Method of Green’s Potentials for Elliptic PDEs in Domains with Random Apertures

Problems with topological uncertainties appear in many fields ranging from nano-device engineering to the design of bridges. In many of such problems, a part of the domains boundaries is subjected to random perturbations making inefficient conventional schemes that rely on discretization of the whole domain. Here, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures, and apply the method of modified potentials with Green’s kernels defined on the deterministic part of the domain. This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only. The multilevel Monte Carlo method is then applied to this modified integral equation and its optimal ϵ -2 asymptotical complexity is shown. Finally, we provide the qualitative analysis of the proposed technique and support it with numerical results.

97 MATHEMATICS AND COMPUTING↗

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↗

Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers are powerful tools for Bayesian inference but suffer from high computational costs due to their reliance on large particle ensembles for accurate estimates. We introduce persistent sampling (PS), an extension of SMC that systematically retains and reuses particles from all prior iterations to construct a growing, weighted ensemble. By leveraging multiple importance sampling and resampling from a mixture of historical distributions, PS mitigates the need for excessively large particle counts, directly addressing key limitations of SMC such as particle impoverishment and mode collapse. Crucially, PS achieves this without additional likelihood evaluations-weights for persistent particles are computed using cached likelihood values. This framework not only yields more accurate posterior approximations but also produces marginal likelihood estimates with significantly lower variance, enhancing reliability in model comparison. Furthermore, the persistent ensemble enables efficient adaptation of transition kernels by leveraging a larger, decorrelated particle pool. Experiments on high-dimensional Gaussian mixtures, hierarchical models, and non-convex targets demonstrate that PS consistently outperforms standard SMC and related variants, including recycled and waste-free SMC, achieving substantial reductions in mean squared error for posterior expectations and evidence estimates, all at reduced computational cost. PS thus establishes itself as a robust, scalable, and efficient alternative for complex Bayesian inference tasks.

Karamanis, Minas↗

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Abstract Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, community discovery in a dynamic setting is challenging for two specific reasons. Firstly, the notion of temporal community lacks a widely accepted formalization, and only limited work exists on understanding how communities emerge over time. Secondly, the added temporal dimension along with the sheer size of modern graph data necessitates new scalable algorithms. In this paper, we investigate how communities evolve over time based on several graph metrics under a temporal formalization. We compare six different algorithmic approaches for dynamic community detection for their quality and runtime. We identify that a vertex-centric (local) optimization method works as efficiently as the classical modularity-based methods. To its advantage, such local computation allows for the efficient design of parallel algorithms without incurring a significant parallel overhead. Based on this insight, we design a shared-memory parallel algorithm DyComPar , which demonstrates between 4 and 18 fold speed-up on a multi-core machine with 20 threads, for several real-world and synthetic graphs from different domains.

97 MATHEMATICS AND COMPUTING↗

Effects of heat treatment and build orientation on the evolution of $ϵ$ and $α'$ martensite and strength during compressive loading of additively manufactured 304L stainless steel

In this paper, the effect of heat-treatment and build orientation on martensitic phase transformation in additively manufactured (AM) 304L stainless steel is studied and compared with conventionally produced wrought material. The relationships between observed martensitic transformations and material microstructures and their effects on mechanical strength are established through experimental observations. In situ high-energy X-ray powder diffraction measurements were performed to monitor the evolution of $ϵ$ and $α'$ martensite during compressive loading of stainless steel. Electron backscatter diffraction (EBSD) was used to provide insight on initial grain morphology, crystallographic misorientation within grains, and crystallographic texture. Heat treatment alters the microstructure of AM samples creating different initial conditions. This difference in starting microstructure resulted in variability in martensitic transformation during compressive deformation. The rate of martensitic transformation decreased for AM samples treated with temperatures up to 1100°C, after which the AM microstructures recrystallized, resulting in increased rate of martensitic transformation for those samples treated at higher temperatures. It was also observed that aligning the axis of compression with the AM build direction resulted in a lower rate of strain-induced martensite formation as opposed to aligning the compression axis perpendicular to it. More favorable distribution of crystal orientations in the latter loading orientation promoted martensitic transformation. These and additional experimental observations from EBSD in terms of kernel average misorientation, mean grain orientation spread, and mean crystallite size reveal strong microstructural effects on strength of additively manufactured metallic materials.

304L stainless steel↗

Hierarchical Gaussian process-based Bayesian optimization for materials discovery in high entropy alloy spaces

Bayesian optimization (BO) is a powerful and data-efficient method for iterative materials discovery and design, particularly valuable when prior knowledge is limited, underlying functional relationships are complex or unknown, and the cost of querying the materials space is significant. Traditional BO methodologies typically utilize conventional Gaussian Processes (cGPs) to model the relationships between material inputs and properties, as well as correlations within the input space. However, cGP-BO approaches often fall short in multi-objective optimization scenarios, where they are unable to fully exploit correlations between distinct material properties. Leveraging these correlations can significantly enhance the discovery process, as information about one property can inform and improve predictions about others. Here, this study addresses this limitation by employing advanced kernel structures to capture and model multi-dimensional property correlations through multi-task (MTGPs) or deep Gaussian Processes (DGPs), thus accelerating the discovery process. We demonstrate the effectiveness of MTGP-BO and DGP-BO in rapidly and robustly solving complex materials design challenges that occur within the context of complex multi-objective optimization over FCC FeCrNiCoCu high entropy alloy (HEA) spaces, where traditional cGP-BO approaches fail. Furthermore, we highlight how the differential costs associated with querying various material properties can be strategically leveraged to make the materials discovery process more cost-efficient.

36 MATERIALS SCIENCE↗