Matching Items (4)
Filtering by
- All Subjects: artificial intelligence
- All Subjects: Carbon Sequestration
- All Subjects: Bipyridine
- Resource Type: Text
- Status: Published
Description
Increasing concentrations of carbon dioxide in the atmosphere will inevitably lead to long-term changes in climate that can have serious consequences. Controlling anthropogenic emission of carbon dioxide into the atmosphere, however, represents a significant technological challenge. Various chemical approaches have been suggested, perhaps the most promising of these is based on electrochemical trapping of carbon dioxide using pyridine and derivatives. Optimization of this process requires a detailed understanding of the mechanisms of the reactions of reduced pyridines with carbon dioxide, which are not currently well known. This thesis describes a detailed mechanistic study of the nucleophilic and Bronsted basic properties of the radical anion of bipyridine as a model pyridine derivative, formed by one-electron reduction, with particular emphasis on the reactions with carbon dioxide. A time-resolved spectroscopic method was used to characterize the key intermediates and determine the kinetics of the reactions of the radical anion and its protonated radical form. Using a pulsed nanosecond laser, the bipyridine radical anion could be generated in-situ in less than 100 ns, which allows fast reactions to be monitored in real time. The bipyridine radical anion was found to be a very powerful one-electron donor, Bronsted base and nucleophile. It reacts by addition to the C=O bonds of ketones with a bimolecular rate constant around 1* 107 M-1 s-1. These are among the fastest nucleophilic additions that have been reported in literature. Temperature dependence studies demonstrate very low activation energies and large Arrhenius pre-exponential parameters, consistent with very high reactivity. The kinetics of E2 elimination, where the radical anion acts as a base, and SN2 substitution, where the radical anion acts as a nucleophile, are also characterized by large bimolecular rate constants in the range ca. 106 - 107 M-1 s-1. The pKa of the bipyridine radical anion was measured using a kinetic method and analysis of the data using a Marcus theory model for proton transfer. The bipyridine radical anion is found to have a pKa of 40±5 in DMSO. The reorganization energy for the proton transfer reaction was found to be 70±5 kJ/mol. The bipyridine radical anion was found to react very rapidly with carbon dioxide, with a bimolecular rate constant of 1* 108 M-1 s-1 and a small activation energy, whereas the protonated radical reacted with carbon dioxide with a rate constant that was too small to measure. The kinetic and thermodynamic data obtained in this work can be used to understand the mechanisms of the reactions of pyridines with carbon dioxide under reducing conditions.
ContributorsRanjan, Rajeev (Author) / Gould, Ian R (Thesis advisor) / Buttry, Daniel A (Thesis advisor) / Yarger, Jeff (Committee member) / Seo, Dong-Kyun (Committee member) / Arizona State University (Publisher)
Created2015
Description
Carbon Capture and Storage (CCS) is a climate stabilization strategy that prevents CO2 emissions from entering the atmosphere. Despite its benefits, impactful CCS projects require large investments in infrastructure, which could deter governments from implementing this strategy. In this sense, the development of innovative tools to support large-scale cost-efficient CCS deployment decisions is critical for climate change mitigation. This thesis proposes an improved mathematical formulation for the scalable infrastructure model for CCS (SimCCS), whose main objective is to design a minimum-cost pipe network to capture, transport, and store a target amount of CO2. Model decisions include source, reservoir, and pipe selection, as well as CO2 amounts to capture, store, and transport. By studying the SimCCS optimal solution and the subjacent network topology, new valid inequalities (VI) are proposed to strengthen the existing mathematical formulation. These constraints seek to improve the quality of the linear relaxation solutions in the branch and bound algorithm used to solve SimCCS. Each VI is explained with its intuitive description, mathematical structure and examples of resulting improvements. Further, all VIs are validated by assessing the impact of their elimination from the new formulation. The validated new formulation solves the 72-nodes Alberta problem up to 7 times faster than the original model. The upgraded model reduces the computation time required to solve SimCCS in 72% of randomly generated test instances, solving SimCCS up to 200 times faster. These formulations can be tested and then applied to enhance variants of the SimCCS and general fixed-charge network flow problems. Finally, an experience from testing a Benders decomposition approach for SimCCS is discussed and future scope of probable efficient solution-methods is outlined.
ContributorsLobo, Loy Joseph (Author) / Sefair, Jorge A (Thesis advisor) / Escobedo, Adolfo (Committee member) / Kuby, Michael (Committee member) / Middleton, Richard (Committee member) / Arizona State University (Publisher)
Created2017
Description
The Cognitive Decision Support (CDS) model is proposed. The model is widely applicable and scales to realistic, complex decision problems based on adaptive learning. The utility of a decision is discussed and four types of decisions associated with CDS model are identified. The CDS model is designed to learn decision utilities. Data enrichment is introduced to promote the effectiveness of learning. Grouping is introduced for large-scale decision learning. Introspection and adjustment are presented for adaptive learning. Triage recommendation is incorporated to indicate the trustworthiness of suggested decisions.
The CDS model and methodologies are integrated into an architecture using concepts from cognitive computing. The proposed architecture is implemented with an example use case to inventory management.
Reinforcement learning (RL) is discussed as an alternative, generalized adaptive learning engine for the CDS system to handle the complexity of many problems with unknown environments. An adaptive state dimension with context that can increase with newly available information is discussed. Several enhanced components for RL which are critical for complex use cases are integrated. Deep Q networks are embedded with the adaptive learning methodologies and applied to an example supply chain management problem on capacity planning.
A new approach using Ito stochastic processes is proposed as a more generalized method to generate non-stationary demands in various patterns that can be used in decision problems. The proposed method generates demands with varying non-stationary patterns, including trend, cyclical, seasonal, and irregular patterns. Conventional approaches are identified as special cases of the proposed method. Demands are illustrated in realistic settings for various decision models. Various statistical criteria are applied to filter the generated demands. The method is applied to a real-world example.
The CDS model and methodologies are integrated into an architecture using concepts from cognitive computing. The proposed architecture is implemented with an example use case to inventory management.
Reinforcement learning (RL) is discussed as an alternative, generalized adaptive learning engine for the CDS system to handle the complexity of many problems with unknown environments. An adaptive state dimension with context that can increase with newly available information is discussed. Several enhanced components for RL which are critical for complex use cases are integrated. Deep Q networks are embedded with the adaptive learning methodologies and applied to an example supply chain management problem on capacity planning.
A new approach using Ito stochastic processes is proposed as a more generalized method to generate non-stationary demands in various patterns that can be used in decision problems. The proposed method generates demands with varying non-stationary patterns, including trend, cyclical, seasonal, and irregular patterns. Conventional approaches are identified as special cases of the proposed method. Demands are illustrated in realistic settings for various decision models. Various statistical criteria are applied to filter the generated demands. The method is applied to a real-world example.
ContributorsKee, Seho (Author) / Runger, George C. (Thesis advisor) / Escobedo, Adolfo (Committee member) / Gel, Esma (Committee member) / Janakiram, Mani (Committee member) / Rogers, Dale (Committee member) / Arizona State University (Publisher)
Created2020
Description
Collecting accurate collective decisions via crowdsourcing
is challenging due to cognitive biases, varying
worker expertise, and varying subjective scales. This
work investigates new ways to determine collective decisions
by prompting users to provide input in multiple
formats. A crowdsourced task is created that aims
to determine ground-truth by collecting information in
two different ways: rankings and numerical estimates.
Results indicate that accurate collective decisions can
be achieved with less people when ordinal and cardinal
information is collected and aggregated together
using consensus-based, multimodal models. We also
show that presenting users with larger problems produces
more valuable ordinal information, and is a more
efficient way to collect an aggregate ranking. As a result,
we suggest input-elicitation to be more widely considered
for future work in crowdsourcing and incorporated
into future platforms to improve accuracy and efficiency.
is challenging due to cognitive biases, varying
worker expertise, and varying subjective scales. This
work investigates new ways to determine collective decisions
by prompting users to provide input in multiple
formats. A crowdsourced task is created that aims
to determine ground-truth by collecting information in
two different ways: rankings and numerical estimates.
Results indicate that accurate collective decisions can
be achieved with less people when ordinal and cardinal
information is collected and aggregated together
using consensus-based, multimodal models. We also
show that presenting users with larger problems produces
more valuable ordinal information, and is a more
efficient way to collect an aggregate ranking. As a result,
we suggest input-elicitation to be more widely considered
for future work in crowdsourcing and incorporated
into future platforms to improve accuracy and efficiency.
ContributorsKemmer, Ryan Wyeth (Author) / Escobedo, Adolfo (Thesis director) / Maciejewski, Ross (Committee member) / Computing and Informatics Program (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05