Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 871 - 900 of 2153

Full-Text Articles in Computer Sciences

Applying Imitation And Reinforcement Learning To Sparse Reward Environments, Haven Brown May 2020

Applying Imitation And Reinforcement Learning To Sparse Reward Environments, Haven Brown

Computer Science and Computer Engineering Undergraduate Honors Theses

The focus of this project was to shorten the time it takes to train reinforcement learning agents to perform better than humans in a sparse reward environment. Finding a general purpose solution to this problem is essential to creating agents in the future capable of managing large systems or performing a series of tasks before receiving feedback. The goal of this project was to create a transition function between an imitation learning algorithm (also referred to as a behavioral cloning algorithm) and a reinforcement learning algorithm. The goal of this approach was to allow an agent to first learn to …

Go to article

On The Explanation And Implementation Of Three Open-Source Fully Homomorphic Encryption Libraries, Alycia Carey May 2020

On The Explanation And Implementation Of Three Open-Source Fully Homomorphic Encryption Libraries, Alycia Carey

Computer Science and Computer Engineering Undergraduate Honors Theses

While fully homomorphic encryption (FHE) is a fairly new realm of cryptography, it has shown to be a promising mode of information protection as it allows arbitrary computations on encrypted data. The development of a practical FHE scheme would enable the development of secure cloud computation over sensitive data, which is a much-needed technology in today's trend of outsourced computation and storage. The first FHE scheme was proposed by Craig Gentry in 2009, and although it was not a practical implementation, his scheme laid the groundwork for many schemes that exist today. One main focus in FHE research is the …

Go to article

Heuristics For Sparsest Cut Approximations In Network Flow Applications, Fernando Vilas May 2020

Heuristics For Sparsest Cut Approximations In Network Flow Applications, Fernando Vilas

Computer Science and Engineering Theses and Dissertations

The Maximum Concurrent Flow Problem (MCFP) is a polynomially bounded problem that has been used over the years in a variety of applications. Sometimes it is used to attempt to find the Sparsest Cut, an NP-hard problem, and other times to find communities in Social Network Analysis (SNA) in its hierarchical formulation, the HMCFP. Though it is polynomially bounded, the MCFP quickly grows in space utilization, rendering it useful on only small problems. When it was defined, only a few hundred nodes could be solved, where a few decades later, graphs of one to two thousand nodes can still be …

Go to article

Shakespeare In The Eighteenth Century: Algorithm For Quotation Identification, Marion Pauline Chiariglione May 2020

Shakespeare In The Eighteenth Century: Algorithm For Quotation Identification, Marion Pauline Chiariglione

Graduate Theses and Dissertations

Quoting a borrowed excerpt of text within another literary work was infrequently done prior to the beginning of the eighteenth century. However, quoting other texts, particularly Shakespeare, became quite common after that. Our work develops automatic approaches to identify that trend. Initial work focuses on identifying exact and modified sections of texts taken from works of Shakespeare in novels spanning the eighteenth century. We then introduce a novel approach to identifying modified quotes by adapting the Edit Distance metric, which is character based, to a word based approach. This paper offers an introduction to previous uses of this metric within …

Go to article

Dependency Mapping Software For Jira, Project Management Tool, Bentley Lager May 2020

Dependency Mapping Software For Jira, Project Management Tool, Bentley Lager

Computer Science and Computer Engineering Undergraduate Honors Theses

Efficiently managing a software development project is extremely important in industry and is often overlooked by the software developers on a project. Pieces of development work are identified by developers and are then handed off to project managers, who are left to organize this information. Project managers must organize this to set expectations for the client, and ensure the project stays on track and on budget. The main block in this process are dependency chains between tasks. Dependency chains can cause a project to take much longer than anticipated or result in the under utilization of developers on a project. …

Go to article

Achieving Causal Fairness In Machine Learning, Yongkai Wu May 2020

Achieving Causal Fairness In Machine Learning, Yongkai Wu

Graduate Theses and Dissertations

Fairness is a social norm and a legal requirement in today's society. Many laws and regulations (e.g., the Equal Credit Opportunity Act of 1974) have been established to prohibit discrimination and enforce fairness on several grounds, such as gender, age, sexual orientation, race, and religion, referred to as sensitive attributes. Nowadays machine learning algorithms are extensively applied to make important decisions in many real-world applications, e.g., employment, admission, and loans. Traditional machine learning algorithms aim to maximize predictive performance, e.g., accuracy. Consequently, certain groups may get unfairly treated when those algorithms are applied for decision-making. Therefore, it is an imperative …

Go to article

Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu May 2020

Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu

Research Collection School Of Computing and Information Systems

Learning graphs from data automatically have shown encouraging performance on clustering and semisupervised learning tasks. However, real data are often corrupted, which may cause the learned graph to be inexact or unreliable. In this paper, we propose a novel robust graph learning scheme to learn reliable graphs from the real-world noisy data by adaptively removing noise and errors in the raw data. We show that our proposed model can also be viewed as a robust version of manifold regularized robust principle component analysis (RPCA), where the quality of the graph plays a critical role. The proposed model is able to …

Go to article

A Matheuristic Algorithm For Solving The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu May 2020

A Matheuristic Algorithm For Solving The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu

Research Collection School Of Computing and Information Systems

This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD. The aim is to find a set of routes to deliver single products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic approach that uses the routes of the local optima of an adaptive large neighborhood search (ALNS) as columns in a set-partitioning formulation of the VRPCD is designed. This matheuristic outperforms the state-of-the-art algorithms in solving a subset of …

Go to article

Advancing Performance Of Retail Recommendation Systems, Lisa Leininger, Johnny Gipson, Kito Patterson, Brad Blanchard Apr 2020

Advancing Performance Of Retail Recommendation Systems, Lisa Leininger, Johnny Gipson, Kito Patterson, Brad Blanchard

SMU Data Science Review

This paper presents two recommendation models, one traditional and one novel, for a retail men's clothing company. J. Hilburn is a custom-fit, menswear clothing company headquartered in Dallas, Texas. J. Hilburn employs stylists across the United States, who engage directly with customers to assist in selecting clothes that fit their size and style. J. Hilburn tasked the authors of this paper to leverage data science techniques to the given data set to provide stylists with more insight into clients’ purchase patterns and increase overall sales. This paper presents two recommendation systems which provide stylists with automatic predictions about possible clothing …

Go to article

Improving Syntactic Relationships Between Language And Objects, Benjamin Wilke, Tej Tenmattam, Anand Rajan, Andrew Pollock, Joel Lindsey Apr 2020

Improving Syntactic Relationships Between Language And Objects, Benjamin Wilke, Tej Tenmattam, Anand Rajan, Andrew Pollock, Joel Lindsey

SMU Data Science Review

This paper presents the integration of natural language processing and computer vision to improve the syntax of the language generated when describing objects in images. The goal was to not only understand the objects in an image, but the interactions and activities occurring between the objects. We implemented a multi-modal neural network combining convolutional and recurrent neural network architectures to create a model that can maximize the likelihood of word combinations given a training image. The outcome was an image captioning model that leveraged transfer learning techniques for architecture components. Our novelty was to quantify the effectiveness of transfer learning …

Go to article

Data-Driven Investment Decisions In P2p Lending: Strategies Of Integrating Credit Scoring And Profit Scoring, Yan Wang Apr 2020

Data-Driven Investment Decisions In P2p Lending: Strategies Of Integrating Credit Scoring And Profit Scoring, Yan Wang

Doctor of Data Science and Analytics Dissertations

In this dissertation, we develop and discuss several loan evaluation methods to guide the investment decisions for peer-to-peer (P2P) lending. In evaluating loans, credit scoring and profit scoring are the two widely utilized approaches. Credit scoring aims at minimizing the risk while profit scoring aims at maximizing the profit. This dissertation addresses the strengths and weaknesses of each scoring method by integrating them in various ways in order to provide the optimal investment suggestions for different investors. Before developing the methods for loan evaluation at the individual level, we applied the state-of-the-art method called the Long Short Term Memory (LSTM) …

Go to article

Philosophical Perspectives, Jochen Albrecht Apr 2020

Philosophical Perspectives, Jochen Albrecht

Publications and Research

This entry follows in the footsteps of Anselin’s famous 1989 NCGIA working paper entitled “What is special about spatial?” (a report that is very timely again in an age when non-spatial data scientists are ignorant of the special characteristics of spatial data), where he outlines three unrelated but fundamental characteristics of spatial data. In a similar vein, I am going to discuss some philosophical perspectives that are internally unrelated to each other and could warrant individual entries in this Body of Knowledge. The first one is the notions of space and time and how they have evolved in …

Go to article

Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann Apr 2020

Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann

Mathematics & Statistics ETDs

This thesis uses a geometric approach to derive and solve nonlinear least squares minimization problems to geolocate a signal source in three dimensions using time differences of arrival at multiple sensor locations. There is no restriction on the maximum number of sensors used. Residual errors reach the numerical limits of machine precision. Symmetric sensor orientations are found that prevent closed form solutions of source locations lying within the null space. Maximum uncertainties in relative sensor positions and time difference of arrivals, required to locate a source within a maximum specified error, are found from these results. Examples illustrate potential requirements …

Go to article

Fast Clustering Using A Grid-Based Underlying Density Function Approximation, Daniel Brown Apr 2020

Fast Clustering Using A Grid-Based Underlying Density Function Approximation, Daniel Brown

Master of Science in Computer Science Theses

Clustering is an unsupervised machine learning task that seeks to partition a set of data into smaller groupings, referred to as “clusters”, where items within the same cluster are somehow alike, while differing from those in other clusters. There are many different algorithms for clustering, but many of them are overly complex and scale poorly with larger data sets. In this paper, a new algorithm for clustering is proposed to solve some of these issues. Density-based clustering algorithms use a concept called the “underlying density function”, which is a conceptual higher-dimension function that describes the possible results from the continuous …

Go to article

Achieving Obfuscation Through Self-Modifying Code: A Theoretical Model, Heidi Waddell Apr 2020

Achieving Obfuscation Through Self-Modifying Code: A Theoretical Model, Heidi Waddell

Senior Honors Theses

With the extreme amount of data and software available on networks, the protection of online information is one of the most important tasks of this technological age. There is no such thing as safe computing, and it is inevitable that security breaches will occur. Thus, security professionals and practices focus on two areas: security, preventing a breach from occurring, and resiliency, minimizing the damages once a breach has occurred. One of the most important practices for adding resiliency to source code is through obfuscation, a method of re-writing the code to a form that is virtually unreadable. …

Go to article

Storage Management Strategy In Mobile Phones For Photo Crowdsensing, En Wang, Zhengdao Qu, Xinyao Liang, Xiangyu Meng, Yongjian Yang, Dawei Li, Weibin Meng Apr 2020

Storage Management Strategy In Mobile Phones For Photo Crowdsensing, En Wang, Zhengdao Qu, Xinyao Liang, Xiangyu Meng, Yongjian Yang, Dawei Li, Weibin Meng

Department of Computer Science Faculty Scholarship and Creative Works

In mobile crowdsensing, some users jointly finish a sensing task through the sensors equipped in their intelligent terminals. In particular, the photo crowdsensing based on Mobile Edge Computing (MEC) collects pictures for some specific targets or events and uploads them to nearby edge servers, which leads to richer data content and more efficient data storage compared with the common mobile crowdsensing; hence, it has attracted an important amount of attention recently. However, the mobile users prefer uploading the photos through Wifi APs (PoIs) rather than cellular networks. Therefore, photos stored in mobile phones are exchanged among users, in order to …

Go to article

Feature Extraction And Analysis Of Binaries For Classification, Micah Flack Apr 2020

Feature Extraction And Analysis Of Binaries For Classification, Micah Flack

Annual Research Symposium

The research project, Feature Extraction and, Analysis of Binaries for Classification, provides an in-depth examination of the features shared by unlabeled binary samples, for classification into the categories of benign or malicious software using several different methods. Because of the time it takes to manually analyze or reverse engineer binaries to determine their function, the ability to gather features and then instantly classify samples without explicitly programming the solution is incredibly valuable. It is possible to use an online service; however, this is not always viable depending on the sensitivity of the binary. With Python3 and the Pefile library, we …

Go to article

Cylindrical Similarity Measurement For Helices In Medium-Resolution Cryo-Electron Microscopy Density Maps, Salim Sazzed, Peter Scheible, Maytha Alshammari, Willy Wriggers, Jing He Apr 2020

Cylindrical Similarity Measurement For Helices In Medium-Resolution Cryo-Electron Microscopy Density Maps, Salim Sazzed, Peter Scheible, Maytha Alshammari, Willy Wriggers, Jing He

College of Sciences Posters

Cryo-electron microscopy (cryo-EM) density maps at medium resolution (5-10 Å) reveal secondary structural features such as α-helices and β-sheets, but they lack the side chains details that would enable a direct structure determination. Among the more than 800 entries in the Electron Microscopy Data Bank (EMDB) of medium-resolution density maps that are associated with atomic models, a wide variety of similarities can be observed between maps and models. To validate such atomic models and to classify structural features, a local similarity criterion, the F1 score, is proposed and evaluated in this study. The F1 score is theoretically normalized to a …

Go to article

Atmospheric Contrail Detection With A Deep Learning Algorithm, Nasir Siddiqui Apr 2020

Atmospheric Contrail Detection With A Deep Learning Algorithm, Nasir Siddiqui

Student Research, Papers, and Creative Works

Aircraft contrail emission is widely believed to be a contributing factor to global climate change. We have used machine learning techniques on images containing contrails in hopes of being able to identify those which contain contrails and those that do not. The developed algorithm processes data on contrail characteristics as captured by long-term image records. Images collected by the United States Deparment of Energy’s Atmospheric Radiation Management user facility(ARM) were used to train a deep convolutional neural network for the purpose of this contrail classification. The neural network model was trained with 1600 images taken by the Total Sky Imager(TSI) …

Go to article

A Semi-Automatic Integrated Framework For Non-English Sentiment Lexicons, Abdullah Kaity Mohammed Salem Apr 2020

A Semi-Automatic Integrated Framework For Non-English Sentiment Lexicons, Abdullah Kaity Mohammed Salem

Student Works (2020-2029)

There has been significant growth in social media networks in the last few years. Posting opinions and messages on social networking websites has become a popular activity on the Internet. The data sources are necessary for business intelligence and market analytics, as human opinions form a major indicator of human desires and behaviour. This has resulted in the development of a new study field called sentiment analysis. This includes the analysis, evaluation and interpretation of the opinions with the help of text mining and Natural Language Processing (NLP) processes, for identifying the text polarity, as positive, neutral or negative. It …

Go to article

Multi-Tier Classification Based On Sentiment, Type, Emotion And Purpose For Online Diabetes Community, Ratan Singh Wandeep Kaur Apr 2020

Multi-Tier Classification Based On Sentiment, Type, Emotion And Purpose For Online Diabetes Community, Ratan Singh Wandeep Kaur

Student Works (2020-2029)

The evolution of social media platforms has created a niche for users to increasingly turn to such sites in order to share and exchange health related information. Facebook being one of the largest social networking sites has only encouraged such exchange thus mounting to a sheer amount of data that is hidden within unstructured text. The aim of this research is to propose a multi-tier classification based on sentiment, type, emotion and purpose (STEP) to classify data collected from diabetes community within Facebook. There are three tiers within the proposed STEP framework namely type, purpose and sentiment (and emotion within …

Go to article

Randomized Algorithms And How Society Uses Them Everyday, Rosaley Milano Apr 2020

Randomized Algorithms And How Society Uses Them Everyday, Rosaley Milano

Undergraduate Honors Thesis Projects

Randomness is an interesting and very beneficial phenomenon. In computer science randomness facilitates great advances in efficiency but topics like randomized algorithms aren’t taught until someone enters graduate school. This paper provides undergraduates as well as people unacquainted with computer science an opportunity to explore the topic of randomness by guiding them from essential topics all the way through the graduate level topic of randomized algorithms. Topics like what an algorithm is, how they are represented and the history that brought them into existence bring the reader up to speed before diving deeper into randomized algorithms. A discussion of complexity …

Go to article

On The Robustness Of Cascade Diffusion Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras Apr 2020

On The Robustness Of Cascade Diffusion Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras

Research Collection School Of Computing and Information Systems

How can we assess a network's ability to maintain its functionality under attacks? Network robustness has been studied extensively in the case of deterministic networks. However, applications such as online information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. We propose three novel robustness measures for networks hosting a diffusion under the Independent Cascade (IC) model, susceptible to node attacks. The outcome of such a process depends on the selection of its initiators, or seeds, by the seeder, as well as on two factors outside the seeder's discretion: the attack strategy and the …

Go to article

Neural Network Pruning For Ecg Arrhythmia Classification, Isaac E. Labarge Apr 2020

Neural Network Pruning For Ecg Arrhythmia Classification, Isaac E. Labarge

Master's Theses

Convolutional Neural Networks (CNNs) are a widely accepted means of solving complex classification and detection problems in imaging and speech. However, problem complexity often leads to considerable increases in computation and parameter storage costs. Many successful attempts have been made in effectively reducing these overheads by pruning and compressing large CNNs with only a slight decline in model accuracy. In this study, two pruning methods are implemented and compared on the CIFAR-10 database and an ECG arrhythmia classification task. Each pruning method employs a pruning phase interleaved with a finetuning phase. It is shown that when performing the scale-factor pruning …

Go to article

Comparison Of Visual Simultaneous Localization And Mapping Methods For Fixed-Wing Aircraft Using Slambench2, Patrick R. Latcham Mar 2020

Comparison Of Visual Simultaneous Localization And Mapping Methods For Fixed-Wing Aircraft Using Slambench2, Patrick R. Latcham

Theses and Dissertations

Visual Simultaneous Localization and Mapping (VSLAM) algorithms have evolved rapidly in the last few years, however there has been little research evaluating current algorithm's effectiveness and limitations when applied to tracking the position of a fixed-wing aerial vehicle. This research looks to evaluate current monocular VSLAM algorithms' performance on aerial vehicle datasets using the SLAMBench2 benchmarking suite. The algorithms tested are MonoSLAM, PTAM, OKVIS, LSDSLAM, ORB-SLAM2, and SVO, all of which are built into the SLAMBench2 software. The algorithms' performance is evaluated using simulated datasets generated in the AftrBurner Engine. The datasets were designed to test the quality of each …

Go to article

Multiple Diagram Navigation, Hisham Benotman Mar 2020

Multiple Diagram Navigation, Hisham Benotman

Dissertations and Theses

Domain novices learning about a new subject can struggle to find their way in large collections. Typical searching and browsing tools are better utilized if users know what to search for or browse to. In this dissertation, we present Multiple Diagram Navigation (MDN) to assist domain novices by providing multiple overviews of the content matter using multiple diagrams. Rather than relying on specific types of visualizations, MDN superimposes any type of diagram or map over a collection of documents, allowing content providers to reveal interesting perspectives of their content. Domain novices can navigate through the content in an exploratory way …

Go to article

Automated Extraction Of Network Activity From Memory Resident Code, Austin Nicholas Sellers Mar 2020

Automated Extraction Of Network Activity From Memory Resident Code, Austin Nicholas Sellers

LSU Master's Theses

Advancements in malware development, including the use of file-less and memory-only payloads, have led to a significant interest in the use of volatile memory analysis by digital forensics practitioners. Memory analysis can uncover a wealth of information not available via traditional analysis, such as the discovery of injected code, hooked APIs, and more. Unfortunately, the process of analyzing such malicious code is largely left to analysts who must manually reverse engineer the code to discover its intent. This task is not only slow and error-prone, but is also generally left only to senior-level analysts to perform, given that significant reverse …

Go to article

Graph Classification With Kernels, Embeddings And Convolutional Neural Networks, Monica Golahalli Seenappa, Katerina Potika, Petros Potikas Mar 2020

Graph Classification With Kernels, Embeddings And Convolutional Neural Networks, Monica Golahalli Seenappa, Katerina Potika, Petros Potikas

Faculty Publications, Computer Science

In the graph classification problem, given is a family of graphs and a group of different categories, and we aim to classify all the graphs (of the family) into the given categories. Earlier approaches, such as graph kernels and graph embedding techniques have focused on extracting certain features by processing the entire graph. However, real world graphs are complex and noisy and these traditional approaches are computationally intensive. With the introduction of the deep learning framework, there have been numerous attempts to create more efficient classification approaches. We modify a kernel graph convolutional neural network approach, that extracts subgraphs (patches) …

Go to article

W-Gun: Whale Optimization For Energy And Delay-Centric Green Underwater Networks, Rajkumar Singh Rathore, Houbing Song, Suman Sangwan, Sukriti Mazumdar, Omprakash Kaiwartya, Kabita Adhikari, Rupak Kharel Mar 2020

W-Gun: Whale Optimization For Energy And Delay-Centric Green Underwater Networks, Rajkumar Singh Rathore, Houbing Song, Suman Sangwan, Sukriti Mazumdar, Omprakash Kaiwartya, Kabita Adhikari, Rupak Kharel

Publications

Underwater sensor networks (UWSNs) have witnessed significant R&D attention in both academia and industry due to their growing application domains, such as border security, freight via sea or river, natural petroleum production and the fishing industry. Considering the deep underwater-oriented access constraints, energy-centric communication for the lifetime maximization of tiny sensor nodes in UWSNs is one of the key research themes in this domain. Existing literature on green UWSNs are majorly adapted from the existing techniques in traditional wireless sensor network relying on geolocation and the quality of service-centric underwater relay node selection, without paying much attention to the dynamic …

Go to article

Global Gradient-Based Phase Unwrapping Algorithm For Increased Performance In Wavefront Sensing, Bryan R. Bartelt Mar 2020

Global Gradient-Based Phase Unwrapping Algorithm For Increased Performance In Wavefront Sensing, Bryan R. Bartelt

Theses and Dissertations

As the reliance on satellite data for military and commercial use increases, more effort must be exerted to protect our space-based assets. In order to help increase our space domain awareness (SDA), new approaches to ground-based space surveillance via wavefront sensing must be adopted. Improving phase-unwrapping algorithms in order to assist in phase retrieval methods is one way of increasing the performance in current adaptive optics (AO) systems. This thesis proposes a new phase-unwrapping algorithm that uses a global, gradient-based technique to more rapidly identify and correct for areas of phase wrapping during particular phase retrieval methods. This is beneficial …

Go to article

First Prev Next Last