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 …

Use Of A Simulated Directional Social Network To Compare Measures Of User Influence, Jose G. Villarreal Jr.

Theses and Dissertations - UTB/UTPA

This paper proposes a new method for measuring user influence in directional social networks, derived from the works of Reilly et al. and Cha et al. The method being proposed in this paper considers an element from each of the two works. The first is the ratio of ‘messages forwarded’ over ‘messages posted’. The second element is the size of the audience. The second part of this study entails modeling and simulating an online social network. Using a data sample from the Twitter network to implement the simulation, it is going to allow us to compare the methods that are …

Efficient Query Processing Over Uncertain Road Networks, Bamikole A. Ogundele

Theses and Dissertations - UTB/UTPA

One of the fundamental problems on spatial road networks has been the shortest traveling time query, with applications such as location-based services (LBS) and trip planning. Algorithms have been made for the shortest time queries in deterministic road networks, in which vertices and edges are known with certainty. Emerging technologies are available and make it easier to acquire information about the traffic. In this paper, we consider uncertain road networks, in which speeds of vehicles are imprecise and probabilistic. We will focus on one important query type, continuous probabilistic shortest traveling time query (CPSTTQ), which retrieves sets of objects that …

Gps-Miv: The General Purpose System For Multi-Display Interactive Visualization, Irving A. Gonzalez Garza

Theses and Dissertations - UTB/UTPA

The new age of information has created opportunities for inventions like the internet. These inventions allow us access to tremendous quantities of data. But, with the increase in information there is need to make sense of such vast quantities of information by manipulating that information to reveal hidden patterns to aid in making sense of it. Data visualization systems provide the tools to reveal patterns and filter information, aiding the processes of insight and decision making. The purpose of this thesis is to develop and test a data visualization system, The General Purpose System for Multi-display Interactive Visualization (GPS-MIV). GPS-MIV …

Efficient Evaluation Of Sparql Property Path Queries Over Prov-Dm Provenance Graphs In An Rdbms, Rodolfo E. Roman Velasco

Theses and Dissertations - UTB/UTPA

Millions of useful resources on the Web are enhanced with machine-processable annotations using W3C Resource Description Framework (RDF). It is crucial to design efficient data management techniques to support querying of existing RDF datasets using standard SPARQL queries. To address this challenge, we use a Relational Database Management System (RDBMS) for efficient and scalable storage and querying backend for RDF data. Our solution requires designing novel algorithms for translating SPARQL queries into equivalent SQL queries, such that the latter can be efficiently executed in an RDBMS. The focus of this work is on the translation of SPARQL property paths queries. …

Creating An Information Systems Security Culture Through An Integrated Model Of Employees Compliance, Mohammad I. Merhi

Theses and Dissertations - UTB/UTPA

Employees’ non-compliance with information systems security policies has been identified as a major threat to organizational data and information systems. This dissertation investigates the process underlying information systems security compliance in organizations with the focus on employees. The process model is complex, comprising many normative, attitudinal, psychological, environmental, and organizational factors. Therefore, the study of information security compliance requires a holistic assessment of all these factors. This dissertation seeks to achieve this objective by offering a comprehensive and integrated model of employee behavior especially focused towards information security compliance. The research framework is influenced by the Reciprocal Determinism Theory which …

Exponential Replication Of Patterns In The Signal Tile Assembly Model And Experimental Non-Deterministic Assembly Of Lines In The Probabilistic Tile Assembly Model, Alexandra B. Keenan

Theses and Dissertations - UTB/UTPA

We introduce the problem of self-replication of rectangular two-dimensional patterns in the practically motivated Signal Tile Assembly Model (STAM), which is an extension of the aTAM. In the first part of this thesis, we construct an exponential pattern replicator that replicates a two-dimensional input pattern over some fixed alphabet of size ϕ with O(ϕ) tile types, O(ϕ) unique glues, and a signal complexity of O(1). In the second part of this thesis, we use a non-deterministic model of tile assembly to significantly reduce the tile complexity of specified-length linear assemblies, which are a particularly important substructure for building more complicated …

Probabilistic Shortest Time Queries Over Uncertain Road Networks, Yaqing Chen

Theses and Dissertations - UTB/UTPA

In many real applications such as location-based services (LBS), map utilities, trip planning, and transportation systems, it is very useful and important to provide query services over spatial road networks. Nowadays we can easily obtain rich traffic information such as the speeds of vehicles on roads. However, due to the inaccuracy of devices or integration in consistencies, the traffic data (i.e., speeds) are often imprecise and uncertain. In this paper, we model road networks by uncertain graphs, which contain edges that are associated with probabilistic velocities. We formalize the problem of probabilistic shortest time query, and we propose time bound …

The Relational Algebra Toolkit: A User-Friendly Approach To Presenting And Processing Relational Algebra Queries On The Web, Jeremy J. Miller

Theses and Dissertations - UTB/UTPA

Relational algebra is the mathematical basis of tools to express and optimize queries on relational data. However, there exists no convenient way to directly use, express, store, render, visualize, and execute relational algebra over the Web. Educators and practitioners are limited to creating relational algebra expressions using TeX or equation editors which cannot execute them. This work presents a solution to this issue: the Relational Algebra Toolkit (RAT). Relational data and queries are represented using purpose-built XML vocabularies, to be both machine-processable and serializable. Encoded relational algebra expressions can be rendered as parenthetical expressions and as syntax trees, translated to …

Algorithms In Abstract Dna Self Assembly, Xingsi Zhong

Theses and Dissertations - UTB/UTPA

For the past two years, I have always been working on the topic of Abstract DNA Tiles Self-Assembly. This is a very new area, driven by the interest of DNA molecules. The feature that the system composed by DNA molecules can be a highly parallelized system, make it much more powerful when comparing with the traditional methods. This thesis will introduce the concept of abstract DNA self-assembly models as well as some interesting problems and their solutions.

Probabilistic Model And Algorithms Design For Motif Detection, Yuan Xue

Theses and Dissertations - UTB/UTPA

In this thesis, a natural probabilistic model has been used to test the quality of motif discovery programs. In this model, there are k background sequences, in which each character is a random character from Σ. Motif is a string G = g1g2 . . . gm. Each background sequence is implanted a probabilistically generated approximate copy of G. For each copy b1b2 . . . bm of G, every character bi is probabilistically generated such that the probability for bi 6= gi is at most α. Based on this model, two randomized algorithms ,one deterministic algorithm and one enumerative …

Understanding User Resistance To Information Technology: Toward A Comprehensive Model In Health Information Technology, Madison N. Ngafeeson

Theses and Dissertations - UTB/UTPA

The successful implementation of health information systems is expected to increase legibility, reduce medical errors, boost the quality of healthcare and shrink costs. Yet, evidence points to the fact that healthcare professionals resist the full use of these systems. Physicians and nurses have been reported to resist the system. Even though resistance to technology has always been identified as key issue in the successful implementation of information technology, the subject remains largely under-theorized and deficient of empirical testing. Only two proposed model have been tested so far. Hence, though user resistance is clearly identified and defined in literature, not very …

Vizlab: The Design And Implementation Of An Immersive Virtual Environment System Using Game Engine Technology And Open Source Software, Moises D. Carrillo

Theses and Dissertations - UTB/UTPA

Virtual Reality (VR) is a term used to describe computer-simulated environments that can immerse users in a real or unreal world. Immersive systems are an essential component when experiencing virtual environments. Developing VR applications is time-consuming, and developers use many resources in creating VR applications. The separate components require integration, and the challenges in using public domain open source software present complex software development. The VizLab Virtual Reality System was created to meet these challenges and provide an integrated suite of tools for VR system development. VizLab supports the development of VR applications by using game engine and CAVE system …

Nascent Nanocomputers: Dna Self-Assembly In O(1) Stages, Michael C. Barnes

Theses and Dissertations - UTB/UTPA

DNA self-assembly offers a potential for nanoscale microcircuits and computers. To make that potential possible requires the development of reliable and efficient tile assembly models. Efficiency is often achieved by minimizing tile complexity, as well as by evaluating the cost and reliability of the specific elements of each tile assembly model. We consider a 2D tile assembly model at temperature 1. The standard 2D tile assembly model at temperature 1 has a tile complexity of O(n) for the construction of exact, complete n x n squares. However, previous research found a staged tile assembly model achieved a tile complexity of …