Engineering PapersSearch

SEARCH · Engineering Papers

Results for “federated algorithm”

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 37 records · Page 2

OmniFed: A Modular Framework for Configurable Federated Learning from Edge to HPC

Federated Learning (FL) is critical for edge and High Performance Computing (HPC) where data is not centralized and privacy is crucial. We present OmniFed, a modular framework designed around decoupling and clear separation of concerns for configuration, orchestration, communication, and training logic. Its architecture supports configuration-driven prototyping and code-level override-what-you-need customization. We also support different topologies, mixed communication protocols within a single deployment, and popular training algorithms. It also offers optional privacy mechanisms including Differential Privacy (DP), Homomorphic Encryption (HE), and Secure Aggregation (SA), as well as compression strategies. These capabilities are exposed through well-defined extension points, allowing users to customize topology and orchestration, learning logic, and privacy/compression plugins, all while preserving the integrity of the core system. We evaluate multiple models and algorithms to measure various performance metrics. By unifying topology configuration, mixed-protocol communication, and pluggable modules in one stack, OmniFed streamlines FL deployment across heterogeneous environments. Github repository is available at https://github.com/at-aaims/OmniFed.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)

Melter Tests to Define LAW Halide Concentrations, Phase 2

The present work represents the second of two phases to address the formation of secondary sulfate phases while processing high waste loading LAW formulations with elevated halide, chromium, and phosphate feed concentrations over a wide range of LAW waste types, including those with high potassium concentrations. The Test Plan for the present work outlines a series of tests designed to assess the formation of secondary phases over a range of sulfur and halide concentrations for two LAW streams and associated glass formulations as well as crucible testing to identify additives that have the potential to suppress the formation of secondary phases for wastes with high chlorine contents. The combined results from both phases of testing and from previous tests with these LAW waste streams will be used as inputs to future work to develop concentration limits for these components in the LAW glass property composition models and to support the modification and updating of the current WTP LAW glass formulation algorithm.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W

Neutrino interaction vertex reconstruction in DUNE with Pandora deep learning

The Pandora Software Development Kit and algorithm libraries perform reconstruction of neutrino interactions in liquid argon time projection chamber detectors. Pandora is the primary event reconstruction software used at the Deep Underground Neutrino Experiment, which will operate four large-scale liquid argon time projection chambers at the far detector site in South Dakota, producing high-resolution images of charged particles emerging from neutrino interactions. While these high-resolution images provide excellent opportunities for physics, the complex topologies require sophisticated pattern recognition capabilities to interpret signals from the detectors as physically meaningful objects that form the inputs to physics analyses. A critical component is the identification of the neutrino interaction vertex. Subsequent reconstruction algorithms use this location to identify the individual primary particles and ensure they each result in a separate reconstructed particle. A new vertex-finding procedure described in this article integrates a U-ResNet neural network performing hit-level classification into the multi-algorithm approach used by Pandora to identify the neutrino interaction vertex. The machine learning solution is seamlessly integrated into a chain of pattern-recognition algorithms. The technique substantially outperforms the previous BDT-based solution, with a more than 20% increase in the efficiency of sub-1 cm vertex reconstruction across all neutrino flavours.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Selection Algorithm for electron neutrino charged current interactions in SBND

The Short Baseline Neutrino (SBN) program at Fermilab is a joint proposal by three experimental collaborations primarily for the investigation of the cause behind the low-energy electron-like event excess observed by the MiniBoone experiment. This dissertation focuses on the near detector of the project, named the Short Baseline Near Detector (SBND), a Liquid Argon Time Projection Chamber apparatus which will conduct searches for sterile neutrinos in the mass range of 1 ${eV}^2/{c}^4$, as well as provide cross-section measurements for neutrino interactions in argon and perform other beyond the standard model studies.\\ \indent As is the case for all detectors in the program, the SBND will use the Booster Neutrino Beam as its source, which will provide it with both muon and electron neutrinos. Given that the ability to discern between the neutrino flavors will be crucial to the fulfillment of the detector's physics goals, the objective of this work is to provide the collaboration with a tool capable of doing so. As such, we here present the development process for an inclusive selection algorithm for the identification of electron neutrino charged current (CC) events regardless of their interaction channel. This is done through a combination of traditional techniques, such as the implementation of cuts on the reconstructed interaction properties, with the use of the Convolutional Visual Network, a machine learning algorithm capable of classifying particle interactions through the analysis of the topology of their final states. With this approach, we have developed a selection process that is capable of identifying $\nu_e$ CC interactions across a wide range of topologies with 34.4\% efficiency, as well as a purity of 91.2\%, making it especially promising for use in cross section studies.

Freire, Hector Moya [ABC Federal U.] (ORCID:000900

Federated Learning with Frequency Estimation for Smart Meter Systems

Federated learning (FL) is a powerful framework that enables multiple distributed clients to collaborate without the need to transfer their data to a central server. However, FL does not inherently guarantee the level of privacy that clients often require. In our review of recent studies on privacy-enhancing techniques in FL, we found that frequency estimation (FE) methods remain underexplored. To address this gap, we developed and integrated FE techniques on the client side, further examining the effects of incorporating an adaptive range and a shuffled model. We also analyzed the impact of varying hyper-parameters on privacy preservation. Our results provide clear guidance on the algorithms and configurations that are most effective for enhancing privacy in FL, particularly when using long short-term memory (LSTM) architectures.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)

Assessing VQLS for Fluid Dynamics on a Hybrid Quantum-HPC Stack

Recent advances in quantum linear solvers offer a promising direction for accelerating extreme scientific computations such as fluid dynamics. However, the deep and complex circuits required by many quantum algorithms limit their practical use on current quantum hardware. The Variational Quantum Linear Solver (VQLS) presents a viable alternative for near-term quantum devices (NISQ), and initial efforts have explored its application to select fluid dynamics problems. In this work, we evaluate the use of VQLS for canonical fluid dynamics problems, aiming to identify pathways for generalizing its implementation across a broader class of systems. We analyze the impact of various circuit ansatz and classical optimizers on solution quality and convergence behavior. Furthermore, we assess the algorithm's feasibility within a hybrid quantum–high-performance computing (HPC) framework by porting it to QFw, a state-of-the-art quantum-HPC software stack. 11This manuscript has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the US Department of Energy (DOE). The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for US government purposes. DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the US DOE under Contract No. DE-AC05-00OR22725.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000

Integrated System Planning: Emerging Software Requirements in the Power Industry

Power system planning software remains fragmented across organizational boundaries, with specialized tools for capacity expansion, production cost modeling, power flow, and dynamic analysis operating on incompatible data models and assumptions. This article argues that the fragmentation is not merely a technical problem but a predictable consequence of Conway's law: software architectures mirror the departmental structures within which they are developed. Regulatory milestones like Federal Energy Regulatory Commission (FERC) Order 888 formalized these divisions, but the roots trace back to the distinct engineering disciplines-mechanical, chemical, and electrical-that staffed generation and transmission planning departments in vertically integrated utilities. As the industry moves toward integrated system planning (ISP) that coordinates generation, transmission, and distribution investment decisions, the software ecosystem must evolve accordingly. We identify five categories of software requirements to enable this transition: coherent data inputs decoupled from individual applications, unified and extensible data schemas, modular component representations that support multiple abstraction levels, lifecycle management of planning datasets, and well-defined application programming interface (API) contracts that separate data exchange from algorithmic control. We examine how these requirements interact with three common workflow patterns-serial gate clearing, sequential multiapplication, and convergence oriented-and discuss the interface design principles each demands. We then outline a vision for platform-based planning architectures where specialized analytical services compose through standardized interfaces and where artificial intelligence (AI)/machine learning (ML) tools augment decision support within a disciplined software infrastructure. The practices proposed here offer a path from today's siloed tool collections toward collaborative planning ecosystems capable of handling the complexity of modern power system transformation.

24 POWER TRANSMISSION AND DISTRIBUTION

IM3 Projected US Data Center Locations

IM3 Projected US Data Center Locations This dataset contains model projections of new data center facilities in the contiguous United States (CONUS) through 2035 using the CERF – Data Centers model. Data center locations are modeled across four data center electricity demand growth scenarios (low, moderate, high, higher) and five market gravity scenarios (0%, 25%, 50%, 75%, 100%). Projected locations are intended to be regional representations of feasible siting locations in the future to assess potential grid and water stress impacts. The data center load growth scenarios correspond with the rates outlined in EPRI (2024) and include 3.71%, 5%, 10%, and 15% annual growth of electricity demand for data centers from 2023 values in 37 states across the CONUS. Market gravity scenarios correspond to the relative importance of proximity to data center markets or high population areas compared to locational cost in the siting algorithm. 0% market gravity means that siting decisions were entirely determined by the locational cost in each feasible location. 100% market gravity means that only market proximity was considered when siting. Other scenarios have weight placed on both components where total weight always equals 100%. Locational cost is dependent on facility cooling type and corresponding electricity cost, taxes, and other factors. Facility cooling type is spatially determined where high water stress and/or areas with high summer wet bulb temperatures are assumed to operate with mechanical cooling for a higher fraction of the year rather than evaporative cooling. Feasible data center siting areas are based on geospatial suitability raster data developed with open-source information. The following areas are excluded from siting: Areas within 300 m of a federal airport runway Waterbodies Areas with slope >16% Areas susceptible to sinkholes High coastal or inland flood risk areas Local, state, and federal parks, leisure areas, and cemeteries Areas >2 km away from electric substations Areas >5 km away from a municipal water supplier service area Areas >2 km away from high-speed fiber provider service territory Protected Areas Database of the United States (PAD-US) areas Railroads, major roadways, and minor roadways Military areas and training grounds NLCD developed lands Areas >0.8 km (0.5 miles) from NLCD developed lands Because we use open-source information, proprietary information that can influence siting decisions such as individual tax agreements with cities, detailed fiber line connectivity, electric grid power capacity agreements, and others, are not currently accounted for in the modeling process. Using specific building locations and footprints in the dataset for local planning purposes is not advised. Technical Information Geospatial data is provided in geojson format using the Albers Equal Area Conic (ESRI:102003) coordinate reference system. The datasets contain the following parameters: id - unique identification number within given scenario file growth_scenario – data center demand growth scenario market_gravity_weight – market gravity weight scenario (%) region – name of region (i.e., US State) total_cost_million_usd – locational siting cost ($million) campus_size_square_ft – total land acquired for data center facility (square ft) data_center_it_power_mw – IT power of data center facility (MW) mechanical_cooling_frac – fraction of year when data center uses mechanical cooling system water_cooling_frac– fraction of year when data center uses evaporative cooling system cooling_energy_demand_mwh – total annual facility energy demand for cooling (MWh) cooling_water_demand_mgy – total annual facility water demand for cooling (MG) cooling_water_consumption_mgy – total annual facility water consumed (MG) normalized_locational_cost – normalized total locational cost score for location normalized_gravity_score – normalized market gravity score for location weighted_siting_score – total weighted siting score of locational cost and gravity score geometry – polygon geometry of facility Acknowledgment IM3 is a multi-institutional effort led by Pacific Northwest National Laboratory and supported by the U.S. Department of Energy's Office of Science as part of research in MultiSector Dynamics, Earth and Environmental Systems Modeling Program. License This data is made available under a CCBY4.0 License Disclaimer This material was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor the United States Department of Energy, nor the Contractor, nor any or their employees, nor any jurisdiction or organization that has cooperated in the development of these materials, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness or any information, apparatus, product, software, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof, or Battelle Memorial Institute. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof. PACIFIC NORTHWEST NATIONAL LABORATORYoperated byBATTELLEfor theUNITED STATES DEPARTMENT OF ENERGYunder Contract DE-AC05-76RL01830

Mongird, Kendall (ORCID:0000000328077088)

IM3 Projected US Data Center Locations

IM3 Projected US Data Center Locations This dataset contains model projections of new data center facilities in the contiguous United States (CONUS) through 2035 using the CERF – Data Centers model. Data center locations are modeled across four data center electricity demand growth scenarios (low, moderate, high, higher) and five market gravity scenarios (0%, 25%, 50%, 75%, 100%). Projected locations are intended to be regional representations of feasible siting locations in the future to assess potential grid and water stress impacts. The data center load growth scenarios correspond with the rates outlined in EPRI (2024) and include 3.71%, 5%, 10%, and 15% annual growth of electricity demand for data centers from 2023 values in 37 states across the CONUS. Market gravity scenarios correspond to the relative importance of proximity to data center markets or high population areas compared to locational cost in the siting algorithm. 0% market gravity means that siting decisions were entirely determined by the locational cost in each feasible location. 100% market gravity means that only market proximity was considered when siting. Other scenarios have weight placed on both components where total weight always equals 100%. Locational cost is dependent on facility cooling type and corresponding electricity cost, taxes, and other factors. Facility cooling type is spatially determined where high water stress and/or areas with high summer wet bulb temperatures are assumed to operate with mechanical cooling for a higher fraction of the year rather than evaporative cooling. Feasible data center siting areas are based on geospatial suitability raster data developed with open-source information. The following areas are excluded from siting: Areas within 300 m of a federal airport runway or within an airport area boundary Waterbodies Areas with slope >16% Areas susceptible to sinkholes High coastal or inland flood risk areas Local, state, and federal parks, leisure areas, and cemeteries Areas >2 km away from electric substations Areas >5 km away from a municipal water supplier service area Areas >2 km away from high-speed fiber provider service territory USGS Protected Areas Database of the United States (PAD-US) GAP status 1, 2, or 3 areas US National Parks Wetlands USFWS critical habitats BIA land areas Railroads, major roadways, and minor roadways Military areas and training grounds NLCD developed lands Areas >0.8 km (0.5 miles) from NLCD developed lands Because we use open-source information, proprietary information that can influence siting decisions such as individual tax agreements with cities, detailed fiber line connectivity, electric grid power capacity agreements, and others, are not currently accounted for in the modeling process. Using specific building locations and footprints in the dataset for local planning purposes is not advised. Technical Information Geospatial data is provided in geojson format using the Albers Equal Area Conic (ESRI:102003) coordinate reference system. The datasets contain the following parameters: id - unique identification number within given scenario file growth_scenario – data center demand growth scenario market_gravity_weight – market gravity weight scenario (%) region – name of region (i.e., US State) total_cost_million_usd – locational siting cost ($million) campus_size_square_ft – total land acquired for data center facility (square ft) data_center_it_power_mw – IT power of data center facility (MW) mechanical_cooling_frac – fraction of year when data center uses mechanical cooling system water_cooling_frac– fraction of year when data center uses evaporative cooling system cooling_energy_demand_mwh – total annual facility energy demand for cooling (MWh) cooling_water_demand_mgy – total annual facility water demand for cooling (MG) cooling_water_consumption_mgy – total annual facility water consumed (MG) normalized_locational_cost – normalized total locational cost score for location normalized_gravity_score – normalized market gravity score for location weighted_siting_score – total weighted siting score of locational cost and gravity score geometry – polygon geometry of facility Acknowledgment IM3 is a multi-institutional effort led by Pacific Northwest National Laboratory and supported by the U.S. Department of Energy's Office of Science as part of research in MultiSector Dynamics, Earth and Environmental Systems Modeling Program. License This data is made available under a CCBY4.0 License Disclaimer This material was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor the United States Department of Energy, nor the Contractor, nor any or their employees, nor any jurisdiction or organization that has cooperated in the development of these materials, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness or any information, apparatus, product, software, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof, or Battelle Memorial Institute. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof. PACIFIC NORTHWEST NATIONAL LABORATORYoperated byBATTELLEfor theUNITED STATES DEPARTMENT OF ENERGYunder Contract DE-AC05-76RL01830

Mongird, Kendall (ORCID:0000000328077088)

Modeling distributed energy resource aggregations in security constrained unit commitment and economic dispatch

The Federal Energy Regulatory Commission (FERC) recently issued Order 2222, which requires all wholesale electricity markets in the US to allow distributed energy resources (DERs) to participate in the market as aggregated resources. These DER aggregations may be composed of many individual resources that are offered and dispatched by the market as a single entity. We present here a model of a distributed energy resource aggregator (DERA) that is scheduled by a market operator’s security constrained unit commitment (SCUC) and security constrained economic dispatch (SCED). The DERA model includes constraints for battery energy storage systems (BESSs), demand response resources (DRRs), and a simple distributed energy resource (DER). This paper describes a model for each resource type and presents two methods for the DERA to generate market offer curves: a profit-maximizing optimization to compute cost curves and a direct cost algorithm to determine dispatch costs for each resource and combine into cost curves. Once all participating DERAs are scheduled in SCUC/SCED, the model is then modified to dispatch individual DERs to maximize profit or minimize schedule deviation of the DERAs. A simulation of a representative day illustrates the DERA offers, the scheduled generation, and the DERA dispatch. Findings show the potential for unavoidable schedule deviations due to internal DER constraints and due to economic incentives to deviate from the SCUC/SCED schedules. This highlights the importance of DERA offer construction on market efficiency and system reliability. Novel aspects of our approach include: (1) We consider the asymmetry of price incentives impacting DERAs from the wholesale market compared to those impacting consumers from the retail market, as imposed by current regulations and laws. (2) We model aggregate consumer response through statistically parameterizable utility functions rather than a potentially impractical approach of modeling each individual consumer. (3) We show how to use the DERA operational dispatch model to create offers into the wholesale electricity market. (4) We show how DERAs may fail to meet their scheduled dispatch because the market offer format may not permit them to fully express their operational features such as intertemporal costs and constraints to the market.

aggregations

Reconstruction of atmospheric neutrinos in DUNE’s horizontal-drift far-detector module

This paper reports on the capabilities in reconstructing and identifying atmospheric neutrino interactions in one of the Deep Underground Neutrino Experiment’s (DUNE) far detector modules, a liquid argon time projection chamber (LArTPC) with horizontal drift (FD-HD) of ionization electrons. The reconstruction is based upon the workflow developed for DUNE’s long-baseline oscillation analysis, with some necessary machine-learning models’ retraining and the addition of features relevant only to atmospheric neutrinos such as the neutrino direction reconstruction. Where relevant, the impact of the detection of the charged particles of the hadronic system is emphasized, and comparisons are carried out between the case when lepton-only information is considered in the reconstruction (as is the case for many neutrino oscillation experiments), versus when all particles identified in the LArTPC were included. Three neutrino direction reconstruction methods have been developed and studied for the atmospheric analyses: using lepton-only information, using all reconstructed particles, and using only correlations from reconstructed hits. The results indicate that incorporating more than just lepton information significantly improves the resolution of both neutrino direction and energy reconstruction. The angle reconstruction algorithms developed in this work result in no strong dependence on particle direction for reconstruction efficiencies or neutrino flavor identification. This comprehensive review of the reconstruction of atmospheric neutrinos in DUNE’s FD-HD LArTPC is the first step towards developing a first neutrino oscillation sensitivity analysis, which will ready DUNE for its first measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Innovating the next generation of commercial smart building software

Nearly 30% of commercial building energy use is wasted due to equipment faults and HVAC controls problems. The result is increased emissions, compromised comfort and productivity, and less reliable coordination of building power needs with a clean grid. The energy impact alone represents $17 billion in potential savings. Today’s smart building software provides a robust solution to address these operational deficiencies. Energy management and information systems (EMIS) are saving up to 9% on average, with two-year paybacks. They are being incorporated into energy management processes, commissioning services, and utility programs. As effective as they are, two barriers prevent even deeper benefits; limited personnel to fix problems once they are identified, and the expense and time to manually implement changes in control systems. In partnership with the research community, the EMIS industry is developing new capabilities to overcome these barriers. Moving beyond siloed products for either fault detection and diagnostics, or optimal control, these new capabilities empower users to not only automatically identify faults, but also to push corrective action, and control improvements to their buildings. In this paper, several areas for enhancements are documented: ‘one-time’ correction of faults such as setpoints, schedules, and economizer lockouts; short-term active testing for automated proportional integral derivative (PID) loop tuning and functional testing; and continuous supervisory control for demand flexibility and year-round efficiency. Results are presented from a pair of partner implementations out of a dozen providers integrating these enhancements into their products, including field tests from across the country, and insights into operator acceptance and integration into operations and maintenance practices.

Casillas, Armando

Recent Improvements to the NWChem COSMO Module

This work presents recent developments in the COSMO solvation model implementation in NWChem. A new cavity construction approach, based on the solvent-excluding surface (SES) and utilizing the well-established GEPOL algorithm, has been introduced. Additionally, a straightforward procedure to merge surface segments that are too close─often a source of numerical artifacts─has been implemented. The available methods for correcting outlying surface charges have also been reviewed and improved. To validate the new implementation, we computed dielectric solvation energies for a chemically diverse set of approximately 100 molecules, including neutral species, small ions, and common ionic liquid components. Results were compared to those from GAMESS using the double-cavity method as a reference. Although the double-cavity approach can be regarded as more accurate, the simpler correction schemes available in NWChem─based on scaling factors or Lagrange multipliers─can achieve excellent agreement if the potential is also properly corrected, with mean unsigned deviations of around 0.15 kcal/mol. Predictions of typical vapor–liquid and liquid–liquid equilibria using a COSMO-SAC variant based on NWChem also showed very promising results.

Cavities

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Measurement of the double-differential inclusive jet cross section in proton-proton collisions at $\sqrt{s}$ = 5.02 TeV

The inclusive jet cross section is measured as a function of jet transverse momentum pT and rapidity y. The measurement is performed using proton-proton collision data at $\sqrt{s}$ = 5.02 TeV, recorded by the CMS experiment at the LHC, corresponding to an integrated luminosity of 27.4 pb −1 . The jets are reconstructed with the anti-k T algorithm using a distance parameter of R = 0.4, within the rapidity interval |y| < 2, and across the kinematic range 0.06 < p T < 1 TeV. The jet cross section is unfolded from detector to particle level using the determined jet response and resolution. The results are compared to predictions of perturbative quantum chromodynamics, calculated at both next-to-leading order and next-to-next-to-leading order. The predictions are corrected for nonperturbative effects, and presented for a variety of parton distribution functions and choices of the renormalization/factorization scales and the strong coupling α S .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

A continuous calibration of the ATLAS flavour-tagging classifiers via optimal transportation maps

A calibration of the ATLAS flavour-tagging algorithms using a new calibration procedure based on optimal transportation maps is presented. Simultaneous, continuous corrections to the b-jet, c-jet, and light-flavour jet classification probabilities from jet-tagging algorithms in simulation are derived for b-jets using $t\bar{t} \rightarrow e\mu \nu \nu bb$ data. After application of the derived calibration maps, closure between simulation and observation is achieved for jet flavour observables used in ATLAS analyses of Large Hadron Collider (LHC) Run 2 proton-proton collision data. This continuous calibration opens up new possibilities for the future use of jet flavour information in LHC analyses and also serves as a guide for deriving high-dimensional corrections to simulation via transportation maps, an important development for a broad range of inference tasks.

Aad, G. [Aix-Marseille Université] (ORCID:00000002

Measurement of photonuclear jet production in ultraperipheral Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV with the ATLAS detector

In ultrarelativistic heavy ion collisions at the LHC, each nucleus acts a sources of high-energy real photons that can scatter off the opposing nucleus in ultraperipheral photonuclear (𝛾 + 𝐴) collisions. Hard scattering processes initiated by the photons in such collisions provide a novel method for probing nuclear parton distributions in a kinematic region not easily accessible to other measurements. ATLAS has measured production of dijet and multijet final states in ultraperipheral Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV using a dataset recorded in 2018 with an integrated luminosity of 1.72 nb −1 . Photonuclear final states are selected by requiring a rapidity gap in the photon direction; this selects events where one of the outgoing nuclei remains intact. Jets are reconstructed using the anti-𝑘 t algorithm with radius parameter, 𝑅 = 0.4. Triple-differential cross sections, unfolded for detector response, are measured and presented using two sets of kinematic variables. The first set consists of the total transverse momentum (𝐻 T ), rapidity, and mass of the jet system. The second set uses 𝐻 T and particle-level nuclear and photon parton momentum fractions, 𝑥 A and 𝑧 𝛾 , respectively. The results are compared with leading-order perturbative QCD calculations of photonuclear jet production cross sections, where all leading order predictions using existing fits fall below the data in the shadowing region. More detailed theoretical comparisons will allow these results to strongly constrain nuclear parton distributions, and these data provide results from the LHC directly comparable to early physics results at the planned Electron-Ion Collider.

Parton distribution functions

Improving galaxy cluster selection with the outskirt stellar mass of galaxies

The number density and redshift evolution of optically selected galaxy clusters offer an independent measurement of the amplitude of matter fluctuations, 𝑆 8 . However, recent results have shown that clusters chosen by the redMaPPer algorithm show richness-dependent biases that affect the weak lensing signals and number densities of clusters, increasing uncertainty in the cluster mass calibration and reducing their constraining power. Here, in this work, we evaluate an alternative cluster proxy, outskirt stellar mass, 𝑀 out , defined as the total stellar mass within a [50, 100] kpc envelope centered on a massive galaxy. This proxy exhibits scatter comparable to redMaPPer richness, 𝜆, but is less likely to be subject to projection effects. We compare the Dark Energy Survey Year 3 redMaPPer cluster catalog with a 𝑀 out selected cluster sample from the Hyper-Suprime Camera survey. We use weak lensing measurements to quantify and compare the scatter of 𝑀 out and 𝜆 with halo mass. Our results show 𝑀 out has a scatter consistent with 𝜆, with a similar halo mass dependence, and that both proxies contain unique information about the underlying halo mass. We find 𝜆-selected samples introduce features into the measured Δ⁢Σ signal that are not well fit by a log-normal scatter only model, absent in 𝑀 out selected samples. Our findings suggest that 𝑀 out offers an alternative for cluster selection with more easily calibrated selection biases, at least at the generally lower richnesses probed here. Combining both proxies may yield a mass proxy with a lower scatter and more tractable selection biases, enabling the use of lower mass clusters in cosmology. Finally, we find the scatter and slope in the 𝜆 −𝑀 out scaling relation to be 0.49 ±0.02 and 0.38 ±0.09.

79 ASTRONOMY AND ASTROPHYSICS