Dissertationen zum Thema „Applied Mathematics|Mathematics|Theoretical Mathematics“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Applied Mathematics|Mathematics|Theoretical Mathematics.

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-32 Dissertationen für die Forschung zum Thema "Applied Mathematics|Mathematics|Theoretical Mathematics" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Sehgal, Nidhi. „Cycle Systems“. Auburn University, 2013.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Gonda, Jessica Lynn. „Subgroups of Finite Wreath Product Groups for p=3“. University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1460027790.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Zhang, Mengsen. „The Coordination Dynamics of Multiple Agents“. Thesis, Florida Atlantic University, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10979968.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:

A fundamental question in Complexity Science is how numerous dynamic processes coordinate with each other on multiple levels of description to form a complex whole—a multiscale coordinative structure (e.g. a community of interacting people, organs, cells, molecules etc.). This dissertation includes a series of empirical, theoretical and methodological studies of rhythmic coordination between multiple agents to uncover dynamic principles underlying multiscale coordinative structures. First, a new experimental paradigm was developed for studying coordination at multiple levels of description in intermediate-sized (N = 8) ensembles of humans. Based on this paradigm, coordination dynamics in 15 ensembles was examined experimentally, where the diversity of subjects’ movement frequency was manipulated to induce different grouping behavior. Phase coordination between subjects was found to be metastable with inphase and antiphase tendencies. Higher frequency diversity led to segregation between frequency groups, reduced intragroup coordination, and dispersion of dyadic phase relations (i.e. relations at different levels of description). Subsequently, a model was developed, successfully capturing these observations. The model reconciles the Kuramoto and the extended Haken-Kelso-Bunz model (for large- and small-scale coordination respectively) by adding the second-order coupling from the latter to the former. The second order coupling is indispensable in capturing experimental observations and connects behavioral complexity (i.e. multistability) of coordinative structures across scales. Both the experimental and theoretical studies revealed multiagent metastable coordination as a powerful mechanism for generating complex spatiotemporal patterns. Coexistence of multiple phase relations gives rise to many topologically distinct metastable patterns with different degrees of complexity. Finally, a new data-analytic tool was developed to quantify complex metastable patterns based on their topological features. The recurrence of topological features revealed important structures and transitions in high-dimensional dynamic patterns that eluded its non-topological counterparts. Taken together, the work has paved the way for a deeper understanding of multiscale coordinative structures.

4

Wilms, Josefine Maryna. „Modelling of the motion of a mixture of particles and a Newtonian fluid“. Thesis, Stellenbosch : Stellenbosch University, 2011. http://hdl.handle.net/10019.1/20042.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Luo, Xianghui 1983. „Symmetries of Cauchy Horizons and Global Stability of Cosmological Models“. Thesis, University of Oregon, 2011. http://hdl.handle.net/1794/11543.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
ix, 111 p.
This dissertation contains the results obtained from a study of two subjects in mathematical general relativity. The first part of this dissertation is about the existence of Killing symmetries in spacetimes containing a compact Cauchy horizon. We prove the existence of a nontrivial Killing symmetry in a large class of analytic cosmological spacetimes with a compact Cauchy horizon for any spacetime dimension. In doing so, we also remove the restrictive analyticity condition and obtain a generalization to the smooth case. The second part of the dissertation presents our results on the global stability problem for a class of cosmological models. We investigate the power law inflating cosmological models in the presence of electromagnetic fields. A stability result for such cosmological spacetimes is proved. This dissertation includes unpublished co-authored material.
Committee in charge: James Brau, Chair; James Isenberg, Advisor; Paul Csonka, Member; John Toner, Member; Peng Lu, Outside Member
6

Gyamfi, Michael. „Modelling The Financial Market Using Copula“. University of Akron / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=akron149601408369316.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Fry, Brendan. „Theoretical Models for Blood Flow Regulation in Heterogeneous Microvascular Networks“. Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/293413.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Proper distribution of blood flow in the microcirculation is necessary to match changing oxygen demands in various tissues. How this coordination of perfusion and consumption occurs in heterogeneous microvascular networks remains incompletely understood. Theoretical models are powerful tools that can help bridge this knowledge gap by simulating a range of conditions difficult to obtain experimentally. Here, an algorithm is first developed to estimate blood flow rates in large microvascular networks. Then, a theoretical model is presented for metabolic blood flow regulation in a realistic heterogeneous network structure, derived from experimental results from hamster cremaster muscle in control and dilated states. The model is based on modulation of arteriolar diameters according to the length-tension characteristics of vascular smooth muscle. Responses of smooth muscle cell tone to myogenic, shear-dependent, and metabolic stimuli are included. Blood flow is simulated including unequal hematocrit partition at diverging vessel bifurcations. Convective and diffusive oxygen transport in the network is simulated, and oxygen-dependent metabolic signals are assumed to be conducted upstream from distal vessels to arterioles. Simulations are carried out over a range of tissue oxygen demand. With increasing demand, arterioles dilate, blood flow increases, and the numbers of flowing arterioles and capillaries, as defined by red-blood-cell flux above a small threshold value, increase. Unequal hematocrit partition at diverging bifurcations contributes to capillary recruitment and enhances tissue oxygenation. The results imply that microvessel recruitment can occur as a consequence of local control of arteriolar tone. The effectiveness of red-blood-cell-dependent and independent mechanisms for the metabolic response of local blood flow regulation is examined over a range of tissue oxygen demands. Model results suggest that although a red-blood-cell-independent mechanism is most effective in increasing flow and preventing hypoxia, the addition of a red-blood-cell-dependent mechanism leads to a higher median tissue oxygen level, indicating distinct roles for the two mechanisms. In summary, flow rates in large microvessel networks can be estimated with the proposed algorithm, and the theoretical model for flow regulation predicts a mechanism for capillary recruitment, as well as roles for red-blood-cell-dependent and independent mechanisms in the metabolic regulation of blood flow in heterogeneous microvascular networks.
8

Aiello, Gordon J. „An application of the theory of moments to Euclidean relativistic quantum mechanical scattering“. Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/5902.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
One recipe for mathematically formulating a relativistic quantum mechanical scattering theory utilizes a two-Hilbert space approach, denoted by $\mathcal{H}$ and $\mathcal{H}_{0}$, upon each of which a unitary representation of the Poincaré Lie group is given. Physically speaking, $\mathcal{H}$ models a complicated interacting system of particles one wishes to understand, and $\mathcal{H}_{0}$ an associated simpler (i.e., free/noninteracting) structure one uses to construct 'asymptotic boundary conditions" on so-called scattering states in $\mathcal{H}$. Simply put, $\mathcal{H}_{0}$ is an attempted idealization of $\mathcal{H}$ one hopes to realize in the large time limits $t\rightarrow\pm\infty$. The above considerations lead to the study of the existence of strong limits of operators of the form $e^{iHt}Je^{-iH_{0}t}$, where $H$ and $H_{0}$ are self-adjoint generators of the time translation subgroup of the unitary representations of the Poincaré group on $\mathcal{H}$ and $\mathcal{H}_{0}$, and $J$ is a contrived mapping from $\mathcal{H}_{0}$ into $\mathcal{H}$ that provides the internal structure of the scattering asymptotes. The existence of said limits in the context of Euclidean quantum theories (satisfying precepts known as the Osterwalder-Schrader axioms) depends on the choice of $J$ and leads to a marvelous connection between this formalism and a beautiful area of classical mathematical analysis known as the Stieltjes moment problem, which concerns the relationship between numerical sequences $\{\mu_{n}\}_{n=0}^{\infty}$ and the existence/uniqueness of measures $\alpha(x)$ on the half-line satisfying \begin{equation*} \mu_{n}=\int_{0}^{\infty}x^{n}d\alpha(x). \end{equation*}
9

Hesselbrock, Andrew J. „A PERTURBED MOON: SOLVING NEREID'S MOTION TO MATCH OBSERVED BRIGHTNESS VARIATIONS“. Miami University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=miami1344100992.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Pakala, Akshay Kumar. „Aerodynamic Analysis of Conventional and Spherical Tires“. University of Akron / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=akron1606237030779529.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Williamson, Alexander James. „Methods, rules and limits of successful self-assembly“. Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:9eb549f9-3372-4a38-9370-a9b0e58ca26b.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
The self-assembly of structured particles into monodisperse clusters is a challenge on the nano-, micro- and even macro-scale. While biological systems are able to self-assemble with comparative ease, many aspects of this self-assembly are not fully understood. In this thesis, we look at the strategies and rules that can be applied to encourage the formation of monodisperse clusters. Though much of the inspiration is biological in nature, the simulations use a simple minimal patchy particle model and are thus applicable to a wide range of systems. The topics that this thesis addresses include: Encapsulation: We show how clusters can be used to encapsulate objects and demonstrate that such `templates' can be used to control the assembly mechanisms and enhance the formation of more complex objects. Hierarchical self-assembly: We investigate the use of hierarchical mechanisms in enhancing the formation of clusters. We find that, while we are able to extend the ranges where we see successful assembly by using a hierarchical assembly pathway, it does not straightforwardly provide a route to enhance the complexity of structures that can be formed. Pore formation: We use our simple model to investigate a particular biological example, namely the self-assembly and formation of heptameric alpha-haemolysin pores, and show that pore insertion is key to rationalising experimental results on this system. Phase re-entrance: We look at the computation of equilibrium phase diagrams for self-assembling systems, particularly focusing on the possible presence of an unusual liquid-vapour phase re-entrance that has been suggested by dynamical simulations, using a variety of techniques.
12

Diatezua, Jacquie Kiangebeni. „Some theoretical aspects of fibre suspension flows“. Master's thesis, University of Cape Town, 1999. http://hdl.handle.net/11427/9707.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Bibliography: leaves 77-82.
This thesis is concerned with properties of equations governing fibre suspensions. Of particular interest is the extent to which solutions, and their properties, depend on the type of closure used. For this purpose two closure rules are investigated: the linear and the quadratic closures. We show that the equations are consistent with the second law of thermodynamics, or dissipation inequality, when the quadratic closure is used. When the linear closure is used, a sufficient condition for consistency is that the particle number Np satisfies Np ≤ 35/2. Likewise, flows are found to be monotonically stable for the quadratic closure, and for the linear closure with Np ≤ 35/2. The second part of the thesis is concerned with one-dimensional problems, and their solution by finite element. The hyperbolic nature of the evolution equation for the orientation tensor necessitates a modification of the standard Galerkin-based approach. We investigate the conditions under which convergence is obtained, for unidirectional flows, with the use of the Streamline Upwind (SU) method, and the Streamline upwind Petrov/Galerkin (SUPG) method.
13

Eve, Robin Andrew. „Theoretical and numerical aspects of problems in finite-strain plasticity“. Doctoral thesis, University of Cape Town, 1992. http://hdl.handle.net/11427/17335.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Bibliography: pages 151-162.
A new internal variable theory of plasticity is presented. This theory is developed within a framework of non-smooth convex analysis; a unification of ideas concerning the postulates of plasticity is achieved by using the powerful tools provided by results in this branch of mathematics. A firm mathematical foundation for the study of qualitative aspects of problems involving plastic deformations is provided. Among the features of the theory is the establishment of a clear relationship between conventional formulations, which make use of yield functions, and those formulated in terms of a dissipation function. The role of the principle of maximum plastic work is also made precise. Attention is focussed on application of the theory to finite-strain plasticity. Quasi-static initial-boundary-value problems involving large plastic deformations are considered. An incremental form of such problems arises from a discretisation in time. A variational form of the incremental boundary-value problem is derived using the new theory. This incremental formulation is based on a generalised midpoint rule, evolution equations for plastic variables are defined in terms of a dissipation function, and an assumption of isochoric plastic deformation is imposed explicitly. A spatially discrete form of the incremental problem is obtained by application of the finite element method. An algorithm for solving this discrete problem, based on the Newton-Raphson procedure and having the typical predictor-corrector structure used in computational plasticity, is proposed and investigated. This algorithm is implemented in NOSTRUM, the in-house finite element code of The FRD/UCT Centre for Research in Computational and Applied Mechanics, at the University of Cape Town. A number of standard example problems are analysed using this code and results are compared with those obtained by others. It is shown that a corrector algorithm based on use of a dissipation function is a viable alternative to the conventional return mapping algorithms. While this alternative approach is not necessarily better than the conventional one for simple models of plasticity, it may prove valuable when considering more complex models for materials which exhibit dissipative behaviour. The manner in which an assumption of isochoric plastic deformation is incorporated into the incremental form of the problem is shown to play an important role.
14

Agiza, Hamdy N. „A numerical and theoretical study of solutions to a damped nonlinear wave equation“. Thesis, Heriot-Watt University, 1987. http://hdl.handle.net/10399/1058.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

Blank, Patrick Neil. „A Mathematical Model of Tau Protein Hyperphosphorylation: The Effects of Kinase Inhibitors as a Theoretical Alzheimer's Disease Therapy“. W&M ScholarWorks, 2015. https://scholarworks.wm.edu/etd/1539626963.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Alberts, Alexander M. „Theoretical Study of Fano Resonance in a Cubic Nonlinear Mechanical System“. University of Akron / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=akron1564665858758713.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Green, Hannah E. „Differentiating Between a Protein and its Decoy Using Nested Graph Models and Weighted Graph Theoretical Invariants“. Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3248.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
To determine the function of a protein, we must know its 3-dimensional structure, which can be difficult to ascertain. Currently, predictive models are used to determine the structure of a protein from its sequence, but these models do not always predict the correct structure. To this end we use a nested graph model along with weighted invariants to minimize the errors and improve the accuracy of a predictive model to determine if we have the correct structure for a protein.
18

Gray, Scott Thomas. „A Distributed Parameter Liver Model of Benzene Transport and Metabolism in Humans and Mice - Developmental, Theoretical, and Numerical Considerations“. NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20011108-195058.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:

GRAY, SCOTT THOMAS. A Distributed ParameterLiver Model of Benzene Transport and Metabolism in Humans and Mice -Developmental, Theoretical, and Numerical Considerations. (Under thedirection of Hien T. Tran.)

In the Clean Air Act of 1970, the U. S. Congress names benzene ahazardous air pollutant and directs certain government agencies toregulate public exposure. Court battles over subsequent regulations haveled to the need for quantitative risk assessment techniques. Models forhuman exposure to various chemicals exist, but most current modelsassume the liver is well-mixed. This assumption does not recognize (mostsignificantly) the spatial distribution of enzymes involved in benzenemetabolism.

The development of a distributed parameter liver model that accountsfor benzene transport and metabolism is presented. The mathematicalmodel consists of a parabolic system of nonlinear partial differentialequations and enables the modeling of convection, diffusion, andreaction within the liver. Unlike the commonly used well-mixed model,this distributed parameter model has the capacity to accommodate spatialvariations in enzyme distribution.

The system of partial differential equations is formulated in a weak orvariational setting that provides natural means for the mathematical andnumerical analysis. In particular, general well-posedness results ofBanks and Musante for a class of abstract nonlinear parabolic systemsare applied to establish well-posedness for the benzene distributedliver model. Banks and Musante also presented theoretical results for ageneral least squares parameter estimation problem. They included aconvergence result for the Galerkin approximation scheme used in ournumerical simulations as a special case.

Preliminary investigations on the qualitative behavior of thedistributed liver model have included simulations with orthograde andretrograde bloodflow through mouse liver tissue. Simulation of humanexposure with the partial differential equation and the existingordinary differential equation model are presented and compared.Finally, the dependence of the solution on model parameters is explored.

19

Burton, III Jackson Kemper, und III Jackson Kemper Burton. „Theoretical Models for Drug Delivery to Solid Tumors“. Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/621828.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
A cancer drug's effectiveness is contingent upon on its ability to reach all parts of the tumor. The distribution of drug in the tumor depends on several transport processes and depends on the physicochemical properties of the drug. These factors can lead to highly heterogeneous distributions of drug in the tumor interstitial space, leaving parts of the tumor unreached, and make it difficult to predict cellular exposure and understand its dependence on key system parameters. Theoretical models are powerful tools that can provide insight by simulating conditions that cannot be achieved or observed experimentally. Here, a Green's function method is utilized to simulate three-dimensional time-dependent diffusion and uptake of drugs in solid tumors with realistic vascular geometry. Regimes dependent on the time scales for transport are used to determine whether spatial and temporal effects must be resolved to predict cellular exposure. Simulations are performed to show the relationship between the plasma pharmacokinetics and cellular exposure for these regimes. Steep gradients in concentration arise when time scales for diffusion and uptake are comparable, implying that models based on well mixed compartments are inaccurate. Effects of linear and nonlinear kinetics of drug uptake on cellular exposure are demonstrated. The drug doxorubicin is commonly used against solid tumors. Cellular exposure to doxorubicin is complicated in vivo by its transport and physicochemical properties. The Green's function method is used to describe the in vivo transport and kinetics of doxorubicin, using parameters derived from in vitro results. Simulations show agreement with observed in vivo distributions of doxorubicin in tumor tissue as well as in vitro kinetics, and provide a link between the two types of experimental observations. The method is applied to the class of cancer drugs called antibody-drug conjugates (ADCs) which consist of a humanized antibody conjugated to extremely toxic small molecular weight drugs. ADCs exhibit complex in vivo kinetics dependent on many design parameters. A phenomenon exhibited by ADCs is the bystander effect, i.e. non-targeted cell killing, which is difficult to analyze based on in vivo observations. Simulations results agree with the observed in vivo distribution of ADCs in tumor tissue and with experimentally observed bystander effects. In summary, the the models presented here provide a novel approach for simulating the complex transport and cellular uptake kinetics exhibited by several cancer drugs. The models give a mechanistic basis for predicting cellular exposure to drugs which can aid, explain, and direct experimental approaches for improving cancer treatment.
20

Wang, Chenyu. „Double-well potentials in Bose-Einstein condensates“. 2011. https://scholarworks.umass.edu/dissertations/AAI3465235.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
This dissertation concentrates on the existence, stability and dynamical properties of nonlinear waves in Bose-Einstein condensates (BECs) trapped in doublewell potentials (DWPs). The fundamental model of interest will be the nonlinear Schrödinger equation, the so-called Gross-Pitaevskii (GP) equation, contributed to the well-established mean-field description of BECs. In this context of the GP equation with DWP, a Galerkin-type few-mode approach provides us a powerful handle towards studying the stationary states and predicting the bifurcation diagram including the occurrence of spontaneous symmetry breaking (SSB). Such method and the corresponding phenomena are discussed based on a prototypical quasi-1D model in Chapter 2. The systematic analysis progresses by considering various modified models, starting with the ones involving different interatomic interactions, e.g., collisionally inhomogeneous interactions, long-range interactions, and competing of short- and long-range interactions. We observe how the basic SSB bifurcation structure persists or is appropriately modified in the presence of these interactions in Chapter 3. We also extend the study to multi-component systems, including nonlinearly coupled two-component settings and F = 1 spinor BECs (genuinely three-component settings) confined in DWPs, where besides the one-component stationary states, combined states involving two or three components appear as well, and novel SSB phenomena emerge within them. Finally the trapped stationary modes of a twodimensional (2D) GP equation with a symmetric four-well potential are explored, providing the picture of SSB in the fundamental 2D setting. These various systems are studied in Chapter 4 - 6. In all models, our analytical predictions based on the few-mode approximation are in excellent agreement with the numerical results of the full GP equations.
21

Steenbergen, John Joseph. „Towards a Spectral Theory for Simplicial Complexes“. Diss., 2013. http://hdl.handle.net/10161/8256.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:

In this dissertation we study combinatorial Hodge Laplacians on simplicial com-

plexes using tools generalized from spectral graph theory. Specifically, we consider

generalizations of graph Cheeger numbers and graph random walks. The results in

this dissertation can be thought of as the beginnings of a new spectral theory for

simplicial complexes and a new theory of high-dimensional expansion.

We first consider new high-dimensional isoperimetric constants. A new Cheeger-

type inequality is proved, under certain conditions, between an isoperimetric constant

and the smallest eigenvalue of the Laplacian in codimension 0. The proof is similar

to the proof of the Cheeger inequality for graphs. Furthermore, a negative result is

proved, using the new Cheeger-type inequality and special examples, showing that

certain Cheeger-type inequalities cannot hold in codimension 1.

Second, we consider new random walks with killing on the set of oriented sim-

plexes of a certain dimension. We show that there is a systematic way of relating

these walks to combinatorial Laplacians such that a certain notion of mixing time

is bounded by a spectral gap and such that distributions that are stationary in a

certain sense relate to the harmonics of the Laplacian. In addition, we consider the

possibility of using these new random walks for semi-supervised learning. An algo-

rithm is devised which generalizes a classic label-propagation algorithm on graphs to

simplicial complexes. This new algorithm applies to a new semi-supervised learning

problem, one in which the underlying structure to be learned is flow-like.


Dissertation
22

St, Thomas Brian Stephen. „Linear Subspace and Manifold Learning via Extrinsic Geometry“. Diss., 2015. http://hdl.handle.net/10161/10529.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:

In the last few decades, data analysis techniques have had to expand to handle large sets of data with complicated structure. This includes identifying low dimensional structure in high dimensional data, analyzing shape and image data, and learning from or classifying large corpora of text documents. Common Bayesian and Machine Learning techniques rely on using the unique geometry of these data types, however departing from Euclidean geometry can result in both theoretical and practical complications. Bayesian nonparametric approaches can be particularly challenging in these areas.

This dissertation proposes a novel approach to these challenges by working with convenient embeddings of the manifold valued parameters of interest, commonly making use of an extrinsic distance or measure on the manifold. Carefully selected extrinsic distances are shown to reduce the computational cost and to increase accuracy of inference. The embeddings are also used to yield straight forward derivations for nonparametric techniques. The methods developed are applied to subspace learning in dimension reduction problems, planar shapes, shape constrained regression, and text analysis.


Dissertation
23

„Intramyocellular Lipids and the Progression of Muscular Insulin Resistance“. Doctoral diss., 2017. http://hdl.handle.net/2286/R.I.46258.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
abstract: Diabetes is a disease characterized by reduced insulin action and secretion, leading to elevated blood glucose. In the 1990s, studies showed that intravenous injection of fatty acids led to a sharp negative response in insulin action that subsided hours after the injection. The molecule associated with diminished insulin signalling response was a byproduct of fatty acids, diacylglycerol. This dissertation is focused on the formulation of a model built around the known mechanisms of glucose and fatty acid storage and metabolism within myocytes, as well as downstream effects of diacylglycerol on insulin action. Data from euglycemic-hyperinsulinemic clamp with fatty acid infusion studies are used to validate the qualitative behavior of the model and estimate parameters. The model closely matches clinical data and suggests a new metric to determine quantitative measurements of insulin action downregulation. Analysis and numerical simulation of the long term, piecewise smooth system of ordinary differential equations demonstrates a discontinuous bifurcation implicating nutrient excess as a driver of muscular insulin resistance.
Dissertation/Thesis
Doctoral Dissertation Applied Mathematics for the Life and Social Sciences 2017
24

(6890684), Nicole E. Eikmeier. „Spectral Properties and Generation of Realistic Networks“. Thesis, 2019.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Picture the life of a modern person in the western world: They wake up in the morning and check their social networking sites; they drive to work on roads that connect cities to each other; they make phone calls, send emails and messages to colleagues, friends, and family around the world; they use electricity flowing through power-lines; they browse the Internet, searching for information. All of these typical daily activities rely on the structure of networks. A network, in this case, is a set of nodes (people, web pages, etc) connected by edges (physical connection, collaboration, etc). The term graph is sometimes used to represent a more abstract structure - but here we use the terms graph and network interchangeably. The field of network analysis concerns studying and understanding networks in order to solve problems in the world around us. Graph models are used in conjunction with the study of real-world networks. They are used to study how well an algorithm may do on a real-world network, and for testing properties that may further produce faster algorithms. The first piece of this dissertation is an experimental study which explores features of real data, specifically power-law distributions in degrees and spectra. In addition to a comparison between features of real data to existing results in the literature, this study resulted in a hypothesis on power-law structure in spectra of real-world networks being more reliable than that in the degrees. The theoretical contributions of this dissertation are focused primarily on generating realistic networks through existing and novel graph models. The two graph models presented are called HyperKron and the Triangle Generalized Preferential Attachment model. Both of the models incorporate higher-order structure - leading to more sophisticated properties not examined in traditional models. We use the second of our models to further validate the hypothesis on power-laws in the spectra. Due to the structure of our model, we show that the power-law in the spectra is more resilient to sub-sampling. This gives some explanation for why we see power-laws more frequently in the spectra in real world data.
25

„The Pauli-Lubanski Vector in a Group-Theoretical Approach to Relativistic Wave Equations“. Doctoral diss., 2016. http://hdl.handle.net/2286/R.I.40221.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
abstract: Chapter 1 introduces some key elements of important topics such as; quantum mechanics, representation theory of the Lorentz and Poincare groups, and a review of some basic rela- ´ tivistic wave equations that will play an important role in the work to follow. In Chapter 2, a complex covariant form of the classical Maxwell’s equations in a moving medium or at rest is introduced. In addition, a compact, Lorentz invariant, form of the energy-momentum tensor is derived. In chapter 3, the concept of photon helicity is critically analyzed and its connection with the Pauli-Lubanski vector from the viewpoint of the complex electromag- ´ netic field, E+ iH. To this end, a complex covariant form of Maxwell’s equations is used. Chapter 4 analyzes basic relativistic wave equations for the classical fields, such as Dirac’s equation, Weyl’s two-component equation for massless neutrinos and the Proca, Maxwell and Fierz-Pauli equations, from the viewpoint of the Pauli-Lubanski vector and the Casimir ´ operators of the Poincare group. A connection between the spin of a particle/field and ´ consistency of the corresponding overdetermined system is emphasized in the massless case. Chapter 5 focuses on the so-called generalized quantum harmonic oscillator, which is a Schrodinger equation with a time-varying quadratic Hamiltonian operator. The time ¨ evolution of exact wave functions of the generalized harmonic oscillators is determined in terms of the solutions of certain Ermakov and Riccati-type systems. In addition, it is shown that the classical Arnold transform is naturally connected with Ehrenfest’s theorem for generalized harmonic oscillators. In Chapter 6, as an example of the usefulness of the methods introduced in Chapter 5 a model for the quantization of an electromagnetic field in a variable media is analyzed. The concept of quantization of an electromagnetic field in factorizable media is discussed via the Caldirola-Kanai Hamiltonian. A single mode of radiation for this model is used to find time-dependent photon amplitudes in relation to Fock states. A multi-parameter family of the squeezed states, photon statistics, and the uncertainty relation, are explicitly given in terms of the Ermakov-type system.
Dissertation/Thesis
Doctoral Dissertation Applied Mathematics 2016
26

Chatwin-Davies, Aidan. „A Covariant Natural Ultraviolet Cutoff in Inflationary Cosmology“. Thesis, 2013. http://hdl.handle.net/10012/7759.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In the field of quantum gravity, it is widely expected that some form of a minimum length scale, or ultraviolet cutoff, exists in nature. Recently, a new natural ultraviolet cutoff that is fully covariant was proposed. In the literature, most studies of ultraviolet cutoffs are concerned with Lorentz-violating ultraviolet cutoffs. The difficulty in making a minimum length cutoff covariant is rooted in the fact that any given length scale can be further Lorentz contracted. It was shown that this problem is avoided by the proposed covariant cutoff by allowing field modes with arbitrarily small wavelengths to still exist, albeit with exceedingly small, covariantly-determined bandwidths. In other words, the degrees of freedom of sub-Planckian modes in time are highly suppressed. The effects of this covariant ultraviolet cutoff on the kinematics of a scalar quantum field are well understood. There is much to learn, however, about the effects on a field’s dynamics. These effects are of great interest, as their presence may have direct observational consequences in cosmology. As such, this covariant ultraviolet cutoff offers the tantalizing prospect of experimental access to physics at the Planck scale. In cosmology, the energy scales that are probed by measurements of cosmic microwave background (CMB) statistics are the closest that we can get to the Planck scale. In particular, the statistics of the CMB encodes information about the quantum fluctuations of the scalar inflaton field. A measure of the strength of a field’s quantum fluctuations is in turn given by the magnitude of the field’s Feynman propagator. To this end, in this thesis I study how this covariant ultraviolet cutoff modifies the Feynman propagator of a scalar quantum field. In this work, I first calculate the cutoff Feynman propagator for a scalar field in flat spacetime, and then I address the cutoff Feynman propagator of a scalar field in curved spacetime. My studies culminate with an explicit calculation for the case of a power-law Friedmann-Lemaître-Robertson-Walker (FLRW) spacetime. This last calculation is cosmologically significant, as power-law FLRW spacetime is a prototypical and realistic model for early-universe inflation. In preparation for studying the covariant cutoff on curved spacetime, I will review the necessary back- ground material as well as the kinematic influence of the covariant cutoff. I will also discuss several side results that I have obtained on scalar quantum field theories in spacetimes which possess a finite start time.
27

(9216107), Jordan D. F. Petty. „Modeling a Dynamic System Using Fractional Order Calculus“. Thesis, 2020.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:

Fractional calculus is the integration and differentiation to an arbitrary or fractional order. The techniques of fractional calculus are not commonly taught in engineering curricula since physical laws are expressed in integer order notation. Dr. Richard Magin (2006) notes how engineers occasionally encounter dynamic systems in which the integer order methods do not properly model the physical characteristics and lead to numerous mathematical operations. In the following study, the application of fractional order calculus to approximate the angular position of the disk oscillating in a Newtonian fluid was experimentally validated. The proposed experimental study was conducted to model the nonlinear response of an oscillating system using fractional order calculus. The integer and fractional order mathematical models solved the differential equation of motion specific to the experiment. The experimental results were compared to the integer order and the fractional order analytical solutions. The fractional order mathematical model in this study approximated the nonlinear response of the designed system by using the Bagley and Torvik fractional derivative. The analytical results of the experiment indicate that either the integer or fractional order methods can be used to approximate the angular position of the disk oscillating in the homogeneous solution. The following research was in collaboration with Dr. Richard Mark French, Dr. Garcia Bravo, and Rajarshi Choudhuri, and the experimental design was derived from the previous experiments conducted in 2018.

28

(8072036), Ahmed I. Al Herz. „APPROXIMATION ALGORITHMS FOR MAXIMUM VERTEX-WEIGHTED MATCHING“. Thesis, 2019.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, and the weight of a matching is the sum of the weights of the matched vertices. Vertex-weighted matchings arise in many applications, including internet advertising, facility scheduling, constraint satisfaction, the design of network switches, and computation of sparse bases for the null space or the column space of a matrix. Let m be the number of edges, n number of vertices, and D the maximum degree of a vertex in the graph. We design two exact algorithms for the MVM problem with time complexities of O(mn) and O(Dmn). The new exact algorithms use a maximum cardinality matching as an initial matching, after which the weight of the matching is increased using weight-increasing paths.

Although MVM problems can be solved exactly in polynomial time, exact MVM algorithms are still slow in practice for large graphs with millions and even billions of edges. Hence we investigate several approximation algorithms for MVM in this thesis. First we show that a maximum vertex-weighted matching can be approximated within an approximation ratio arbitrarily close to one, to k/(k + 1), where k is related to the length of augmenting or weight-increasing paths searched by the algorithm. We identify two main approaches for designing approximation algorithms for MVM. The first approach is direct; vertices are sorted in non-increasing order of weights, and then the algorithm searches for augmenting paths of restricted length that reach a heaviest vertex. (In this approach each vertex is processed once). The second approach repeatedly searches for augmenting paths and increasing paths, again of restricted length, until none can be found. In this second, iterative approach, a vertex may need to be processed multiple times. We design two approximation algorithms based on the direct approach with approximation ratios of 1/2 and 2/3. The time complexities of the 1/2-approximation algorithm is O(m + n log n), and that of the 2/3-approximation algorithm is O(mlogD). Employing the second approach, we design 1/2- and 2/3-approximation algorithms for MVM with time complexities of O(Dm) and O(D2m), respectively. We show that the iterative algorithm can be generalized to nd a k/(k+1)-approximate MVM with a time complexity of O(Dkm). In addition, we design parallel 1/2- and 2/3-approximation algorithms for a shared memory programming model, and introduce a new technique for locking augmenting paths to avoid deadlock and related problems.

MVM problems may be solved using algorithms for the maximum edge-weighted matching (MEM) by assigning to each edge a weight equal to the sum of the vertex weights on its endpoints. However, our results will show that this is one way to generate MEM problems that are difficult to solve. On such problems, exact MEM algorithms may require run times that are a factor of a thousand or more larger than the time of an exact MVM algorithm. Our results show the competitiveness of the new exact algorithms by demonstrating that they outperform MEM exact algorithms. Specifically, our fastest exact algorithm runs faster than the fastest MEM implementation by a factor of 37 and 18 on geometric mean, using two different sets of weights on our test problems. In some instances, the factor can be higher than 500. Moreover, extensive experimental results show that the MVM approximation algorithm outperforms an MEM approximation algorithm with the same approximation ratio, with respect to matching weight and run time. Indeed, our results show that the MVM approximation algorithm outperforms the corresponding MEM algorithm with respect to these metrics in both serial and parallel settings.
29

Daugherty, Sean Michael. „Independent sets and closed-shell independent sets of fullerenes“. Thesis, 2009. http://hdl.handle.net/1828/1783.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Fullerenes are all-carbon molecules with polyhedral structures where each atom is bonded with three other atoms and the faces of the polyhedron are pentagons and hexagons. Fullerene graphs model the fullerene structures and are cubic planar graphs having twelve pentagonal faces and the remaining faces are hexagonal. This work explores two models that seek to determine the maximum number of bulky addends that may bond to the surface of a fullerene. The first model assumes that any two bulky addends are too large to bond to adjacent carbon atoms. This is equivalent to finding a graph-theoretical maximum independent set: a vertex subset of maximum size such that no two vertices are adjacent. The problem of determining the maximum independent set order is NP-hard for general cubic planar graphs and the complexity for the fullerene subclass was previously unknown. By extending the work of Graver, a graph-theoretical foundation is laid then used to derive a linear-time algorithm for solving the maximum independent set problem for fullerenes. A discussion of the relationship between maximum independent sets and some specific families of fullerenes follows. The second model refines the first by adding an additional requirement that the resulting molecule is stable according to Hückel theory: the molecule exhibits a stable distribution of π electrons. The graph-theoretical description of this model is a maximum closed-shell independent set: a vertex subset of maximum size such that no two vertices are adjacent and exactly half of the eigenvalues of the adjacency matrix of the graph that results from the deletion of the vertex subset are positive. Computations for finding a maximum closed-shell independent set rely on determining whether fullerene subgraphs are closed-shell (satisfy the eigenvalue requirement) so a linear-time algorithm for finding the inertia (number of negative, zero, and positive eigenvalues) of unicyclic graphs is given. This algorithm is part of an exponential-time algorithm for finding a maximum closed-shell independent set of a fullerene molecule that is fast enough for practical use. An improved upper bound of 3n/8 + 3/2 for the closed-shell independence number is included.
30

„Theoretical Studies on a Two Strain Model of Drug Resistance: Understand, Predict and Control the Emergence of Drug Resistance“. Doctoral diss., 2011. http://hdl.handle.net/2286/R.I.8939.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
abstract: Infectious diseases are a leading cause of death worldwide. With the development of drugs, vaccines and antibiotics, it was believed that for the first time in human history diseases would no longer be a major cause of mortality. Newly emerging diseases, re-emerging diseases and the emergence of microorganisms resistant to existing treatment have forced us to re-evaluate our optimistic perspective. In this study, a simple mathematical framework for super-infection is considered in order to explore the transmission dynamics of drug-resistance. Through its theoretical analysis, we identify the conditions necessary for the coexistence between sensitive strains and drug-resistant strains. Farther, in order to investigate the effectiveness of control measures, the model is extended so as to include vaccination and treatment. The impact that these preventive and control measures may have on its disease dynamics is evaluated. Theoretical results being confirmed via numerical simulations. Our theoretical results on two-strain drug-resistance models are applied in the context of Malaria, antimalarial drugs, and the administration of a possible partially effective vaccine. The objective is to develop a monitoring epidemiological framework that help evaluate the impact of antimalarial drugs and partially-effective vaccine in reducing the disease burden at the population level. Optimal control theory is applied in the context of this framework in order to assess the impact of time dependent cost-effective treatment efforts. It is shown that cost-effective combinations of treatment efforts depend on the population size, cost of implementing treatment controls, and the parameters of the model. We use these results to identify optimal control strategies for several scenarios.
Dissertation/Thesis
Ph.D. Applied Mathematics for the Life and Social Sciences 2011
31

„Characterization of the Mathematical Theoretical Biology Institute as a Vygotskian-Holzman Zone of Proximal Development“. Doctoral diss., 2015. http://hdl.handle.net/2286/R.I.36379.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
abstract: The Mathematical and Theoretical Biology Institute (MTBI) is a summer research program for undergraduate students, largely from underrepresented minority groups. Founded in 1996, it serves as a 'life-long' mentorship program, providing continuous support for its students and alumni. This study investigates how MTBI supports student development in applied mathematical research. This includes identifying of motivational factors to pursue and develop capacity to complete higher education. The theoretical lens of developmental psychologists Lev Vygotsky (1978, 1987) and Lois Holzman (2010) that sees learning and development as a social process is used. From this view student development in MTBI is attributed to the collaborative and creative way students co-create the process of becoming scientists. This results in building a continuing network of academic and professional relationships among peers and mentors, in which around three quarters of MTBI PhD graduates come from underrepresented groups. The extent to which MTBI creates a Vygotskian learning environment is explored from the perspectives of participants who earned doctoral degrees. Previously hypothesized factors (Castillo-Garsow, Castillo-Chavez and Woodley, 2013) that affect participants’ educational and professional development are expanded on. Factors identified by participants are a passion for the mathematical sciences; desire to grow; enriching collaborative and peer-like interactions; and discovering career options. The self-recognition that they had the ability to be successful, key element of the Vygotskian-Holzman theoretical framework, was a commonly identified theme for their educational development and professional growth. Participants characterize the collaborative and creative aspects of MTBI. They reported that collaborative dynamics with peers were strengthened as they co-created a learning environment that facilitated and accelerated their understanding of the mathematics needed to address their research. The dynamics of collaboration allowed them to complete complex homework assignments, and helped them formulate and complete their projects. Participants identified the creative environments of their research projects as where creativity emerged in the dynamics of the program. These data-driven findings characterize for the first time a summer program in the mathematical sciences as a Vygotskian-Holzman environment, that is, a `place’ where participants are seen as capable applied mathematicians, where the dynamics of collaboration and creativity are fundamental components.
Dissertation/Thesis
Doctoral Dissertation Applied Mathematics for the Life and Social Sciences 2015
32

Williams, Aaron Michael. „Shift gray codes“. Thesis, 2009. http://hdl.handle.net/1828/1966.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj si. In other words, si is right-shifted into position j by applying the permutation (j j−1 .. i) to the indices of s. Right-shifts include prefix-shifts (i = 1) and adjacent-transpositions (j = i+1). A fixed-content language is a set of strings that contain the same multiset of symbols. Given a fixed-content language, a shift Gray code is a list of its strings where consecutive strings differ by a shift. This thesis asks if shift Gray codes exist for a variety of combinatorial objects. This abstract question leads to a number of practical answers. The first prefix-shift Gray code for multiset permutations is discovered, and it provides the first algorithm for generating multiset permutations in O(1)-time while using O(1) additional variables. Applications of these results include more efficient exhaustive solutions to stacker-crane problems, which are natural NP-complete traveling salesman variants. This thesis also produces the fastest algorithm for generating balanced parentheses in an array, and the first minimal-change order for fixed-content necklaces and Lyndon words. These results are consequences of the following theorem: Every bubble language has a right-shift Gray code. Bubble languages are fixed-content languages that are closed under certain adjacent-transpositions. These languages generalize classic combinatorial objects: k-ary trees, ordered trees with fixed branching sequences, unit interval graphs, restricted Schr oder and Motzkin paths, linear-extensions of B-posets, and their unions, intersections, and quotients. Each Gray code is circular and is obtained from a new variation of lexicographic order known as cool-lex order. Gray codes using only shift(s, 1, n) and shift(s, 1, n−1) are also found for multiset permutations. A universal cycle that omits the last (redundant) symbol from each permutation is obtained by recording the first symbol of each permutation in this Gray code. As a special case, these shorthand universal cycles provide a new fixed-density analogue to de Bruijn cycles, and the first universal cycle for the "middle levels" (binary strings of length 2k + 1 with sum k or k + 1).

Zur Bibliographie