Geometry and Topology Commons^™

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 …

Conditional Product Sampling For Gaussian Process Implicit Surfaces, Song Shi

Dartmouth College Master’s Theses

Gaussian Process Implicit Surfaces (GPISes) provide a powerful and unified stochastic geometry representation for rendering surfaces, volumes, and the rich continuum between them. Recent work has shown that GPISes can model a broad space of visual appearances under a unified light transport framework. However, practical rendering with GPISes remains challenging: existing estimators can become inefficient for particular correlation structures, and highly anisotropic or heightfield-like GPISes require specialized treatment to obtain robust variance reduction.

This thesis extends recent work on GPIS rendering by introducing a new next-event estimation (NEE) technique for anisotropic GPISes.We show that standard NEE provides diminishing benefits as …

Unique Combinations Of Packing Integer Squares, Keith M. Dreiling, Austin Leanna, William Mooney

SACAD: Scholarly Activities

This research investigates a function, informally named WAK(x), that describes the number of ways to divide an integer square into integer subsquares counting only the list of parts. Previous research has shown values up to 28, though finding these values is computationally complex and requires a long runtime using computer algorithms. We attempt to find patterns in the values and many aspects of the values, hoping to find a general solution. We are unsure if a solution exists, but we have ideas for how to move forward in finding a solution.

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 …

Near Real-Time Adaptive Isotropic And Anisotropic Image-To-Mesh Conversion For Cerebral Aneurysm Simulations, Kevin Garner, Chander Sadasivan, Nikos Chrisochoides

Computer Science Faculty Publications

This paper presents two performance optimization techniques for a mesh adaptation method that is designed to help streamline the discretization of complex vascular geometries within the numerical modeling process. This method is integrated into a pipeline with an image-to-mesh conversion tool to generate adaptive anisotropic meshes from segmented medical images. The pipeline is shown to satisfy quality, fidelity, smoothness, and robustness requirements while providing near real-time performance for medical image-to-mesh conversion. Tested with two brain aneurysm cases and utilizing up to 96 CPU cores within a single, multicore node on Purdue University’s Anvil supercomputer, the parallel adaptive anisotropic meshing method …

Face Value: A Computational Approach To Subjective Impressions Of Faces, Kevin Kpankou

Undergraduate Research Symposium

Various computational models of first impressions have been developed to uncover the mechanisms driving these judgments. However, the implicit notion of a singular ``human'' often overlooks meaningful individual differences in beliefs, attitudes, and associations, as well as culturally grounded group-level constructs. In this paper, we extend Cultural Consensus Theory (CCT) to estimate culturally shared beliefs about faces by incorporating latent constructs structured around interpretable facial features extracted via computer vision algorithms. We apply our model to a large-scale dataset of people’s first impressions of faces. Our approach reveals a robust mapping between facial features and culturally constructed impressions, allowing us …

Modern Procedural Terrain Generation Techniques And Their Background, Hunter A. Barton

2025 Symposium

Procedural terrain generation has become a staple in many digital environments, enabling the automated creation of large-scale and realistic landscapes for applications such as video games and movies. This paper provides an in-depth look at smooth noise functions and their use for terrain generation, as well as an overview of some more modern methods of generation. A method utilizing machine learning stlye transfer was reproduced for this paper with some alterations to improve visualization and realism.

Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam

Computer Science ETDs

We develop distributed robotics algorithms with analytical tools needed to define and analyze angle turned and distance traversed by robots executing geometric algorithms. We then use these analytical tools to obtain information, via sensor measurements, about an a priori unknown surface. Our contributions are threefold. First, we develop the Sketch Algorithm, which estimates the boundary of any unknown contour and is asymptotically optimal in terms of distance traversed and angle turned. Second, we present experimental field work that validates the Sketch Algorithm. Finally, we propose an approach to find multiple sources of a surface with potential applications to approximate that …

The Impact Of Loss Function Topology On Gradient Descent, Robert B. Skudnig Jr.

Theses and Dissertations

Gradient descent is a popular optimization method that utilizes a model’s prediction error to iteratively improve its parameters for a given task. The functions that measure this error can be defined to align with the user’s goals and sometimes satisfy metric or norm properties. It is common for these functions to measure over Rn, but any differentiable space allows for gradient descent to occur. There has been some research investigating the influence of topological spaces on optimization methods, but it is a limited field of study. This thesis further explores this phenomenon by applying a transformation prediction model to multiple …

The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …

Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude

Department of Mathematics: Dissertations, Theses, and Student Research

We introduce and investigate a natural problem regarding unit cube tilings/partitions of Euclidean space and also consider broad generalizations of this problem. The problem fits well within a historical context of similar problems and also has applications to the study of reproducibility in randomized computation.

Given $k\in\mathbb{N}$ and $\epsilon\in(0,\infty)$, we define a $(k,\epsilon)$-secluded unit cube partition of $\mathbb{R}^{d}$ to be a unit cube partition of $\mathbb{R}^{d}$ such that for every point $\vec{p}\in\R^d$, the closed $\ell_{\infty}$ $\epsilon$-ball around $\vec{p}$ intersects at most $k$ cubes. The problem is to construct such partitions for each dimension $d$ with the primary goal of minimizing …

Bifurcation Levels Of The Integral Manifolds Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem, first proposed by Isaac Newton, is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It has significance to many areas of science, including physics and computer science, and is crucial in understanding how the universe works. In fact, it was a primary motivation for Newton's development of calculus. An important application of the N-body problem is within celestial mechanics and involves how planets and other celestial bodies move with mutual gravitational attraction. It is important in developing how satellites behave in space using complicated …

Development Of Graphical Models And Statistical Physics Motivated Approaches To Genomic Investigations, Yashwanth Lagisetty

Dissertations and Theses (Open Access)

Identifying genes involved in disease pathology has been a goal of genomic research since the early days of the field. However, as technology improves and the body of research grows, we are faced with more questions than answers. Among these is the pressing matter of our incomplete understanding of the genetic underpinnings of complex diseases. Many hypotheses offer explanations as to why direct and independent analyses of variants, as done in genome-wide association studies (GWAS), may not fully elucidate disease genetics. These range from pointing out flaws in statistical testing to invoking the complex dynamics of epigenetic processes. In the …

The Dope Distance Is Sic: A Stable, Informative, And Computable Metric On Ordered Merge Trees, Jose Arbelo, Antonio Delgado, Charley Kirk, Zach Schlamowitz

Mathematics Summer Fellows

When analyzing time series data, it is often of interest to categorize them based on how different they are. We define a new dissimilarity measure between time series: Dynamic Ordered Persistence Editing (DOPE). DOPE satisfies metric properties, is stable to noise, is as informative as alternative approaches, and efficiently computable. Satisfying these properties simultaneously makes DOPE of interest to both theoreticians and data scientists alike.

Finding Approximate Pythagorean Triples (And Applications To Lego Robot Building), Ronald I. Greenberg, Matthew Fahrenbacher, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This assignment combines programming and data analysis to determine good combinations of side lengths that approximately satisfy the Pythagorean Theorem for right triangles. This can be a standalone exercise using a wide variety of programming languages, but the results are useful for determining good ways to assemble LEGO pieces in robot construction, so the exercise can serve to integrate three different units of the Exploring Computer Science high school curriculum: "Programming", "Computing and Data Analysis", and "Robotics". Sample assignment handouts are provided for both Scratch and Java programmers. Ideas for several variants of the assignment are also provided.

Intra-Hour Solar Forecasting Using Cloud Dynamics Features Extracted From Ground-Based Infrared Sky Images, Guillermo Terrén-Serrano

Electrical and Computer Engineering ETDs

Due to the increasing use of photovoltaic systems, power grids are vulnerable to the projection of shadows from moving clouds. An intra-hour solar forecast provides power grids with the capability of automatically controlling the dispatch of energy, reducing the additional cost for a guaranteed, reliable supply of energy (i.e., energy storage). This dissertation introduces a novel sky imager consisting of a long-wave radiometric infrared camera and a visible light camera with a fisheye lens. The imager is mounted on a solar tracker to maintain the Sun in the center of the images throughout the day, reducing the scattering effect produced …

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew

Honors Program Theses

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …

Stroke Clustering And Fitting In Vector Art, Khandokar Shakib

Senior Independent Study Theses

Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.

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 …

Multilateration Index., Chip Lynch

Electronic Theses and Dissertations

We present an alternative method for pre-processing and storing point data, particularly for Geospatial points, by storing multilateration distances to fixed points rather than coordinates such as Latitude and Longitude. We explore the use of this data to improve query performance for some distance related queries such as nearest neighbor and query-within-radius (i.e. “find all points in a set P within distance d of query point q”). Further, we discuss the problem of “Network Adequacy” common to medical and communications businesses, to analyze questions such as “are at least 90% of patients living within 50 miles of a covered emergency …

Knot Theory In Virtual Reality, Donald Lee Price

Masters Theses & Specialist Projects

Throughout the study of Knot Theory, there have been several programmatic solutions to common problems or questions. These solutions have included software to draw knots, software to identify knots, or online databases to look up pre-computed data about knots. We introduce a novel prototype of software used to study knots and links by using Virtual Reality. This software can allow researchers to draw links in 3D, run physics simulations on them, and identify them. This technique has not yet been rigorously explored and we believe it will be of great interest to Knot Theory researchers. The computer code is written …

A 3d Image-Guided System To Improve Myocardial Revascularization Decision-Making For Patients With Coronary Artery Disease, Haipeng Tang

Dissertations

OBJECTIVES. Coronary artery disease (CAD) is the most common type of heart disease and kills over 360,000 people a year in the United States. Myocardial revascularization (MR) is a standard interventional treatment for patients with stable CAD. Fluoroscopy angiography is real-time anatomical imaging and routinely used to guide MR by visually estimating the percent stenosis of coronary arteries. However, a lot of patients do not benefit from the anatomical information-guided MR without functional testing. Single-photon emission computed tomography (SPECT) myocardial perfusion imaging (MPI) is a widely used functional testing for CAD evaluation but limits to the absence of anatomical information. …

Geometry Aided Sonification, Michael Tecce

Computer Science Summer Fellows

Sonification is the process of deriving an audio representation of a time series which conveys important information about that time series. Otology and vision science have established that humans process audio information more quickly than visual information, and sonification can convey data to the visually impaired. In our work, we implement pipelines using Python/Numpy, and we handle both ordinary 1D time series and multivariate time series. For 1D time series, we find that using data to modulate the pitch or timing of preselected sounds (such as sine waves) simply and effectively captures repeating patterns and anomalies/outliers within the data. To …

C# Application To Deal With Neutrosophic G(Alpha)-Closed Sets In Neutrosophic Topology, S. Saranya, M. Vigneshwaran, S. Jafari

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we have developed a C# Application for finding the values of the complement, union, intersection and the inclusion of any two neutrosophic sets in the neutrosophic field by using .NET Framework, Microsoft Visual Studio and C# Programming Language. In addition to this, the system can find neutrosophic topology, neutrosophic alpha-closed sets and neutrosophic g(alpha)-closed sets in each resultant screens. Also, this computer-based application produces the complement values of each neutrosophic closed sets.

Invariance And Invertibility In Deep Neural Networks, Han Zhang

Theses and Dissertations

Machine learning is concerned with computer systems that learn from data instead of being explicitly programmed to solve a particular task. One of the main approaches behind recent advances in machine learning involves neural networks with a large number of layers, often referred to as deep learning. In this dissertation, we study how to equip deep neural networks with two useful properties: invariance and invertibility. The first part of our work is focused on constructing neural networks that are invariant to certain transformations in the input, that is, some outputs of the network stay the same even if the input …

Mathematics And Programming Exercises For Educational Robot Navigation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper points students towards ideas they can use towards developing a convenient library for robot navigation, with examples based on Botball primitives, and points educators towards mathematics and programming exercises they can suggest to students, especially advanced high school students.

Geometric Aspects Of Wound Healing, Julio Urenda, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we show that many aspects of complex biological processes related to wound healing can be explained in terms of the corresponding geometric symmetries.

Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.

Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell

Honors Theses

Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example "...ababababab...". The Morse-Hedlund theorem says that a bi-infinite word f repeats itself, in at most n letters, if and only if the number of distinct subwords of length n is at most n. Using the example, "...ababababab...", there are 2 subwords of length 3, namely "aba" and "bab". Since 2 is less than 3, we must have that "...ababababab..." repeats itself after at most 3 letters. In fact it does repeat itself every two letters. …

Introduction To The Usu Library Of Solutions To The Einstein Field Equations, Ian M. Anderson, Charles G. Torre

Tutorials on... in 1 hour or less

This is a Maple worksheet providing an introduction to the USU Library of Solutions to the Einstein Field Equations. The library is part of the DifferentialGeometry software project and is a collection of symbolic data and metadata describing solutions to the Einstein equations.