Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complexes”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Accurate Thermochemistry of Complex Lignin Structures via Density Functional Theory, Group Additivity, and Machine Learning

A molecular-level understanding of lignin structures and bond dissociation energies could facilitate depolymerization technologies. Still, this information is currently limited due to the lack of databases and the simplification of surrogate models. Here, substitution effects on seven common linkages in lignin polymers are systematically investigated. An automated reaction network generator is employed to create a database of structures. A new group additivity (GA) model based on principal component analysis (PCA) descriptors is introduced and trained on gas-phase density functional theory data of 4100 species at the M06-2X/6-311++G(d,p) level. Hydrogen bonds, local steric, and nonaromatic ring contributions are also incorporated. Lastly, we improve the accuracy of the group additivity model to reach the G4 theory by computing a data set of 770 species at this level and using a data fusion approach.

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

Oxygen-atom transfer photochemistry of a molecular copper bromate complex

Here, we report the synthesis and oxygen-atom transfer (OAT) photochemistry of [Cu(tpa)BrO 3 ]ClO 4 . In situ spectroscopy and in crystallo experiments indicate OAT proceeds from a Cu–O fragment generated by sequential Cu–O bond cleavage and OAT from BrO x to [Cu(tpa)] + . Furthermore, these results highlight synthetic opportunities in M–O photochemistry and demonstrate the utility of in crystallo experiments to evaluating photochemical reaction mechanisms.

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

Biomolecular complex viewed by dynamic nuclear polarization solid-state NMR spectroscopy

Solid-state nuclear magnetic resonance (ssNMR) is an indispensable tool for elucidating the structure and dynamics of insoluble and non-crystalline biomolecules. The recent advances in the sensitivity-enhancing technique magic-angle spinning dynamic nuclear polarization (MAS-DNP) have substantially expanded the territory of ssNMR investigations and enabled the detection of polymer interfaces in a cellular environment. This article highlights the emerging MAS-DNP approaches and their applications to the analysis of biomolecular composites and intact cells to determine the folding pathway and ligand binding of proteins, the structural polymorphism of low-populated biopolymers, as well as the physical interactions between carbohydrates, proteins, and lignin. Furthermore, these structural features provide an atomic-level understanding of many cellular processes, promoting the development of better biomaterials and inhibitors. It is anticipated that the capabilities of MAS-DNP in biomolecular and biomaterial research will be further enlarged by the rapid development of instrumentation and methodology.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Soft x-ray absorption spectroscopy and magnetic circular dichroism as operando probes of complex oxide electrolyte gate transistors

Electrolyte-based transistors utilizing ionic liquids/gels have been highly successful in the study of charge-density-controlled phenomena, particularly in oxides. Experimental probes beyond transport have played a significant role, despite challenges in their application in electric double-layer transistors. Here, we demonstrate the application of synchrotron soft x-ray absorption spectroscopy (XAS) and x-ray magnetic circular dichroism (XMCD) as operando probes of the charge state and magnetism in ion-gel-gated ferromagnetic perovskite films. Electrochemical response via oxygen vacancies at positive gate bias in LaAlO 3 (001)/La 0.5 Sr 0.5 CoO 3-δ is used as a test case. XAS/XMCD measurements of 4–25 unit-cell-thick films first probe the evolution of hole doping (from the O K-edge pre-peak) and ferromagnetism (at the Co L-edges), to establish a baseline. Operando soft XAS/XMCD of electrolyte-gated films is then demonstrated, using optimized spin-coated gels with a thickness of ~1 μm and a specific composition. The application of gate voltages up to +4 V is shown to dramatically suppress the O K-edge XAS pre-peak intensity and Co L-edge XMCD, thus enabling the Co valence and ferromagnetism to be tracked upon gate-induced reduction. Soft XAS and XMCD, with appropriate electrolyte design, are thus established to be viable for the operando characterization of electrolyte-gated oxides.

Yu, Biqiong↗
DOE OSTI2020

The Generality of the GUGA MRCI Approach in COLUMBUS for Treating Complex Quantum Chemistry

The core part of the program system COLUMBUS allows highly efficient calculations using variational multireference (MR) methods in the framework of configuration interaction with single and double excitations (MR-CISD) and averaged quadratic coupled-cluster calculations (MR-AQCC), based on uncontracted sets of configurations and the graphical unitary group approach (GUGA). The availability of analytic MR-CISD and MR-AQCC energy gradients and analytic nonadiabatic couplings for MR-CISD enables exciting applications including, e.g., investigations of π-conjugated biradicaloid compounds, calculations of multitudes of excited states, development of diabatization procedures, and furnishing the electronic structure information for on-the-fly surface nonadiabatic dynamics. With fully variational uncontracted spin-orbit MRCI, COLUMBUS provides a unique possibility of performing high-level calculations on compounds containing heavy atoms up to lanthanides and actinides. Crucial for carrying out all of these calculations effectively is the availability of an efficient parallel code for the CI step. Configuration spaces of several billion in size now can be treated quite routinely on standard parallel computer clusters. Emerging developments in COLUMBUS, including the all configuration mean energy multiconfiguration self-consistent field method and the graphically contracted function method, promise to allow practically unlimited configuration space dimensions. Spin density based on the GUGA approach, analytic spin-orbit energy gradients, possibilities for local electron correlation MR calculations, development of general interfaces for nonadiabatic dynamics, and MRCI linear vibronic coupling models conclude this overview.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Closing the loop between in-situ stress complexity and EGS fracture complexity

The goal of the project is to employ a combination of high-fidelity simulations and true-triaxial block fracturing tests at high temperature to explore the intricate relationship between in-situ stress and hydraulic fracture patterns and better characterize the in-situ stress at Utah FORGE. Laboratory experiments are used to validate numerical models and better understand the impact of various parameters (e.g., temperature, well orientation, stress, etc) on the hydraulic fracture nucleation process in EGS. The project will have a significant impact as it will (1) improve the characterization of the in-situ stress field at FORGE; (2) demonstrate how high-fidelity modeling tools can be employed to analyze data for EGS; (3) provide a unique set of high-temperature hydraulic fracturing experimental results for EGS to help identifying the most important components for in-situ stress estimation and to validate the current in-situ stress estimation theory and establish a strong foundation for proposing a new one; (4) provide a validated set of numerical tools in an open source simulation framework (GEOS) that can be used to model EGS.

15 GEOTHERMAL ENERGY↗
DOE OSTI2024

Closing the Loop Between In Situ Stress Complexity and EGS Fracture Complexity (Quarterly Research Performance Progress Report: Q3Y3)

As part of Task 1, we have started by testing our modeling capabilities by reproducing isothermal DFIT simulations presented in the literature. To start, we have been working towards adjusting numerical parameters to reproduce DFIT tests with different fracture geometries. Then, we have focused modeling the DFIT conducted at well 58-32 (cycle 4 in zone 2). Specifically, we have carefully analyzed the influence of the aperture-contact stress relationship and investigated how two different laws affect model results. We have also introduced thermal effects in the model and rerun the simulations to estimate the effect of cooling on the DFIT response. Due to the small amount of fluid injected during a DFIT, thermal effects seem to be moderate.

15 GEOTHERMAL ENERGY↗
DOE OSTI2025

Closing the Loop Between In Situ Stress Complexity and EGS Fracture Complexity: Quarterly Research Performance Progress Report

As part of Task 1, we have started by testing our modeling capabilities by reproducing isothermal DFIT simulations presented in the literature. To start, we have been working towards adjusting numerical parameters to reproduce DFIT tests with different fracture geometries. Then, we have focused modeling the DFIT conducted at well 58-32 (cycle 4 in zone 2). Specifically, we have carefully analyzed the influence of the aperture-contact stress relationship and investigated how two different laws affect model results.

58 GEOSCIENCES↗
NASA NTRSDate not supplied

Monitoring Airspace Complexity and Determining Contributing Factors

The national airspace has evolved over many years to accommodate increased traffic demand [1] while simultaneously maintaining one of the safest forms of transportation [2], [3]. One of the reasons for this success is the ability of the system and the operators to adapt and accommodate to situations that routinely disrupt optimal operations. These situations may include: adverse weather, delays, early arrivals, equipment outages, and other factors that are outside the operators ability to control. These factors can lead to states where automation is unable to properly handle these issues and therefore air traffic controllers and pilots have to intervene, ultimately increasing communication between operators resulting in higher workload. As controller workload increases to handle sub-optimal operating conditions this can be viewed as an increase in complexity. The reasoning for this is because humans are now required to make tactical decisions in response to external factors, resulting in a departure from the strategic plan where operations would be more efficiently managed. Human operators control airspace complexity under rigid regulations that are constantly changing. The airspace is divided into sectors and the number of aircraft assigned to each controller is limited for safe handling. There has been past work that devised airspace complexity metrics in commercial aviation and related these metrics to controller workload (e.g., [4],[5]). The upper bounds on the system load are pre-determined. Such bounds on complexity make for a safe system, but the system cannot scale and adapt to autonomous, dense, and heterogeneous traffic, including the many types of Unmanned Aerial Vehicles (UAVs) envisioned to be added to the operations. We hypothesize that, as traffic density and heterogeneity grow, and other key metrics change, there will be phase transitions at which the way traffic should be managed changes significantly [6]. We offer a method for in-time detection of contributing factors that lead to phase transitions, characterized by increased complexity. To the best of our knowledge, there is no tool similar to our proposed effort that identifies such contributing factors or precursor patterns. To define the scope we are proposing to measure complexity from the viewpoint of the Terminal Radar Approach Control Facilities (TRACON) controller’s perspective. In particular we are analyzing arrivals into KSFO. With safety as the top concern for airspace operators, it is important to recognize that as density and heterogeneity grow, the focus of the system will change. Times of the day when the airspace has low density and heterogeneity, the flights will follow more efficient paths where the aircraft move on established routes that are more or less directly to the destination. However, when density and heterogeneity increases, the system will begin changing focus to avoiding conflicts and collisions and route the flights in a more flexible way. Higher flexibility requires more communication and coordination between controllers and pilots which the current automation is unable to handle. This paper proposes a novel approach that monitors airspace complexity at multiple scales, uses a Machine Learning-based tool that predicts when operations will transition to a regime of greater complexity, and identifies actions that can reduce the complexity while still maintaining efficient and safe operations. We demonstrate our proposed approach using data from multiple complementary sources. This includes, but is not limited to: historical aircraft surveillance data from NASA’s Sherlock Data Warehouse [7], METAR weather data, and airport configuration data from Aviation System Performance Metrics (ASPM). The surveillance data flight paths are sampled at a variable sample rate — increasing as the aircraft approaches the airport. This is due to how Sherlock manages flight track stitching between different radar facilities which have different sampling rates. The weather and performance data are logged at defined intervals throughout the day at a courser refresh rate. In addition to the logged data and metrics, we leverage pre-defined Standard Terminal Arrival Routes (STARs) procedures to characterize the path of each flight. Each flight files for one of these routes in the flight plan well before entering the terminal airspace, and approximately follows the route until it leaves the STAR, typically on the final fix of a runway transition. However, most flights do not always fly the full STAR procedure to completion [8], but the majority do adhere to the fixes within the common route of the procedure. Our approach leverages fixes in the common route of each of the STARs to build a reference path to the airport. This allows us to characterize the flight paths in what we are defining as the “maneuvering area” (the airspace between the STAR and before the flight is lined up on the runway’s final approach) to determine how off nominal the flights are to calculate its complexity score. Determining airspace complexity is a concept that does not have a concrete answer. In designing this metric, we consider what increases the workload for the air traffic controllers. Consequently more specialized vectoring maneuvers results in higher workload. Accordingly, we start with a theory: each flight has a direct path it takes from the STAR’s common route to the final approach’s outer marker fix for the flight’s landing runway. It is important to note that the direct path is only used as a reference. If the majority of the flights have a large consistent offset as compared to other routes it does not necessarily mean that those flights have higher complexity. We are merely building a distribution based on this direct path for that particular STAR and runway pair to determine the normal mode of operations for that route. Flights that are in the upper tail of these distributions will result in higher complexity scores and flights that fly in the median will represent the normal mode of operations and therefore will have lower complexity scores. Since flights following each STAR route take different paths to the airport, we have a different distribution for each STAR route and therefore can model these distributions to compute a complexity score from their respective normalized distributions. To evaluate the effectiveness of our proposed airspace complexity metric we will compare against an established approach based on trajectory clustering [9]. This unsupervised learning technique consists of the following steps: (1) identify the general maneuvering areas (waypoints) by performing $\kappa$-means or DBSCAN clustering on locations where aircraft frequently turn based on the surveillance radar track data, (2) map flight trajectories onto sequences of waypoints, and (3) cluster the sequences based on their common subsequences. From a high-level perspective, this baseline model learns nominal operations in the airspace through the sequence of waypoints that are representative of where aircraft change direction and defines deviations from the nominal operations as “complex.” Therefore, more deviations from the nominal operations correspond to higher complexity values. For our validation, we re-implemented this technique and tune model hyper-parameters to correctly detect waypoints for the arrival traffic into the San Francisco bay area. We will compute the complexity measure over a one-year period using our proposed technique as well as the baseline. Our validation will be based on each technique’s ability to detect a set of undesirable outcomes (e.g., go-arounds, holding patterns, average time in the airspace, etc.). Since our current complexity metric is derived from the offset from the direct reference path, it’s important to understand what causes these offsets. In many of the flights with high offset distance, flights performing holding patterns and S turns can be observed. These maneuvering tactics are utilized to add distance between the aircraft and the destination runway to prevent multiple flights from having conflicting arrival times. In order to predict a rise in complexity (or the precursor to complexity), it’s necessary to be able to identify these potential conflicts (which in turn, result in higher offsets). To do this, we define a “representative flight” for each STAR route and runway pair. This flight is approximately the path the flight would take if there was a clear path with no other flights in the airspace — including the time remaining to the airport. We first identify the flights for a given STAR runway pair using the offset to the reference path distributions that fall between the 44-55 percentiles. This yields the flights that conform to the most normal mode of operation. Each of these flights is partitioned based on the percent complete from the entry point into the maneuvering areas from 0\% – 100\% complete. Then for each percent “bin”, we take the median value of the flight’s latitude/longitude coordinates, airspeed, and (non causal) time remaining to the airport to construct a lookup table for each percent complete bin on a given route. As a flight enters the maneuvering area, we can find the estimated arrival time of a flight to the airport by finding the closest point to the representative path’s percent complete bin (relative to the flight’s current position at any snapshot in the airspace) and therefore retrieve the corresponding remaining time left on the “representative path”. We assume that the flight will follow the representative path to completion when deriving these estimates. We can then compare these estimated arrival times against other flights for the same snapshot in time to identify potential conflicts. If more flights are estimated to arrive within a tolerance window than there are runways available, then we have a potential conflict. We can use this derived measure along with other factors expected to add disruption to the operation such as weather and runway configuration changes as an input to machine learning tools to detect precursors that increases in our complexity measure. This novel method will assist in uncovering insights into the contributing factors that lead to increased complexity that may allow for in-time responses to avoid reaching a high complexity state in the airspace.

complexity↗
NASA NTRS2015

Reduction of Subjective and Objective System Complexity

Occam's razor is often used in science to define the minimum criteria to establish a physical or philosophical idea or relationship. Albert Einstein is attributed the saying "everything should be made as simple as possible, but not simpler". These heuristic ideas are based on a belief that there is a minimum state or set of states for a given system or phenomena. In looking at system complexity, these heuristics point us to an idea that complexity can be reduced to a minimum. How then, do we approach a reduction in complexity? Complexity has been described as a subjective concept and an objective measure of a system. Subjective complexity is based on human cognitive comprehension of the functions and inter relationships of a system. Subjective complexity is defined by the ability to fully comprehend the system. Simplifying complexity, in a subjective sense, is thus gaining a deeper understanding of the system. As Apple's Jonathon Ive has stated," It's not just minimalism or the absence of clutter. It involves digging through the depth of complexity. To be truly simple, you have to go really deep". Simplicity is not the absence of complexity but a deeper understanding of complexity. Subjective complexity, based on this human comprehension, cannot then be discerned from the sociological concept of ignorance. The inability to comprehend a system can be either a lack of knowledge, an inability to understand the intricacies of a system, or both. Reduction in this sense is based purely on a cognitive ability to understand the system and no system then may be truly complex. From this view, education and experience seem to be the keys to reduction or eliminating complexity. Objective complexity, is the measure of the systems functions and interrelationships which exist independent of human comprehension. Jonathon Ive's statement does not say that complexity is removed, only that the complexity is understood. From this standpoint, reduction of complexity can be approached in finding the optimal or 'best balance' of the system functions and interrelationships. This is achievable following von Bertalanffy's approach of describing systems as a set of equations representing both the system functions and the system interrelationships. Reduction is found based on an objective function defining the system output given variations in the system inputs and the system operating environment. By minimizing the objective function with respect to these inputs and environments, a reduced system can be found. Thus, a reduction of the system complexity is feasible.

Watson, Michael D.↗