Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Applied Statistics (2)
- Computer Sciences (2)
- Other Mathematics (2)
- Other Statistics and Probability (2)
- Statistics and Probability (2)
-
- Applied Mathematics (1)
- Artificial Intelligence and Robotics (1)
- Categorical Data Analysis (1)
- Curriculum and Instruction (1)
- Databases and Information Systems (1)
- Disability and Equity in Education (1)
- Discrete Mathematics and Combinatorics (1)
- Education (1)
- Educational Administration and Supervision (1)
- Educational Assessment, Evaluation, and Research (1)
- Educational Leadership (1)
- Educational Methods (1)
- Elementary Education (1)
- Elementary Education and Teaching (1)
- Elementary and Middle and Secondary Education Administration (1)
- Harmonic Analysis and Representation (1)
- Junior High, Intermediate, Middle School Education and Teaching (1)
- Longitudinal Data Analysis and Time Series (1)
- Multivariate Analysis (1)
- Number Theory (1)
- Other Applied Mathematics (1)
- Other Computer Sciences (1)
- Keyword
-
- Analytics (1)
- Atlanta BeltLine (1)
- Circle method (1)
- Demographics (1)
- Extremal graph theory (1)
-
- Harmonic Analysis (1)
- Housing affordability (1)
- Image Recognition (1)
- Integer partitions (1)
- Machine learning (1)
- Maximum degree (1)
- Neural Network (1)
- Number theory (1)
- Old English. (1)
- Partial Differential Equations (1)
- Partition identities (1)
- Risk Prevention (1)
- Risk Profiles (1)
- Statistical Modeling (1)
- Suburbs (1)
- Publication
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Analysis
Reducing The Maximum Degree Of A Graph: Comparisons Of Bounds, Peter Borg
Reducing The Maximum Degree Of A Graph: Comparisons Of Bounds, Peter Borg
Theory & Applications of Graphs
Let λ(G) be the smallest number of vertices that can be removed from a non-empty graph G so that the resulting graph has a smaller maximum degree. Let λe(G) be the smallest number of edges that can be removed from G for the same purpose. Let k be the maximum degree of G, let t be the number of vertices of degree k, let M(G) be the set of vertices of degree k, let n be the number of vertices in the closed neighbourhood of M(G), and let m be the …
Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins
Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins
College of Graduate Studies: Theses & Dissertations
In biology, minimizing a free energy functional gives an equilibrium shape that is the most stable in nature. The formulation of these functionals can vary in many ways, in particular they can have either a smooth or sharp interface. Minimizing a functional can be done through variational calculus or can be proved to exist using various analysis techniques. The functionals investigated here have a smooth and sharp interface and are analyzed using analysis and variational calculus respectively. From the former we find the condition for extremum and its second variation. The second variation is commonly used to analyze stability of …
The Relationship Between Housing Affordability And Demographic Factors: Case Study For The Atlanta Beltline, Chapman T. Lindstrom
The Relationship Between Housing Affordability And Demographic Factors: Case Study For The Atlanta Beltline, Chapman T. Lindstrom
College of Graduate Studies: Theses & Dissertations
Housing affordability has been a widely examined subject for populations residing in major metropolitan regions around the world. The relationship between housing affordability and the city’s demographics and its volume of urban development are important to take into consideration. In the past two decades there has been an increasing volume of literature detailing Atlanta Georgia’s large-scale redevelopment project, the Atlanta BeltLine (ABL), and its relationship with Atlanta’s Metropolitan population and housing affordability. The first objective of this paper is to study the relationship between housing affordability at two scales within the Atlanta Metropolitan Area (AMA) for both renters and homeowners. …
Building A Better Risk Prevention Model, Steven Hornyak
Building A Better Risk Prevention Model, Steven Hornyak
National Youth Advocacy & Resilience Conference
This presentation chronicles the work of Houston County Schools in developing a risk prevention model built on more than ten years of longitudinal student data. In its second year of implementation, Houston At-Risk Profiles (HARP), has proven effective in identifying those students most in need of support and linking them to interventions and supports that lead to improved outcomes and significantly reduces the risk of failure.
Old English Character Recognition Using Neural Networks, Sattajit Sutradhar
Old English Character Recognition Using Neural Networks, Sattajit Sutradhar
College of Graduate Studies: Theses & Dissertations
Character recognition has been capturing the interest of researchers since the beginning of the twentieth century. While the Optical Character Recognition for printed material is very robust and widespread nowadays, the recognition of handwritten materials lags behind. In our digital era more and more historical, handwritten documents are digitized and made available to the general public. However, these digital copies of handwritten materials lack the automatic content recognition feature of their printed materials counterparts. We are proposing a practical, accurate, and computationally efficient method for Old English character recognition from manuscript images. Our method relies on a modern machine learning …
Survey Of Results On The Schrodinger Operator With Inverse Square Potential, Richardson Saint Bonheur
Survey Of Results On The Schrodinger Operator With Inverse Square Potential, Richardson Saint Bonheur
College of Graduate Studies: Theses & Dissertations
In this paper we present a survey of results on the Schrodinger operator with Inverse ¨ Square potential, La= −∆ + a/|x|^2 , a ≥ −( d−2/2 )^2. We briefly discuss the long-time behavior of solutions to the inter-critical focusing NLS with an inverse square potential(proof not provided). Later we present spectral multiplier theorems for the operator. For the case when a ≥ 0, we present the multiplier theorem from Hebisch [12]. The case when 0 > a ≥ −( d−2/2 )^2 was explored in [1], and their proof will be presented for completeness. No improvements on the sharpness …
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
College of Graduate Studies: Theses & Dissertations
Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …