Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 19 of 19

Full-Text Articles in Physical Sciences and Mathematics

Asymptotic Expansion Of The L^2 Norms Of The Solutions To The Heat And Dissipative Wave Equations On The Heisenberg Group, Preston Walker Dec 2020

Asymptotic Expansion Of The L^2 Norms Of The Solutions To The Heat And Dissipative Wave Equations On The Heisenberg Group, Preston Walker

Theses and Dissertations

Motivated by the recent work on asymptotic expansions of heat and dissipative wave equations on the Euclidean space, and the resurgent interests in Heisenberg groups, this dissertation is devoted to the asymptotic expansions of heat and dissipative wave equations on Heisenberg groups. The Heisenberg group, $\mathbb{H}^{n}$, is the $\mathbb{R}^{2n+1}$ manifold endowed with the law $$(x,y,s)\cdot (x',y',s') = (x+x', y+y', s+ s' + \frac{1}{2} (xy' - x'y)),$$ where $x,y\in \mathbb{R}^{n}$ and $t\in \mathbb{R}$. Let $v(t,z)$ and $u(t,z)$ be solutions of the heat equation, $v_{t} - \mathcal{L} v=0$, and dissipative wave equation, $u_{tt}+u_{t} - \mathcal{L}u =0$, over the Heisenberg group respectively, where …


The Second Law Of Thermodynamics And The Accumulation Theorem, Austin Maule Aug 2020

The Second Law Of Thermodynamics And The Accumulation Theorem, Austin Maule

Theses and Dissertations

In Serrin's proof of the Accumulation Theorem, the presence of an ideal gas G is assumed.

In 1979 at the University of Naples, Serrin (allegedly) proved that the ideal system G can be replaced by a more general ideal system and still have the Accumulation Theorem hold.

In this paper, we attempt to reconstruct Serrin's proof and supply a proof for a more general theorem stated in a paper of Coleman, Owen and Serrin.


Asymptotic Probability Of Incidence Relations Over Finite Fields, Adam Buck Aug 2020

Asymptotic Probability Of Incidence Relations Over Finite Fields, Adam Buck

Theses and Dissertations

Given four generic lines in FP3, we ask, "How many lines meet the four?" The answer depends on the field. When F = C, the answer is two. When F = R, the answer is either zero or two.

If we work over a finite field there are only finitely many projective lines. We compute the probability four lines are met by two. The main result is that as q approaches infinity, this probability approaches 1/2. Asymptotically, the other half of the time zero lines will meet the four.


Local Connectedness Of Bowditch Boundary Of Relatively Hyperbolic Groups, Ashani Dasgupta Aug 2020

Local Connectedness Of Bowditch Boundary Of Relatively Hyperbolic Groups, Ashani Dasgupta

Theses and Dissertations

If the Bowditch boundary of a finitely generated relatively hyperbolic group is connected, then, we show that it is locally connected. Bowditch showed that this is true provided the peripheral subgroups obey certain tameness condition. In this paper, we show that these tameness conditions are not necessary.


Earth Mover's Distance Between Grade Distribution Data With Fixed Mean, Jan Kretschmann Aug 2020

Earth Mover's Distance Between Grade Distribution Data With Fixed Mean, Jan Kretschmann

Theses and Dissertations

The Earth Mover's Distance (EMD) is examined on all theoretically possible grade distributions with the same grade point average (GPA). The numbers of distributions with the same EMD and GPA are encoded in the coefficients of a generating function. The theoretical mean EMD for grade distributions, that are sampled uniformly and independently at random, is computed from this function, and compared to real world grade data taken from several years. The data is further examined regarding the appearance of clusters that change when varying the distance threshold.


Algebraic Relations Via A Monte Carlo Simulation, Alison Elaine Becker Aug 2020

Algebraic Relations Via A Monte Carlo Simulation, Alison Elaine Becker

Theses and Dissertations

The conjugation action of the complex orthogonal group on the polynomial functions on $n \times n$ matrices gives rise to a graded algebra of invariants, $\mathcal{P}(M_n)^{O_n}$. A spanning set of this algebra is in bijective correspondence to a set of unlabeled, cyclic graphs with directed edges equivalent under dihedral symmetries. When the degree of the invariants is $n+1$, we show that the dimension of the space of relations between the invariants grows linearly in $n$. Furthermore, we present two methods to obtain a basis of the space of relations; we construct a basis using an idempotent of the group algebra …


A Dynamic Programming Approach To Impulse Control Of Brownian Motions, Robin Braun Aug 2020

A Dynamic Programming Approach To Impulse Control Of Brownian Motions, Robin Braun

Theses and Dissertations

This thesis considers an impulse control problem of a standard Brownian motion under a discounted criterion, in which every intervention incurs a strictly positive cost. The value function and an optimal $(\tau_{*}, Y_{*})$ policy are found using the dynamic programming principle together with the smooth pasting technique. The thesis also performs a sensitivity analysis by analyzing the limiting behaviors of the value function and the $(\tau_{*}, Y_{*})$ policy when the fixed intervention cost converges to zero. It is demonstrated that the limits agree with the classic fuel follower problem.

The thesis next formulates and analyzes an $N$-player stochastic game of …


Dictionary-Based Data Generation For Fine-Tuning Bert For Adverbial Paraphrasing Tasks, Mark Anthony Carthon Aug 2020

Dictionary-Based Data Generation For Fine-Tuning Bert For Adverbial Paraphrasing Tasks, Mark Anthony Carthon

Theses and Dissertations

Recent advances in natural language processing technology have led to the emergence of

large and deep pre-trained neural networks. The use and focus of these networks are on transfer

learning. More specifically, retraining or fine-tuning such pre-trained networks to achieve state

of the art performance in a variety of challenging natural language processing/understanding

(NLP/NLU) tasks. In this thesis, we focus on identifying paraphrases at the sentence level using

the network Bidirectional Encoder Representations from Transformers (BERT). It is well

understood that in deep learning the volume and quality of training data is a determining factor

of performance. The objective of …


Analysis On Some Basic Ion Channel Modeling Problems, Zhen Chao Aug 2020

Analysis On Some Basic Ion Channel Modeling Problems, Zhen Chao

Theses and Dissertations

The modeling and simulation of ion channel proteins are essential to the study of many vital physiological processes within a biological cell because most ion channel properties are very difficult to address experimentally in biochemistry. They also generate a lot of new numerical issues to be addressed in applied and computational mathematics. In this dissertation, we mainly deal with some numerical issues that are arisen from the numerical solution of one important ion channel dielectric continuum model, Poisson-Nernst-Planck (PNP) ion channel model, based on the finite element approximation approach under different boundary conditions and unstructured tetrahedral meshes. In particular, we …


Gross's Proof Of Local Existence For The Coupled Maxwell-Dirac Equations, Kimberly Jane Harry Aug 2020

Gross's Proof Of Local Existence For The Coupled Maxwell-Dirac Equations, Kimberly Jane Harry

Theses and Dissertations

The Maxwell-Dirac equations are a model for the interaction of a relativistic electron with an electromagnetic field. It is to be expected that the initial value problem will have an unique solution which exists for all time t >0, for all appropriate initial conditions. This is not yet known, but in 1966, Leonard Gross proved a local existence theorem. In this thesis, we will present an overview of Leonard Gross's proof.


Analysis Of The Continuity Of The Value Function Of An Optimal Stopping Problem, Samuel Morris Nehls Aug 2020

Analysis Of The Continuity Of The Value Function Of An Optimal Stopping Problem, Samuel Morris Nehls

Theses and Dissertations

In order to study model uncertainty of an optimal stopping problem of a stochastic process with a given state dependent drift rate and volatility, we analyze the effects of perturbing the parameters of the problem. This is accomplished by translating the original problem into a semi-infinite linear program and its dual. We then approximate this dual linear program by a countably constrained sub-linear program as well as an infinite sequence of finitely constrained linear programs. We find that in this framework the value function will be lower semi-continuous with respect to the parameters. If in addition we restrict ourselves to …


Evaluation Of Text Document Clustering Using K-Means, Lisa Beumer May 2020

Evaluation Of Text Document Clustering Using K-Means, Lisa Beumer

Theses and Dissertations

The fundamentals of human communication are language and written texts. Social media is an essential source of data on the Internet, but email and text messages are also considered to be one of the main sources of textual data. The processing and analysis of text data is conducted using text mining methods. Text Mining is the extension of Data Mining to text files to extract relevant information from large amounts of text data and to recognize patterns. Cluster analysis is one of the most important text mining methods. Its goal is the automatic partitioning of a number of objects into …


Numerical Solution Of A Class Of Stochastic Functional Differential Equations With Financial Applications, Laszlo Nicolai Fertig May 2020

Numerical Solution Of A Class Of Stochastic Functional Differential Equations With Financial Applications, Laszlo Nicolai Fertig

Theses and Dissertations

After a brief review of the Euler and Milstein numerical schemes and their convergence results

for stochastic differential equations (SDEs) and stochastic functional differential equations

(SFDEs), the thesis next proposes two specific SFDEs. The classical Euler and Milstein

schemes are developed to find the numerical solutions of these SFDEs, which are then compared

with the Ornstein-Uhlenbeck and a modified Ornstein-Uhlenbeck processes. These

results are further used to build four different but related stochastic models for stock prices.

The fitness of these models is analyzed by comparing real market data. The thesis concludes

with a numerical study for option pricing for …


Smoothed Quantiles For Claim Frequency Models, With Applications To Risk Measurement, Ponmalar Suruliraj Ratnam May 2020

Smoothed Quantiles For Claim Frequency Models, With Applications To Risk Measurement, Ponmalar Suruliraj Ratnam

Theses and Dissertations

Statistical models for the claim severity and claim frequency variables are routinely constructed and utilized by actuaries. Typical applications of such models include identification of optimal deductibles for selected loss elimination ratios, pricing of contract layers, determining credibility factors, risk and economic capital measures, and evaluation of effects of inflation, market trends and other quantities arising in insurance. While the actuarial literature on the severity models is extensive and rapidly growing, that for the claim frequency models lags behind. One of the reasons for such a gap is that various actuarial metrics do not possess ``nice'' statistical properties for the …


Analysis Of Inventory Models With Random Supply Using A Long-Term Average Criterion, Lars Moestue May 2020

Analysis Of Inventory Models With Random Supply Using A Long-Term Average Criterion, Lars Moestue

Theses and Dissertations

In this thesis we will use different numerical algorithms for inventory models, where the inventory level is described by a stochastic differential equation and therefore random. Furthermore we assume that order supply is randomly distributed. The goal is to find the optimal order strategy to minimize the long-term average costs.\\

This stochastic problem can be reformulated as non-linear optimization problem. However the problems are too complex to solve by hand, so we need to use numerical optimization algorithms and for some of the models even numerical integration methods. \\

These algorithms then can be used to analyze some properties and …


Fitting Of Lotka-Volterra Model For Coupled Population Growth Data Through Least-Squares Estimation Of Parameters, Jessica Ann Harter May 2020

Fitting Of Lotka-Volterra Model For Coupled Population Growth Data Through Least-Squares Estimation Of Parameters, Jessica Ann Harter

Theses and Dissertations

The population of two types of bacteria found in the Gulf Coast of Florida, V.chagasii and V. harveyi, can be described by the Lotka-Voltera competition model. Using data gathered in experiments conducted by Bury and Pickett (2015), we take a different approach to find parameter estimates using numerical methods in R. In particular, we find a numerical solution to the coupled set of ODEs and minimize the sum of squared errors in order to obtain the optimal parameter estimates that will fit the data best. In order to get a sense of accuracy of these parameter estimates, we use bootstrap …


The Fundamental System Of Units For Cubic Number Fields, Janik Huth May 2020

The Fundamental System Of Units For Cubic Number Fields, Janik Huth

Theses and Dissertations

Let $K$ be a number field of degree $n$. An element $\alpha \in K$ is called integral, if the minimal polynomial of $\alpha$ has integer coefficients. The set of all integral elements of $K$ is denoted by $\mathcal{O}_K$. We will prove several properties of this set, e.g. that $\mathcal{O}_K$ is a ring and that it has an integral basis. By using a fundamental theorem from algebraic number theory, Dirichlet's Unit Theorem, we can study the unit group $\mathcal{O}_K^\times$, defined as the set of all invertible elements of $\mathcal{O}_K$. We will prove Dirichlet's Unit Theorem and look at unit groups for …


Modeling Of Cloud Droplet Formation: Software Development And Sampling Strategies, Niklas Selke May 2020

Modeling Of Cloud Droplet Formation: Software Development And Sampling Strategies, Niklas Selke

Theses and Dissertations

Updraft speeds are an important factor in the formation of cloud droplets which play an important role in an atmospheric simulation. The updraft speeds are varying very strongly in small areas of space. Current models do not account for this kind of variability. Support for a probability density function (PDF) based approach in representing the variability of the updraft speeds has been implemented in the Energy Exascale Earth System Model (E3SM). Specifics of the implementation process have been discussed.

Different sampling strategies were tested to analyze the convergence behavior of the new approach to the cloud droplet formation process. It …


A Statistical Model For The Prediction Of The Taxi Trip Time In The City Of Chicago, Frank Bitter May 2020

A Statistical Model For The Prediction Of The Taxi Trip Time In The City Of Chicago, Frank Bitter

Theses and Dissertations

This thesis addresses the problem of prediction of taxi trip duration for any given

day, time, pickup point and dropo point. Data on taxi trips from the Chicago Data

Portal is used. The main idea of the model is to cluster similar trips together and use

the mean duration of all those clustered taxi trips to predict the duration of a new taxi

trip in that cluster. Furthermore, for a possible additional reduction of prediction error,

estimators from dierent days which are not signicantly dierent from each other are

pooled together. It is shown that this procedure improves prediction error.