Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- ADNI database (1)
- Alzheimer’s disease (1)
- Bayesian inference (1)
- Brain data (1)
- Brain graph (1)
-
- Combinatorics (1)
- Coupled neuronalglial models (1)
- Critical buckling loads (1)
- Cryptology (1)
- Data-driven models (1)
- Deep brain stimulation (1)
- Differential (1)
- Differential equations (1)
- Discrete Mathematics (1)
- Eigenvalues (1)
- Euler beam-column (1)
- Generalized ellipses (1)
- Geometry (1)
- Gowdy (1)
- Graph Theory (1)
- Gravity (1)
- HCP database (1)
- Multiscale mathematical modelling (1)
- NeighborNet (1)
- Neurodegenerative disorders (1)
- Neuroscience (1)
- Nonlinear mechanics (1)
- Nonlinear waves (1)
- Numerical analysis (1)
- Parkinson’s disease (1)
Articles 1 - 7 of 7
Full-Text Articles in Special Functions
Multiscale Modelling Of Brain Networks And The Analysis Of Dynamic Processes In Neurodegenerative Disorders, Hina Shaheen
Multiscale Modelling Of Brain Networks And The Analysis Of Dynamic Processes In Neurodegenerative Disorders, Hina Shaheen
Theses and Dissertations (Comprehensive)
The complex nature of the human brain, with its intricate organic structure and multiscale spatio-temporal characteristics ranging from synapses to the entire brain, presents a major obstacle in brain modelling. Capturing this complexity poses a significant challenge for researchers. The complex interplay of coupled multiphysics and biochemical activities within this intricate system shapes the brain's capacity, functioning within a structure-function relationship that necessitates a specific mathematical framework. Advanced mathematical modelling approaches that incorporate the coupling of brain networks and the analysis of dynamic processes are essential for advancing therapeutic strategies aimed at treating neurodegenerative diseases (NDDs), which afflict millions of …
Phylogenetic Networks And Functions That Relate Them, Drew Scalzo
Phylogenetic Networks And Functions That Relate Them, Drew Scalzo
Williams Honors College, Honors Research Projects
Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate …
General Nonlinear-Material Elasticity In Classical One-Dimensional Solid Mechanics, Ronald Joseph Giardina Jr
General Nonlinear-Material Elasticity In Classical One-Dimensional Solid Mechanics, Ronald Joseph Giardina Jr
University of New Orleans Theses and Dissertations
We will create a class of generalized ellipses and explore their ability to define a distance on a space and generate continuous, periodic functions. Connections between these continuous, periodic functions and the generalizations of trigonometric functions known in the literature shall be established along with connections between these generalized ellipses and some spectrahedral projections onto the plane, more specifically the well-known multifocal ellipses. The superellipse, or Lam\'{e} curve, will be a special case of the generalized ellipse. Applications of these generalized ellipses shall be explored with regards to some one-dimensional systems of classical mechanics. We will adopt the Ramberg-Osgood relation …
Radial Basis Function Generated Finite Differences For The Nonlinear Schrodinger Equation, Justin Ng
Radial Basis Function Generated Finite Differences For The Nonlinear Schrodinger Equation, Justin Ng
Theses and Dissertations
Solutions to the one-dimensional and two-dimensional nonlinear Schrodinger (NLS) equation are obtained numerically using methods based on radial basis functions (RBFs). Periodic boundary conditions are enforced with a non-periodic initial condition over varying domain sizes. The spatial structure of the solutions is represented using RBFs while several explicit and implicit iterative methods for solving ordinary differential equations (ODEs) are used in temporal discretization for the approximate solutions to the NLS equation. Splitting schemes, integration factors and hyperviscosity are used to stabilize the time-stepping schemes and are compared with one another in terms of computational efficiency and accuracy. This thesis shows …
Elliptic Curve Cryptology, Francis Rocco
Elliptic Curve Cryptology, Francis Rocco
Honors Theses
In today's digital age of conducting large portions of daily life over the Internet, privacy in communication is challenged extremely frequently and confidential information has become a valuable commodity. Even with the use of commonly employed encryption practices, private information is often revealed to attackers. This issue motivates the discussion of cryptology, the study of confidential transmissions over insecure channels, which is divided into two branches of cryptography and cryptanalysis. In this paper, we will first develop a foundation to understand cryptography and send confidential transmissions among mutual parties. Next, we will provide an expository analysis of elliptic curves and …
Series Solutions Of Polarized Gowdy Universes, Doniray Brusaferro
Series Solutions Of Polarized Gowdy Universes, Doniray Brusaferro
Theses and Dissertations
Einstein's field equations are a system of ten partial differential equations. For a special class of spacetimes known as Gowdy spacetimes, the number of equations is reduced due to additional structure of two dimensional isometry groups with mutually orthogonal Killing vectors. In this thesis, we focus on a particular model of Gowdy spacetimes known as the polarized T3 model, and provide an explicit solution to Einstein's equations.
The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates
The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates
Undergraduate Theses and Capstone Projects
We study graph colorings of the form made popular by the four-color theorem. Proved by Appel and Haken in 1976, the Four-Color Theorem states that all planar graphs can be vertex-colored with at most four colors. We consider an alternate way to prove the Four-Color Theorem, introduced by Hadwiger in 1943 and commonly know as Hadwiger’s Conjecture. In addition, we examine the chromatic number of graphs which are not planar. More specifically, we explore adding edges to a planar graph to create a non-planar graph which has the same chromatic number as the planar graph which we started from.