Search NASA⌕ Search

SEARCH · Search NASA

Results for “SET”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Techniques for collective operations in distributed systems

Various embodiments are generally directed to techniques for collective operations among compute nodes in a distributed processing set, such as by utilizing ring sets and local sets of the distributed processing set. In some embodiments, a ring set may include a subset of the distributed processing set in which each compute node is connected to a network with a separate router. In various embodiments, a local set may include a subset of the distributed processing set in which each compute node is connected to a network with a common router. In one or more embodiments, each compute node in a distributed processing set may belong to one ring set and one local set.

Langer, Akhil↗
DOE OSTI2023

Supervisory-level control system demand control of an HVAC system

A supervisory-level control system is provided and includes a summation unit receptive of first and second signals, an HVAC system to generate the second signal according to first set-point signals and to a second set-point signal and a supervisory controller. The supervisory controller includes a control unit, a set-point scheduler and a zone level set-point distribution unit. The control unit is receptive of an error signal representing a difference between the first and second signals from the summation unit. The set-point scheduler is receptive of a demand signal generated by the control unit according to the error signal. The set-point scheduler generates a set-point command signal and the second set-point signal according to the demand signal. The zone level set-point distribution unit is configured to generate the first set-point signals in accordance with the set-point command signal.

Adetola, Veronica↗
DOE OSTI2022

Systematic Evaluation of Counterpoise Correction in Density Functional Theory

A widespread belief persists that the Boys–Bernardi function counterpoise (CP) procedure “overcorrects” supramolecular interaction energies for the effects of basis-set superposition error. To the extent that this is true for correlated wave function methods, it is usually an artifact of low-quality basis sets. The question has not been considered systematically in the context of density functional theory, however, where basis-set convergence is generally less problematic. We present a systematic assessment of the CP procedure for a representative set of functionals and basis sets, considering both benchmark data sets of small dimers and larger supramolecular complexes. The latter include layered composite polymers with ~150 atoms and ligand–protein models with ~300 atoms. Provided that CP correction is used, we find that intermolecular interaction energies of nearly complete-basis quality can be obtained using only double-ζ basis sets. Furthermore, this is less expensive as compared to triple-ζ basis sets without CP correction. CP-corrected interaction energies are less sensitive to the presence of diffuse basis functions as compared to uncorrected energies, which is important because diffuse functions are expensive and often numerically problematic for large systems. Our results upend the conventional wisdom that CP “overcorrects” for basis-set incompleteness. In small basis sets, CP correction is mandatory in order to demonstrate that the results do not rest on error cancellation.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Molecular NMR shieldings, J -couplings, and magnetizabilities from numeric atom-centered orbital based density-functional calculations

This paper reports and benchmarks a new implementation of nuclear magnetic resonance shieldings, magnetizabilities, and J-couplings for molecules within semilocal density functional theory, based on numeric atom-centered orbital (NAO) basis sets. NAO basis sets are attractive for the calculation of these nuclear magnetic resonance (NMR) parameters because NAOs provide accurate atomic orbital representations especially near the nucleus, enabling high-quality results at modest computational cost. Moreover, NAOs are readily adaptable for linear scaling methods, enabling efficient calculations of large systems. Here, the paper has five main parts: (1) It reviews the formalism of density functional calculations of NMR parameters in one comprehensive text to make the mathematical background available in a self-contained way. (2) The paper quantifies the attainable precision of NAO basis sets for shieldings in comparison to specialized Gaussian basis sets, showing similar performance for similar basis set size. (3) The paper quantifies the precision of calculated magnetizabilities, where the NAO basis sets appear to outperform several established Gaussian basis sets of similar size. (4) The paper quantifies the precision of computed J-couplings, for which a group of customized NAO basis sets achieves precision of ~Hz for smaller basis set sizes than some established Gaussian basis sets. (5) The paper demonstrates that the implementation is applicable to systems beyond 1000 atoms in size.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

The many-body expansion for aqueous systems revisited: 1. Water-water interactions

We revisit the Many-Body Expansion (MBE) for water-water interactions by examining the effects of the basis set, including those resulting from the Basis Set Superposition Error (BSSE) correction, on the various terms for selected sizes of water clusters up to n = 21. The analysis is performed at the second order Møller-Plesset (MP2) perturbation theory with the family of augmented correlation consistent basis sets up to five zeta quality for the (H2O)n, n = 7, 10, 13, 16 and 21 clusters, for which we report either the complete MBE (n = 7, 10) or the one through the 6-body (n = 13) and the 5-body terms (n = 16, 21). Our results suggest that any sizeable contributions to the total cluster binding energy arising from the 5-body and larger terms are solely an artifact of the size of the basis set. Indeed, all terms above the 4-body converge monotonically to practically zero at the Complete Basis Set (CBS) limit. The magnitudes of the 5-body and above terms are accurately reproduced even with the smaller basis set of the series (aug-cc-pVDZ) once the BSSE correction is taken into account. The same level of theory (MP2/aug-cc-pVDZ, BSSEcorrected) also accurately reproduces the MP2/CBS values of the 3- and 4-body terms. The contribution of electron correlation to the 3- and 4-body terms is quite small, so that neglecting the correlation contribution in all terms above the 3-body results in an error of ??(0.1%). The BSSE correction to the largest 2-body term in the MBE was accurately estimated from the function ?? [1 + erf(-?? ??)], which is proportional to the common (overlapping) area between two Gaussian distributions whose centers are separated by R, with the constants ??, ?? fitted to the calculated BSSE corrections for the individual 2-body terms of the clusters with each basis set. Our results unquestionably demonstrate that the MBE for water-water interactions converges to the 4-body term, since any finite terms above the 4-body are artifacts of the size of the basis set and can be safely truncated at the 4-body term when either a very large basis set is used or BSSE corrections are taken into account even with the aug-cc-pVDZ basis set. We expect these findings to have important consequences in the pursuit of accurate many-body molecular dynamics simulations for aqueous systems.

Heindel, Joseph↗
DOE OSTI2021

AI-Batt (Autonomous Identification of Battery Life Models) [SWR 21-36]

Autonomous Identification of Battery Life Models (AI-Batt) AI-Batt is a MATLAB code base for developing lifetime models for batteries from accelerated aging data. The code base provides many functions for processing, visualizing, and modeling battery aging data, making the data processing, exploration, and modeling workflow substantially faster. These tools are tailored for working with battery aging data sets, which usually consist of many separate time-series for each cell, with many test conditions and possible replicates at each condition, which makes it difficult to simply process or visualize the data set. Complex modeling tasks, such as cross-validation, sensitivity analysis, and uncertainty quantification have been implemented to enable thorough statistical investigation of model predictions. Additionally, several machine-learning algorithms are implemented to autonomously identify suitable models via symbolic regression. Data processing functions automatically cast data from the struct data type, which is commonly used to store experimental data, but is not an acceptable input for most algorithms, to the table data type, which can be easily used as input to any optimization algorithm. Also, the data can be separated into time-invariant and time-variant data tables, which is helpful for exploring the data set as well as developing separate models for time-variant and time-invariant aging mechanisms. For example, in aging tests with constant temperature, temperature is a time-invariant experimental condition. Visualization tools enable plotting of data, model fits, and model simulations possible with single-line function calls, empowering data exploration of complex data sets with both time-varying and time-invariant trends. Plots can be automatically generated for the whole data set, or separated by data group (groups of test replicates) or individual data series. Data points or data series can be automatically colored by the value of a variable with a variety of color maps, and model predictions can also be colored by the value of a fit statistic. Comparisons between data sets and the predictions/simulations of different models on the same data set can be easily plotted as well. Distributions of parameter values from bootstrap resampling can be plotted to visualize the reliability of parameter estimation, or determine any correlations between parameters. Modeling tools handle the complex task of creating and parsing symbolic equations for modeling battery lifetime. Equations are parsed to grab relevant data variables, parameter values, or specified sub-models for input into optimization, evaluation, or simulation functions. Models can be optimized locally (one set of parameters for each data series), bi-level (some parameters shared across the data set), or globally (single set of parameters for all data). Functions implementing symbolic regression algorithms help users to discover effective model equations, even in poorly sampled, high-dimensional data.

Smith, Kandler↗
DOE OSTI2021

Chemometrics and Experimental Design for the Quantification of Nitrate Salts in Nitric Acid: Near-Infrared Spectroscopy Absorption Analysis

Implementing remote, real-time spectroscopic monitoring of radiochemical processing streams in hot cell environments requires efficiency and simplicity. The success of optical spectroscopy for the quantification of species in chemical systems highly depends on representative training sets and suitable validation sets. Selecting a training set (i.e., calibration standards) to build multivariate regression models is both time- and resource-consuming using standard one-factor-at-a-time approaches. This study describes the use of experimental design to generate spectral training sets and a validation set for the quantification of sodium nitrate (0–1 M) and nitric acid (0.1–10 M) using the near-infrared water band centered at 1440 nm. Partial least squares regression models were built from training sets generated by both D- and I-optimal experimental designs and a one-factor-at-a-time approach. The prediction performance of each model was evaluated by comparing the bias and standard error of prediction for statistical significance. D- and I-optimal designs reduced the number of samples required to build regression models compared with one-factor-at-a-time while also improving performance. Models must be confirmed against a validation sample set when minimizing the number of samples in the training set. The D-optimal design performed the best when considering both performance and efficiency by improving predictive capability and reducing number of samples in the training set by 64% compared with the one-factor-at-a-time approach. The experimental design approach objectively selects calibration and validation spectral data sets based on statistical criterion to optimize performance and minimize resources.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2020

All-electron ab initio Bethe-Salpeter equation approach to neutral excitations in molecules with numeric atom-centered orbitals

The Bethe-Salpeter equation (BSE) based on GW quasiparticle levels is a successful approach for calculating the optical gaps and spectra of solids and also for predicting the neutral excitations of small molecules. We here present an all-electron implementation of the GW+BSE formalism for molecules, using numeric atom-centered orbital (NAO) basis sets. We present benchmarks for low-lying excitation energies for a set of small organic molecules, denoted in the literature as “Thiel’s set.” Literature reference data based on Gaussian-type orbitals are reproduced to about one millielectron-volt precision for the molecular benchmark set, when using the same GW quasiparticle energies and basis sets as the input to the BSE calculations. For valence correlation consistent NAO basis sets, as well as for standard NAO basis sets for ground state density-functional theory with extended augmentation functions, we demonstrate excellent convergence of the predicted low-lying excitations to the complete basis set limit. A simple and affordable augmented NAO basis set denoted “tier2+aug2” is recommended as a particularly efficient formulation for production calculations. We finally demonstrate that the same convergence properties also apply to linear-response time-dependent density functional theory within the NAO formalism.

Liu, Chi↗
DOE OSTI2022

Phase field modeling of dislocations and obstacles in InSb

We present a phase-field dislocation dynamics (PFDD) model informed by first-principle calculations to elucidate the competitive dislocation nucleation and propagation between the glide and shuffle sets in InSb diamond cubic crystal. The calculations are directly informed with generalized stacking fault energy curves on the (111) slip plane for both the “glide set,” with the smaller interplanar spacing, and the “shuffle set,” with the larger interplanar spacing. The formulation also includes elastic anisotropy and the gradient term associated with the dislocation core. The PFDD calculations show that under no stress the equilibrium structure of screw glide set dislocations dissociates into Shockley partials, while those of the shuffle set dislocations do not dissociate, remaining compact. The calculated dislocation core widths of these InSb dislocations agree well with the measured values for other semiconductor materials, such as Si and GaN. We find that a shuffle set dislocation emits from a dislocation source at an applied stress about three times smaller than that needed to emit leading and trailing partials successively on the glide set plane. Once the partial dislocations in the glide set are emitted, they propagate faster than the shuffle set perfect dislocation at the same stress level.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗
DOE OSTI2026

Data for Spatial Analysis of Cell Patterning to Aid Genetic and Phenotypic Understanding of Grass Stomatal Density: A Case Study in Maize

Biological processes involve complex hierarchies where composite traits result from multiple component traits. However, holistically understanding of how sets of component traits interact to underpin genotype-to-phenotype relationships is generally lacking. Stomatal density (SD) is a tractable model system for exploring how high-throughput phenotyping (HTP) data could be exploited by a new spatial analysis approach to better understand a developmentally and functionally important trait. SD is a composite trait, resulting from various components related to cell identity and size, which are themselves governed by a series of spatio-developmental processes. Data from 192 recombinant inbred lines of maize [Zea mays (L.)] were analyzed by a new stomatal patterning phenotype (SPP) to (1) describe the average spatial probability distribution of the nearest neighboring stomata; (2) derive a core set of component traits related to cell size, cell packing, and positional probabilities; (3) build a structural equation model of component traits underlying SD; and (4) identify stomatal patterning quantitative trait loci (QTL). The core set of SPP-derived traits explained 74% of the variation in SD. Analyzing SPP component traits allowed some loci previously identified as generic SD QTL to be recognized as specific to lateral versus longitudinal elements of stomatal patterning. Therefore, this study highlights how novel insights can be gained by decomposing a composite trait (e.g., SD) into a set of component traits that were present in HTP data but not previously exploited.

AI/ML↗
DOE OSTI2021

2021 Smoky Mountains Conference Data Challenge Synthetic-to-Real Domain Adaptation for Autonomous Driving Dataset

The dataset is comprised of both real and synthetic images from a vehicle's forward-facing camera. Each camera image is accompanied by a corresponding pixel-level semantic segmentation image (all files are .png files). In total, the dataset contains 5600 images in the training/validation set and 1400 images in the testing set. The training dataset contains mostly synthetic RGB images collected with a wide range of weather and lighting conditions using the CARLA simulator [1]. In addition, the training data also includes a small pre-selected subset of data from the Cityscapes training dataset – which is comprised of RGB-segmentation image pairs from driving scenarios in various European cities [2]. The testing data is split into three sets. The first set contains synthetic CARLA images with weather/lighting conditions that were not present in the training set. The second set is a subset of the Cityscapes testing dataset. Finally, the third set is an unknown testing set which will not be revealed to the participants until after the submission deadline. [1] Dosovitskiy, A., Ros, G., Codevilla, F., Lopez, A., and Koltun, V. (2017, October). CARLA: An open urban driving simulator. In Conference on robot learning (pp. 1-16). PMLR. [2] Cordts, M., Omran, M., Ramos, S., Rehfeld, T., Enzweiler, M., Benenson, R., ... and Schiele, B. (2016). The cityscapes dataset for semantic urban scene understanding. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 3213-3223).

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2023

NbTaV_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution ternary alloys niobium-tantalum-vanadium (Nb-Ta-V). The first-principle code that has been used to run the calculations is the closed-source Vienna Ab-Initio Simulation Package (VASP). The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 8. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 10,500 randomized atomic structures over 105 chemical compositions. The calculations have been collected on NERSC-Perlmutter using the VASP 6.3.2. The VASP calculations for every atomic structure have been performed in 2 main steps: 1. Starting from an ideal body-centered-cubic (BCC) structure, geometry optimization with low precision has been executed to perform a preliminary optimization of the atomic structure. The output for this calculations is available in the files 0.CONTCAR, 0.OUTCAR, rlx1.out. 2. Using the atomic structure resulting from the preliminary geometry optimization, a second geometry optimization has been performed using normal precision. The output for this calculations is available in the files CONTCAR, OUTCAR, rlx2.out, vaspout.h5, and vasprun.xml. Every chemical composition sampled across the composition range in the dataset has its own directory. The convention used to name the directories for ternary alloys is AXBYCZ, where A, B, and C refer to the constituents, and X, Y, and Z are positive integers that represent the number of atoms for each constituent and their values still sum up to 128. Each atomic structure associated with a specific chemical composition has its own sub-directory within the directory of the corresponding chemical composition. The sub-directories for each atomic structure for each chemical composition are named 'case-*', where * is a positive integer that spans all the values from 1 through 100, extremes included. The files contained in each sub-directory 'case-*' for each atomic structure are as follows: 1. INCAR: input file that contains various parameters and settings for controlling the behavior of the electronic structure calculations 2. 0.POSCAR: input file that defines the atomic structure of a system 3. 0.CONTCAR: output file that provides the atomic positions and cell parameters after the first geometry optimization has been run with the precision variable set to PREC=Low in the INCAR file 4. 0.OUTCAR: output file that contains detailed information about the progress of a calculation after the first geometry optimization has been run with the precision variable set to PREC=Low in the INCAR file 5. rlx1.out: file with diagnostic information about the execution of the first geometry optimization with precision variable set to PREC=Low in the INCAR file 6. POSCAR: input file that defines the atomic structure of a system after the first geometry optimization has been run at low precision. This represents the input for the second geometry optimization run with the precision variable set to PREC=Normal in the INCAR file 7. CONTCAR: output file that provides the atomic positions and cell parameters after the second geometry optimization has been run with the precision variable set to PREC=Normal in the INCAR file 8. OUTCARL: output file that contains detailed information about the progress of a calculation after the second geometry optimization has been run with the precision variable set to PREC=Normal in the INCAR file 9. rlx2.out: file with diagnostic information about the execution of the second geometry optimization with precision variable set to PREC=Normal in the INCAR file 10. vaspout.h5: hierarchical HDF5 file containing the inputs and outputs of a VASP calculation. To analyze the data in this file we recommend using py4vasp. This file is only produced if the VASP version used is compiled with HDF5 support 11. vasprun.xml: contains similar information to OUTCAR, but in an xml format. This research is sponsored by the Artificial Intelligence Initiative as part of the Laboratory Directed Research and Development (LDRD) Program of Oak Ridge National Laboratory, managed by UT-Battelle, LLC, for the US Department of Energy under contract DE-AC05-00OR22725. This work used resources of the Oak Ridge Leadership Computing Facility, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725, under Directorate Discretionary awards MAT025 (Materials Science) and LRN026 (Machine Learning), and INCITE award MAT201. This work also used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231, under award ERCAP0025216.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Integrating Characteristic Arctic Vegetation in a Land Surface Model Improves Representation of Carbon Dynamics Across a Tundra Landscape: Modeling Archive

This modeling archive is in support of the Next-Generation Ecosystem Experiments in the Arctic (NGEE Arctic) publication "Integrating Characteristic Arctic Vegetation in a Land Surface Model Improves Representation of Carbon Dynamics Across a Tundra Landscape", by Murphy et al. (2025). This archive contains model input files and outputs from landscape-scale simulations conducted using ELM, the land model component of the Department of Energy’s Energy Exascale Earth System Model (E3SM), at the Council NGEE Arctic field site (Council Road mile marker 71) on Alaska’s Seward Peninsula. Input data and model output from two sets of ELM simulations are provided. The first set of simulations were conducted with the two default ELM Arctic plant functional types (PFTs; broadleaf deciduous boreal shrub and a C3 grass) and the second set of simulations were conducted with a set of nine Arctic-specific PFTs including nonvascular mosses and lichens, graminoids, forbs, evergreen dwarf shrubs, three height classes of deciduous shrubs (dwarf, low, and low to tall), and deciduous alder shrubs (Sulman et al., 2021). Parameter names and major parameter changes in the Arctic-specific PFT configuration are described in Sulman et al. (2021) and archived in the Sulman et al. (2021) dataset (see below). Simulations were spatially explicit, covering an approximately 6.4X3.3 km domain at the Council site with a spatial resolution of 100 m for a total of 2,112 simulated grid cells under each ELM PFT configuration. The modeling archive contains meteorological forcing (seven *.nc files and one *.txt file), a domain definition file (one *.nc files), land surface configuration files (two *.nc files), parameter files (two *.nc files), annual ELM output files spanning 1980-2014 (68 *.nc files), and a User’s Guide (*pdf file). Additional information on the provided files is in the “Modeling Archive Contents” section of the User’s Guide. Model outputs are aggregated to the column scale (i.e. PFT-specific outputs are not provided here).

Murphy, Bailey [ORNL] (ORCID:0000000203995221)↗
DOE OSTI2021

High-Quality Revision of the Israeli Seismic Bulletin

Seismic bulletins, with trustworthy phase picks, origin times, and source locations are key for regional seismic studies, such as travel-time (TT) tomography, attenuation tomography, and anisotropy studies. To lay the groundwork for such studies in Israel, we revised the seismic bulletin of Israel and the surrounding area and obtained a trustworthy TT data set. From the earthquake and explosion bulletins of the Geophysical Institute of Israel, we compiled a starting data set of about 123,000 earthquakes and explosions that occurred during the past 40 yr. After screening out the poorly recorded events, we were left with a data set of ~38,000 well-recorded events. We then revised the remaining data set in two consecutive steps. In the first, we reviewed and updated station metadata, including changes in station metadata parameters over time. In the second step, we jointly relocated a list of selected seismic events, using the Bayesian hierarchical location software package (BayesLoc) of Myers et al. (2007) that performs joint relocation of multiple events. We observed striking dissimilarities between the spatial distributions of the newly relocated catalog and the initial locations. Although the depth distribution of the starting catalog is trimodal with peaks at 0, 5, and 10 km, the distribution in this study is unimodal, with a broad peak between 7.5 and 12.5 km. By differencing the observed arrival times and the origin times obtained through relocation with BayesLoc, we obtained a revised TT database that consists of 261,336 Pg, 132,876 Pn, 114,816 Sg, and 60,394 Sn arrivals, from a set of 30,458 jointly relocated seismic sources. In this work, we compared prerevision and postrevision TTs as a function of epicentral distance and concluded that the revised data set contains far fewer outliers and inconsistencies than the original data set. The revised TT data set may be used for seismic studies, such as TT tomography, attenuation tomography, and anisotropy studies.

58 GEOSCIENCES↗
DOE OSTI2021

Performance Results for Sensor Assignment Problem as Solved on a Multi-Node Cluster

An earlier report described a procedure for optimal sensor set selection and its implementation on a computational cluster. This new and innovative capability was developed to facilitate a reduction in operations staffing levels to improve plant economics. By automating surveillance and maintenance tasks through early detection of degrading sensors and equipment, staff can be more efficiently deployed. The method uses automated reasoning and domain knowledge in the form of the conservation equations to infer from plant measurements the state of equipment health. Inclusion of domain knowledge addresses the problem that exists with pure data-driven methods that there are no rigorous guidelines for determining what constitutes an adequate sensor set. Formalizing the procedure for sensor set selection as we have done results in a more reliable and explainable diagnosis of plant equipment health. Importantly, from the standpoint of the plant owner, personnel are provided with an early and explicit diagnosis of an equipment problem. That in principle automates the process and eliminates having to send personnel into the plant to find the cause as typically occurs when a data-driven method detects an anomaly. In this report we describe first results obtained using a computational cluster to solve the sensor set selection problem as framed above. The case described addresses the problem of equipment health monitoring in the high-pressure (HP) feedwater system of a pressurized light water reactor as seen through the eyes of our collaborating utility partner. Maintenance of this system can amount to millions of dollars per year if equipment health issues go undiagnosed and lead to loss of function. On examining the potential that is inherent in the installed sensor set for diagnosing equipment health degradation, it was found that greater fault resolution capability can be achieved using a sensor set that is 20 percent fewer in number. The take-away is that compared to the installed sensor set there exists a more strategic assignment of sensors that will furnish better health monitoring capability and with fewer sensors. Where the problem defies solution by manual inspection, as is the case here, one can be found by an algorithm. The solution was obtained in four hours using 30 computational cores. The HP feedwater problem as posed above illustrates the added value of approaching the sensor selection problem as one amenable to algorithmic solution. This problem is of interest to advanced reactor designers and to utilities that are setting up remote monitoring and diagnostic centers.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm

Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.

Matthews, Ronald C.↗
DOE OSTI2023

Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics

Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.

97 MATHEMATICS AND COMPUTING↗