Computer Sciences Commons^™

Mobile Solar Energy Environmental Control System With Remote Accessibility, Luis S. Garay

Theses and Dissertations

The proposed system, Mobile Solar Energy Environmental Control System with Remote Accessibility (mSEECS w/ RA), is based on the utilization of an already available Energy Storage Unit (ESU) in a Transport Unit System (TUS) to harness solar energy to provide a system to enhance the environment, safety and security of a TUS in a stationary or a mobile state by monitoring and controlling the operation of its onboard systems, and provide remote accessibility to know the state of affairs at any time. To relate to a real world application, the battery (ESU) of a vehicle (TUS) is underutilized …

Simplification Of Eeg Signal Extraction, Processing, And Classification Using A Consumer-Grade Headset To Facilitate Student Engagement In Bci Research, Jesus D. Rodriguez

Theses and Dissertations

Brain-computer interfaces (BCIs) are an emerging technology that leverage neurophysiological signals as input to computing systems. By circumventing the reliance on traditional input methods (e.g., mouse and keyboard), BCIs show a promising alternative interaction modality for people with disabilities. Advances in BCI research have further inspired a range of novel applications, such as the use of neurophysiological signals as passive input (e.g., to detect and reduce operator workload when managing multiple machines). BCIs have also emerged as a tool for student engagement due to the intrinsic interdisciplinarity of the technology, which spans the fields of computer science, electrical engineering, neuroscience, …

Approximate Set Union Via Approximate Randomization, Pengfei Gu

Theses and Dissertations

We develop an randomized approximation algorithm for the size of set union problem |A1 U A2 U...UAm|, which given a list of sets A1,...,Am with approximate set size m i for Ai with mi ∈ ((1–βL)|A i|,(1+βR)|Ai|), and biased random generators with Prob(x = RandomElement(Ai)) ∈ [1–a L/Ai, 1 +aR/Ai] for each input set Ai and element x ∈ Ai, where i = 1,2,...,m. The approximation |Ai | |Ai | ratio for |A1 U A2 U...UAm| is in the range [(1–ϵ)(1–aL)(1–βL),(1+ϵ)(1+β R)(1+βR)] for any ϵ ∈ (0,1), where α L,αR,βL,βR ∈ (0,1). The complexity of the algorithm …

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 …

Using Machine Learning To Predict Student Achievement On The State Of Texas Assessment Of Academic Readiness Examination In Charter Schools, Christopher D. Gonzalez

Theses and Dissertations

The purpose of this study was to research and develop a way to use machine learning algorithms (MLAs) to predict student achievement on the State of Texas Assessment of Academic Readiness (STAAR), specifically in the charter school setting. Charter schools have the disadvantage of a constant influx in students, so providing historical student data in order to analyze trends proves difficult. This study expands on previous research done on students in secondary and post-secondary school and determining features that indicate success in these settings. The data used is from the district of IDEA Public Schools who focuses on providing education …

An Open Source Approach To Serve A Large Number Of Computer Users Using Block-Level Streaming, Max D. Torres

Theses and Dissertations

There are several options for providing a large number of computers to users for their daily tasks. A typical setup may consist of a large number of computers where each relies on an HDD consisting of the required software, sufficient RAM, a capable CPU that meets the software requirements, and a stable network connection. This thesis proposes the use of the open-source AoE protocol to stream an OS to a user computer from a central server. Since the streaming is done from a well-protected central storage, the AoE protocol is less prone to failures compared to the traditional approach based …

Randomness, Information Encoding, And Shape Replication In Various Models Of Dna-Inspired Self-Assembly, Eric M. Martinez

Theses and Dissertations

Self-assembly is the process by which simple, unorganized components autonomously combine to form larger, more complex structures. Researchers are turning to self-assembly technology for the design of ever smaller, more complex, and precise nanoscale devices, and as an emerging fundamental tool for nanotechnology.

We introduce the robust random number generation problem, the problem of encoding a target string of bits in the form of a bit string pad, and the problem of shape replication in various models of tile-based self-assembly. Also included are preliminary results in each of these directions with discussion of possible future work directions.

Accelerating Object Extraction And Detection Using A Hierarchical Approach With Shape Descriptors, Bassam Syed Arshad

Theses and Dissertations

Automatic object recognition is a fundamental problem in the fields of computer vision and machine learning, that has received a lot of research attention lately. Miniaturization and affordability, of both, high resolution digital cameras and advanced computing hardware, have further advanced the scope and applications of object recognition methods. While there are different methods, that build upon various low level features to construct object models, this work explores and implements the use of closed-contours as formidable object features. A hierarchical technique is employed to extract the contours, exploiting the inherent spatial relationships between the parent and child contours of an …

Towards Building A Computer-Aided Accreditation System, Emmanuel Alejandro Santillana Fayett

Theses and Dissertations

Accreditation is a big subject. What is accreditation? Why should it matter to us? How many types of accreditation can an institution have? Is the government involved? What issues are present? How can we improve the accreditation process? All these questions will be covered in this paper. In addition, I will build towards a software that will apply the most important points in this paper, like applying the mission, objectives, and outcomes expected from the students in the form of a syllabus. This will help the faculty with the accreditation process and will help the students know what is expected …

Analysis Of Artificial Neural Networks In The Diagnosing Of Breast Cancer Using Fine Needle Aspirates, Janette Vazquez

Theses and Dissertations

This thesis examines how Artificial Neural Networks can be used to classify a set of samples from a fine needle aspirate dataset. The dataset is composed of various different attributes, each of which are used to come to the conclusion as to whether a sample is benign or malignant. To automate the process of analyzing the various attributes and coming to a correct prediction, a neural network was implemented. First, a Feedforward Neural Network was trained with the dataset using a Backpropagation training method and an activation sigmoid function with one hidden layer in the architecture of the network. After …

A Comparative Approach To Question Answering Systems, Josue Balandrano Coronel

Theses and Dissertations

In this paper I will analyze three different algorithms and approaches to implement Question Answering Systems (QA-Systems). I will analyze the efficiency, strengths, and weaknesses of multiple algorithms by explaining them in detail and comparing them with each other. The overarching aim of this thesis is to explore ideas that can be used to create a truly open context QA-System. Open context QA-Systems remain an open problem.

The various algorithms and approaches presented in this work will be focused on complex questions. Complex questions are usually verbose and the context of the question is equally important to answer the query …

Analysis And Simulation Of A Social Network, Twitter: A Case Study, Jonatan Reyes

Theses and Dissertations

The use of online social networks empowers its users to efficiently disseminate information across traditional social networks. Typically, the weight and value of messages are relative to its readers’ culture and interests. Nevertheless, in some instances, messages take the form of viral phenomenon, which circulates around the world in very short periods of time. Therefore, despite the actual content of the message spread over the network, the determination of the effectiveness of message dissemination across the social network becomes an attractive opportunity for scientific study. Since a meticulous analysis of a complete online social network would require the acquisition of …

Global Entropy Based Greedy Algorithm For Discretization, Sai Jyothsna Jonnalagadda

Theses and Dissertations

Discretization algorithm is a crucial step to not only achieve summarization of continuous attributes but also better performance in classification that requires discrete values as input. In this thesis, I propose a supervised discretization method, Global Entropy Based Greedy algorithm, which is based on the Information Entropy Minimization. Experimental results show that the proposed method outperforms state of the art methods with well-known benchmarking datasets. To further improve the proposed method, a new approach for stop criterion that is based on the change rate of entropy was also explored. From the experimental analysis, it is noticed that the threshold based …

3d Reconstruction Of Close Range Objects Using Free And Open Source Software And Raspberry Pi Technologies, Juan Lorenzo Monrreal

Theses and Dissertations

Existing 3D rendering open source software along with Raspberry Pi technology can be used to create an affordable method and workflow for time efficient, accurate and quality scans for 3D printing. The emergence of technology spurs a technological community working to progress in a collaborative effort. This brings a potential to the possibility of efficient and economical solutions to emerging problems, in this case, the ability to render three dimensional scans using free and open source software as well as Raspberry Pi technology. The focus of this paper will be divided into three different aspects including the background needed to …