Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- AG codes (1)
- ARMA (1)
- Analytic Target Cascading (1)
- Barban-Davenport-Halberstam Theorem (1)
- Breakpoint (1)
-
- CUSUM (1)
- Cartesian Products (1)
- Change-Points (1)
- Changepoint (1)
- Co-TT graph (1)
- Combinatorics (1)
- Commutative algebra (1)
- Complete Double Vertex Graphs (1)
- Complex Systems (1)
- Conflict-tolerance (1)
- Discrete dynamics (1)
- Discrete representations (1)
- Distribution of primes (1)
- Dominator Partitions (1)
- Double Vertex Graphs (1)
- Drug resistance (1)
- Efficient set (1)
- Elliptic curve (1)
- Factoring polynomials (1)
- Finite fields (1)
- General Linear Model (1)
- Graph Products (1)
- Graph Theory (1)
- Groebner bases (1)
- HIV (1)
Articles 1 - 13 of 13
Full-Text Articles in Physical Sciences and Mathematics
Some New Problems In Changepoint Analysis, Jonathan Woody
Some New Problems In Changepoint Analysis, Jonathan Woody
All Dissertations
Climatological studies have often neglected changepoint effects when modeling
various physical phenomena. Here, changepoints are plausible whenever a station location moves or its instruments are changed. There is frequently meta-data to
perform sound statistical inferences that account for changepoint
information. This dissertation focuses on two such problems in changepoint analysis.
The first problem we investigate involves assessing trends
in daily snow depth series. Here, we introduce a stochastic storage model. The model allows for seasonal features, which permits the
analysis of daily data. Changepoint times are shown to greatly influence estimated trends in one snow depth series and are accounted …
Decoding Of Multipoint Algebraic Geometry Codes Via Lists, Nathan Drake
Decoding Of Multipoint Algebraic Geometry Codes Via Lists, Nathan Drake
All Dissertations
Algebraic geometry codes have been studied greatly since their introduction by Goppa . Early study had focused on algebraic geometry codes CL(D;G) where G was taken to be a multiple of a single point. However, it has been shown that if we allow G to be supported by more points, then the associated code may have better parameters. We call such a code a multipoint code and if G is supported by m points, then we call it an m-point code. In this dissertation, we wish to develop a decoding algorithm for multipoint codes. We show how we can embed …
Variations On Graph Products And Vertex Partitions, Jobby Jacob
Variations On Graph Products And Vertex Partitions, Jobby Jacob
All Dissertations
In this thesis we investigate two graph products called double vertex graphs and complete double vertex graphs, and two vertex partitions called dominator partitions and rankings.
We introduce a new graph product called the complete double vertex graph and study its properties. The complete double vertex graph is a natural extension of the Cartesian product and a generalization of the double vertex graph.
We establish many properties of complete double vertex graphs, including results involving the chromatic number of a complete double vertex graph and the characterization of planar complete double vertex graphs. We also investigate the important problem of …
Multiobjective Optimization For Complex Systems, Melissa Gardenghi
Multiobjective Optimization For Complex Systems, Melissa Gardenghi
All Dissertations
Complex systems are becoming more and more apparent in a variety of disciplines, making solution methods for these systems valuable tools. The solution of complex systems requires two significant skills. The first challenge of developing mathematical models for these systems is followed by the difficulty of solving these models to produce preferred solutions for the overall systems. Both issues are addressed by this research.
This study of complex systems focuses on two distinct aspects. First, models of complex systems with multiobjective formulations and a variety of structures are proposed. Using multiobjective optimization theory, relationships between the efficient solutions of the …
Factoring Polynomials And Groebner Bases, Genhua (Yinhua) Guan
Factoring Polynomials And Groebner Bases, Genhua (Yinhua) Guan
All Dissertations
Factoring polynomials is a central problem in computational algebra and number theory and is a basic routine in most
computer algebra systems (e.g. Maple, Mathematica, Magma, etc). It has been extensively studied
in the last few decades by many mathematicians and computer scientists. The main approaches include Berlekamp's method
(1967) based on the kernel of Frobenius map, Niederreiter's method (1993) via an ordinary differential equation,
Zassenhaus's modular approach (1969), Lenstra, Lenstra and Lovasz's lattice reduction (1982), and Gao's method via a partial differential equation (2003). These methods and their recent improvements due to van Hoeij (2002) and
Lecerf et al …
Asymptotics Of Families Of Polynomials And Sums Of Hurwitz Class Numbers, Timothy Flowers
Asymptotics Of Families Of Polynomials And Sums Of Hurwitz Class Numbers, Timothy Flowers
All Dissertations
In a note in the American Mathematical Monthly in 1960, Strodt mentions a way to prove both the Euler-Maclaurin summation formula and the Boole summation formula using operators. In a 2009 article in the Monthly, Borwein, Calkin, and Manna expand on this idea. Therein, they define Strodt operators and Strodt polynomials and show that the classical Bernoulli polynomials and Euler polynomials are examples of Strodt polynomials.
It is well known that both Bernoulli polynomials and Euler polynomials on a fixed interval are asymptotically sinusoidal. Borwein, Calkin, and Manna show that a similar result holds for the uniform Strodt polynomials. We …
Discrete Dynamics Over Finite Fields, Jang-Woo Park
Discrete Dynamics Over Finite Fields, Jang-Woo Park
All Dissertations
A dynamical system consists of a set V and a map f : V → V . The primary goal is to characterize points in V according to their limiting behaviors under iteration of the map f . Especially understanding dynamics of nonlinear maps is an important but difficult problem, and there are not many methods available. This work concentrates on dynamics of certain nonlinear maps over finite fields. First we study monomial dynamics over finite fields. We show that determining the number of fixed points of a boolean monomial dynamics is #P–complete problem and consider various cases in which …
Quality Representation In Multiobjective Programming, Stacey Faulkenberg
Quality Representation In Multiobjective Programming, Stacey Faulkenberg
All Dissertations
In recent years, emphasis has been placed on generating quality representations of the nondominated set of multiobjective programming problems. This manuscript presents two methods for generating discrete representations with equidistant points for multiobjective programs with solution sets determined by convex cones. The Bilevel Controlled Spacing (BCS) method has a bilevel structure with the lower-level generating the nondominated points and the upper-level controlling the spacing. The Constraint Controlled Spacing (CCS) method is based on the epsilon-constraint method with an additional constraint to control the spacing of generated points. Both methods (under certain assumptions) are proven to produce (weakly) nondominated points. Along …
Change-Point Analysis: Asymptotic Theory And Applications, Michael Robbins
Change-Point Analysis: Asymptotic Theory And Applications, Michael Robbins
All Dissertations
The problem of undocumented change-points in data sets appears in many areas of science. Mathematical fundamentals of asymptotic methods used in change-point analysis are discussed, and several important maximally selected change-point statistics are introduced. First, the likelihood ratio method is applied to abstract data models within the setting of precipitation series. Basic inference as to the legitimacy and effectiveness of asymptotic methods at detecting undocumented change-points is provided. Next, maximally selected chi-square statistics are discussed in detail and applied to data on tropical cyclone behavior, where a widely available and widely analyzed data set on Atlantic basin cyclones is studied. …
On Elliptic Curves, Modular Forms, And The Distribution Of Primes, Ethan Smith
On Elliptic Curves, Modular Forms, And The Distribution Of Primes, Ethan Smith
All Dissertations
In this thesis, we present four problems related to elliptic curves, modular forms, the distribution of primes, or some combination of the three. The first chapter surveys the relevant background material necessary for understanding the remainder of the thesis. The four following chapters present our problems of interest and their solutions. In the final chapter, we present our conclusions as well as a few possible directions for future research.
Hurwitz class numbers are known to have connections to many areas of number theory. In particular, they are intimately connected to the theory of binary quadratic forms, the structure of imaginary …
New Directions In Multivariate Public Key Cryptography, Raymond Heindl
New Directions In Multivariate Public Key Cryptography, Raymond Heindl
All Dissertations
Most public key cryptosystems used in practice are based on integer factorization or discrete logarithms (in finite fields or elliptic curves). However, these systems suffer from two potential drawbacks. First, they must use large keys to maintain security, resulting in decreased efficiency. Second, if large enough quantum computers can be built, Shor's algorithm will render them completely insecure.
Multivariate public key cryptosystems (MPKC) are one possible alternative. MPKC makes use of the fact that solving multivariate polynomial systems over a finite field is an NP-complete problem, for which it is not known whether there is a polynomial algorithm on quantum …
Intersections And Representations Of Graphs, John Light
Intersections And Representations Of Graphs, John Light
All Dissertations
Given two graphs G and H sharing the same vertex set, the edge-intersection spectrum of G and H is the set of possible
sizes of the intersection of the edge sets of both graphs. For example,
the spectrum of two copies of the cycle C5 is {0, 2, 3, 5}, and the spectrum of two copies of the star K1,r is {1, r}. The intersection spectrum was initially studied for designs by Lindner and Fu and others and was originally extended to graphs by Eric Mendelsohn. Several examples are studied, both when G and H are isomorphic and …
Modeling Hiv Drug Resistance, Mingfu Zhu
Modeling Hiv Drug Resistance, Mingfu Zhu
All Dissertations
Despite the development of antiviral drugs and the optimization of therapies, the emergence of drug resistance remains one of the most challenging issues for successful treatments of HIV-infected patients. The availability of massive HIV drug resistance data provides us not only exciting opportunities for HIV research, but also the curse of high dimensionality.
We provide several statistical learning methods in this thesis to analyze sequence data from different perspectives. We propose a hierarchical random graph approach to identify possible covariation among residue-specific mutations. Viral progression pathways were inferred using an EM-like algorithm in literature, and we present a normalization method …