Long Short-Term Memory for Karst Watershed Modeling: Case Study of Logan River Canyon, UT, USA

164857-Thumbnail Image.png
Description
Hydrologic modeling in snowfed karst watersheds is important for many communities relying on their water for municipal and agricultural use, but the complexities of karst hydrology have made this task historically difficult. Here, two Long Short-Term Memory (LSTM) models are

Hydrologic modeling in snowfed karst watersheds is important for many communities relying on their water for municipal and agricultural use, but the complexities of karst hydrology have made this task historically difficult. Here, two Long Short-Term Memory (LSTM) models are compared to investigate this problem from a deep-learning perspective within the context of the Logan River Canyon watershed, which supplies water to Logan City, UT. One is spatially lumped and the other spatially distributed, the latter with a potential to reveal underlying spatial watershed dynamics. Both use snowmelt and rainfall to predict daily streamflow downstream. I find distributed LSTMs consistently outperform lumped LSTMs in this task. Additionally, I find that a spatial sensitivity analysis of distributed LSTMs is unpromising in revealing spatial watershed dynamics but warrants further investigation.
Date Created
2022-05
Agent

A Supplement to ASU's MAT 370: Examples and Applications

148454-Thumbnail Image.png
Description

This thesis is a supplement textbook designed with ASU’s MAT 370, or more generally, a course in introductory real analysis (IRA). With research in the realms of mathematics textbook creation and IRA pedagogy, this supplement aims to provide students or

This thesis is a supplement textbook designed with ASU’s MAT 370, or more generally, a course in introductory real analysis (IRA). With research in the realms of mathematics textbook creation and IRA pedagogy, this supplement aims to provide students or interested readers an additional presentation of the materials. Topics discussed include the real number system, some topology of the real line, sequences of real numbers, continuity, differentiation, integration, and the Fundamental Theorem of Calculus. Special emphasis was placed on worked examples of proven results and exercises with hints at the end of every chapter. In this respect, this supplement aims to be both versatile and self-contained for the different mathematics skill levels of readers.

Date Created
2021-05
Agent

Asymptotic Stability of Biharmonic Shallow Water Equations

134632-Thumbnail Image.png
Description
The dissipative shallow-water equations (SWE) possess both real-world application and extensive analysis in theoretical partial differential equations. This analysis is dominated by modeling the dissipation as diffusion, with its mathematical representation being the Laplacian. However, the usage of the biharmonic

The dissipative shallow-water equations (SWE) possess both real-world application and extensive analysis in theoretical partial differential equations. This analysis is dominated by modeling the dissipation as diffusion, with its mathematical representation being the Laplacian. However, the usage of the biharmonic as a dissipative operator by oceanographers and atmospheric scientists and its underwhelming amount of analysis indicates a gap in SWE theory. In order to provide rigorous mathematical justification for the utilization of these equations in simulations with real-world implications, we extend an energy method utilized by Matsumura and Nishida for initial value problems relating to the equations of motion for compressible, vsicous, heat-conductive fluids ([6], [7]) and applied by Kloeden to the diffusive SWE ([4]) to prove global time existence of classical solutions to the biharmonic SWE. In particular, we develop appropriate a priori growth estimates that allow one to extend the solution's temporal existence infinitely under sufficient constraints on initial data and external forcing, resulting in convergence to steady-state.
Date Created
2017-05
Agent

Monotonicity and manipulability of ordinal and cardinal social choice functions

149527-Thumbnail Image.png
Description
Borda's social choice method and Condorcet's social choice method are shown to satisfy different monotonicities and it is shown that it is impossible for any social choice method to satisfy them both. Results of a Monte Carlo simulation are presented

Borda's social choice method and Condorcet's social choice method are shown to satisfy different monotonicities and it is shown that it is impossible for any social choice method to satisfy them both. Results of a Monte Carlo simulation are presented which estimate the probability of each of the following social choice methods being manipulable: plurality (first past the post), Borda count, instant runoff, Kemeny-Young, Schulze, and majority Borda. The Kemeny-Young and Schulze methods exhibit the strongest resistance to random manipulability. Two variations of the majority judgment method, with different tie-breaking rules, are compared for continuity. A new variation is proposed which minimizes discontinuity. A framework for social choice methods based on grades is presented. It is based on the Balinski-Laraki framework, but doesn't require aggregation functions to be strictly monotone. By relaxing this restriction, strategy-proof aggregation functions can better handle a polarized electorate, can give a societal grade closer to the input grades, and can partially avoid certain voting paradoxes. A new cardinal voting method, called the linear median is presented, and is shown to have several very valuable properties. Range voting, the majority judgment, and the linear median are also simulated to compare their manipulability against that of the ordinal methods.
Date Created
2010
Agent