Search NASA⌕ Search

SEARCH · Search NASA

Results for “tree search”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Machine learning techniques for intermediate mass gap lepton partner searches at the large hadron collider

We consider machine learning techniques associated with the application of a boosted decision tree (BDT) to searches at the Large Hadron Collider (LHC) for pair-produced lepton partners which decay to leptons and invisible particles. This scenario can arise in the minimal supersymmetric Standard Model (MSSM), but can be realized in many other extensions of the Standard Model (SM). We focus on the case of intermediate mass splitting ( ∼ 30 GeV ) between the dark matter (DM) and the scalar. For these mass splittings, the LHC has made little improvement over LEP due to large electroweak backgrounds. We find that the use of machine learning techniques can push the LHC well past discovery sensitivity for a benchmark model with a lepton partner mass of ∼ 110 GeV , for an integrated luminosity of 300 fb − 1 , with a signal-to-background ratio of ∼ 0.3 . The LHC could exclude models with a lepton partner mass as large as ∼ 160 GeV with the same luminosity. The use of machine learning techniques in searches for scalar lepton partners at the LHC could thus definitively probe the parameter space of the MSSM in which scalar muon mediated interactions between SM muons and Majorana singlet DM can both deplete the relic density through dark matter annihilation and satisfy the recently measured anomalous magnetic moment of the muon. We identify several machine learning techniques which can be useful in other LHC searches involving large and complex backgrounds. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2020

Nearest neighbour distributions: New statistical measures for cosmological clustering

ABSTRACT The use of summary statistics beyond the two-point correlation function to analyse the non-Gaussian clustering on small scales, and thereby, increasing the sensitivity to the underlying cosmological parameters, is an active field of research in cosmology. In this paper, we explore a set of new summary statistics – the k-Nearest Neighbour Cumulative Distribution Functions (kNN-CDF). This is the empirical cumulative distribution function of distances from a set of volume-filling, Poisson distributed random points to the k-nearest data points, and is sensitive to all connected N-point correlations in the data. The kNN-CDF can be used to measure counts in cell, void probability distributions, and higher N-point correlation functions, all using the same formalism exploiting fast searches with spatial tree data structures. We demonstrate how it can be computed efficiently from various data sets – both discrete points, and the generalization for continuous fields. We use data from a large suite of N-body simulations to explore the sensitivity of this new statistic to various cosmological parameters, compared to the two-point correlation function, while using the same range of scales. We demonstrate that the use of kNN-CDF improves the constraints on the cosmological parameters by more than a factor of 2 when applied to the clustering of dark matter in the range of scales between 10 and $40\, h^{-1}\, {\rm Mpc}$. We also show that relative improvement is even greater when applied on the same scales to the clustering of haloes in the simulations at a fixed number density, both in real space, as well as in redshift space. Since the kNN-CDF are sensitive to all higher order connected correlation functions in the data, the gains over traditional two-point analyses are expected to grow as progressively smaller scales are included in the analysis of cosmological data, provided the higher order correlation functions are sensitive to cosmology on the scales of interest.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Parallax-corrected VISST-derived pixel-level products from satellite GOES-16

The NASA Langley group led by William Smith produced GOES-16 satellite cloud retrievals over an approximate 10 by 10 degree region over the CACTI field campaign location. These retrievals are described here: https://www.arm.gov/capabilities/vaps/visst and are available for download here . They use algorithms historically called VISST that are now referred to as SatCORPS. More information can be found in Trepte et al. (2019), Minnis et al. (2021), and Yost et al. (2021). If using this dataset, please cite these references, the CACTI VISST dataset DOI found at the download link above, and this dataset’s DOI. The CACTI VISST pixel-level retrievals are on a 2 km spatial grid and available every 15 minutes (every 10 minutes late in the campaign), producing 21,765 files for the entire field campaign between October 2018 and April 2019. They are not corrected for parallax error, which is an offset in the actual geographical location of a cloud above the surface due to the satellite viewing the cloud partly from the side off nadir. This dataset applies a correction for parallax using the location relative to the satellite and the retrieved cloud top height above the surface, which allows the dataset to be geo-located with surface-based observations. The parallax correction for each location depends on the longitude, latitude and cloud top height above ground level (AGL) for that longitude and latitude in the original VISST files. The cloud top height AGL requires first computing the surface elevation at each VISST grid point. Data from the Advanced Spaceborne Thermal Emission and Reflection (ASTER) Global Digital Elevation Map Version 3 at 30-m resolution is projected onto the VISST grid using conservative coarsening (conserving surface elevation) in the xESMF Python package. The surface elevation is then subtracted from the VISST-retrieved cloud top height above mean sea level. These cloud top heights AGL are then combined with longitude and latitude to estimate the latitude and longitude corrections. Due to variability in cloud top height, the parallax shifts produce an irregular grid of values since higher cloud tops are shifted further than lower cloud tops. A ball tree-based neighbor search with Haversine distance is performed using the Python-based scikit-learn library to find the nearest VISST grid point to each parallax correction-shifted point. The data value of the shifted point is then assigned to that VISST grid point. In this manner, the irregular geographical shifts to correct for parallax are projected back to the rectilinear VISST grid. Because relatively higher clouds should obscure lower clouds, the variable values for the highest cloud top are preferentially chosen if two or more values are assigned to a grid point. The parallax correction should be viewed as an improved but still imperfect estimation of the cloud top locations, largely because the cloud top height is an imperfect retrieval. Please see the attached README document for further information. Users are encouraged to contact the authors with any additional questions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Optimization and Augmentation for Data Parallel Contour Trees

Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. Furthermore, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Distinctive signals of frustrated dark matter

We study a renormalizable model of Dirac fermion dark matter (DM) that communicates with the Standard Model (SM) through a pair of mediators — one scalar, one fermion — in the representation (6, 1, $\frac{4}{3}$) of the SM gauge group SU(3) c x SU(2) L x U(1) Y . While such assignments preclude direct coupling of the dark matter to the Standard Model at tree level, we examine the many effective operators generated at one-loop order when the mediators are heavy, and find that they are often phenomenologically relevant. We reinterpret dijet and pair-produced resonance and jets + E$^{miss}_{T}$ searches at the Large Hadron Collider (LHC) in order to constrain the mediator sector, and we examine an array of DM constraints ranging from the observed relic density Ω χ h$^{2}_{Planck}$ to indirect and direct searches for dark matter. Tree-level annihilation, available for DM masses starting at the TeV scale, is required in order to produce Ω χ h$^{2}_{Planck}$ through freeze-out, but loops — led by the dimension-five DM magnetic dipole moment — are nonetheless able to produce signals large enough to be constrained, particularly by the XENON1T experiment. In some benchmarks, we find a fair amount of parameter space left open by experiment and compatible with freeze-out. In other scenarios, however, the open space is quite small, suggesting a need for further model-building and/or non-standard cosmologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Automatic Search of Cataclysmic Variables Based on LightGBM in LAMOST-DR7

The search for special and rare celestial objects has always played an important role in astronomy. Cataclysmic Variables (CVs) are special and rare binary systems with accretion disks. Most CVs are in the quiescent period, and their spectra have the emission lines of Balmer series, HeI, and HeII. A few CVs in the outburst period have the absorption lines of Balmer series. Owing to the scarcity of numbers, expanding the spectral data of CVs is of positive significance for studying the formation of accretion disks and the evolution of binary star system models. At present, the research for astronomical spectra has entered the era of Big Data. The Large Sky Area Multi-Object Fiber Spectroscopy Telescope (LAMOST) has produced more than tens of millions of spectral data. the latest released LAMOST-DR7 includes 10.6 million low-resolution spectral data in 4926 sky regions, providing ideal data support for searching CV candidates. To process and analyze the massive amounts of spectral data, this study employed the Light Gradient Boosting Machine (LightGBM) algorithm, which is based on the ensemble tree model to automatically conduct the search in LAMOST-DR7. Finally, 225 CV candidates were found and four new CV candidates were verified by SIMBAD and published catalogs. This study also built the Gradient Boosting Decision Tree (GBDT), Adaptive Boosting (AdaBoost), and eXtreme Gradient Boosting (XGBoost) models and used Accuracy, Precision, Recall, the F1-score, and the ROC curve to compare the four models comprehensively. Experimental results showed that LightGBM is more efficient. The search for CVs based on LightGBM not only enriches the existing CV spectral library, but also provides a reference for the data mining of other rare celestial objects in massive spectral data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Rapidly convergent quantum Monte Carlo using a Chebyshev projector

The multireference coupled-cluster Monte Carlo (MR-CCMC) algorithm is a determinant-based quantum Monte Carlo (QMC) algorithm that is conceptually similar to Full Configuration Interaction QMC (FCIQMC). It has been shown to offer a balanced treatment of both static and dynamic correlation while retaining polynomial scaling, although application to large systems with significant strong correlation remained impractical. In this paper, we document recent algorithmic advances that enable rapid convergence and a more black-box approach to the multireference problem. These include a logarithmically scaling metric-tree-based excitation acceptance algorithm to search for determinants connected to the reference space at the desired excitation level and a symmetry-screening procedure for the reference space. We show that, for moderately sized reference spaces, the new search algorithm brings about an approximately 8-fold acceleration of one MR-CCMC iteration, while the symmetry screening procedure reduces the number of active reference space determinants with essentially no loss of accuracy. We also introduce a stochastic implementation of an approximate wall projector, which is the infinite imaginary time limit of the exponential projector, using a truncated expansion of the wall function in Chebyshev polynomials. Notably, this wall-Chebyshev projector can be used to accelerate any projector-based QMC algorithm. We show that it requires significantly fewer applications of the Hamiltonian to achieve the same statistical convergence. We benchmark these acceleration methods on the beryllium and carbon dimers, using initiator FCIQMC and MR-CCMC with basis sets up to cc-pVQZ quality.

Zhao, Zijun↗
DOE OSTI2021

Failure prediction and estimation of failure parameters

Machine-learning methods and apparatus are disclosed to determine frictional state or other parameters in an earthquake zone or other failing medium, using acoustic emission, seismic waves, or other detectable indicators of microscopic processes. Predictions of future failures are demonstrated in different regimes. A classifier is trained using time series of acoustic emission data along with historic data of frictional state or failure events. In disclosed examples, random forests and gradient boost trees are used, and grid-search or EGO procedures are used for hyperparameter tuning. Once trained, the classifier can be applied to testing or live data in order to assess a frictional state, assess seismic hazard, or make predictions regarding a future failure event. The technology has been developed in a double direct shear apparatus, but can be widely applied to seismic faults, other terrestrial failures, or failures in man-made structures. Variations are disclosed.

Johnson, Paul Allan↗
DOE OSTI2024

MicroBooNE investigations on the photon interpretation of the MiniBooNE low energy excess

The MicroBooNE experiment is a liquid argon time projection chamber with 85-ton active volume at Fermilab, operated from 2015 to 2020 to collect neutrino data from Fermilab's Booster Neutrino Beam. One of MicroBooNE's physics goals is to investigate possible explanations of the low-energy excess observed by the MiniBooNE experiment in $\nu_{\mu}\rightarrow \nu_{e}$ neutrino oscillation measurements. MicroBooNE has performed searches to test hypothetical interpretations of the MiniBooNE low-energy excess, including the underestimation of the photon background or instrinic $\nu_{e}$ background. This thesis presents MicroBooNE's searches for two neutral current (NC) single-photon production processes that contribute to the photon background of the MiniBooNE measurement: NC $\Delta$ resonance production followed by $\Delta$ radiative decay: $\Delta \rightarrow N\gamma$, and NC coherent single-photon production. Both searches take advantage of boosted decision trees to yield efficient background rejection, and a high-statistic NC $\pi^0$ measurement to constrain dominant background, and make use of MicroBooNE's first three years of data. The NC $\Delta \rightarrow N\gamma$ measurement yielded a bound on the $\Delta$ radiative decay process at 2.3 times the predicted nominal rate at 90\% confidence level(C.L.), disfavoring a candidate photon interpretation of the MiniBooNE low-energy excess as a factor of 3.18 times the nominal NC Δ radiative decay rate at the 94.8\% C.L. The NC coherent single photon measurement leads to the world's first experimental limit on the cross-section of this process below 1 GeV, of $1.49 \times 10^{-41} \text{cm}^2$ at 90\% C.L., corresponding to 24.0 times the nominal prediction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Metal hydride composition-derived parameters as machine learning features for material design and H 2 storage

Though hydrogen is a promising energy carrier for a green future, many challenges persist. One is the difficulty in engineering storage solutions, with metal hydrides being a leading contender among solid-state strategies. To facilitate efficient searching of candidate materials, ridge regression, simple decision trees, random forest ensembles, and gradient boosting ensembles were employed to predict the energy of formation, with the random forest ensemble resulting in the lowest test set error. First, two public databases, Materials Project and HydPark, were searched for metal hydrides. Feature engineering was performed before the models were developed, resulting in electronegativity, density, atomic density, d-character, f-character, band gap, hydrogen weight fraction, magnetization, temperature, and pressure being retained. The models were then benchmarked by the lowest test error before a random forest ensemble was used to populate entries missing energy of formation. Furthermore, all were then scored by hydrogen storage capacity and energy of formation suitability. Readily available features including several derived from only the chemical formula which were found to be highly predictive. and so are promising for high-throughput screening of arbitrary novel hydride formulations and blends for thermodynamic feasibility.

25 ENERGY STORAGE↗
DOE OSTI2026

CDRL: Certification-Driven Reinforcement Learning for Neutrino Flavor Model Discovery

Many scientific discovery problems require searching combinatorial hypothesis spaces under complex domain constraints. Reinforcement learning (RL) offers a promising approach, but existing methods rely on scalar rewards that provide limited information about why candidate solutions fail, leading agents to repeatedly explore invalid regions. We introduce Certification-Driven Reinforcement Learning (CDRL), a framework that leverages structured feedback from symbolic reasoning tools. When a candidate violates domain constraints, these tools produce certificates identifying the actions responsible for failure. CDRL converts these certificates into reusable constraints that eliminate classes of invalid solutions and guide exploration toward valid regions. We evaluate CDRL on neutrino flavor model discovery in theoretical particle physics, where the hypothesis space exceeds $10^{26}$ possible models, and compare it with the state-of-the-art RL approach previously used for this task. Across three theory spaces, CDRL achieves up to 1.95$\times$ higher valid model rates and up to 6.33$\times$ higher neutrino model rates while evaluating up to 4$\times$ fewer candidates. We further extract 40 interpretable rules from search trajectories using a post-hoc decision-tree framework and show that reusing them as soft constraints yields gains of up to 2$\times$ in valid model rates and 3$\times$ in neutrino model discovery across all three theory spaces. These results suggest that CDRL uncovers reusable structure in combinatorial search spaces and provides a general framework for scientific model discovery.

Jha, Piyush [Georgia Tech., Atlanta; Georgia Tech]↗
DOE OSTI2023

Interpretable boosted-decision-tree analysis for the Majorana Demonstrator

The Majorana Demonstrator is a leading experiment searching for neutrinoless double-beta decay with high purity germanium detectors (HPGe). Machine learning provides a new way to maximize the amount of information provided by these detectors, but the data-driven nature makes it less interpretable compared to traditional analysis. An interpretability study reveals the machine's decision-making logic, allowing us to learn from the machine to feedback to the traditional analysis. In this work, we have presented the first machine learning analysis of the data from the Majorana Demonstrator; this is also the first interpretable machine learning analysis of any germanium detector experiment. Two gradient boosted decision tree models are trained to learn from the data, and a game-theory-based model interpretability study is conducted to understand the origin of the classification power. By learning from data, this analysis recognizes the correlations among reconstruction parameters to further enhance the background rejection performance. By learning from the machine, this analysis reveals the importance of new background categories to reciprocally benefit the standard Majorana analysis. This model is highly compatible with next-generation germanium detector experiments like LEGEND since it can be simultaneously trained on a large number of detectors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Search for dark photons from Higgs boson decays via $ZH$ production with a photon plus missing transverse momentum signature from $pp$ collisions at $\sqrt{s}$ = 13 TeV with the ATLAS detector

This paper describes a search for dark photons ($γ_d$) in proton-proton collisions at $\sqrt{s}$ = 13 TeV at the Large Hadron Collider (LHC). The dark photons are searched for in the decay of Higgs bosons ($H$ → $γγ_d$) produced through the $ZH$ production mode. The transverse mass of the system, made of the photon and the missing transverse momentum from the non-interacting $γ_d$, presents a distinctive signature as it peaks near the Higgs boson mass. The results presented use the total Run-2 integrated luminosity of 139 fb –1 recorded by the ATLAS detector at the LHC. The dominant reducible background processes are estimated using data-driven techniques. A Boosted Decision Tree technique is adopted to enhance the sensitivity of the search. As no excess is observed with respect to the Standard Model prediction, an observed (expected) upper limit on the branching ratio BR($H$ → $γγ_d$) of 2.28% (${2.82}_{–0.84}^{+1.33}$%) is set at 95% CL for massless $γ_d$. For massive dark photons up to 40 GeV, the observed (expected) upper limits on BR($H$ → $γγ_d$) at 95% confidence level is found within the [2.19,2.52]% ([2.71,3.11]%) range.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs

DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.

Prokopenko, Andrey↗
DOE OSTI2020

A Model Tree Generator (MTG) Framework for Simulating Hydrologic Systems: Application to Reservoir Routing

Data-driven algorithms have been widely used as effective tools to mimic hydrologic systems. Unlike black-box models, decision tree algorithms offer transparent representations of systems and reveal useful information about the underlying process. A popular class of decision tree models is model tree (MT), which is designed for predicting continuous variables. Most MT algorithms employ an exhaustive search mechanism and a pre-defined splitting criterion to generate a piecewise linear model. However, this approach is computationally intensive, and the selection of the splitting criterion can significantly affect the performance of the generated model. These drawbacks can limit the application of MTs to large datasets. To overcome these shortcomings, a new flexible Model Tree Generator (MTG) framework is introduced here. MTG is equipped with several modules to provide a flexible, efficient, and effective tool for generating MTs. The application of the algorithm is demonstrated through simulation of controlled discharge from several reservoirs across the Contiguous United States (CONUS).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Search for resonant production of strongly coupled dark matter in proton-proton collisions at 13 TeV

The first collider search for dark matter arising from a strongly coupled hidden sector is presented and uses a data sample corresponding to 138 fb$^{-1}$, collected with the CMS detector at the CERN LHC, at $ \sqrt{s} $ = 13 TeV. The hidden sector is hypothesized to couple to the standard model (SM) via a heavy leptophobic Z' mediator produced as a resonance in proton-proton collisions. The mediator decay results in two “semivisible” jets, containing both visible matter and invisible dark matter. The final state therefore includes moderate missing energy aligned with one of the jets, a signature ignored by most dark matter searches. No structure in the dijet transverse mass spectra compatible with the signal is observed. Assuming the Z' boson has a universal coupling of 0.25 to the SM quarks, an inclusive search, relevant to any model that exhibits this kinematic behavior, excludes mediator masses of 1.5–4.0 TeV at 95% confidence level, depending on the other signal model parameters. To enhance the sensitivity of the search for this particular class of hidden sector models, a boosted decision tree (BDT) is trained using jet substructure variables to distinguish between semivisible jets and SM jets from background processes. When the BDT is employed to identify each jet in the dijet system as semivisible, the mediator mass exclusion increases to 5.1 TeV, for wider ranges of the other signal model parameters. These limits exclude a wide range of strongly coupled hidden sector models for the first time.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Efficient loading of reduced data ensembles produced at ORNL SNS/HFIR neutron time-of-flight facilities

We present algorithmic improvements to the loading operations of certain reduced data ensembles produced from neutron scattering experiments at Oak Ridge National Laboratory (ORNL) facilities. Ensembles from multiple measurements are required to cover a wide range of the phase space of a sample material of interest. They are stored using the standard NeXus schema on individual HDF5 files. This makes it a scalability challenge, as the number of experiments stored increases in a single ensemble file. The present work follows up on our previous efforts on data management algorithms, to address identified input output (I/O) bottlenecks in Mantid, an open-source data analysis framework used across several neutron science facilities around the world. We reuse an in-memory binary-tree metadata index that resembles data access patterns, to provide a scalable search and extraction mechanism. In addition, several memory operations are refactored and optimized for the current common use cases, ranging most frequently from 10 to 180, and up to 360 separate measurement configurations. Results from this work show consistent speed ups in wall-clock time on the Mantid LoadMD routine, ranging from 19% to 23% on average, on ORNL production computing systems. The latter depends on the complexity of the targeted instrument-specific data and the system I/O and compute variability for the shared computational resources available to users of ORNL’s Spallation Neutron Source (SNS) and the High Flux Isotope Reactor (HFIR) instruments. Nevertheless, we continue to highlight the need for more research to address reduction challenges as experimental data volumes, user time and processing costs increase.

Godoy, William↗
DOE OSTI2023

Hydraulic safety and growth rather than climate of origin influence survival in desert shrubs and trees

The species-poor woodlands and forests in arid regions are particularly vulnerable to climate change induced plant die-off. Searching for species suitable to replant in these areas is an effective way to prevent further expansion of land desertification. Good knowledge of drought resistance of species is critical for current replanting efforts, however, the related plant survival mechanisms in the process of restoration remain limited. Here, we tested the dominant drivers of plant survival in relation to climate factors, growth characteristics and functional traits including hydraulics and gas exchange across 35 multiple shrub and tree woody species in a common garden at the Tengger Desert, northwest China. We found the desert plants had a wide range of hydraulic thresholds among these desert species, with relative high hydraulic safety, and low xylem hydraulic conductivity. Pant survival was largely determined by hydraulic safety and growth status, but was not affected by the climate of the species’ site of origin. Shrubs and trees diverged in hydraulic and growth characteristics, while there was no difference between native and introduced species. In this study, our results highlight the critical roles of hydraulic safety and growth on determining the survival and drought adaptation during desert vegetation development, which provide a new insight into ecological restoration in arid regions under changing climate conditions.

54 ENVIRONMENTAL SCIENCES↗