Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1681 - 1710 of 27173

Full-Text Articles in Entire DC Network

Theoretical And Applied Considerations In Dynamical Sampling, Brendan Miller Jan 2025

Theoretical And Applied Considerations In Dynamical Sampling, Brendan Miller

Graduate Research Theses & Dissertations

Dynamical sampling is an area of mathematics which studies the theory and applications of signals evolving through time, as well as the stable recovery of said signals from spatiotemporal measurements. This manuscript is devoted to problems which arise as theoretical considerations in signal recovery and as applications of using space-time measurements as opposed to static measurements.

For the former, we consider the problem of recovering an evolving signal via space-time measurements at irregular time intervals. To do so, we generalize the classic Kadec $1/4$ theorem using techniques of Banach $L^1(\R)$-modules. For the latter, we show how dynamical samples can be …


Methods For Finding High Quality And Optimal Solutions Of Binary Quadratic Optimization Problems, James Haas Jan 2025

Methods For Finding High Quality And Optimal Solutions Of Binary Quadratic Optimization Problems, James Haas

Graduate Research Theses & Dissertations

BiqAlps is an extension of the BiqCrunch project that leverages its bounding procedures within a computer cluster environment. The primary goal of this work was to investigate whether distributing the branch-and-bound tree search across multiple CPUs could improve solve times. While some problem instances demonstrated speedups of up to fivefold, others showed no measurable improvement, revealing that parallelization benefits are problem-dependent.

Beyond parallelization, BiqAlps introduces enhanced heuristics for generating high-quality initial solutions and refining existing ones. Additionally, the framework explores the impact of propagating triangle inequality cuts to child nodes during search, with the aim of accelerating bounding processes and …


Cubic Blaschke Products, Alexandra Hill Jan 2025

Cubic Blaschke Products, Alexandra Hill

Graduate Research Theses & Dissertations

It is well known that Blaschke products can be classified as elliptic, hyperbolic, or parabolic. Based on the classification of the Blaschke product, we know that the Julia set is either the entire unit circle or a Cantor subset of the unit circle. For unicritical Blaschke products of degree d, it has been shown that the parabolic functions are parameterized by an epicycloid with d-1 cusps, with the interior of the epicycloid giving rise to the elliptic parameters, and the relative complement of the epicycloid within the unit disk providing the hyperbolic parameters. In this dissertation, we study in more …


Green's Functions And Fixed Points Of Quasiregular Maps, Mark Broderius Jan 2025

Green's Functions And Fixed Points Of Quasiregular Maps, Mark Broderius

Graduate Research Theses & Dissertations

This dissertation is on the dynamics of planar quasiregular maps of degree 2. These maps have three parameters. One of these parameters determines the distortion, one of them determines the orientation, and the last one is a shift parameter. Our first objective is to construct a new dynamical version of Green's functions for these maps. These functions provide information about the escaping sets of our quasiregular maps and are used to prove topological results about them. We show that the boundary of the escaping set is either connected or consists of infinitely many components. Additionally, we prove that if one …


Facial Reduction Of Semidefinite Relaxations Of Binary Quadratic Problems, Ian Sugrue Jan 2025

Facial Reduction Of Semidefinite Relaxations Of Binary Quadratic Problems, Ian Sugrue

Graduate Research Theses & Dissertations

A standard technique for bounding a combinatorial optimization problem is to form a semidefinite relaxation of the problem by "lifting" the problem into a higher dimensional space of symmetric matrices. For some combinatorial problems such as maximum k-cluster, the resulting semidefinite relaxation is not strictly feasible. In the context of the maximum k-cluster problem, we present an equivalent, strictly feasible semidefinite relaxation by way of the dimensionality reduction technique known as facial reduction. We provide a recipe to form this semidefinite relaxation directly, bypassing the lifting and facial reduction steps entirely. We then present our work on generalizing this result, …


A New G Family: Properties, Characterizations, Different Estimation Methods And Port-Var Analysis For U.K. Insurance Claims And U.S. House Prices Data Sets, Ahmad M. Aboalkhair, Gholamhossein Hamedani, Nazar Ali Ahmed, Mohamed Ibrahim, Mohammad A. Zayed, Haitham M. Yousof Jan 2025

A New G Family: Properties, Characterizations, Different Estimation Methods And Port-Var Analysis For U.K. Insurance Claims And U.S. House Prices Data Sets, Ahmad M. Aboalkhair, Gholamhossein Hamedani, Nazar Ali Ahmed, Mohamed Ibrahim, Mohammad A. Zayed, Haitham M. Yousof

Mathematical and Statistical Science Faculty Research and Publications

This paper introduces a new class of probability distributions, termed the generated log exponentiated polynomial (GLEP) family, designed to enhance flexibility in modeling complex real financial data. The proposed family is constructed through a novel cumulative distribution function that combines logarithmic and exponentiated polynomial structures, allowing for rich distributional shapes and tail behaviors. We present comprehensive mathematical properties, including useful series expansions for the density, cumulative, and quantile functions, which facilitate the derivation of moments, generating functions, and order statistics. Characterization results based on the reverse hazard function and conditional expectations are established. The model parameters are estimated using various …


A Bayesian Complex-Valued Latent Variable Model Applied To Functional Magnetic Resonance Imaging, Chase J. Sakitis, D. Andrew Brown, Daniel B. Rowe Jan 2025

A Bayesian Complex-Valued Latent Variable Model Applied To Functional Magnetic Resonance Imaging, Chase J. Sakitis, D. Andrew Brown, Daniel B. Rowe

Mathematical and Statistical Science Faculty Research and Publications

In linear regression, the coefficients are simple to estimate using the least squares method with a known design matrix for the observed measurements. However, real-world applications may encounter complications such as an unknown design matrix and complex-valued parameters. The design matrix can be estimated from prior information but can potentially cause an inverse problem when multiplying by the transpose as it is generally ill-conditioned. This can be combat by adding regularizers to the model but does not always mitigate the issues. Here, we propose our Bayesian approach to a complex-valued latent variable linear model with an application to functional magnetic …


Bayesian Merged Utilization Of Grappa And Sense (Bmugs) For In-Plane Accelerated Reconstruction Increases Fmri Detection Power, Chase J. Sakitis, Daniel B. Rowe Jan 2025

Bayesian Merged Utilization Of Grappa And Sense (Bmugs) For In-Plane Accelerated Reconstruction Increases Fmri Detection Power, Chase J. Sakitis, Daniel B. Rowe

Mathematical and Statistical Science Faculty Research and Publications

In fMRI, capturing brain activity during a task is dependent on how quickly the k-space arrays for each volume image are obtained. Acquiring the full k-space arrays can take a considerable amount of time. Under-sampling k-space reduces the acquisition time, but results in aliased, or “folded,” images after applying the inverse Fourier transform (IFT). GeneRalized Autocalibrating Partial Parallel Acquisition (GRAPPA) and SENSitivity Encoding (SENSE) are parallel imaging techniques that yield reconstructed images from subsampled arrays of k-space. With GRAPPA operating in the spatial frequency domain and SENSE in image space, these techniques have been separate but can …


Designing An Affordable Motion Capture System For Multi-Robot Research And Education, Hojune Kim , '25 Jan 2025

Designing An Affordable Motion Capture System For Multi-Robot Research And Education, Hojune Kim , '25

Senior Theses, Projects, and Awards

In this work, we propose a low-cost motion capture system for real-time tracking of multiple robots’ positions and orientations in indoor environments, specifically tailored for research and educational applications. Precise localization is essential for evaluating robotics algorithms such as decentralized multi-agent control, cooperative path planning, and collision avoidance. [1-3] However, commercial motion capture systems like Vicon and OptiTrack cost between $50,000 and $150,000, making them inaccessible for many smaller institutions, student clubs, and low-resource labs. To address this challenge, we developed an affordable alternative based on three ceiling-mounted 1080p USB cameras and AprilTags. Our system operates at 30 Hz and …


A Geometric Characterization Of N-Graded Manifolds And The Frobenius Theorem, Henrique Bursztyn, Miquel Cueca, Rajan Amit Mehta Jan 2025

A Geometric Characterization Of N-Graded Manifolds And The Frobenius Theorem, Henrique Bursztyn, Miquel Cueca, Rajan Amit Mehta

Mathematics Sciences: Faculty Publications

This paper studies graded manifolds with local coordinates concentrated in non-negative degrees. We provide a canonical description of these objects in terms of classical geometric data and, building on this geometric viewpoint, we prove the Frobenius theorem for distributions in this graded setting.


Runner Locating With Multiple Probes, Kola Akinrele, Axel Brandt, Elizabeth Breen, Catherine Erbes, Matthew Lee, Patrick O’Doherty, Weston Rainer Jan 2025

Runner Locating With Multiple Probes, Kola Akinrele, Axel Brandt, Elizabeth Breen, Catherine Erbes, Matthew Lee, Patrick O’Doherty, Weston Rainer

2025 Faculty Bibliography

In the runner locating variation of cops and robbers on a graph, a chaser attempts to locate an invisible runner by probing a single vertex v each turn, from which the chaser learns the runner’s distance. The runner is then permitted to stay at his current vertex or move to an adjacent vertex other than v. A graph is locatable if the chaser is able to locate the runner in a finite number of turns, and the location number of a graph is the minimum number of turns necessary to determine the runner’s location regardless of the runner’s evasion strategy. …


Rings With Q-Torsionfree Canonical Modules, Naoki William Endo, Laura P. Ghezzi, Shiro S. Goto, Jooyoun Hong Phd, Shin-Ichiro Iai, Toshinori Kobayashi, Naoyuki Matsuoka, Ryo Takahashi Jan 2025

Rings With Q-Torsionfree Canonical Modules, Naoki William Endo, Laura P. Ghezzi, Shiro S. Goto, Jooyoun Hong Phd, Shin-Ichiro Iai, Toshinori Kobayashi, Naoyuki Matsuoka, Ryo Takahashi

Publications and Research

Let A be a Noetherian local ring with canonical module K A . We characterize A when K A is a torsionless, reflexive, or q-torsionfree module for an integer q ≥ 3 . If A is a Cohen–Macaulay ring, H.-B. Foxby proved in 1974 that the A-module K A is q-torsionfree if and only if the ring A is q-Gorenstein. With mild assumptions, we provide a generalization of Foxby’s result to arbitrary Noetherian local rings admitting the canonical module. In particular, since the reflexivity of the canonical module is closely related to the ring being Gorenstein …


Vanishing Of Local Cohomology With Applications To Hodge Theory, Scott Hiatt Jan 2025

Vanishing Of Local Cohomology With Applications To Hodge Theory, Scott Hiatt

Mathematics Faculty Publications

Let H = ((H, F •), L) be a polarized variation of Hodge structure on a smooth quasi-projective variety U . By M. Saito’s theory of mixed Hodge modules, the variation of Hodge structure H can be viewed as a polarized Hodge module M ∈ HM (U ). Let X be a compactification of U , and j : U ↪→ X is the natural map. In this paper, we use local cohomology with mixed Hodge module theory to study j+M ∈ DbM HM (X). In particular, we study the graded pieces of the de Rham complex GrF p DR(j+M) …


A Computational Approach To The Game Of Cycles, Jocelyn Garcia, Mike Janssen, Eliza Kautz Jan 2025

A Computational Approach To The Game Of Cycles, Jocelyn Garcia, Mike Janssen, Eliza Kautz

Faculty Work Comprehensive List

In Mathematics for Human Flourishing, Francis E. Su introduced The Game of Cycles, a game played on a finite simple planar graph. In game play, opponents alternate adding direction to the edges of the graph with the goal of creating a cycle or making the last legal move. Recent work has sought to determine winning strategies on certain classes of graphs. We introduce a tabular representation of a game state and provide a computer program that determines which player has a winning strategy on any legal game board. The program builds a directed graph of all possible game states, utilizing …


Early Entering Research And Writing (Eerw) In College-Level Statistics, Rebecca Fang Jan 2025

Early Entering Research And Writing (Eerw) In College-Level Statistics, Rebecca Fang

2025 Faculty Bibliography

With the high demand for data-driven knowledge, students today need to comprehend skills in problem-solving, critical thinking, communication, and collaboration. However, in traditional statistics lectures, students learn descriptive algorithms, hypothesis, and linear regression at their early stage of college. Unfortunately, they often analyze numbers without considering the context, purpose, audience, and the meaning of the numbers. Therefore, providing students the early opportunity to research and write with data in college will allow them to deepen their understanding of the subjects, to think critically about the data and the results, to communicate effectively with diverse audience, and to prepare for their …


Securing Secrets: Exploring The Aes Encryption And Key Security Capabilities Of Chatgpt, Kayla Taylor Jan 2025

Securing Secrets: Exploring The Aes Encryption And Key Security Capabilities Of Chatgpt, Kayla Taylor

Student Works

The development and increasing accessibility of generative artificial intelligence (AI) tools and large language models (LLMs) have allowed cryptographers to explore a variety of cryptanalysis problems in dynamic and interactive ways. Prompt engineering, the process by which input text is tested and refined to elicit a desired response from LLMs, is a nascent area of research that remains largely unexplored in many contexts, including cryptography. This study will explore the potential applications and limitations of prompt engineering in the context of Advanced Encryption Standard (AES) encryption and key security with OpenAI’s ChatGPT (GPT-4o) through two main objectives: First, given a …


Weakly Reversible Deficiency Zero Realizations Of Polynomial Dynamical Systems, Neal Ryan Buxton Jan 2025

Weakly Reversible Deficiency Zero Realizations Of Polynomial Dynamical Systems, Neal Ryan Buxton

Graduate Theses, Dissertations, and Problem Reports (ETD)

Weakly reversible, deficiency zero (WR0) systems form a large class of polynomial ODEs modeling chemical reaction networks. Their behavior is exceptionally stable: they have unique positive steady states, which are locally asymptotically stable (they are also conjectured to be globally asymptotically stable). This powerful result (the Deficiency Zero Theorem) applies to a large class of high dimensional, nonlinear polynomial dynamics, and is independent of the choice of parameters in the model. In this dissertation we present two algorithms that expands the scope of the Deficiency Zero Theorem to:

1. Networks with WR0 realizations, i.e. networks that are not necessarily WR0 …


A Bridge Too Low, John Adam Jan 2025

A Bridge Too Low, John Adam

Mathematics & Statistics Faculty Publications

The article "A bridge too low" in the Physics Teacher journal discusses a low bridge near the River Greta in Keswick, England, with an arch shaped like a semiellipse. It presents questions about the maximum height a person of a certain height can walk under the bridge without hitting their head, the cross-sectional area of the arch, its eccentricity, and perimeter. The article also mentions the approximation by Indian mathematician Srinivasa Ramanujan for the perimeter of an ellipse and invites readers to find the answers online.


A Question Of Transparency: Solutions For Fermi Questions, March 2025, John Adam Jan 2025

A Question Of Transparency: Solutions For Fermi Questions, March 2025, John Adam

Mathematics & Statistics Faculty Publications

Question 1: Why is it easier to see through rain than fog?

Start thinking about this by imagining a fixed volume (V) of water being dispersed into, say, N identical droplets of diameter d. Surface area and volume considerations should lead to the answer in terms of V and d.

Solution to Question 1: N = VI(πd³/6) = 6V/πd³ ≈ 2V/d³.

The cross-sectional area A of each drop is πd²/4 ≈ 3d²/4, so the total area blocked off (assuming no overlapping drops—so this is an upper bound) is NA ≈ 1.5V/d, so the area blocked off is inversely proportional to …


Generalizations Of Finiteness Conditions And Extension Monads In Algebras With Infinitely Many Or Infinitary Operations, Danielle Christienne Bowerman Jan 2025

Generalizations Of Finiteness Conditions And Extension Monads In Algebras With Infinitely Many Or Infinitary Operations, Danielle Christienne Bowerman

Doctoral Dissertations

In this work, we extend the results of finiteness conditions and extension monads found in Insall from finitely many finitary operations to infinitely many finitary operations, as well as touching on infinitary operations. We also examine varieties of algebras, including the notion of strong varieties introduced in Insall, and common constructions of extension monads in varieties of algebras. We see that for finite collections of algebras of the same signature, the extension monad operation on a variety of algebras commutes with the direct product operation, and all retractions from an enlargement or extension monad are trivial. We also see that …


Isochronous And Period-Doubling Diagrams For Symplectic Maps Of The Plane, T. Zolkin, S. Nagaitsev, I. Morozov, S. Kladov, Y. -K. Kim Jan 2025

Isochronous And Period-Doubling Diagrams For Symplectic Maps Of The Plane, T. Zolkin, S. Nagaitsev, I. Morozov, S. Kladov, Y. -K. Kim

Physics Faculty Publications

Symplectic mappings of the plane serve as key models for exploring the fundamental nature of complex behavior in nonlinear systems. Central to this exploration is the effective visualization of stability regimes, which enables the interpretation of how systems evolve under varying conditions. While the area-preserving quadratic Hénon map has received significant theoretical attention, a comprehensive description of its mixed parameter-space dynamics remain lacking. This limitation arises from early attempts to reduce the full two-dimensional phase space to a one-dimensional projection, a simplification that resulted in the loss of important dynamical features. Consequently, there is a clear need for a more …


Gorenstein Flat Preenvelopes Over Coherent Rings, Alec Moore Jan 2025

Gorenstein Flat Preenvelopes Over Coherent Rings, Alec Moore

College of Graduate Studies: Theses & Dissertations

The existence of precovers and preenvelopes of Gorenstein flat modules is of great interest in the field of Gorenstein homological algebra. We give a sufficient condition in order for the class of Gorenstein flat modules to be preenveloping. More precisely, we prove that if the ring R is coherent such that every injective module has finite flat dimension, then every R-module has a Gorenstein flat preenvelope.


Machine Learning Methods For Intrusion Detection And Response In Network Security, Ayomide Oyemaja Jan 2025

Machine Learning Methods For Intrusion Detection And Response In Network Security, Ayomide Oyemaja

College of Graduate Studies: Theses & Dissertations

Intrusion Detection Systems (IDS) play a crucial role in computer network security by identifying malicious activities and potential cyberattacks. This thesis combines machine learning and cybersecurity by applying Reinforcement Learning (RL) in intrusion detection and response using the NSL-KDD dataset.

We designed and implemented a Q-learning framework where an agent learns to classify network traffic over time by interacting with the environment and receiving rewards based on detection accuracy. We also look at the importance of feature selection and classification techniques and how effective they are in improving model performance, reducing the complexity of computation, and producing more desirable results. …


Towards A Baker-Campbell-Hausdorff Theorem In Positive Characteristic, Nikolas A. Koutroulakis Jan 2025

Towards A Baker-Campbell-Hausdorff Theorem In Positive Characteristic, Nikolas A. Koutroulakis

College of Graduate Studies: Theses & Dissertations

We investigate whether there is an analog of the Baker-Campbell-Hausdorff (BCH) theorem for Lie algebras over fields of positive characteristic. We begin by introducing the proof of the BCH formula in characteristic zero. We then introduce the Artin-Hasse exponential and show that it is $p$-integral. Our main result provides sufficient conditions under which a BCH-type formula exists for the Artin-Hasse exponential in positive characteristic. Additionally, we derive a formula for computing an inverse of the Artin-Hasse exponential.


On The Combinatorial Invariance For Kazhdan-Lusztig Polynomials, Grover C. Harrell Iii Jan 2025

On The Combinatorial Invariance For Kazhdan-Lusztig Polynomials, Grover C. Harrell Iii

College of Graduate Studies: Theses & Dissertations

This thesis will be a discussion on the Combinatorial Invariance Conjecture for Kazhdan Lusztig polynomials. The conjecture is widely suspected to be true; and there is an abun dance of computational evidence which supports it. Despite this, no complete proof has been discovered for more than forty years. We will explore some known results about the CIC, particularly those by Dyer, Incitti, Brenti, Caselli, and Marietti.


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 Jan 2025

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 …


Development Of Conceptual Scaffolding-Assisted Formative Assessment For Enhancing Understanding Of Temperature And Heat, Ana Lailatul Fitriyah, Sentot Kusairi, Markus Diantoro Dec 2024

Development Of Conceptual Scaffolding-Assisted Formative Assessment For Enhancing Understanding Of Temperature And Heat, Ana Lailatul Fitriyah, Sentot Kusairi, Markus Diantoro

Jurnal Pendidikan Sains

This research aims to develop formative assessment media assisted by conceptual scaffolding to improve students’ understanding of temperature and heat, test its validity and practicality, and gauge student responses. Utilizing the ADDIE model, the research follows five stages: Analysis, Design, Development, Implementation, and Evaluation. In the Analysis stage, a literature review was conducted to identify critical components, including formative assessment, conceptual scaffolding, concept mastery, and previous research. The Design stage involved identifying users, defining competencies and indicators, creating a storyboard, integrating assessment components, and determining mastery levels. During the Development stage, the assessment media were developed into a functional product. …


Composite Volume Learning Media Based On Augmented Reality To Enhance Students’ Visual-Spatial Intelligence, Ria Kurniawati, Susiswo Susiswo, Syamsul Hadi Dec 2024

Composite Volume Learning Media Based On Augmented Reality To Enhance Students’ Visual-Spatial Intelligence, Ria Kurniawati, Susiswo Susiswo, Syamsul Hadi

Jurnal Pendidikan Sains

Augmented Reality (AR) technology, a three-dimensional visual tool that integrates virtual objects or environments into real-world displays in real time (Azuma et al., 2001), is particularly useful for grasping complex concepts such as the composite volume of solids, which often confuses students when they need to decompose solids into their individual components. While previous research has predominantly focused on the introduction of solids, spatial nets, and the volume of singular shapes, this study aims to develop composite volume learning media based on AR to enhance students’ visual-spatial intelligence in a valid, practical, and effective manner, aligning with their concrete operational …


Students’ Concept Maps Profile On Environmental Pollution Material During The Covid-19 Pandemic, Sunarni Sunarni, Sri Widoretno, Puguh Karyanto, Bowo Sugiharto, Sri Dwiastuti, Chandra Adi Prabowo Dec 2024

Students’ Concept Maps Profile On Environmental Pollution Material During The Covid-19 Pandemic, Sunarni Sunarni, Sri Widoretno, Puguh Karyanto, Bowo Sugiharto, Sri Dwiastuti, Chandra Adi Prabowo

Jurnal Pendidikan Sains

The study investigates the performance of students in constructing Concept Maps (CM) related to environmental pollution material during the COVID-19 pandemic. The data reveals that the overall achievement in CM construction was suboptimal, with no component reaching more than half of its maximum potential. The highest achievement was recorded in the valid relationship component, which attained 9.75% of its maximum possible score. This was followed by the hierarchy component, achieving 7.34%, and the branching component at 3.42%. The pattern component ranked fourth with 1.31%, closely followed by the example component at 1.30%. The lowest performance was observed in the crosslink …


Analysis Of Students’ Problem-Solving Skills In Newton’S Law With 5e Learning Cycle, Nidya Desyana, Sutopo Sutopo, Nandang Mufti Dec 2024

Analysis Of Students’ Problem-Solving Skills In Newton’S Law With 5e Learning Cycle, Nidya Desyana, Sutopo Sutopo, Nandang Mufti

Jurnal Pendidikan Sains

The aim of this study is to identify students’ problem-solving skills in Newton’s laws through the implementation of the 5E learning cycle in the classroom. A pre-experimental design with a one-group pretest-posttest approach was employed. Data on problem-solving skills were collected from students’ pre-test and post-test responses to two essay questions. The indicator with the highest percentage of problem-solving skills was useful description (83% of students), while the indicator with the lowest percentage was specific application of physics (33% of students). Due to the non-normal distribution of the data, the Wilcoxon test was utilized. The results indicated a significant difference …