SEARCH · Search NASA

Results for “algorithm selection”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,495 records · Page 83

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Is Knowledge about Running Applications Helping Improve Runtime Prediction of HPC Jobs?

High-performance computing systems rely upon scheduling algorithms to achieve high utilization. These schedulers rely upon user estimates of job resource requirements, such as runtime, to determine optimal scheduling of incoming jobs. These user estimates, however, are prone to error. To mitigate this error, significant research has been directed at providing better estimates of job runtime, usually employing machine learning techniques. These techniques are dependent upon the input features selected. Among the possible features is the primary application used by the job. In a survey of more than 20 papers directed at improving runtime prediction, only four included primary application as an input feature. We focus this investigation specifically on the value of adding primary application as an input feature, and find that it does improve model performance, especially for jobs with longer runtimes, though this improvement varies based on the application used. We recommend further research to determine the cause of this variability as well as an optimal strategy for employing a mixture of models both including and not including primary application as a feature.

MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Validation of LOCA2 and STAR-ESDM Statistically Downscaled Products

The National Climate Assessment (NCA) is the preeminent national report examining current and future risks posed by climate change. Countless agencies, policymakers, stakeholders and other end-users rely upon guidance from the NCA to plan for an uncertain future. These groups all depend on modern curated data, provided alongside the NCA, to quantify the impact of climate change on metrics of relevance for their decision processes. In its fifth iteration (NCA5), two statistically downscaled ensemble products, each providing data at grid spacing of approximately 5km over the contiguous United States, were selected to accompany the report. These include LOCalized Analogs version 2 (LOCA2) and Seasonal Trends and Analysis of Residuals Empirical-Statistical Downscaling Model (STAR-ESDM). Both data products are produced through a process known as statistical downscaling, where relatively coarse Global Climate Model (GCM) data is refined to locally relevant scales through the application of scientifically-supported empirical and algorithmic relationships. In support of the NCA effort, this report provides an independent validation of these two products against historical observations, with a focus on precipitation and near-surface temperature variables. Based on the results of this validation, several recommendations are provided related to the use of these data products. The structure of this report is as follows: In section 2, we review three gridded observational products that are used as part of our intercomparison. In section 3, we describe the two statistical downscaling techniques and their corresponding datasets that are the focus of this study. In section 4, the methodology we employ for validation is described. Section 5 provides results of the validation, which in turn motivate our recommendations on the use of these data products. A brief summary is provided in section 6.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Is Knowledge About Running Applications Helping Improve Runtime Prediction of HPC Jobs?

feature selection↗

DOE OSTI2014

Composition-dependent stability of the medium-range order responsible for metallic glass formation

The competition between the characteristic medium-range order corresponding to amorphous alloys and that in ordered crystalline phases is central to phase selection and morphology evolution under various processing conditions. We examine the stability of a model glass system, Cu–Zr, by comparing the energetics of various medium-range structural motifs over a wide range of compositions using first-principles calculations. Furthermore, we focus specifically on motifs that represent possible building blocks for competing glassy and crystalline phases, and we employ a genetic algorithm to efficiently identify the energetically favored decorations of each motif for specific compositions. These results show that a Bergman-type motif with crystallization-resisting icosahedral symmetry is energetically most favorable in the composition range 0.63 < xCu < 0.68, and is the underlying motif for one of the three optimal glass-forming ranges observed experimentally for this binary system (Li et al., 2008). This work establishes an energy-based methodology to evaluate specific medium-range structural motifs which compete with stable crystalline nuclei in deeply undercooled liquids.

36 MATERIALS SCIENCE↗

DOE OSTI2023

A sharp interface Lagrangian-Eulerian method for flexible-body fluid-structure interaction

This paper introduces a sharp-interface approach to simulating fluid-structure interaction (FSI) involving flexible bodies described by general nonlinear material models and across a broad range of mass density ratios. This new flexible-body immersed Lagrangian-Eulerian (ILE) scheme extends our prior work on integrating partitioned and immersed approaches to rigid-body FSI. Our numerical approach incorporates the geometrical and domain solution flexibility of the immersed boundary (IB) method with an accuracy comparable to body-fitted approaches that sharply resolve flows and stresses up to the fluid-structure interface. Unlike many IB methods, our ILE formulation uses distinct momentum equations for the fluid and solid subregions with a Dirichlet-Neumann coupling strategy that connects fluid and solid subproblems through simple interface conditions. As in earlier work, we use approximate Lagrange multiplier forces to treat the kinematic interface conditions along the fluid-structure interface. This penalty approach simplifies the linear solvers needed by our formulation by introducing two representations of the fluid-structure interface, one that moves with the fluid and another that moves with the structure, that are connected by stiff springs. This approach also enables the use of multi-rate time stepping, which allows us to use different time step sizes for the fluid and structure subproblems. Our fluid solver relies on an immersed interface method (IIM) for discrete surfaces to impose stress jump conditions along complex interfaces while enabling the use of fast structured-grid solvers for the incompressible Navier-Stokes equations. The dynamics of the volumetric structural mesh are determined using a standard finite element approach to large-deformation nonlinear elasticity via a nearly incompressible solid mechanics formulation. This formulation also readily accommodates compressible structures with a constant total volume, and it can handle fully compressible solid structures for cases in which at least part of the solid boundary does not contact the incompressible fluid. Selected grid convergence studies demonstrate second-order convergence in volume conservation and in the pointwise discrepancies between corresponding positions of the two interface representations as well as between first and second-order convergence in the structural displacements. The time stepping scheme is also demonstrated to yield second-order convergence. To assess and validate the robustness and accuracy of the new algorithm, comparisons are made with computational and experimental FSI benchmarks. Test cases include both smooth and sharp geometries in various flow conditions. Furthermore, we also demonstrate the capabilities of this methodology by applying it to model the transport and capture of a geometrically realistic, deformable blood clot in an inferior vena cava filter.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

A new background distribution-based active contour model for three-dimensional lesion segmentation in breast DCE-MRI

Purpose: To develop and evaluate a computerized semiautomatic segmentation method for accurate extraction of three-dimensional lesions from dynamic contrast-enhanced magnetic resonance images (DCE-MRIs) of the breast. Methods: The authors propose a new background distribution-based active contour model using level set (BDACMLS) to segment lesions in breast DCE-MRIs. The method starts with manual selection of a region of interest (ROI) that contains the entire lesion in a single slice where the lesion is enhanced. Then the lesion volume from the volume data of interest, which is captured automatically, is separated. The core idea of BDACMLS is a new signed pressure function which is based solely on the intensity distribution combined with pathophysiological basis. To compare the algorithm results, two experienced radiologists delineated all lesions jointly to obtain the ground truth. In addition, results generated by other different methods based on level set (LS) are also compared with the authors’ method. Finally, the performance of the proposed method is evaluated by several region-based metrics such as the overlap ratio. Results: Forty-two studies with 46 lesions that contain 29 benign and 17 malignant lesions are evaluated. The dataset includes various typical pathologies of the breast such as invasive ductal carcinoma, ductal carcinomain situ, scar carcinoma, phyllodes tumor, breast cysts, fibroadenoma, etc. The overlap ratio for BDACMLS with respect to manual segmentation is 79.55% ± 12.60% (mean ± s.d.). Conclusions: A new active contour model method has been developed and shown to successfully segment breast DCE-MRI three-dimensional lesions. The results from this model correspond more closely to manual segmentation, solve the weak-edge-passed problem, and improve the robustness in segmenting different lesions.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2015

SU-D-BRB-04: Plan Quality Comparison of Intracranial Stereotactic Radiosurgery (SRS) for Gamma Knife and VMAT Treatments

Purpose: To compare treatment plan quality of intracranial stereotactic radiosurgery (SRS) for VMAT (RapidArc) and Gamma Knife (GK) systems. Methods: Ten patients with 24 tumors (seven with 1–2 and three with 4–6 lesions), previously treated with GK 4C (prescription doses ranging from 14–23 Gy) were re-planned for RapidArc. Identical contour sets were kept on MRI images for both plans with tissues assigned a CT number of zero. RapidArc plans were performed using 6 MV flattening-filter-free (FFF) beams with dose rate of 1400 MU/minute using two to eight arcs with the following combinations: 2 full coplanar arcs and the rest non-coplanar half arcs. Beam selection was based on target depth. Areas that penetrated more than 10 cm of tissue were avoided by creating smaller arcs or using avoidance sectors in optimization. Plans were optimized with jaw tracking and a high weighting to the normal-brain-tissue and Normal-Tissue-Objective without compromising PTV coverage. Plans were calculated on a 1 mm grid size using AAA algorithm and then normalized so that 99% of each target volume received the prescription dose. Plan quality was assessed by target coverage using Paddick Conformity Index (PCI), sparing of normal-brain-tissue through analysis of V4, V8, and V12 Gy, and integral dose. Results: In all cases critical structure dose criteria were met. RapidArc had a higher PCI than GK plans for 23 out of 24 lesions. The average PCI was 0.76±0.21 for RapidArc and 0.46±0.20 for GK plans (p≤0.001), respectively. Integral dose and normal-brain-tissue doses for all criteria were lower for RapidArc in nearly all patients. The average ratio of GK to RapidArc plans was 1.28±0.27 (p=0.018), 1.31±0.25 (p=0.017), 1.81±0.43 (p=0.005), and 1.50±0.61 (p=0.006) for V4, V8, and V12 Gy, and integral dose, respectively. Conclusion: VMAT was capable of producing higher quality treatment plans than GK when using optimal beam geometries and proper optimization techniques.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2015

SU-E-T-393: Evaluation of Large Field IMRT Versus RapidArc Planning for Carcinoma Cervix with Para-Aotic Node Irradiation

Purpose: The objective of this work is to evaluate and compare Large field IMRT and RapidArc planning for Carcinoma Cervix and Para-aotic node irradiation. Methods: In this study, ten patients of Cervix with para-aotic node have been selected with PTV length 35+2cm. All plans were generated in Eclipse TPS V10.0 with Dynamic IMRT and RapidArc technique using 6MV photon energy. In IMRT planning, 7 fields were chosen to get optimal plan and in RapidArc, double Full arc clockwise and counter clockwise were used for planning. All the plans were generated with single isocenter and calculated using AAA dose algorithm. For all the cases the prescribed dose to PTV was same and the plan acceptance criteria is; 95% of the PTV volume should receive 100% prescribed dose. The tolerance doses for the OAR’s is also taken in to account. The evaluation criteria used for analysis are; 1) Homogeneity Index, 2) Conformity Index, 3) Mean Dose to OAR’s, 4)Total monitor units delivered. Results: DVH analysis were performed for both IMRT and RapidArc planning. In both the plans, 95% of PTV volume receives prescribed dose and maximum dose are less than 107%. The conformity index are same in both the techniques. The mean Homogeneity index are 1.036 and 1.053 for IMRT and RapidArc plan. The mean (mean + SD) dose of bladder and rectum in IMRT is 44.2+1.55, 42.05+2.52 and RapidArc is 46.66+1.6, 44.2+2.75 respectively. There is no significant difference found in Right Femoral head, Left Femoral head and Kidney doses. It is found that total MU’s are more in IMRT compared with RapidArc planning. Conclusion: In the case of cervix with Para-arotic node single isocenter irradiation, IMRT planning in large-field is better compared to RapidArc planning in terms of Homogeneity Index and mean dose of Bladder and Rectum.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2016

SU-F-J-23: Field-Of-View Expansion in Cone-Beam CT Reconstruction by Use of Prior Information

Purpose: Cone-beam CT (CBCT) has become an integral part of online patient setup in an image-guided radiation therapy (IGRT). In addition, the utility of CBCT for dose calculation has actively been investigated. However, the limited size of field-of-view (FOV) and resulted CBCT image with a lack of peripheral area of patient body prevents the reliability of dose calculation. In this study, we aim to develop an FOV expanded CBCT in IGRT system to allow the dose calculation. Methods: Three lung cancer patients were selected in this study. We collected the cone-beam projection images in the CBCT-based IGRT system (X-ray volume imaging unit, ELEKTA), where FOV size of the provided CBCT with these projections was 410 × 410 mm{sup 2} (normal FOV). Using these projections, CBCT with a size of 728 × 728 mm{sup 2} was reconstructed by a posteriori estimation algorithm including a prior image constrained compressed sensing (PICCS). The treatment planning CT was used as a prior image. To assess the effectiveness of FOV expansion, a dose calculation was performed on the expanded CBCT image with region-of-interest (ROI) density mapping method, and it was compared with that of treatment planning CT as well as that of CBCT reconstructed by filtered back projection (FBP) algorithm. Results: A posteriori estimation algorithm with PICCS clearly visualized an area outside normal FOV, whereas the FBP algorithm yielded severe streak artifacts outside normal FOV due to under-sampling. The dose calculation result using the expanded CBCT agreed with that using treatment planning CT very well; a maximum dose difference was 1.3% for gross tumor volumes. Conclusion: With a posteriori estimation algorithm, FOV in CBCT can be expanded. Dose comparison results suggested that the use of expanded CBCTs is acceptable for dose calculation in adaptive radiation therapy. This study has been supported by KAKENHI (15K08691).

60 APPLIED LIFE SCIENCES↗

DOE OSTI2021

Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates. This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned Toffoli decomposition such as the 8-CNOT Toffoli for the specific hardware qubits now known after the routing pass. Furthermore, we perform real experiments on IBM Johannesburg showing an average 35% decrease in two-qubit gate count and 23% increase in success rate of a single Toffoli over Qiskit. We additionally compile many near-term benchmark algorithms showing an average 344% increase in (or 4.44x) simulated success rate on the Johannesburg architecture and compare with other architecture types.

compiler↗

DOE OSTI2015

Limited-memory adaptive snapshot selection for proper orthogonal decomposition

Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Constraint-Based Routing Models for the Transport of Radioactive Materials

The Department of Energy (DOE) has a historic programmatic interest in the safe and secure routing, tracking, and transportation risk analysis of radiological materials in the United States. In order to address these program goals, DOE has funded the development of several tools and related systems designed to provide insight to planners and other professionals handling radioactive materials shipments. These systems include the WebTRAGIS (Transportation Routing Analysis Geographic Information System) platform. WebTRAGIS is a browser-based routing application developed at Oak Ridge National Laboratory (ORNL) focused primarily on the safe transport of spent nuclear fuel from US nuclear reactors via railway, highway, or waterway. It is also used for the transport planning of low-level radiological waste to depositories such as the Waste Isolation Pilot Plant (WIPP) facility. One particular feature of WebTRAGIS is its coupling with high-resolution population data from ORNL s LandScan project. This allows users to obtain highly accurate population count and density information for use in route planning and risk analysis. To perform the routing and risk analysis WebTRAGIS incorporates a basic routing model methodology, with the additional application of various constraints designed to mimic US Department of Transportation (DOT), DOE, and Nuclear Regulatory Commission (NRC) regulations. Aside from the routing models available in WebTRAGIS, the system relies on detailed or specialized modal networks for the route solutions. These include a highly detailed network model of the US railroad system, the inland and coastal waterways, and a specialized highway network that focuses on the US interstate system and the designated hazardous materials and Highway Route Controlled Quantity (HRCQ) -designated roadways. The route constraints in WebTRAGIS rely upon a series of attributes assigned to the various components of the different modal networks. Routes are determined via a constrained shortest-path Dijkstra algorithm that has an assigned impedance factor. The route constraints modify the various impedance weights to bias or prefer particular network characteristics as desired by the user. Both the basic route model and the constrained impedance function calculations are determined by a series of network characteristics and shipment types. The study examines solutions under various constraints modeled by WebTRAGIS including possible routes from select shut-down reactor sites in the US to specific locations in the US. For purposes of illustration, the designated destinations are Oak Ridge National Laboratory in Tennessee and the Savannah River Site in South Carolina. To the degree that routes express sameness or variety under constraints serves to illustrate either a) the determinism of particular transport modes by either configuration or regulatory compliance, and/or b) the variety of constrained routes that are regulation compliant but may not be operationally feasible.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2015

Differences Between Colon Cancer Primaries and Metastases Using a Molecular Assay for Tumor Radiation Sensitivity Suggest Implications for Potential Oligometastatic SBRT Patient Selection

Purpose: We previously developed a multigene expression model of tumor radiation sensitivity index (RSI) with clinical validation in multiple independent cohorts (breast, rectal, esophageal, and head and neck patients). The purpose of this study was to assess differences between RSI scores in primary colon cancer and metastases. Methods and Materials: Patients were identified from our institutional review board–approved prospective observational protocol. A total of 704 metastatic and 1362 primary lesions were obtained from a de-identified metadata pool. RSI was calculated using the previously published rank-based algorithm. An independent cohort of 29 lung or liver colon metastases treated with 60 Gy in 5 fractions stereotactic body radiation therapy (SBRT) was used for validation. Results: The most common sites of metastases included liver (n=374; 53%), lung (n=116; 17%), and lymph nodes (n=40; 6%). Sixty percent of metastatic tumors, compared with 54% of primaries, were in the RSI radiation-resistant peak, suggesting metastatic tumors may be slightly more radiation resistant than primaries (P=.01). In contrast, when we analyzed metastases based on anatomical site, we uncovered large differences in RSI. The median RSIs for metastases in descending order of radiation resistance were ovary (0.48), abdomen (0.47), liver (0.43), brain (0.42), lung (0.32), and lymph nodes (0.31) (P<.0001). These findings were confirmed when the analysis was restricted to lesions from the same patient (n=139). In our independent cohort of treated lung and liver metastases, lung metastases had an improved local control rate compared to that in patients with liver metastases (2-year local control rate of 100% vs 73.0%, respectively; P=.026). Conclusions: Assessment of radiation sensitivity between primary and metastatic tissues of colon cancer histology revealed significant differences based on anatomical location of metastases. These initial results warrant validation in a larger clinical cohort.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2014

Narrowing the gap between the promise and reality of polyketide synthases as a synthetic biology platform

Engineering modular polyketide synthases (PKSs) has the potential to be an effective methodology to produce existing and novel chemicals. However, this potential has only just begun to be realized. We propose the adoption of an iterative design-build-test-learn paradigm to improve PKS engineering. We suggest methods to improve engineered PKS design by learning from laboratory-based selection; adoption of DNA design software and automation to build constructs and libraries more easily; tools for the expression of engineered proteins in a variety of heterologous hosts; and mass spectrometry-based high-throughput screening methods. Finally, lessons learned during iterations of the design-build-test-learn cycle can serve as a knowledge base for the development of a single retrosynthesis algorithm usable by both PKS experts and non-experts alike.

Poust, S↗

DOE OSTI2020

Implicit fast sweeping method for hyperbolic systems of conservation laws

Implicit time-accurate methods are often used to integrate stiff problems where explicit schemes impose severe time step restrictions. This paper presents an efficient numerical framework based on the Fast Sweeping Method (FSM) for solving linear and nonlinear hyperbolic systems of conservation laws. The solution at each discrete location is computed by sweeping the numerical domain in several predetermined directions that follow the causality of the characteristic families. The use of a fractional step strategy eliminates the need for a solution selection criterion while one-sided stencils limit the number of sweeps to at most 2 d for d space dimensions. This work focuses on the first-order implicit upwind method since it constitutes the building block for high-order conservative schemes. For problems where the degree of stiffness evolves over time, implicit-explicit hybridization can be accomplished with the same algorithm by simply switching the stencil at each time level. As opposed to traditional implicit solvers, the sweeping method does not require a local time linearization of the fluxes thereby preserving the nonlinear stability properties of the original implicit scheme. It also avoids the large computational and memory requirements associated with solving large block-diagonal systems of equations. Here, a series of one- and two-dimensional test cases are presented for the inviscid Burgers' equation and the reactive Euler equations. The results indicate that the implicit FSM can allow a major reduction in the number of time steps even in the presence of discontinuous solution profiles.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2018

Digital pulse deconvolution with adaptive shaping for real-time high-resolution high-throughput gamma spectroscopy

A high-resolution high-throughput real-time adaptive digital pulse processing system is developed for high count rate gamma-ray spectroscopy applications. The adaptive digital pulse processing algorithms are implemented on a reconfigurable FPGA and include a pulse deconvolver, adaptive shaping filter, timing filter, baseline restorer, and pile-up rejecter. Digital pulse deconvolution is implemented to reconstruct the original detector signal from the preamplifier signal, which reduces the resolution deterioration due to pulse pile-up. The deconvoluted signal is shaped with a trapezoid filter and the shaping parameter is selected adaptively based on the time separation between successive input pulses. Experimental measurements are performed with a 137Cs source under varying count-rate conditions and using germanium detectors equipped with resistive feedback and transistor reset preamplifiers (TRP). The results herein demonstrate that when using a TRP, adaptive digital signal processing allows handling 106 counts/s. In addition, the implementation of a deconvolution approach limits resolution deterioration for throughput rates that are 4 to 10 times better than achievable in typical digital and analog gamma-ray spectroscopy systems.

47 OTHER INSTRUMENTATION↗

DOE OSTI2023

ReaLigands: A Ligand Library Cultivated from Experiment and Intended for Molecular Computational Catalyst Design

Computational catalyst design requires identification of a metal and ligand that together result in the desired reaction reactivity and/or selectivity. A major impediment to translating computational designs to experiments is evaluating ligands that are likely to be synthesized. Here we provide a solution to this impediment with our ReaLigands library that contains >30,000 monodentate, bidentate (didentate), tridentate, and larger ligands cultivated by dismantling experimentally reported crystal structures. Individual ligands from mononuclear crystal structures were identified using a modified depth-first search algorithm and charge was assigned using a machine learning model based on quantum-chemical calculated features. In the library ligands are sorted based on direct ligand-to-metal atomic connections and on denticity. Representative principal component analysis (PCA) and uniform manifold approximation and projection (UMAP) analyses were used to analyze several tridentate ligand categories, which revealed both the diversity of ligands and connections between ligand categories. Furthermore, we also demonstrated the utility of this library by implementing it with our building and optimization tools, which resulted in the very rapid generation of barriers for 750 bidentate ligands for Rh-hydride ethylene migratory insertion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗