Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- ETD (7)
- Active set method (1)
- Algebraic Geometry (1)
- Antioxidant Properties (1)
- B-Spline (1)
-
- Business Intelligence (1)
- Change point (1)
- Combinatorial game theory (1)
- Constrained optimization (1)
- Cross-correlation (1)
- Data Mart (1)
- Data Vault (1)
- Data warehouse testing (1)
- Dengue fever (1)
- Dense tree (1)
- Distances between leaves (1)
- Domineering (1)
- Dynamical System (1)
- Edge-swap heuristic (1)
- Elliptic (1)
- Full Newton-step (1)
- Gluing (1)
- Graphs (1)
- Hackenbush (1)
- Havel hakimi (1)
- Heavy-tailed Distribution (1)
- Hermitian (1)
- Hierarchical Bayesian model (1)
- Infeasible interior-point method (1)
- Interior-point method (1)
Articles 1 - 13 of 13
Full-Text Articles in Entire DC Network
Total Synthesis Of Biologically Active Natural And Unnatural Products, Julia Heimberger
Total Synthesis Of Biologically Active Natural And Unnatural Products, Julia Heimberger
Electronic Theses and Dissertations
Herbarin A and B were isolated from the fungal strains of Cladosporium herbarum found in marine sponges Aplysina aerophoba and Callyspongia aerizusa. Total synthesis of Herbarin A and B was achieved by carrying out a multi-step synthesis approach, and the antioxidant properties were evaluated using FRAP assay. Toxicity of these compounds was determined using a zebrafish embryo model. Furthermore, synthesis of C-6 alkyl-azaarene derivatives of nucleosides by Csp3-H bond functionalization were investigated. Effective incorporation of 2-methylazaarene moiety at the C-6 position of the protected inosine nucleoside provided a new class of compounds with anticipated enhanced biological activity.
Electrospun Titanium Dioxide And Silicon Composite Nanofibers For Advanced Lithium Ion Batteries, Kathleen Mccormac
Electrospun Titanium Dioxide And Silicon Composite Nanofibers For Advanced Lithium Ion Batteries, Kathleen Mccormac
Electronic Theses and Dissertations
A unique electrospinning method was implemented to fabricate composite nanofibers for lithium ion battery applications. The composite nanofibers were made of amorphous carbon, rutile phase TiO2, and cubic phase Si nanoparticles. Sulfur was utilized as a template to form void structures within the TiO2 nanofiber matrix. This provides the desired space for the Si expansion during the lithiation process. Phase, structure, composition, and morphology of the nanofibers were characterized using Raman spectroscopy, SEM, EDS, TGA, and powder XRD. Carbonized TiO2 nanofibers showed a low but stable specific capacity. Si Nanoparticles demonstrated an initially high but fast …
Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen
Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen
Electronic Theses and Dissertations
In this thesis, we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some centering steps (at most three in practice). The improved version guarantees that after one feasibility step, the new iterated point is feasible and close enough to central path. Thus, the centering steps are eliminated. This improvement is based on the Lemma(Roos, 2015). Thanks to this lemma, proximity …
Enumerating Graphs Using Integrals From Quantum Field Theory, William A. Coggins
Enumerating Graphs Using Integrals From Quantum Field Theory, William A. Coggins
Electronic Theses and Dissertations
Enumerating graphs is a relatively new subfield of mathematics. In this thesis, we will discuss a enumerative method that derives from Quantum Field Theory. We begin with the basic ideas of Calculus and extend them into a enumerative method that will allow us to classify graphs embedded on surfaces.
Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.
Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.
Electronic Theses and Dissertations
The purpose of this thesis is to introduce a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as Domineering. Please note that this document contains color images so please keep that in mind when printing.
The Sensitivity Of A Test Based On Spearman's Rho In Cross-Correlation Change Point Problems, Congjian Liu
The Sensitivity Of A Test Based On Spearman's Rho In Cross-Correlation Change Point Problems, Congjian Liu
Electronic Theses and Dissertations
In change point problems, there are three main questions that researchers are interested in. First of all, is there a change point or not? Second, when does the change point occur in a time series? Third, how quickly can we detect the change point? In this thesis, we first explain what a change point is, and what a cross-correlation is. We then discuss prior research in this area. Then we discuss and examine a test based on Spearman's rho, introduced by Wied and Dehling (2011), which tests the null hypothesis of no change point, and compare the change point we …
Solutions Of Inequality Constrained Spline Optimization Problems With The Active Set Method, Joshua A. Holloway
Solutions Of Inequality Constrained Spline Optimization Problems With The Active Set Method, Joshua A. Holloway
Electronic Theses and Dissertations
We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so …
Testing Data Vault-Based Data Warehouse, Connard N. Williams
Testing Data Vault-Based Data Warehouse, Connard N. Williams
Electronic Theses and Dissertations
Data warehouse (DW) projects are undertakings that require integration of disparate sources of data, a well-defined mapping of the source data to the reconciled data, and effective Extract, Transform, and Load (ETL) processes. Owing to the complexity of data warehouse projects, great emphasis must be placed on an agile-based approach with properly developed and executed test plans throughout the various stages of designing, developing, and implementing the data warehouse to mitigate against budget overruns, missed deadlines, low customer satisfaction, and outright project failures. Yet, there are often attempts to test the data warehouse exactly like traditional back-end databases and legacy …
A Survey Of Mathematical Models Of Dengue Fever, Iurii Bakach
A Survey Of Mathematical Models Of Dengue Fever, Iurii Bakach
Electronic Theses and Dissertations
In this paper, we compare and contrast five models of Dengue fever. We evaluate each model using different scenarios and identify the strenghts and wecknesses of each of the model
Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman
Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman
Electronic Theses and Dissertations
In this thesis, we examine two topics. In the first part, we consider Leech tree which is a tree of order n with positive integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type questions on distances between leaves are studied as well as some other labeling questions …
Bayesian Inference Of The Weibull-Pareto Distribution, James Dow
Bayesian Inference Of The Weibull-Pareto Distribution, James Dow
Electronic Theses and Dissertations
The Weibull distribution has many applications in various topics. Some of these topics include survival analysis, reliability engineering, general insurance, electrical engineering, and industrial engineering. The Weibull distribution was further extended by the Weibull-Pareto distribution. A desirable property this distribution has is its shape can skew being able to better model left or right skewed data. Examples of skewed data include human longevity and actuarial data. In this work a hierarchical Bayesian model was developed using the Weibull-Pareto distribution.
Automorphisms Of Graph Curves On K3 Surfaces, Joshua C. Ferrerra
Automorphisms Of Graph Curves On K3 Surfaces, Joshua C. Ferrerra
Electronic Theses and Dissertations
We examine the automorphism group of configurations of rational curves on $K3$ surfaces. We use the properties of finite automorphisms of $\PP^1$ to examine what restrictions a given elliptic fibration imposes on the possible finite order non-symplectic automorphisms of the $K3$ surface. We also examine the fixed loci of these automorphisms, and construct an explicit fibration to demonstrate the process.
Graphs Of Classroom Networks, Rebecca Holliday
Graphs Of Classroom Networks, Rebecca Holliday
Electronic Theses and Dissertations
In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …