Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Encoding Lexicographical Ordering Constraints In Sat, Wenting Zhao
Encoding Lexicographical Ordering Constraints In Sat, Wenting Zhao
Honors Projects
Symmetry occurs in many constraint satisfaction problems, and it is important to deal with it efficiently and effectively, as it often leads to an exponential number of isomorphic assignments. Symmetric rows and columns in matrices are an important class of symmetries in constraint programming. In this work, we develop a new SAT encoding for partial lexicographical ordering constraints to break symmetries in such places. We also survey all the previous complete lex-leader encodings in literature and translate them into SAT encodings. We perform experimental analysis on how these lex-leader constraints impact the solving of Balanced Incomplete Block Design (BIBD) instances. …
Statistical Analysis Of Momentum In Basketball, Mackenzi Stump
Statistical Analysis Of Momentum In Basketball, Mackenzi Stump
Honors Projects
The “hot hand” in sports has been debated for as long as sports have been around. The debate involves whether streaks and slumps in sports are true phenomena or just simply perceptions in the mind of the human viewer. This statistical analysis of momentum in basketball analyzes the distribution of time between scoring events for the BGSU Women’s Basketball team from 2011-2017. We discuss how the distribution of time between scoring events changes with normal game factors such as location of the game, game outcome, and several other factors. If scoring events during a game were always randomly distributed, or …
Encryption Backdoors: A Discussion Of Feasibility, Ethics, And The Future Of Cryptography, Jennifer A. Martin
Encryption Backdoors: A Discussion Of Feasibility, Ethics, And The Future Of Cryptography, Jennifer A. Martin
Honors Projects
In the age of technological advancement and the digitization of information, privacy seems to be all but an illusion. Encryption is supposed to be the white knight that keeps our information and communications safe from unwanted eyes, but how secure are the encryption algorithms that we use? Do we put too much trust in those that are charged with implementing our everyday encryption systems? This paper addresses the concept of backdoors in encryption: ways that encryption systems can be implemented so that the security can be bypassed by those that know about its existence. Many governments around the world are …
Ds-Pso: Particle Swarm Optimization With Dynamic And Static Topologies, Dominick Sanchez
Ds-Pso: Particle Swarm Optimization With Dynamic And Static Topologies, Dominick Sanchez
Honors Projects
Particle Swarm Optimization (PSO) is often used for optimization problems due to its speed and relative simplicity. Unfortunately, like many optimization algorithms, PSO may potentially converge too early on local optima. Using multiple neighborhoods alleviates this problem to a certain extent, although premature convergence is still a concern. Using dynamic topologies, as opposed to static neighborhoods, can encourage exploration of the search space at the cost of exploitation. We propose a new version of PSO, Dynamic-Static PSO (DS-PSO) that assigns multiple neighborhoods to each particle. By using both dynamic and static topologies, DS-PSO encourages exploration, while also exploiting existing knowledge …
Visualizing Sorting Algorithms, Brian Faria
Visualizing Sorting Algorithms, Brian Faria
Honors Projects
This paper discusses a study performed on animating sorting algorithms as a learning aid for classroom instruction. A web-based animation tool was created to visualize four common sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort, and Merge Sort. The animation tool would represent data as a bar-graph and after selecting a data-ordering and algorithm, the user can run an automated animation or step through it at their own pace. Afterwards, a study was conducted with a voluntary student population at Rhode Island College who were in the process of learning algorithms in their Computer Science curriculum. The study consisted of …