Digital Commons Network^™

Using Pedagogical Tools To Help Hispanics Be Successful In Computer Science, Rodger Irish

Theses and Dissertations

Irish, Rodger, Using Pedagogical Tools to Help Hispanics Be Successful in Computer Science. Master of Science (MS), July 2017, 68 pp., 4 tables, 2 figures, references 48 titles. Computer science (CS) jobs are a growing field and pay a living wage, but the Hispanics are underrepresented in this field. This project seeks to give an overview of several contributing factors to this problem. It will then explore some possible solutions to this problem and how a combination of some tools (teaching methods) can create the best possible outcome. It is my belief that this approach can produce successful Hispanics to …

A Study On The Effects Of Mutation On Populations Using Strategies While Playing Iterative Prisoner's Dilemma, Ramses Romulus De Guzman Reyes

Theses and Dissertations

This thesis examines the effects different types of mutation and mutation rates have on populations using strategies while playing the Iterative Prisoners Dilemma (IPD). The system used in order to conduct this study was used in Leas et al. (2016), which uses genetic algorithms as a means of studying memory and its impact on populations playing IPD. For this study, experiments are organized into three different environments: Control, Static and Dynamic. The Control Environment focuses on analyzing the system and forming initial results. The Static Environment focuses on studying the effects of different rates on strategic populations playing IPD, while …

Randomized Approach Tor Set Cover With Multiple Phases*, Ujjwol Subedi

Theses and Dissertations

We Develop an interactive algorithm for the set cover problem. The algorithm uses multiple stages and select some sets each stage via random samples among the uncovered points. We show that it has a O(log n)—approximation ratio and takes O(log n) rounds and O(m2+ϵ ) samples each round, where n is the size of universal set and m is the number of sets.

We also prove a Ω(√logn/loglogn) lower bound for both the number of phases if each phase has poly(m) the number of samples.

Fractals, Randomization, Optimal Constructions, And Replication In Algorithmic Self-Assembly, Cameron Chalk

Theses and Dissertations

The problem of the strict self-assembly of infinite fractals within tile self-assembly is considered. In particular, tile assembly algorithms are provided for the assembly of the discrete Sierpinski triangle and the discrete Sierpinski carpet.

The robust random number generation problem in the abstract tile assembly model is introduced. First, it is shown this is possible for a robust fair coin flip within the aTAM, and that such systems guarantee a worst case O(1) space usage. This primary construction is accompanied with variants that show trade-offs in space complexity, initial seed size, temperature, tile complexity, bias, and extensibility.

This work …