Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Prairie View A&M University (4)
- University of Arkansas, Fayetteville (2)
- Bemidji State University (1)
- Claremont Colleges (1)
- Clemson University (1)
-
- Indian Statistical Institute (1)
- LSU New Orleans (1)
- Louisiana State University (1)
- Minnesota State University, Mankato (1)
- Neutrosophic Systems with Applications (1)
- Old Dominion University (1)
- Rose-Hulman Institute of Technology (1)
- Stephen F. Austin State University (1)
- University of Denver (1)
- Utah State University (1)
- Wilfrid Laurier University (1)
- Keyword
-
- Subdivision (4)
- Curve design (3)
- Refinable functions (3)
- A-ary (2)
- Computer Vision (2)
-
- Computer-aided geometric design (2)
- Stationary (2)
- Ab Initio Protein Structure Prediction (1)
- Abstract Algebra (1)
- Acceleration (1)
- Analytic functions (1)
- Approximation algorithms (1)
- Artificial Intelligence (1)
- Biarc (1)
- Bibliometric analysis (1)
- Buchberger's Algorithm (1)
- Career Technical Education (1)
- Case Study (1)
- Circular-Invariant (1)
- Cohomology (1)
- Commutative Algebra (1)
- Computational Algebraic Geometry (1)
- Computational Thinking (1)
- Computational geometry (1)
- Computer Education Curriculum (1)
- Computer Science (1)
- Conformational Ensemble Generator (1)
- Constrained optimization (1)
- Contextualization (1)
- Critical thinking (1)
- Publication Year
- Publication
-
- Applications and Applied Mathematics: An International Journal (AAM) (4)
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (1)
- All Graduate Theses, Dissertations, and Other Capstone Projects (1)
- All Theses (1)
- Computer Science Faculty Publications (1)
-
- Data Science Undergraduate Honors Theses (1)
- Electronic Theses and Dissertations (1)
- Journal Articles (1)
- Journal of Humanistic Mathematics (1)
- LSU Doctoral Dissertations (1)
- LSU New Orleans Theses and Dissertations (1)
- Mathematical Sciences Spring Lecture Series (1)
- Mathematical Sciences Technical Reports (MSTR) (1)
- Mathematics Graduate Theses (1)
- Neutrosophic Systems with Applications (1)
- Theses and Dissertations (Comprehensive) (1)
- Undergraduate Research Conference (1)
- Publication Type
Articles 1 - 20 of 20
Full-Text Articles in Algebraic Geometry
Classes Of Analytic Functions Defined By Salagean Derivative Operator Associated With Neutrosophic Generalized Poisson Distribution, Soliu O. Opeyemi Okunola, Olushola Adeyemo, Sayo A. Abidemi Gbangbala, Folorunso I. Isola Akinwale
Classes Of Analytic Functions Defined By Salagean Derivative Operator Associated With Neutrosophic Generalized Poisson Distribution, Soliu O. Opeyemi Okunola, Olushola Adeyemo, Sayo A. Abidemi Gbangbala, Folorunso I. Isola Akinwale
Neutrosophic Systems with Applications
This study introduces and analyses new subclasses of analytic functions by applying the Salagean derivative operator to the Neutrosophic Generalized Poisson Distribution (NGPD) series. We develop a model where the mean parameter is treated as an interval or set to account for indeterminacy in complex systems. By employing Stirling numbers of the second kind and decreasing factorials, we derive necessary and sufficient coefficient inequalities and inclusion relations for these new subclasses. Numerical results and graphical illustrations demonstrate the sensitivity of these functions to orientation and the neutrosophic parameter, providing a framework for applications in fields like medical imaging and network …
Geovig And Purevig: Geometry-Aware Architectures For Efficient Computer Vision, Omar Ismail
Geovig And Purevig: Geometry-Aware Architectures For Efficient Computer Vision, Omar Ismail
Theses and Dissertations (Comprehensive)
Deploying deep learning models for medical image analysis on mobile devices requires a balance between inference latency, memory footprint, and delineating anatomical boundaries with high accuracy. While Convolutional Neural Networks (CNNs) and mobile Vision Transformers (ViTs) offer efficiency, they often struggle to model the irregular, non-local geometric structures inherent in biological tissues without incurring prohibitive computational costs. In this thesis, we introduce GeoViG (Geometric Vision Graph), an architecture that bridges the gap between efficient grid-based processing and explicit Geometric Deep Learning. GeoViG introduces a novel transition from high-resolution pixel grids to low-resolution dynamic graphs via a SpreadEdgePool operator, a geometry-aware …
Computer Vision In Soccer: Yolov11 Analytics Engine For Quantifying Game Strategy, Connor S. Maurer
Computer Vision In Soccer: Yolov11 Analytics Engine For Quantifying Game Strategy, Connor S. Maurer
Data Science Undergraduate Honors Theses
Single-shot object detection capabilities significantly reduce computational overhead for real-time computer vision in sports analytics at 60 FPS. YOLO11’s lightweight CNN gives promising accuracy while meeting the low-latency demand of dynamic soccer matches. As data-driven approaches take over the sport of soccer, efficient player tracking systems become critical for informing coach’s strategies. I prototype the ETL (Extract, Transform, Load) process of data collected from a single- shot detection program and evaluate its viability for estimating player fatigue. YOLO11 detects players, the ball, and other characteristics, with the output transformed by homography to estimate the positions in the real world. These …
A Bibliographic And Topic Modeling Analysis Of The P-Adic Theory Literature Using Latent Dirichlet Allocation, Humberto Llinás, Ismael Gutiérrez, Anselmo Torresblanca, Javier De La Hoz, Brian Llinás
A Bibliographic And Topic Modeling Analysis Of The P-Adic Theory Literature Using Latent Dirichlet Allocation, Humberto Llinás, Ismael Gutiérrez, Anselmo Torresblanca, Javier De La Hoz, Brian Llinás
Computer Science Faculty Publications
P-adic analysis, introduced by Kurt Hensel in the early 20th century, has developed into a fundamental area of mathematical research with broad applications in number theory, algebraic geometry, and mathematical physics. This study aims to examine the thematic evolution and scholarly impact of p-adic research through a comprehensive topic modeling and bibliometric analysis. Using classical bibliometric techniques (e.g., performance analysis, co-authorship, and co-citation networks) combined with Latent Dirichlet Allocation (LDA), we analyzed 7388 peer-reviewed documents published between 1965 and 2024. The computational workflow was conducted using R (version 4.4.1) and VOSviewer (version 1.6.20), which enabled the identification of 20 distinct …
Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova
Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova
Journal of Humanistic Mathematics
This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!
Acceleration Skinning: Kinematics-Driven Cartoon Effects For Articulated Characters, Niranjan Kalyanasundaram
Acceleration Skinning: Kinematics-Driven Cartoon Effects For Articulated Characters, Niranjan Kalyanasundaram
All Theses
Secondary effects are key to adding fluidity and style to animation. This thesis introduces the idea of “Acceleration Skinning” following a recent well-received technique, Velocity Skinning, to automatically create secondary motion in character animation by modifying the standard pipeline for skeletal rig skinning. These effects, which animators may refer to as squash and stretch or drag, attempt to create an illusion of inertia. In this thesis, I extend the Velocity Skinning technique to include acceleration for creating a wider gamut of cartoon effects. I explore three new deformers that make use of this Acceleration Skinning framework: followthrough, centripetal stretch, and …
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Probability Distributions For Elliptic Curves In The Cgl Hash Function, Dhruv Bhatia, Kara Fagerstrom, Max Watson
Mathematical Sciences Technical Reports (MSTR)
Hash functions map data of arbitrary length to data of predetermined length. Good hash functions are hard to predict, making them useful in cryptography. We are interested in the elliptic curve CGL hash function, which maps a bitstring to an elliptic curve by traversing an inputdetermined path through an isogeny graph. The nodes of an isogeny graph are elliptic curves, and the edges are special maps betwixt elliptic curves called isogenies. Knowing which hash values are most likely informs us of potential security weaknesses in the hash function. We use stochastic matrices to compute the expected probability distributions of the …
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Mathematical Sciences Spring Lecture Series
Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.
Evolution Of Computational Thinking Contextualized In A Teacher-Student Collaborative Learning Environment., John Arthur Underwood
Evolution Of Computational Thinking Contextualized In A Teacher-Student Collaborative Learning Environment., John Arthur Underwood
LSU Doctoral Dissertations
The discussion of Computational Thinking as a pedagogical concept is now essential as it has found itself integrated into the core science disciplines with its inclusion in all of the Next Generation Science Standards (NGSS, 2018). The need for a practical and functional definition for teacher practitioners is a driving point for many recent research endeavors. Across the United States school systems are currently seeking new methods for expanding their students’ ability to analytically think and to employee real-world problem-solving strategies (Hopson, Simms, and Knezek, 2001). The need for STEM trained individuals crosses both the vocational certified and college degreed …
Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes
Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes
All Graduate Theses, Dissertations, and Other Capstone Projects
This paper will explore the use and construction of Gröbner bases through Buchberger's algorithm. Specifically, applications of such bases for solving systems of polynomial equations will be discussed. Furthermore, we relate many concepts in commutative algebra to ideas in computational algebraic geometry.
Effective Statistical Energy Function Based Protein Un/Structure Prediction, Avdesh Mishra
Effective Statistical Energy Function Based Protein Un/Structure Prediction, Avdesh Mishra
LSU New Orleans Theses and Dissertations
Proteins are an important component of living organisms, composed of one or more polypeptide chains, each containing hundreds or even thousands of amino acids of 20 standard types. The structure of a protein from the sequence determines crucial functions of proteins such as initiating metabolic reactions, DNA replication, cell signaling, and transporting molecules. In the past, proteins were considered to always have a well-defined stable shape (structured proteins), however, it has recently been shown that there exist intrinsically disordered proteins (IDPs), which lack a fixed or ordered 3D structure, have dynamic characteristics and therefore, exist in multiple states. Based on …
Data Parsing For Optimized Molecular Geometry Calculations, Luke Rens
Data Parsing For Optimized Molecular Geometry Calculations, Luke Rens
Undergraduate Research Conference
The purpose of this project is to optimize and streamline to process of using ADF and ReaxFF. There is no efficient way to effectively add constraints to a compound and run it through ADF, take the ADF output and create a file that can be run through Reaxff, then take that Reaxff output and come to conclusions on it. To streamline this process, scripts were developed using Python to parse information out of data generated by ADF.
Squared Distance Matrix Of A Weighted Tree, Ravindra B. Bapat
Squared Distance Matrix Of A Weighted Tree, Ravindra B. Bapat
Journal Articles
Let T be a tree with vertex set f1;: :: ; ng such that each edge is assigned a nonzero weight. The squared distance matrix of T; denoted by is the n n matrix with (i; j)-element d(i; j)2; where d(i; j) is the sum of the weights of the edges on the (ij)-path. We obtain a formula for the determinant of A formula for 1 is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.
Calculating The Cohomology Of A Lie Algebra Using Maple And The Serre Hochschild Spectral Sequence, Jacob Kullberg
Calculating The Cohomology Of A Lie Algebra Using Maple And The Serre Hochschild Spectral Sequence, Jacob Kullberg
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Lie algebra cohomology is an important tool in many branches of mathematics. It is used in the Topology of homogeneous spaces, Deformation theory, and Extension theory. There exists extensive theory for calculating the cohomology of semi simple Lie algebras, but more tools are needed for calculating the cohomology of general Lie algebras. To calculate the cohomology of general Lie algebras, I used the symbolic software program called Maple. I wrote software to calculate the cohomology in several different ways. I wrote several programs to calculate the cohomology directly. This proved to be computationally expensive as the number of differential forms …
A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design, Jian-Ao Lian
A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
A 4-point nonlinear corner-cutting subdivision scheme is established. It is induced from a special C-shaped biarc circular spline structure. The scheme is circular-invariant and can be effectively applied to 2-dimensional (2D) data sets that are locally convex. The scheme is also extended adaptively to non-convex data. Explicit examples are demonstrated.
Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster
Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster
Electronic Theses and Dissertations
This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline ℜ with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-ε, where the goal is to minimize the error for a …
Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang
Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang
Applications and Applied Mathematics: An International Journal (AAM)
Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …
On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian
On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
The a-ary 3-point and 5-point interpolatery subdivision schemes for curve design are introduced for arbitrary odd integer a greater than or equal to 3. These new schemes further extend the family of the classical 4- and 6-point interpolatory schemes.
On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian
On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian
Applications and Applied Mathematics: An International Journal (AAM)
The classical binary 4-point and 6-point interpolatery subdivision schemes are generalized to a-ary setting for any integer a greater than or equal to 3. These new a-ary subdivision schemes for curve design are derived easily from their corresponding two-scale scaling functions, a notion from the context of wavelets.
How Geometer’S Sketchpad Improves Student Learning, William George Awe
How Geometer’S Sketchpad Improves Student Learning, William George Awe
Mathematics Graduate Theses
This study investigated whether dynamic software improves learning and reviews different types of dynamic software. The study then narrows its focus to one type of dynamic software, Geometer’s Sketchpad and studies how Geometer’s Sketchpad, in itself, improves student learning. The researcher identified what dynamic software is, the importance of dynamic software and different types of dynamic software. The researcher also identifies how dynamic software is utilized in schools and researches how to improve the use of dynamic software in schools. Dynamic software, and Geometer’s Sketchpad, In particular, was found to improve learning across grade levels and with different levels of …