Other Computer Sciences Commons^™

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log₂(α)³ + 16.5log₂(α)² + …

Accurate And Justifiable : New Algorithms For Explainable Recommendations., Behnoush Abdollahi

Electronic Theses and Dissertations

Websites and online services thrive with large amounts of online information, products, and choices, that are available but exceedingly difficult to find and discover. This has prompted two major paradigms to help sift through information: information retrieval and recommender systems. The broad family of information retrieval techniques has given rise to the modern search engines which return relevant results, following a user's explicit query. The broad family of recommender systems, on the other hand, works in a more subtle manner, and do not require an explicit query to provide relevant results. Collaborative Filtering (CF) recommender systems are based on algorithms …

Database Auto Awesome: Enhancing Database-Centric Web Applications Through Informed Code Generation, Jonathan Adams

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Database Auto Awesome is an approach to enhancing web applications comprised of forms used to interact with stored information. It was inspired by Google's Auto Awesome tool, which provides automatic enhancements for photos. Database Auto Awesome aims to automatically or semi-automatically provide improvements to an application by expanding the functionality of the application and improving the existing code.

This thesis describes a tool that gathers information from the application and provides details on how the parts of the application work together. This information provides the details necessary to generate new portions of an application.

These enhancements are directed by the …

Data Extraction From Web Tables: The Devil Is In The Details, George Nagy, Sharad C. Seth, Dongpu Jin, David W. Embley, Spencer Machado, Mukkai Krishnamoorthy

School of Computing: Conference and Workshop Papers

We present a method based on header paths for efficient and complete extraction of labeled data from tables meant for humans. Although many table configurations yield to the proposed syntactic analysis, some require access to semantic knowledge. Clicking on one or two critical cells per table, through a simple interface, is sufficient to resolve most of these problem tables. Header paths, a purely syntactic representation of visual tables, can be transformed (“factored”) into existing representations of structured data such as category trees, relational tables, and RDF triples. From a random sample of 200 web tables from ten large statistical web …

End-To-End Conversion Of Html Tables For Populating A Relational Database, George Nagy, David W. Embley, Sharad C. Seth

School of Computing: Conference and Workshop Papers

Automating the conversion of human-readable HTML tables into machine-readable relational tables will enable end-user query processing of the millions of data tables found on the web. Theoretically sound and experimentally successful methods for index-based segmentation, extraction of category hierarchies, and construction of a canonical table suitable for direct input to a relational database are demonstrated on 200 heterogeneous web tables. The methods are scalable: the program generates the 198 Access compatible CSV files in ~0.1s per table (two tables could not be indexed).

An Analysis Of The Application Of Simplified Silhouette To The Evaluation Of K-Means Clustering Validity, Fei Wang, Hector-Hugo Franco-Penya, John D. Kelleher, John Pugh, Robert J. Ross

Conference papers

Silhouette is one of the most popular and effective internal measures for the evaluation of clustering validity. Simplified Silhouette is a computationally simplified version of Silhouette. However, to date Simplified Silhouette has not been systematically analysed in a specific clustering algorithm. This paper analyses the application of Simplified Silhouette to the evaluation of k-means clustering validity and compares it with the k-means Cost Function and the original Silhouette from both theoretical and empirical perspectives. The theoretical analysis shows that Simplified Silhouette has a mathematical relationship with both the k-means Cost Function and the original Silhouette, while empirically, we show that …

Distributed Knowledge Discovery For Diverse Data, Hossein Hamooni

Computer Science ETDs

In the era of new technologies, computer scientists deal with massive data of size hundreds of terabytes. Smart cities, social networks, health care systems, large sensor networks, etc. are constantly generating new data. It is non-trivial to extract knowledge from big datasets because traditional data mining algorithms run impractically on such big datasets. However, distributed systems have come to aid this problem while introducing new challenges in designing scalable algorithms. The transition from traditional algorithms to the ones that can be run on a distributed platform should be done carefully. Researchers should design the modern distributed algorithms based on the …

Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Magic tricks based on computer science concepts help grab student attention and can motivate them to delve more deeply. Error detection ideas long used by computer scientists provide a rich basis for working magic; probably the most well known trick of this type is one included in the CS Unplugged activities. This paper shows that much more powerful variations of the trick can be performed, some in an unplugged environment and some with computer assistance. Some of the tricks also show off additional concepts in computer science and discrete mathematics.

(Dis)Enchanted: (Re)Constructing Love And Creating Community In The, Shannon A. Suddeth

USF Tampa Graduate Theses and Dissertations

This thesis examines a queer fan community for the television show Once Upon a Time (OUAT) that utilizes the social networking site Tumblr as their primary base of fan activity. The Swan Queen fan community is comprised of individuals that collectively support and celebrate a non-canon romantic relationship between two of the female lead characters of the show rather than the canonic, heterocentric relationships that occur between the two women and their respective male love interests. I answer two research questions in this study: First, how are members of the Swan Queen fan community developing counter narratives of …

Travel Mode Identification With Smartphone Sensors, Xing Su

Dissertations, Theses, and Capstone Projects

Personal trips in a modern urban society typically involve multiple travel modes. Recognizing a traveller's transportation mode is not only critical to personal context-awareness in related applications, but also essential to urban traffic operations, transportation planning, and facility design. While the state of the art in travel mode recognition mainly relies on large-scale infrastructure-based fixed sensors or on individuals' GPS devices, the emergence of the smartphone provides a promising alternative with its ever-growing computing, networking, and sensing powers. In this thesis, we propose new algorithms for travel mode identification using smartphone sensors. The prototype system is built upon the latest …

Underwater Computer Vision - Fish Recognition, Spencer Chang, Austin Otto

Computer Engineering

The Underwater Computer Vision – Fish Recognition project includes the design and implementation of a device that can withstand staying underwater for a duration of time, take pictures of underwater creatures, such as fish, and be able to identify certain fish. The system is meant to be cheap to create, yet still able to process the images it takes and identify the objects in the pictures with some accuracy. The device can output its results to another device or an end user.

Procedurally Generating Genetic Keys, Adam A. Levasseur

Computer Engineering

This project presents a method for creating multi-part models based on input keys to generate new, variant models via genetic algorithms. By utilizing 3D models as modular parts, this method allows for the generation of a unique, compound model based on one or multiple input keys. This paper explains the process of creating and testing such generation styles using simple geometry to create more complex, compound models.

P4sinc – An Execution Policy Framework For Iot Services In The Edge, Phu Huu Phung, Hong-Linh Truong, Divya Teja Yasoju

Computer Science Faculty Publications

Internet of Things (IoT) services are increasingly deployed at the edge to access and control Things. The execution of such services needs to be monitored to provide information for security, service contract, and system operation management. Although different techniques have been proposed for deploying and executing IoT services in IoT gateways and edge servers, there is a lack of generic policy frameworks for instrumentation and assurance of various types of execution policies for IoT services. In this paper, we present P4SINC as an execution policy framework that covers various functionalities for IoT services deployed in software-defined machines in IoT infrastructures. …

Automated Grading Of Handwritten Numerical Answers, Mark T. Brown

Computer Engineering

The objective of this project was to automate the process of grading handwritten numerical answers in a classroom setting. The final program accepts a scanned answer sheet completed by the student along with a description of the correct answers and produces a detailed report describing the confidence of correctness for each answer.

Computer vision techniques are used to automatically locate the locations of the answers in the scan. Each digit is then passed through a convolutional neural network to predict what was written by the student. The individual probabilities of each digit produced by the network are aggregated into a …

Custom T-Shirt Designs, Ranjan Khadka

Electronic Theses, Projects, and Dissertations

Custom T-shirt Designs is a web-based application. The purpose of this project is to provide a website that would allow customers to be able to customize T-shirt and place an order of custom T-shirt. Customers can sign up, sign in, select T-shirt color, add text, choose Font, choose Font color, upload an image, apply filters to images, transform text or images, choose T-shirt size and save designs for future references. Customers would be able to add the design to a cart, manage cart and checkout with their credit card to purchase for the order and view their previous orders. The …

Predicting Pancreatic Cancer Using Support Vector Machine, Akshay Bodkhe

Master's Projects

This report presents an approach to predict pancreatic cancer using Support Vector Machine Classification algorithm. The research objective of this project it to predict pancreatic cancer on just genomic, just clinical and combination of genomic and clinical data. We have used real genomic data having 22,763 samples and 154 features per sample. We have also created Synthetic Clinical data having 400 samples and 7 features per sample in order to predict accuracy of just clinical data. To validate the hypothesis, we have combined synthetic clinical data with subset of features from real genomic data. In our results, we observed that …

Path-Finding Methodology For Visually-Impaired Patients Based On Image-Processing, Abhilash Goyal

Master's Projects

The objective of this project is to propose and develop the path-finding methodology for the visually impaired patients. The proposed novel methodology is based on image-processing and it is targeted for the patients who are not completely blind. The major problem faced by visually impaired patients is to walk independently. It is mainly because these patients can not see obstacles in front of them due to the degradation in their eye sight. Degradation in the eye-sight is mainly because either the light doesn't focus on the retina properly or due to the malfunction of the photoreceptor cells on the retina, …

Web - Based Office Market, Manodivya Kathiravan

Master's Projects

People who work in an office often have different pools of resources that they want to exchange. They want to trade their resources/work(seller) with a person who wants that particular resource(buyer) and in return get another resource the buyer offers. These kind of exchanges are often called Barter-exchanges where an item is traded for another item without the involvement of actual money. An exchange is set to be complete when there is a match between an available item and a desired item. This exchange is called direct exchange. When an item desired by one user is made available through a …

Computational Analysis Of Cryptic Splice Sites, Remya Mohanan

Master's Projects

DNA in the nucleus of all eukaryotes is transcribed into mRNA where it is then translated into proteins. The DNA which is transcribed into mRNA is composed of coding and non-coding regions called exons and introns, respectively. It undergoes a post-trancriptional process called splicing where the introns or the non-coding regions are removed from the pre-mRNA to give the mature mRNA. Splicing of pre-mRNAs at 5 ́ and 3ˊ ends is a crucial step in the gene expression pathway. The mis-splicing by the spliceosome at different sites known as cryptic splice sites is caused by mutations which will affect the …