Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- The College of Wooster (5)
- Claremont Colleges (4)
- East Tennessee State University (4)
- University of Tennessee, Knoxville (3)
- Air Force Institute of Technology (2)
-
- California Polytechnic State University, San Luis Obispo (2)
- Georgia Southern University (2)
- City University of New York (CUNY) (1)
- Colby College (1)
- Kennesaw State University (1)
- Mississippi State University (1)
- Murray State University (1)
- Portland State University (1)
- Rollins College (1)
- The University of Akron (1)
- University of Denver (1)
- University of Kentucky (1)
- University of Montana (1)
- University of New Hampshire (1)
- University of North Florida (1)
- University of Wisconsin Milwaukee (1)
- Utah State University (1)
- Western University (1)
- Keyword
-
- Mathematics (6)
- Computer Science (4)
- Machine Learning (4)
- Combinatorics (3)
- Graph Theory (3)
-
- Algorithms (2)
- Game (2)
- Graph (2)
- Graph theory (2)
- Optimization (2)
- Statistics (2)
- 49 Calculus of variations and optimal control; optimization (1)
- 53 Differential geometry (1)
- 62-07 (1)
- 62-09 (1)
- 68 Computer science (1)
- 68-04 (1)
- AI (1)
- Academic -- UNF -- Master of Science in Mathematical Science; Dissertations (1)
- Academic -- UNF -- Mathematics; Finite State Automata; Regular Languages; Subword Closure; Involution Mappings; Strictly Locally Testable Languages; DNA Code Words (1)
- Adaptively Weighted Discriminator Generative Adversarial Network (1)
- Applied Mathematics (1)
- Approximation (Mathematics) (1)
- Art (1)
- Art vectorization (1)
- Artificial Intelligence (1)
- Assorted-Time Normalization (1)
- BCH Codes (1)
- Bakry Emery curvature (1)
- Balance (1)
- Publication Year
- Publication
-
- Electronic Theses and Dissertations (7)
- Senior Independent Study Theses (5)
- Theses and Dissertations (4)
- HMC Senior Theses (3)
- Master's Theses (2)
-
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (1)
- CMC Senior Theses (1)
- Chancellor’s Honors Program Projects (1)
- Dissertations, Theses, and Capstone Projects (1)
- Doctoral Dissertations (1)
- Electronic Thesis and Dissertation Repository (1)
- Graduate Student Theses, Dissertations, & Professional Papers (1)
- Honors Program Theses (1)
- Honors Theses (1)
- Honors Theses and Capstones (1)
- Master of Science in Computer Science Theses (1)
- Masters Theses (1)
- Murray State Theses and Dissertations (1)
- Theses and Dissertations--Mathematics (1)
- UNF Graduate Theses and Dissertations (1)
- University Honors Theses (1)
- Williams Honors College, Honors Research Projects (1)
Articles 31 - 38 of 38
Full-Text Articles in Other Mathematics
Parameters Estimation Of Material Constitutive Models Using Optimization Algorithms, Kiswendsida Jules Kere
Parameters Estimation Of Material Constitutive Models Using Optimization Algorithms, Kiswendsida Jules Kere
Williams Honors College, Honors Research Projects
Optimization Algorithms are very useful for solving engineering problems. Indeed, optimization algorithms can be used to optimize engineering designs in terms of safety and economy. Understanding the proprieties of materials in engineering designs is very important in order to make designs safe. Materials are not really perfectly homogeneous and there are heterogeneous distributions in most materials. In this paper, Self-OPTIM which is an inverse constitutive parameter identification framework will be used to identify parameters of a linear elastic material constitutive model. Data for Self-OPTIM will be obtained using ABAQUS simulation of a dog-bone uniaxial test. Optimization Algorithms will be used …
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. …
Optimizing The Analysis Of Electroencephalographic Data By Dynamic Graphs, Mehrsasadat Golestaneh
Optimizing The Analysis Of Electroencephalographic Data By Dynamic Graphs, Mehrsasadat Golestaneh
Electronic Thesis and Dissertation Repository
The brain’s underlying functional connectivity has been recently studied using tools offered by graph theory and network theory. Although the primary research focus in this area has so far been mostly on static graphs, the complex and dynamic nature of the brain’s underlying mechanism has initiated the usage of dynamic graphs, providing groundwork for time sensi- tive and finer investigations. Studying the topological reconfiguration of these dynamic graphs is done by exploiting a pool of graph metrics, which describe the network’s characteristics at different scales. However, considering the vast amount of data generated by neuroimaging tools, heavy computation load and …
A Mathematical Framework For Unmanned Aerial Vehicle Obstacle Avoidance, Sorathan Chaturapruek
A Mathematical Framework For Unmanned Aerial Vehicle Obstacle Avoidance, Sorathan Chaturapruek
HMC Senior Theses
The obstacle avoidance navigation problem for Unmanned Aerial Vehicles (UAVs) is a very challenging problem. It lies at the intersection of many fields such as probability, differential geometry, optimal control, and robotics. We build a mathematical framework to solve this problem for quadrotors using both a theoretical approach through a Hamiltonian system and a machine learning approach that learns from human sub-experts' multiple demonstrations in obstacle avoidance. Prior research on the machine learning approach uses an algorithm that does not incorporate geometry. We have developed tools to solve and test the obstacle avoidance problem through mathematics.
Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva
Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva
Electronic Theses and Dissertations
Epistasis is the interaction between two or more genes to control a single phenotype. We model epistasis of the prey in a two-locus two-allele problem in a basic predator- prey relationship. The resulting model allows us to examine both population sizes as well as genotypic and phenotypic frequencies. In the context of several numerical examples, we show that if epistasis results in an undesirable or desirable phenotype in the prey by making the particular genotype more or less susceptible to the predator or dangerous to the predator, elimination of undesirable phenotypes and then genotypes occurs.
Validation Of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation, Elton Lewis Freeman
Validation Of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation, Elton Lewis Freeman
Masters Theses
Extremization of a weak form for the continuum energy conservation principle differential equation naturally implements fluid convection and radiation as flux Robin boundary conditions associated with unsteady heat transfer. Combining a spatial semi-discretization via finite element trial space basis functions with time-accurate integration generates a totally node-based algebraic statement for computing. Closure for gray body radiation is a newly derived node-based radiosity formulation generating piecewise discontinuous solutions, while that for natural-forced-mixed convection heat transfer is extracted from the literature. Algorithm performance, mathematically predicted by asymptotic convergence theory, is subsequently validated with data obtained in 24 hour diurnal field experiments for …
Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ
Master's Theses
View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.
In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …
Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki
Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki
Theses and Dissertations
Representing speech signals such that specific characteristics of speech are included is essential in many Air Force and DoD signal processing applications. A mathematical construct called a frame is presented which captures the important time-varying characteristic of speech. Roughly speaking, frames generalize the idea of an orthogonal basis in a Hilbert space, Specific spaces applicable to speech are L2(R) and the Hardy spaces Hp(D) for p> 1 where D is the unit disk in the complex plane. Results are given for representations in the Hardy spaces involving Carleson's inequalities (and its extensions), …