Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 4 of 4
Full-Text Articles in Mathematics
Explicit Constructions Of Canonical And Absolute Minimal Degree Lifts Of Twisted Edwards Curves, William Coleman Bitting Iv
Explicit Constructions Of Canonical And Absolute Minimal Degree Lifts Of Twisted Edwards Curves, William Coleman Bitting Iv
Doctoral Dissertations
Twisted Edwards Curves are a representation of Elliptic Curves given by the solutions of bx^2 + y^2 = 1 + ax^2y^2. Due to their simple and unified formulas for adding distinct points and doubling, Twisted Edwards Curves have found extensive applications in fields such as cryptography. In this thesis, we study the Canonical Liftings of Twisted Edwards Curves and the associated lift of points Elliptic Teichmu ̈ller Lift. The coordinate functions of the latter are proved to be polynomials, and their degrees and derivatives are computed. Moreover, an algorithm is described for explicit computations, and some properties of the general …
Bayesian Topological Machine Learning, Christopher A. Oballe
Bayesian Topological Machine Learning, Christopher A. Oballe
Doctoral Dissertations
Topological data analysis encompasses a broad set of ideas and techniques that address 1) how to rigorously define and summarize the shape of data, and 2) use these constructs for inference. This dissertation addresses the second problem by developing new inferential tools for topological data analysis and applying them to solve real-world data problems. First, a Bayesian framework to approximate probability distributions of persistence diagrams is established. The key insight underpinning this framework is that persistence diagrams may be viewed as Poisson point processes with prior intensities. With this assumption in hand, one may compute posterior intensities by adopting techniques …
Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong
Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong
Doctoral Dissertations
Quadratic programming (QP) has received significant consideration due to an extensive list of applications. Although polynomial time algorithms for the convex case have been developed, the solution of large scale QPs is challenging due to the computer memory and speed limitations. Moreover, if the QP is nonconvex or includes integer variables, the problem is NP-hard. Therefore, no known algorithm can solve such QPs efficiently. Alternatively, row-aggregation and diagonalization techniques have been developed to solve QP by a sub-problem, knapsack separable QP (KSQP), which has a separable objective function and is constrained by a single knapsack linear constraint and box constraints. …
The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen
The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen
Doctoral Dissertations
Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then a practical approach is described, which separates out important algorithmic decisions so that the algorithm can be easily …