Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 181 records · Page 10

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Robotic Vision-Based Localization in an Urban Environment

A system of electronic hardware and software, now undergoing development, automatically estimates the location of a robotic land vehicle in an urban environment using a somewhat imprecise map, which has been generated in advance from aerial imagery. This system does not utilize the Global Positioning System and does not include any odometry, inertial measurement units, or any other sensors except a stereoscopic pair of black-and-white digital video cameras mounted on the vehicle. Of course, the system also includes a computer running software that processes the video image data. The software consists mostly of three components corresponding to the three major image-data-processing functions: Visual Odometry This component automatically tracks point features in the imagery and computes the relative motion of the cameras between sequential image frames. This component incorporates a modified version of a visual-odometry algorithm originally published in 1989. The algorithm selects point features, performs multiresolution area-correlation computations to match the features in stereoscopic images, tracks the features through the sequence of images, and uses the tracking results to estimate the six-degree-of-freedom motion of the camera between consecutive stereoscopic pairs of images (see figure). Urban Feature Detection and Ranging Using the same data as those processed by the visual-odometry component, this component strives to determine the three-dimensional (3D) coordinates of vertical and horizontal lines that are likely to be parts of, or close to, the exterior surfaces of buildings. The basic sequence of processes performed by this component is the following: 1. An edge-detection algorithm is applied, yielding a set of linked lists of edge pixels, a horizontal-gradient image, and a vertical-gradient image. 2. Straight-line segments of edges are extracted from the linked lists generated in step 1. Any straight-line segments longer than an arbitrary threshold (e.g., 30 pixels) are assumed to belong to buildings or other artificial objects. 3. A gradient-filter algorithm is used to test straight-line segments longer than the threshold to determine whether they represent edges of natural or artificial objects. In somewhat oversimplified terms, the test is based on the assumption that the gradient of image intensity varies little along a segment that represents the edge of an artificial object.

Mchenry, Michael↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Prediction model of potential hepatocarcinogenicity of rat hepatocarcinogens using a large-scale toxicogenomics database

The present study was performed to develop a robust gene-based prediction model for early assessment of potential hepatocarcinogenicity of chemicals in rats by using our toxicogenomics database, TG-GATEs (Genomics-Assisted Toxicity Evaluation System developed by the Toxicogenomics Project in Japan). The positive training set consisted of high- or middle-dose groups that received 6 different non-genotoxic hepatocarcinogens during a 28-day period. The negative training set consisted of high- or middle-dose groups of 54 non-carcinogens. Support vector machine combined with wrapper-type gene selection algorithms was used for modeling. Consequently, our best classifier yielded prediction accuracies for hepatocarcinogenicity of 99% sensitivity and 97% specificity in the training data set, and false positive prediction was almost completely eliminated. Pathway analysis of feature genes revealed that the mitogen-activated protein kinase p38- and phosphatidylinositol-3-kinase-centered interactome and the v-myc myelocytomatosis viral oncogene homolog-centered interactome were the 2 most significant networks. The usefulness and robustness of our predictor were further confirmed in an independent validation data set obtained from the public database. Interestingly, similar positive predictions were obtained in several genotoxic hepatocarcinogens as well as non-genotoxic hepatocarcinogens. These results indicate that the expression profiles of our newly selected candidate biomarker genes might be common characteristics in the early stage of carcinogenesis for both genotoxic and non-genotoxic carcinogens in the rat liver. Our toxicogenomic model might be useful for the prospective screening of hepatocarcinogenicity of compounds and prioritization of compounds for carcinogenicity testing. - Highlights: >We developed a toxicogenomic model to predict hepatocarcinogenicity of chemicals. >The optimized model consisting of 9 probes had 99% sensitivity and 97% specificity. >This model enables us to detect genotoxic as well as non-genotoxic hepatocarcinogens.

60 APPLIED LIFE SCIENCES↗

Autonomous System Subversion Tactics: Prototypes and Recommended Countermeasures

One of the fielding requirements for Advanced and Small Modular Reactors (AR/SMR) is the ability to support remote and autonomous operations. Autonomous Control Systems (ACS) are found on platforms such as Autonomous Space Vehicles, Cruise Missiles, and advanced driver-assistance systems. Each of these ACS implementations depends upon a set of decision support subsystems responsible for supporting Autonomous Mission Managers (names vary based upon field and author preferences). These Autonomous Mission Managers receive inputs from system sensors (e.g., LIDAR collection from an automobile travelling down a street; transients from a nuclear reactor), and perform a set of classifications (e.g., Red Traffic Light; Small Pedestrian at 10m; Load Rejection; Single Coolant Pump Trip), and then use these classifications in combination with recommendation algorithms to achieve platform goals (e.g., Stop the Vehicle at the Traffic Light, Avoid the Small Pedestrian; Trip the Reactor to prevent a Safety Event). The design, implementation, and fielding of an ACS capability will alter the cyber-attack surface such that existing risk management plans will need to be updated to include how to protect and defend against data-science and decision-support-system attack classes. These attack classes would include protection of the design and training environments where algorithm selection and testing and training data would be obvious attack vectors. These attack classes would also require an informed set of detection and response procedures to identify anomalous behaviors and document best practices for anomaly assessment and vulnerability mitigation and remediation. Last year we published a Cyber Threat Assessment Methodology for Autonomous and Remote Operations for AR/SMRs along with a companion publication on Cyber Attack and Defense Use Cases. The focus of the methodology was on describing and enumerating ACS processes, components, and functions such that security engineers could: evaluate subversion options against the target; identify threat actor attributes and capabilities derived from each subversion option; and identify security controls and response countermeasures. The Use Cases document offered detailed methodology examples including an assessment of a Military Base SMR, an Autonomous System Decision Loop, and implementation of AR/SMR Machine Learning algorithms. Our proposal at the end of last year was to focus on implementation of subversion prototypes related to the last Use Case area: AR/SMR Machine Learning (ML) Algorithms. We included six attack scenarios in our Use Cases paper: a Poisoning Attack against ML functions implemented using an FPGA; a Trojaning Attack against ML classifiers exploiting the excitability of Nuclear Engineers; a Backdooring Attack against ML Training environments to ensure persistence of an attack vector; a False Positive Evasion Attack against multi-factor Access Control Systems using clever inputs; an Inference Attack against ML models by an Insider with access to the Operational environment; and an Adversarial Reprogramming Attack against a Material Access Control Video Surveillance System. At the beginning of this year these six attack scenarios were provided to our research teams at Georgia Tech and Idaho State University and each team successfully implemented a subversion attack against a ML implementation to include transient misclassifications. While this is a notable outcome from this type of research, this paper offers the reader insight into not only how to structure and execute these types of attacks, but into the thought process behind how the researcher investigated the problem space, performed initial algorithm implementation, and the trial-and-error behind arriving at the successful subversion prototypes. We include in this paper a set of associated Scenarios on how these subversion prototypes could be implemented and an initial set of guidance for AR/SMR architects, Nuclear Regulators, and Cyber Defenders to implement awareness and defense capabilities into their current operational portfolios.

42 ENGINEERING↗

ON THE DEARTH OF COMPACT, MASSIVE, RED SEQUENCE GALAXIES IN THE LOCAL UNIVERSE

We set out to test the claim that the recently identified population of compact, massive, and quiescent galaxies at z {approx} 2.3 must undergo significant size evolution to match the properties of galaxies found in the local universe. Using data from the Sloan Digital Sky Survey (SDSS; Data Release 7), we have conducted a search for local red sequence galaxies with sizes and masses comparable to those found at z {approx} 2.3. The SDSS spectroscopic target selection algorithm excludes high surface brightness objects; we show that this makes incompleteness a concern for such massive, compact galaxies, particularly for low redshifts (z {approx}< 0.05). We have identified 63 M{sub *}>10{sup 10.7} M{sub sun} ({approx}5 x 10{sup 10} M{sub sun}) red sequence galaxies at 0.066 < z{sub spec} < 0.12 which are smaller than the median size-mass relation by a factor of 2 or more. Consistent with expectations from the virial theorem, the median offset from the mass-velocity dispersion relation for these galaxies is 0.12 dex. We do not, however, find any galaxies with sizes and masses comparable to those observed at z {approx} 2.3, implying a decrease in the comoving number density of these galaxies, at fixed size and mass, by a factor of {approx}>5000. This result cannot be explained by incompleteness: in the 0.066 < z < 0.12 interval, we estimate that the SDSS spectroscopic sample should typically be {approx}>75% complete for galaxies with the sizes and masses seen at high redshift, although for the very smallest galaxies it may be as low as {approx}20%. In order to confirm that the absence of such compact massive galaxies in SDSS is not produced by spectroscopic selection effects, we have also looked for such galaxies in the basic SDSS photometric catalog, using photometric redshifts. While we do find signs of a slight bias against massive, compact galaxies, this analysis suggests that the SDSS spectroscopic sample is missing at most a few objects in the regime we consider. Accepting the high-redshift results, it is clear that massive galaxies must undergo significant structural evolution over z {approx}< 2 in order to match the population seen in the local universe. Our results suggest that a highly stochastic mechanism (e.g., major mergers) cannot be the primary driver of this strong size evolution.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-F-T-407: Artifact Reduction with Dual Energy Or IMAR: Who’s Winning?

Purpose: The purpose of this abstract was to evaluate the performance of commercial strategies for artifact reduction in radiation oncology settings. The iterative metal artifact reduction (Siemens iMAR) algorithm and monoenergetic virtual datasets reconstructed from dual energy scans are compared side-by-side in their ability to image in the presence of metal inserts. Methods: A CIRS ATOM Dosimetry Verification Phantom was scanned with and without a metal insert on a SOMATOM Definition AS dual energy scanner. Images with the metal insert were reconstructed with (a) a tradition single energy CT scan with the iMAR option implemented, using different artifact reduction settings and (b) a monoenergetic scan calculated from dual energy scans by recovering differences in the energy-dependence of the attenuation coefficients of different materials and then creating a virtual monoenergetic scan from these coefficients. The iMAR and monoenergetic scans were then compared with the metal-free scan to assess changes in HU numbers and noise within a region around the metal insert. Results: Both the iMAR and dual energy scans reduced artifacts produced by the metal insert. However the iMAR results are dependent of the selected algorithm settings, with a mean HU difference ranging from 0.65 to 90.40 for different options. The mean differences without the iMAR correction were 38.74. When using the dual energy scan, the mean differences were 4.53, that is however attributed to increased noise and not artifacts, as the dual energy scan had the lowest skewness (2.52) compared to the iMAR scans (ranging from 3.90 to 4.88) and the lowest kurtosis (5.72 for dual energy, range of 18.19 to 27.36 for iMAR). Conclusion: Both approaches accurately recovered HU numbers, however the dual energy method provided smaller residual artifacts.

60 APPLIED LIFE SCIENCES↗

Large modal survey testing using the Ibrahim time domain /ITD/ identification technique

The ability of the ITD identification algorithm in identifying a complete set of structural modal parameters using a large number of free-response time histories simultaneously in one analysis, assuming a math model with a high number of degrees-of-freedom, has been studied. Identification results using simulated free responses of a uniform rectangular plate, with 225 measurement stations, and experimental responses from a ground vibration test of the Long Duration Exposure Facility (LDEF) Space Shuttle payload, with 142 measurement stations, are presented. As many as 300 degrees-of-freedom were allowed in analyzing these data. In general, the use of a significantly oversized math model in the identification process was found to maintain or increase identification accuracy and to identify modes of low response level that are not identified with smaller math model sizes. The concept of a Mode Shape Correlation Constant is introduced for use when more than one identification analysis of the same structure are conducted. This constant quantifies the degree of correlation between any two sets of complex mode shapes identified using different excitation conditions, different user-selectable algorithm constants, or overlapping sets of measurements.

Ibrahim, S. R.↗

Large Modal Survey Testing Using the Ibrahim Time Domain Identification Technique

The ability of the ITD identification algorithm in identifying a complete set of structural modal parameters using a large number of free-response time histories simultaneously in one analysis, assuming a math model with a high number of degrees-of-freedom, has been studied. Identification results using simulated free responses of a uniform rectangular plate, with 225 measurement stations, and experimental responses from a ground vibration test of the Long Duration Exposure Facility (LDEF) Space Shuttle payload, with 142 measurement stations, are presented. As many as 300 degrees-of-freedom were allowed in analyzing these data. In general, the use of a significantly oversized math model in the identification process was found to maintain or increase identification accuracy and to identify modes of low response level that are not identified with smaller math model sizes. The concept of a Mode Shape Correlation Constant is introduced for use when more than one identification analysis of the same structure are conducted. This constant quantifies the degree of correlation between any two sets of complex mode shapes identified using different excitation conditions, different user-selectable algorithm constants, or overlapping sets of measurements.

Ibrahim, S. R.↗

Immunity-Based Aircraft Fault Detection System

In the study reported in this paper, we have developed and applied an Artificial Immune System (AIS) algorithm for aircraft fault detection, as an extension to a previous work on intelligent flight control (IFC). Though the prior studies had established the benefits of IFC, one area of weakness that needed to be strengthened was the control dead band induced by commanding a failed surface. Since the IFC approach uses fault accommodation with no detection, the dead band, although it reduces over time due to learning, is present and causes degradation in handling qualities. If the failure can be identified, this dead band can be further A ed to ensure rapid fault accommodation and better handling qualities. The paper describes the application of an immunity-based approach that can detect a broad spectrum of known and unforeseen failures. The approach incorporates the knowledge of the normal operational behavior of the aircraft from sensory data, and probabilistically generates a set of pattern detectors that can detect any abnormalities (including faults) in the behavior pattern indicating unsafe in-flight operation. We developed a tool called MILD (Multi-level Immune Learning Detection) based on a real-valued negative selection algorithm that can generate a small number of specialized detectors (as signatures of known failure conditions) and a larger set of generalized detectors for unknown (or possible) fault conditions. Once the fault is detected and identified, an adaptive control system would use this detection information to stabilize the aircraft by utilizing available resources (control surfaces). We experimented with data sets collected under normal and various simulated failure conditions using a piloted motion-base simulation facility. The reported results are from a collection of test cases that reflect the performance of the proposed immunity-based fault detection algorithm.

Dasgupta, D.↗

THE OVERDENSITY AND MASSES OF THE FRIENDS-OF-FRIENDS HALOS AND UNIVERSALITY OF HALO MASS FUNCTION

The friends-of-friends algorithm (hereafter FOF) is a percolation algorithm which is routinely used to identify dark matter halos from N-body simulations. We use results from percolation theory to show that the boundary of FOF halos does not correspond to a single density threshold but to a range of densities close to a critical value that depends upon the linking length parameter, b. We show that for the commonly used choice of b = 0.2, this critical density is equal to 81.62 times the mean matter density. Consequently, halos identified by the FOF algorithm enclose an average overdensity which depends on their density profile (concentration) and therefore changes with halo mass, contrary to the popular belief that the average overdensity is {approx}180. We derive an analytical expression for the overdensity as a function of the linking length parameter b and the concentration of the halo. Results of tests carried out using simulated and actual FOF halos identified in cosmological simulations show excellent agreement with our analytical prediction. We also find that the mass of the halo that the FOF algorithm selects crucially depends upon mass resolution. We find a percolation-theory-motivated formula that is able to accurately correct for the dependence on number of particles for the mock realizations of spherical and triaxial Navarro-Frenk-White halos. However, we show that this correction breaks down when applied to the real cosmological FOF halos due to the presence of substructures. Given that abundance of substructure depends on redshift and cosmology, we expect that the resolution effects due to substructure on the FOF mass and halo mass function will also depend on redshift and cosmology and will be difficult to correct for in general. Finally, we discuss the implications of our results for the universality of the mass function.

79 ASTRONOMY AND ASTROPHYSICS↗

Geothermal-integrated thermally anisotropic building envelope for energy and peak-demand reduction

Buildings consume large amounts of energy for heating and cooling, while peak electricity demand places significant stress on the power grid. This paper presents a reduced-order co-simulation framework and load-oriented supervisory control strategy for a geothermal-integrated thermally anisotropic building envelope with a ground loop (TABE+GL). In TABE+GL, a hydronic loop embedded in the building envelope is directly coupled with a geothermal ground loop, allowing for bidirectional heat exchange between the envelope, the ground, and the indoor environment. A hybrid co-simulation framework was established by coupling a reduced-order resistor–capacitor (RC) thermal network model with EnergyPlus augmented with GHEDesigner modules. The RC model generated feasible heat flux options under three operating modes, and EnergyPlus predicted sensible loads, energy use, and pump energy demand. At each simulation step, a supervisory control algorithm selected the optimal loop configuration and duty factor that maximizes useful TABE geothermal utilization without exceeding the predicted sensible load, thereby avoiding overheating or cooling. Case studies were conducted for Los Angeles, California, Charleston, South Carolina, and Denver, Colorado. Results showed that the proposed framework reduced HVAC electricity consumption by 43%–67%, natural gas use for space heating by 11%–38%, and peak electricity demand by 43%–88%. These results highlight the potential of combining reduced-order envelope modeling, direct geothermal coupling, and load-oriented supervisory control to improve whole building energy performance and reduce peak demand across diverse weather conditions.

Howard, Daniel [Southern Adventist University]↗

Feature extraction for subtle anomaly detection using semi-supervised learning

The demand for automated and effective monitoring techniques has soared with the increased digitization of industrial monitoring systems. State-of-the-art machine learning methods are effectively detecting abrupt changes in system states. However, these methods lack comparable maturity in detecting subtle changes that may be signs of incipient faults. This manuscript argues that the current anomaly detection methods can be enhanced by exploring weak patterns to enable subtle variation detection. Specifically, the concept of semi-supervised learning is employed, with labels representing knowledge about some anomalous conditions of a system. The basic idea is to extract a candidate set of weak patterns discarded by state-of-the-art baselining algorithms. With few labeled anomalous data, the algorithm selects the weak patterns and allows for their possible fusion using the highest sensitivity to the labeled anomalies. Here, the method’s applicability is demonstrated using a representative pressurized water reactor (PWR) model simulated by Dymola.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Implementation of an extensible property modeling framework in ESPEI with applications to molar volume and elastic stiffness models

Property models are becoming more widely adopted by commercial Calphad databases, but they are not nearly as common in non-commercial or traditional academic Calphad databases. A primary driver is that user-friendly Calphad modeling tools that support property models are not widely available. Here we present new property modeling capabilities that have been implemented in ESPEI (the Extensible, Self-optimizing Phase Equilibrium Infrastructure). These capabilities include both generating property model parameters from data and improvements to the algorithmic selection of the most appropriate model from a series of candidates. Additionally, two illustrative examples are given that use ESPEI to fit different property models. First, we generate molar volume model parameters for Group IV, V, and VI refractory BCC alloys based on the model by Lu et al. (2005). Second, we demonstrate the extensibility of ESPEI’s property modeling capabilities by implementing a custom PyCalphad model for BCC elastic stiffness parameters to generate and compare parameters to the ones assessed by Marker et al. (2018) using the same data. Property models generated by ESPEI can be used in PyCalphad or further optimized with uncertainty quantification using ESPEI.

36 MATERIALS SCIENCE↗

Bayesian operator inference for data-driven reduced-order modeling

This work proposes a Bayesian inference method for the reduced-order modeling of time-dependent systems. Informed by the structure of the governing equations, the task of learning a reduced-order model from data is posed as a Bayesian inverse problem with Gaussian prior and likelihood. The resulting posterior distribution characterizes the operators defining the reduced-order model, hence the predictions subsequently issued by the reduced-order model are endowed with uncertainty. The statistical moments of these predictions are estimated via a Monte Carlo sampling of the posterior distribution. Since the reduced models are fast to solve, this sampling is computationally efficient. Furthermore, the proposed Bayesian framework provides a statistical interpretation of the regularization term that is present in the deterministic operator inference problem, and the empirical Bayes approach of maximum marginal likelihood suggests a selection algorithm for the regularization hyperparameters. The proposed method is demonstrated on two examples: the compressible Euler equations with noise-corrupted observations, and a single-injector combustion process.

97 MATHEMATICS AND COMPUTING↗

Optimal sensor placement for reconstructing wind pressure field around buildings using compressed sensing

Deciding how to optimally deploy sensors in a large, complex, and spatially extended structure is critical to ensure that the surface pressure field is accurately captured for subsequent analysis and design. In some cases, reconstruction of missing data is required in downstream tasks such as the development of digital twins. Here, this paper presents a data-driven sparse sensor selection algorithm, aiming to provide the most information contents for reconstructing aerodynamic characteristics of wind pressures over tall building structures parsimoniously. The algorithm first fits a set of basis functions to the training data, then applies a computationally efficient QR algorithm that ranks existing pressure sensors in order of importance based on the state reconstruction to this tailored basis. The findings of this study show that the proposed algorithm successfully re- constructs the aerodynamic characteristics of tall buildings from sparse measurement locations, generating stable and optimal solutions across a range of conditions. As a result, this study serves as a promising first step toward leveraging the success of data-driven and machine learning algorithms to supplement traditional genetic algorithms currently used in wind engineering.

42 ENGINEERING↗

A web-based geovisual analytics platform for identifying potential contributors to culvert sedimentation

Sediment accumulation at culverts involves large-scale and interlinked environmental processes that are difficult to address with experimental or physical modeling methods. This article presents an alternative data-driven investigation for shedding insights into these processes. Accordingly, a web-based geovisual analytics application, the IowaDOT platform, was developed, which allows users to explore the complex processes associated with the sediment deposition at culverts. The platform provides systematic procedures for (1) collecting and integrating analytical variables into a single dataset, (2) quantifying the degree of culvert sedimentation using time series of aerial images, (3) identifying drivers that contribute to culvert sedimentation processes from a variety of culvert structural and upstream landscape characteristics using a tree-based feature selection algorithm, and (4) facilitating the understanding of complex spatial and relational patterns of culvert sedimentation processes using multivariate geovisualizations supported by a self-organizing map (SOM). As the outcomes of this study, these patterns identify culvert sedimentation-prone regions in Iowa and quantify empirical relationships between the drivers and culvert sedimentation degrees. Finally, a simple evaluation of the platform was performed to assess the usefulness and user satisfaction of the tool by professional users, and positive feedbacks are received.

54 ENVIRONMENTAL SCIENCES↗

Natural Charge-Transfer Analysis: Eliminating Spurious Charge-Transfer States in Time-Dependent Density Functional Theory via Diabatization, with Application to Projection-Based Embedding

For many types of vertical excitation energies, linear-response time-dependent density functional theory (LR-TDDFT) offers a useful degree of accuracy combined with unrivaled computational efficiency, although charge-transfer excitation energies are often systematically and dramatically underestimated, especially for large systems and those that contain explicit solvent. As a result, low energy electronic spectra of solution-phase chromophores often contain tens to hundreds of spurious charge-transfer states, making LR-TDDFT needlessly expensive in bulk solution. More nefariously, intensity borrowing by the low-energy charge-transfer states can affect intensities of the valence excitations even if those excitation energies are accurate. At higher excitation energies, it is difficult to distinguish spurious CT states from genuine charge-transfer-to-solvent (CTTS) excitations. In this work, we introduce an automated diabatization scheme that enables fast and effective screening of the CTTS acceptor space in bulk solution. Our procedure introduces the concept of “natural charge-transfer orbitals”, which provide a means to isolate characteristic pairs of orbitals that are most likely to participate in a CTTS excitation. The projection of these orbitals onto solvent-centered virtual orbitals provides a criterion for defining the most important solvent molecules in a given excitation. We apply this method to analyze an ab initio molecular dynamics (MD) trajectory of I-(aq) and report the lowest-energy CTTS band in the absorption spectrum. Our results are in excellent agreement with experimental measurements for bulk I-(aq), and only one-third of the water molecules in the I-(H2O)96 simulation cell need to be described with LR-TDDFT in order to obtain excitation energies that are converged to < 0.1 eV. The tools introduced herein will improve the accuracy, efficiency, and usability of LR-TDDFT in solution-phase environments

Carter-Fenk, Kevin D.↗