Physical Sciences and Mathematics Commons^™

Mathematical Modeling Of Nonlinear Dynamics Of Blood Hormones On The Regulatory System, Gabriela Urbina

Theses and Dissertations

We study a mathematical modeling of nonlinear dynamics of blood hormones, which includes glucose and insulin. On Chapter I, II, III and IV, we introduce this work, analyze an effect of the secreted insulin by the pancreatic beta cells and glucagon hormones and state concluding remarks, respectively. This model considers the time evolution of nonlinear dynamics of the equations for glucose, glucagon and insulin concentrations plus insulin and glucagon actions and the secreted insulin as a result of elevation of glucose in the blood plasma. Using both analytical and numerical procedures, we determine such quantities using different parameters for different …

Optimal Control Of The Second Order Elliptic Equations With Biomedical Applications, Saleheh Seif

Theses and Dissertations

Dissertation analyzes optimal control of systems with distributed parameters described by the general boundary value problems in a bounded Lipschitz domain for the linear second order uniformly elliptic partial differential equations (PDE) with bounded measurable coefficients. Broad class of elliptic optimal control problems under Dirichlet or Neumann boundary conditions are considered, where the control parameter is the density of sources, and the cost functional is the L2-norm difference of the weak solution of the elliptic problem from measurement along the boundary or subdomain. The optimal control problems are fully discretized using the method of finite differences. Two types of discretization …

Discrete Moment Problems With Logconcave And Logconvex Distributions, Talal Alharbi

Theses and Dissertations

We introduce new shape constraints, logconcavity and logconvexity, to discrete moment problems for bounding the k-out-of-n type probabilities and expectations of higher order convex functions of discrete random variables with non-negative and finite support. The bounds are obtained as the optimum values of non-convex and convex nonlinear optimization problems, where the non-convex problem is reformulated as a bilinear optimization problem. We present numerical experiments to show the improvement in the tightness of the bounds when the shape of underlying unknown probability distribution is prescribed into discrete moment problems. We apply our optimization based bounding methodology in an insurance problem to …

Reliability Improvement On Feasibility Study For Selection Of Infrastructure Projects Using Data Mining And Machine Learning, Xi Hu

Theses and Dissertations

With the progressive development of infrastructure construction, conventional analytical methods such as correlation index, quantifying factors, and peer review are no longer satisfactory in support for decision-making of implementing an infrastructure project in the age of big data. This study proposes using a mathematical model named Fuzzy-Neural Comprehensive Evaluation Model (FNCEM) to improve the reliability of the feasibility study of infrastructure projects by using data mining and machine learning. Specifically, the data collection on time-series data, including traffic videos (278 Gigabytes) and historical weather data, uses transportation cameras and online searching, respectively. Meanwhile, the researcher sent out a questionnaire for …

Finite Axiomatisability In Nilpotent Varieties, Joshua Thomas Grice

Theses and Dissertations

Study of general algebraic systems has long been concerned with finite basis results that prove finite axiomatisability of certain classes of general algebras. In the 1970’s, Bjarni Jónsson speculated that a variety generated by a finite algebra might be finitely based provided the variety has a finite residual bound (that is, a finite bound on the cardinality of subdirectly irreducible algebras in the variety). As such, most finite basis results since then have had the hypothesis of a finite residual bound. However, Jónsson also speculated that it might be sufficient to replace the finite residual bound with the weaker hypothesis …

Diameter Of 3-Colorable Graphs And Some Remarks On The Midrange Crossing Constant, Inne Singgih

Theses and Dissertations

The first part of this dissertation discussing the problem of bounding the diameter of a graph in terms of its order and minimum degree. The initial problem was solved independently by several authors between 1965 − 1989. They proved that for fixed δ ≥ 2 and large n, diam(G) ≤ 3n+ O(1). In 1989, Erdős, Pach, Pollack, and Tuza conjectured that the upper bound on the diameter can be improved if G does not contain a large complete subgraph K_k.

Let r, δ ≥ 2 be fixed integers and let G be a connected graph with n vertices …

Counting Number Fields By Discriminant, Harsh Mehta

Theses and Dissertations

The central topic of this dissertation is counting number fields ordered by discriminant. We fix a base field k and let Nd(k,G;X) be the number of extensions N/k up to isomorphism with Nk/Q(dN/k) ≤ X, [N : k] = d and the Galois closure of N/k is equal to G.

We establish two main results in this work. In the first result we establish upper bounds for N_|G| (k,G;X) in the case that G is a finite group with an abelian normal subgroup. Further, we establish upper bounds for the case N _|F| (k,G;X) where G is a Frobenius …

Rationality Questions And The Derived Category, Alicia Lamarche

Theses and Dissertations

This document is roughly divided into four chapters. The first outlines basic preliminary material, definitions, and foundational theorems required throughout the text. The second chapter, which is joint work with Dr. Matthew Ballard, gives an example of a family of Fano arithmetic toric varieties in which the derived category is able to detect the existence of k-rational points. More succinctly, we show that if X is a generalized del Pezzo variety defined over a field k, then X contains a k-rational point (and is in fact k-rational, that is, birational to Pnk ) if and only if Db(X) admits a …

Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature Of Graphs, And Linear Algebra, Zhiyu Wang

Theses and Dissertations

This thesis studies some problems in extremal and probabilistic combinatorics, Ricci curvature of graphs, spectral hypergraph theory and the interplay between these areas. The first main focus of this thesis is to investigate several Ramsey-type problems on graphs, hypergraphs and sequences using probabilistic, combinatorial, algorithmic and spectral techniques:

• The size-Ramsey number Rˆ(G, r) is defined as the minimum number of edges in a hypergraph H such that every r-edge-coloring of H contains a monochromatic copy of G in H. We improved a result of Dudek, La Fleur, Mubayi and Rödl [ J. Graph Theory 2017 ] on the size-Ramsey number …

An Ensemble-Based Projection Method And Its Numerical Investigation, Shuai Yuan

Theses and Dissertations

In many cases, partial differential equation (PDE) models involve a set of parameters whose values may vary over a wide range in application problems, such as optimization, control and uncertainty quantification. Performing multiple numerical simulations in large-scale settings often leads to tremendous demands on computational resources. Thus, the ensemble method has been developed for accelerating a sequence of numerical simulations. In this work we first consider numerical solutions of Navier-Stokes equations under different conditions and introduce the ensemblebased projection method to reduce the computational cost. In particular, we incorporate a sparse grad-div stabilization into the method as a nonzero penalty …

Windows And Generalized Drinfeld Kernels, Robert R. Vandermolen

Theses and Dissertations

We develop a generalization of a construction of Drinfeld, first inspired by the Qconstruction of Ballard, Diemer, and Favero. We use this construction to provide kernels for Grassmann flops over an arbitrary field of characteristic zero. In the case of Grassmann flops this generalization recovers the kernel for a Fourier-Mukai functor on the derived category of the associated global quotient stack studied by Buchweitz, Leuschke, and Van den Bergh. We show an idempotent property for this kernel, which after restriction, induces a derived equivalence over any twisted form of a Grassmann flop.

Distance Related Graph Invariants In Triangulations And Quadrangulations Of The Sphere, Trevor Vincent Olsen

Theses and Dissertations

The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. I provide asymptotic upper bounds and sharp lower bounds for the Wiener index of simple triangulations and quadrangulations with given connectivity. Additionally, I make conjectures for the extremal triangulations and quadrangulations which maximize the Wiener index based on computational evidence. If σ(v) denotes the arithmetic mean of the distances from v to all other vertices of G, then the remoteness and proximity of G are defined as the largest and smallest value of σ(v) over all vertices v of G, respectively. …

Two Inquiries Related To The Digits Of Prime Numbers, Jeremiah T. Southwick

Theses and Dissertations

This dissertation considers two different topics. In the first part of the dissertation, we show that a positive proportion of the primes have the property that if any one of their digits in base 10, including their infinitely many leading 0 digits, is replaced by a different digit, then the resulting number is composite. We show that the same result holds for bases b 2 {2, 3, · · · , 8, 9, 11, 31}.

In the second part of the dissertation, we show for an integer b ≥ 5 that if a polynomial ƒ( x) with non-negative coefficients …

Congruences For Coefficients Of Modular Functions In Levels 3, 5, And 7 With Poles At 0, Ryan Austin Keck

Theses and Dissertations

We give congruences modulo powers of p in {3, 5, 7} for the Fourier coefficients of certain modular functions in level p with poles only at 0, answering a question posed by Andersen and Jenkins and continuing work done by the Jenkins, the author, and Moss. The congruences involve a modulus that depends on the base p expansion of the modular form's order of vanishing at infinity.

Symmetry Algebras Of The Canonical Lie Group Geodesic Equations In Dimension Five, Hassan Almusawa

Theses and Dissertations

Nowadays, there is much interest in constructing exact analytical solutions of differential equations using Lie symmetry methods. Lie devised the method in the 1880s. These methods were substantially developed utilizing modern mathematical language in the 1960s and 1970s by several different groups of authors such as L.V. Ovsiannikov, G. Bluman, and P. J. Olver, and have since been implemented as a software package for symbolic computation on commonly used platforms such as Mathematica and MAPLE.

In this work, we first develop an algorithmic scheme using the MAPLE platform to perform a Lie symmetry algebra identification and validate it on nonlinear …

Invariance And Invertibility In Deep Neural Networks, Han Zhang

Theses and Dissertations

Machine learning is concerned with computer systems that learn from data instead of being explicitly programmed to solve a particular task. One of the main approaches behind recent advances in machine learning involves neural networks with a large number of layers, often referred to as deep learning. In this dissertation, we study how to equip deep neural networks with two useful properties: invariance and invertibility. The first part of our work is focused on constructing neural networks that are invariant to certain transformations in the input, that is, some outputs of the network stay the same even if the input …