Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “range finding 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Renewable hydrogen and ammonia for combined heat and power systems in remote locations: Optimal design and scheduling

Abstract Using hydrogen (H ) and ammonia (NH ) for renewable energy storage has the potential to enable economical power and heat supply with high renewable penetrations, especially in remote locations which are characterized by high energy costs. In this work we assess the economic competitiveness of renewable combined heat and power (CHP) systems in Mahaka HI, Nantucket MA, and Northwest Arctic Borough (NWAB) AK by optimally designing these systems for scenarios in which power and heat can be purchased over a range of historical energy prices as well as when 100% renewable supply is required. We use a combined optimal design and scheduling model which minimizes annualized net present cost by determining optimal technology selection and size simultaneously with optimal schedules for each period of a system operating horizon aggregated from full year hourly resolution data via a consecutive temporal clustering algorithm. We find that renewable generation meets at least 85% of power demands and 75% of heat demands under the lowest energy prices investigated. Higher conventional energy prices lead to increased renewable penetration which is facilitated by renewable NH as a seasonal energy storage medium, as are 100% renewable CHP systems. NH is used for power generation with heat cogeneration in all three locations, as well as directly for heating in NWAB. On an annual cost basis, NH ‐enabled 100% renewable CHP is only 3% more expensive in Mahaka and NWAB than systems which can purchase energy at the lowest prices, while it is 15% more expensive in Nantucket.

Palys, Matthew J.↗
DOE OSTI2024

State Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry

State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space–unitary coupled cluster (LAS–UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. Here, in this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C–C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

A physics‐informed learning technique for fault location of DC microgrids using traveling waves

Abstract Fast and accurate fault location in DC power systems is of particular importance to ensure their reliable operation. One of the approaches for implementing a fast‐tripping protection scheme is to use Traveling waves (TW) initiated by a fault scenario. This paper proposes a physics‐informed machine learning approach that utilizes TWs for fault location in DC microgrids. TWs are extracted by the so‐called multiresolution analysis which identifies the TW's wavelet coefficients for multiple frequency ranges. This paper deploys Parseval's theorem to find the energy of wavelet coefficients as a quantitative metric for describing TWs. The hypothesis of this paper is that once the Parseval energy curves for a specific cable are extracted, they can be utilized to locate faults along with that cable regardless of the DC system in which the cable is deployed. The fault location algorithm uses Parseval energy curves to train a Gaussian Process (GP) estimator. With the Parseval energy values of measured current at the protection device location, the GP estimator is able to estimate fault locations with high accuracy. The effectiveness of the proposed algorithm is verified by simulating a DC microgrid system in PSCAD/EMTDC.

Paruthiyil, Sajay Krishnan↗
DOE OSTI2022

Machine Learning–Based Detection of Weather Fronts and Associated Extreme Precipitation in Historical and Future Climates

Extreme precipitation events, including those associated with weather fronts, have wide-ranging impacts across the world. Here we use a deep learning algorithm to identify weather fronts in high resolution Community Earth System Model (CESM) simulations over the contiguous United States (CONUS), and evaluate the results using observational and reanalysis products. We further compare results between CESM simulations using present-day and future climate forcing, to study how these features might change with climate change. We find that detected front frequencies in CESM have seasonally varying spatial patterns and responses to climate change and are found to be associated with modeled changes in large scale circulation such as the jet stream. We also associate the detected fronts with precipitation and find that total and extreme frontal precipitation mostly decreases with climate change, with some seasonal and regional differences. Here, decreases in Northern Hemisphere summer frontal precipitation are largely driven by changes in the frequency of different front types, especially cold and stationary fronts. On the other hand, Northern Hemisphere winter exhibits some regional increases in frontal precipitation that are largely driven by changes in frontal precipitation intensity. While CONUS mean and extreme precipitation generally increase during all seasons in these climate change simulations, the likelihood of frontal extreme precipitation decreases, demonstrating that extreme precipitation has seasonally varying sources and mechanisms that will continue to evolve with climate change.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2022

Estimating snow cover from high-resolution satellite imagery by thresholding blue wavelengths

We report the extent and duration of snow cover, a critical component of the hydrologic cycle and the global climate system, is expected to shift dramatically under climate change. Therefore, developing high-resolution assessments of snow cover change is crucial for estimating the impact of changing snow cover on watershed and ecosystems processes in cold regions. Remote sensing tools provide a powerful method for mapping snow-covered area (SCA) across a landscape. The most common method for estimating SCA utilizes the normalized difference snow index (NDSI), which relies on spectral measurements in the shortwave-infrared wavelengths (SWIR). NDSI can effectively estimate catchment- to regional-scale SCA, but it cannot be used to assess fine-scale SCA because of current limitations on the spatial resolution of satellite-derived SWIR measurements. Here, we map SCA using a threshold of blue wavelengths and high-resolution satellite imagery. The thresholding method, which we call the Blue Snow Threshold algorithm (BST), has previously been used with digital camera imagery. We refine and automate the algorithm for use with cloud-free high-resolution satellite imagery and find that the BST can be used to assess fine-scale SCA. For validation, we compared BST-derived estimates of SCA to a) airborne lidar surveys, b) Landsat fractional SCA, and c) snow disappearance dates from Snow Telemetry (SNOTEL) stations. When compared to airborne lidar surveys of SCA, the BST predicted SCA had a range of F-scores between 0.81 and 0.94 in four study areas in California and Colorado. We also found general agreement between SCA and snow disappearance at multiple SNOTEL sites across the western United States. Given the relatively recent availability of high-resolution satellite imagery with spectral measurements in the visible wavelengths but lacking in SWIR, the BST offers a reliable and easy-to-apply tool for examining fine-scale snow-related processes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Consistent and reproducible computation of the glass transition temperature from molecular dynamics simulations

In many fields, from semiconductors for opto-electronic applications to ionic liquids (ILs) for separations, the glass transition temperature (Tg) of a material is a useful gauge for its potential use in practical settings. As a result, there is a great deal of interest in predicting Tg using molecular simulations. However, the uncertainty and variation in the trend shift method, a common approach in simulations to predict Tg, can be high. This is due to the need for human intervention in defining a fitting range for linear fits of density with temperature assumed for the liquid and glass phases across the simulated cooling. The definition of such fitting ranges then defines the estimate for the Tg as the intersection of linear fits. We eliminate this need for human intervention by leveraging the Shapiro–Wilk normality test and proposing an algorithm to define the fitting ranges and, consequently, Tg. Through this integration, we incorporate into our automated methodology that residuals must be normally distributed around zero for any fit, a requirement that must be met for any regression problem. Consequently, fitting ranges for realizing linear fits for each phase are statistically defined rather than visually inferred, obtaining an estimate for Tg without any human intervention. The method is also capable of finding multiple linear regimes across density vs temperature curves. We compare the predictions of our proposed method across multiple IL and semiconductor molecular dynamics simulation results from the literature and compare other proposed methods for automatically detecting Tg from density–temperature data. We believe that our proposed method would allow for more consistent predictions of Tg. We make this methodology available and open source through GitHub.

Chemistry↗
DOE OSTI2025

Inference of response functions with the help of machine-learning algorithms

Response functions are a key quantity to describe the near-equilibrium dynamics of strongly interacting many-body systems. Recent techniques that attempt to overcome the challenges of calculating these ab initio have employed expansions in terms of orthogonal polynomials. We employ a neural network prediction algorithm to reconstruct a response function 𝑆⁡(𝜔) defined over a range in frequencies 𝜔. Here, we represent the calculated response function as a truncated Chebyshev series whose coefficients can be optimized to reduce the representation error. We compare the quality of response functions obtained using coefficients calculated using a neural network (NN) algorithm with those computed using the Gaussian integral transform (GIT) method. In the regime where only a small number of terms in the Chebyshev series are retained, we find that the NN scheme outperforms the GIT method.

Kurkcuoglu, Doga Murat [Fermi National Accelerator↗
DOE OSTI2023

Mu2e - Extinction Monitor Research & Development

Current efforts are being conducted at Fermi National Laboratory to study potential violations in accepted theory that would otherwise suggest a restructuring of our fundamental understanding of the universe. Mu2e is one of these frontier projects that studies charged lepton flavor violation (CLFV) which if observed, would suggest physics beyond the Standard Model. Therefore, this note encompasses several projects that contribute to the fruition of Mu2e investigations. Due to the broad range of disciplinary inconsistencies that each project requires, all the work is being presented as a means of justifying contribution to Mu2e. The projects are comprised of a G4Beamline simulation analyzing 8GeV proton beam interaction with a titanium window of Recycler ring extinction rates using three Cherenkov radiation-based detectors and supplemental work for the implementation of a micro–Telecommunications Computing Architecture (MicroTCA) crate to establish a peak finding algorithm to ensure that the out-of-time beam is less than 10^-10 fractional level along with inefficiency analysis on scintillation counters for the Cosmic-Ray Veto (CRV) analysis. Preliminary results have been achieved for extinction rate simulation by achieving coincidence rates for 2/3-fold and 3/3-fold on the detectors in the order of 10^-9 and 10^-10, respectively. Only preliminary results of a triangular counter and four rectangular di-counters for the CRV have been realized but other non-experimental contributions were made to the development of the MicroTCA crate.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Simulations suggest offshore wind farms modify low-level jets

Abstract. Offshore wind farms are scheduled to be constructed along the East Coast of the US in the coming years. Low-level jets (LLJs) – layers of relatively fast winds at low altitudes – also occur frequently in this region. Because LLJs provide considerable wind resources, it is important to understand how LLJs might change with turbine construction. LLJs also influence moisture and pollution transport; thus, the effects of wind farms on LLJs could also affect the region’s meteorology. In the absence of observations or significant wind farm construction as yet, we compare 1 year of simulations from the Weather Research and Forecasting (WRF) model with and without wind farms incorporated, focusing on locations chosen by their proximity to future wind development areas. We develop and present an algorithm to detect LLJs at each hour of the year at each of these locations. We validate the algorithm to the extent possible by comparing LLJs identified by lidar, constrained to the lowest 200 m, to WRF simulations of these very low LLJs (vLLJs). In the NOW-WAKES simulation data set, we find offshore LLJs in this region occur about 25 % of the time, most frequently at night, in the spring and summer months, in stably stratified conditions, and when a southwesterly wind is blowing. LLJ wind speed maxima range from 10 m s−1 to over 40 m s−1. The altitude of maximum wind speed, or the jet “nose”, is typically 300 m above the surface, above the height of most profiling lidars, although several hours of vLLJs occur in each month in the data set. The diurnal cycle for vLLJs is less pronounced than for all LLJs. Wind farms erode LLJs, as LLJs occur less frequently (19 %–20 % of hours) in the wind farm simulations than in the no-wind-farm (NWF) simulation (25 % of hours). When LLJs do occur in the simulation with wind farms, their noses are higher than in the NWF simulation: the LLJ nose has a mean altitude near 300 m for the NWF jets, but that nose height moves higher in the presence of wind farms, to a mean altitude near 400 m. Rotor region (30–250 m) wind veer is reduced across almost all months of the year in the wind farm simulations, while rotor region wind shear is similar in both simulations.

17 WIND ENERGY↗
DOE OSTI2026

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O ( n ) to O (√ n ). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06% for [[18,4,4]] BB code, 2.6× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

Liu, Kun [Yale Univ., New Haven, CT (United States↗
DOE OSTI2020

mpfit: a robust method for fitting atomic resolution images with multiple Gaussian peaks

The standard technique for sub-pixel estimation of atom positions from atomic resolution scanning transmission electron microscopy images relies on fitting intensity maxima or minima with a two-dimensional Gaussian function. While this is a widespread method of measurement, it can be error prone in images with non-zero aberrations, strong intensity differences between adjacent atoms or in situations where the neighboring atom positions approach the resolution limit of the microscope. Here we demonstrate mpfit, an atom finding algorithm that iteratively calculates a series of overlapping two-dimensional Gaussian functions to fit the experimental dataset and then subsequently uses a subset of the calculated Gaussian functions to perform sub-pixel refinement of atom positions. Based on both simulated and experimental datasets presented in this work, this approach gives lower errors when compared to the commonly used single Gaussian peak fitting approach and demonstrates increased robustness over a wider range of experimental conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

The completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: growth rate of structure measurement from cosmic voids

ABSTRACT We present a void clustering analysis in configuration-space using the completed Sloan Digital Sky Survey IV (SDSS-IV) extended Baryon Oscillation Spectroscopic Survey (eBOSS) DR16 samples. These samples consist of Luminous Red Galaxies (LRGs) combined with the high-redshift tail of the SDSS-III Baryon Oscillation Spectroscopic Survey (BOSS) DR12 CMASS galaxies (called as LRG+CMASS sample), Emission Line Galaxies (ELGs), and quasars (QSOs). We build void catalogues from the three eBOSS DR16 samples using a ZOBOV-based algorithm, providing 2814 voids, 1801 voids, and 4347 voids in the LRG+CMASS, ELG, and QSO samples, respectively, spanning the redshift range 0.6 < z < 2.2. We measure the redshift space distortions around voids using the anisotropic void-galaxy cross-correlation function and we extract the distortion parameter β. We test the methodology on realistic simulations before applying it to the data, and we investigate all our systematic errors on these mocks. We find βLRG(z = 0.74) = 0.415 ± 0.087, βELG(z = 0.85) = 0.665 ± 0.125 and βQSO(z = 1.48) = 0.313 ± 0.134, for the LRG+CMASS, ELG, and QSO sample, respectively. The quoted errors include systematic and statistical contributions. In order to convert our measurements in terms of the growth rate fσ8, we use consensus values of linear bias from the eBOSS DR16 companion papers, resulting in the following constraints: fσ8(z = 0.74) = 0.50 ± 0.11, fσ8(z = 0.85) = 0.52 ± 0.10, and fσ8(z = 1.48) = 0.30 ± 0.13. Our measurements are consistent with other measurements from eBOSS DR16 using conventional clustering techniques.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

The Dark Energy Survey Supernova Program: Cosmological Biases from Host Galaxy Mismatch of Type Ia Supernovae

Abstract Redshift measurements, primarily obtained from host galaxies, are essential for inferring cosmological parameters from type Ia supernovae (SNe Ia). Matching SNe to host galaxies using images is nontrivial, resulting in a subset of SNe with mismatched hosts and thus incorrect redshifts. We evaluate the host galaxy mismatch rate and resulting biases on cosmological parameters from simulations modeled after the Dark Energy Survey 5 Yr (DES-SN5YR) photometric sample. For both DES-SN5YR data and simulations, we employ the directional light radius method for host galaxy matching. In our SN Ia simulations, we find that 1.7% of SNe are matched to the wrong host galaxy, with redshift differences between the true and matched hosts of up to 0.6. Using our analysis pipeline, we determine the shift in the dark energy equation of state parameter (Δ w ) due to including SNe with incorrect host galaxy matches. For SN Ia–only simulations, we find Δ w = 0.0013 ± 0.0026 with constraints from the cosmic microwave background. Including core-collapse SNe and peculiar SNe Ia in the simulation, we find that Δ w ranges from 0.0009 to 0.0032, depending on the photometric classifier used. This bias is an order of magnitude smaller than the expected total uncertainty on w from the DES-SN5YR sample of ∼0.03. We conclude that the bias on w from host galaxy mismatch is much smaller than the uncertainties expected from the DES-SN5YR sample, but we encourage further studies to reduce this bias through better host-matching algorithms or selection cuts.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Unsupervised Resource Allocation with Graph Neural Networks

We present an approach for maximizing a global utility function by learning how to allocate resources in an unsupervised way. We expect interactions between allocation targets to be important and therefore propose to learn the reward structure for near-optimal allocation policies with a GNN. By relaxing the resource constraint, we can employ gradient-based optimization in contrast to more standard evolutionary algorithms. Our algorithm is motivated by a problem in modern astronomy, where one needs to select-based on limited initial information-among $10^9$ galaxies those whose detailed measurement will lead to optimal inference of the composition of the universe. Our technique presents a way of flexibly learning an allocation strategy by only requiring forward simulators for the physics of interest and the measurement process. We anticipate that our technique will also find applications in a range of resource allocation problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

A fitting algorithm for optimizing ion implantation energies and fluences

In this work we describe a method to automatically generate an ion implantation recipe, a set of energies and fluences, to produce a desired defect density profile in a solid using the fewest required energies. We simulate defect density profiles for a range of ion energies, fit them with an appropriate function, and interpolate to yield defect density profiles at arbitrary ion energies. Given Ν energies, we then optimize a set of Ν energy-fluence pairs to match a given target defect density profile. Finally, we find the minimum Ν such that the error between the target defect density profile and the defect density profile generated by the Ν energy-fluence pairs is less than a given threshold. Inspired by quantum sensing applications with nitrogen-vacancy centers in diamond, we apply our technique to calculate optimal ion implantation recipes to create uniform-density 1 μm surface layers of 15 N or vacancies (using 4 He).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

C-SAW: a framework for graph sampling and random walk on GPUs

Many applications require to learn, mine, analyze and visualize large-scale graphs. These graphs are often too large to be addressed efficiently using conventional graph processing technologies. Fortunately, recent research efforts find out graph sampling and random walk, which significantly reduce the size of original graphs, can benefit the tasks of learning, mining, analyzing and visualizing large graphs by capturing the desirable graph properties. This paper introduces C-SAW, the first framework that accelerates Sampling and Random Walk framework on GPUs. Particularly, C-SAW makes three contributions: First, our framework provides a generic API which allows users to implement a wide range of sampling and random walk algorithms with ease. Second, offloading this framework on GPU, we introduce warp-centric parallel selection, and two novel optimizations for collision migration. Third, towards supporting graphs that exceed the GPU memory capacity, we introduce efficient data transfer optimizations for out-of-memory and multi-GPU sampling, such as workload-aware scheduling and batched multi-instance sampling. Taken together, our framework constantly outperforms the state of the art projects in addition to the capability of supporting a wide range of sampling and random walk algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Barium stars as tracers of s -process nucleosynthesis in AGB stars: II. Using machine learning techniques on 169 stars

Barium (Ba) stars are characterised by an abundance of heavy elements made by the slow neutron capture process (s-process). This peculiar observed signature is due to the mass transfer from a stellar companion, bound in a binary stellar system, to the Ba star observed today. The signature is created when the stellar companion is an asymptotic giant branch (AGB) star. We aim to analyse the abundance pattern of 169 Ba stars using machine learning techniques and the AGB final surface abundances predicted by the FRUITY and Monash stellar models. We developed machine learning algorithms that use the abundance pattern of Ba stars as input to classify the initial mass and metallicity of each Ba star’s companion star using stellar model predictions. We used two algorithms. The first exploits neural networks to recognise patterns, and the second is a nearest-neighbour algorithm that focuses on finding the AGB model that predicts the final surface abundances closest to the observed Ba star values. In the second algorithm, we included the error bars and observational uncertainties in order to find the best-fit model. The classification process was based on the abundances of Fe, Rb, Sr, Zr, Ru, Nd, Ce, Sm, and Eu. We selected these elements by systematically removing s-process elements from our AGB model abundance distributions and identifying the elements whose removal had the biggest positive effect on the classification. We excluded Nb, Y, Mo, and La. Our final classification combined the output of both algorithms to identify an initial mass and metallicity range for each Ba star companion. With our analysis tools, we identified the main properties for 166 of the 169 Ba stars in the stellar sample. The classifications based on both stellar sets of AGB final abundances show similar distributions, with an average initial mass of M = 2.23 M ⊙ and 2.34 M ⊙ and an average [Fe/H] = –0.21 and –0.11, respectively. We investigated why the removal of Nb, Y, Mo, and La improves our classification and identified 43 stars for which the exclusion had the biggest effect. We found that these stars have statistically significant and different abundances for these elements compared to the other Ba stars in our sample. We discuss the possible reasons for these differences in the abundance patterns.

79 ASTRONOMY AND ASTROPHYSICS↗