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

Computer Sciences Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 25651 - 25680 of 63705

Full-Text Articles in Computer Sciences

Finding Needles In A Haystack: Leveraging Co-Change Dependencies To Recommend Refactorings, Marcos César De Oliveira, Davi Freitas, Rodrigo Bonifacio, Gustavo Pinto, David Lo Dec 2019

Finding Needles In A Haystack: Leveraging Co-Change Dependencies To Recommend Refactorings, Marcos César De Oliveira, Davi Freitas, Rodrigo Bonifacio, Gustavo Pinto, David Lo

Research Collection School Of Computing and Information Systems

A fine-grained co-change dependency arises when two fine-grained source-code entities, e.g., a method,change frequently together. This kind of dependency is relevant when considering remodularization efforts (e.g., to keep methods that change together in the same class). However, existing approaches forrecommending refactorings that change software decomposition (such as a move method) do not explorethe use of fine-grained co-change dependencies. In this paper we present a novel approach for recommending move method and move field refactorings, which removes co-change dependencies and evolutionary smells, a particular type of dependency that arise when fine-grained entities that belong to different classes frequently change together. First …


Clustering Models For Topic Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman Dec 2019

Clustering Models For Topic Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman

Research Collection School Of Computing and Information Systems

Discussion forums provide the base content for creating a knowledge repository. It contains discussion threads related to key course topics that are debated by the students. In order to better understand the student learning experience, the instructor needs to analyse these discussion threads. This paper proposes the use of clustering models and interactive visualizations to conduct a qualitative analysis of graduate discussion forums. Our goal is to identify the sub-topics and topic evolutions in the discussion forums by applying text mining techniques. Our approach generates insights into the topic analysis in the forums and discovers the students’ cognitive understanding within …


Escape Puzzler, Shane Robertson Dec 2019

Escape Puzzler, Shane Robertson

Masters Theses & Doctoral Dissertations

This project is a systems design project. The goal of the project was to complete an online game for the purpose of entertaining an end-user. There is also additional research potential with analyzing the end-user behavior. This project showcases various skills learned at Dakota State University. This project required systems analysis, research of information technologies, database design, and project management.

About 50% of the planning phase was dedicated to scanning the IT industry for various technologies. We researched web hosting providers that would support the technologies we wanted to use. Also, a survey of available game engines was conducted. Additionally, …


Rating News Claims: Feature Selection And Evaluation, Izzat Alsmadi, Michael J. O'Brien Dec 2019

Rating News Claims: Feature Selection And Evaluation, Izzat Alsmadi, Michael J. O'Brien

Computer Science Faculty Publications (Archived)

News claims that travel the Internet and online social networks (OSNs) originate from different, sometimes unknown sources, which raises issues related to the credibility of those claims and the drivers behind them. Fact-checking websites such as Snopes, FactCheck, and Emergent use human evaluators to investigate and label news claims, but the process is labor- and time-intensive. Driven by the need to use data analytics and algorithms in assessing the credibility of news claims, we focus on what can be generalized about evaluating human-labeled claims. We developed tools to extract claims from Snopes and Emergent and used public datasets collected by …


Improving The Classification Of Tiny Images For Forensic Analysis, Roba Jafar Alharbi Dec 2019

Improving The Classification Of Tiny Images For Forensic Analysis, Roba Jafar Alharbi

Theses and Dissertations

Forensics can be defined as the approach that connects with and uses in governments and different organizations in order to detect any malicious activity. Digital forensics has become an essential approach to cyber investigation. Image forensics is one of the most beneficial ways that are used in digital forensics in order to help investigators in cybercrimes. Therefore, investigators can discover some new evidence besides what is already available on their systems when they use some digital forensics techniques. This thesis focuses on identifying an image based on its contents, especially tiny images. We investigated ways to improve the performance of …


Deep Reinforcement Learning Pairs Trading, Andrew Brim Dec 2019

Deep Reinforcement Learning Pairs Trading, Andrew Brim

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

This research applies a deep reinforcement learning technique, Deep Q-network, to a stock market pairs trading strategy for profit. Artificial intelligent methods have long since been applied to optimize trading strategies. This work trains and tests a DQN to trade co-integrated stock market prices, in a pairs trading strategy. The results demonstrate the DQN is able to consistently produce positive returns when executing a pairs trading strategy.


Building Datasets From Publicly Accessible Social Media Images For Biometric Analysis, Giordano Roberto Benitez Torres Dec 2019

Building Datasets From Publicly Accessible Social Media Images For Biometric Analysis, Giordano Roberto Benitez Torres

Theses and Dissertations

The world is developing at a rapid pace, and some of its advancement can be accredited to technological innovations that are affecting many aspects of society. A field within computer science that is increasingly reaching many industries is Biometrics, specifically the area face recognition. Researchers, scientists, and organizations actively try to improve the performance of tools and algorithms. Nevertheless, for it to occur, there is a need for high-quality datasets to test and develop new techniques. Never had humanity, in the course of the history of civilization, produced massive amounts of data as it currently does. Social media networks play …


Machine Learning Models On Prognostic Outcome Prediction For Cancer Images With Multiple Modalities, Gengbo Liu Dec 2019

Machine Learning Models On Prognostic Outcome Prediction For Cancer Images With Multiple Modalities, Gengbo Liu

Theses and Dissertations

Machine learning algorithms have been applied to predict different prognostic outcomes for many different diseases by directly using medical images. However, the higher resolution in various types of medical imaging modalities and new imaging feature extraction framework brings new challenges for predicting prognostic outcomes. Compared to traditional radiology practice, which is only based on visual interpretation and simple quantitative measurements, medical imaging features can dig deeper within medical images and potentially provide further objective support for clinical decisions. In this dissertation, we cover three projects with applying or designing machine learning models on predicting prognostic outcomes using various types of …


Resampling-Based Analysis Of Multivariate Data And Repeated Measures Designs With The R Package Manova.Rm, Sarah Friedrich, Frank Konietschke, Markus Pauly Dec 2019

Resampling-Based Analysis Of Multivariate Data And Repeated Measures Designs With The R Package Manova.Rm, Sarah Friedrich, Frank Konietschke, Markus Pauly

The R Journal

Nonparametric statistical inference methods for a modern and robust analysis of longitudinal and multivariate data in factorial experiments are essential for research. While existing approaches that rely on specific distributional assumptions of the data (multivariate normality and/or equal covariance matrices) are implemented in statistical software packages, there is a need for user-friendly software that can be used for the analysis of data that do not fulfill the aforementioned assumptions and provide accurate p value and confidence interval estimates. Therefore, newly developed nonparametric statistical methods based on bootstrap- and permutation-approaches, which neither assume multivariate normality nor specific covariance matrices, have been …


The Landscape Of R Packages For Automated Exploratory Data Analysis, Mateusz Staniak, Przemysław Biecek Dec 2019

The Landscape Of R Packages For Automated Exploratory Data Analysis, Mateusz Staniak, Przemysław Biecek

The R Journal

The increasing availability of large but noisy data sets with a large number of heterogeneous variables leads to the increasing interest in the automation of common tasks for data analysis. The most time-consuming part of this process is the Exploratory Data Analysis, crucial for better domain understanding, data cleaning, data validation, and feature engineering

There is a growing number of libraries that attempt to automate some of the typical Exploratory Data Analysis tasks to make the search for new insights easier and faster. In this paper, we present a systematic review of existing tools for Automated Exploratory Data Analysis (autoEDA). …


The Idspatialstats R Package: Quantifying Spatial Dependence Of Infectious Disease Spread, John R. Giles, Henrik Salje, Justin Lessler Dec 2019

The Idspatialstats R Package: Quantifying Spatial Dependence Of Infectious Disease Spread, John R. Giles, Henrik Salje, Justin Lessler

The R Journal

Spatial statistics for infectious diseases are important because the spatial and temporal scale over which transmission operates determine the dynamics of disease spread. Many methods for quantifying the distribution and clustering of spatial point patterns have been developed (e.g. K-function and pair correlation function) and are routinely applied to infectious disease case occurrence data. However, these methods do not explicitly account for overlapping chains of transmission and require knowledge of the underlying population distribution, which can be limiting when analyzing epidemic case occurrence data. Therefore, we developed two novel spatial statistics that account for these effects to estimate: 1) …


Jomo: A Flexible Package For Two-Level Joint Modelling Multiple Imputation, Matteo Quartagno, Simon Grund, James Carpenter Dec 2019

Jomo: A Flexible Package For Two-Level Joint Modelling Multiple Imputation, Matteo Quartagno, Simon Grund, James Carpenter

The R Journal

Multiple imputation is a tool for parameter estimation and inference with partially observed data, which is used increasingly widely in medical and social research. When the data to be imputed are correlated or have a multilevel structure — repeated observations on patients, school children nested in classes within schools within educational districts — the imputation model needs to include this structure. Here we introduce our joint modelling package for multiple imputation of multilevel data, jomo, which uses a multivariate normal model fitted by Markov Chain Monte Carlo (MCMC). Compared to previous packages for multilevel imputation, e.g. pan, jomo adds the …


Biclustermd: An R Package For Biclustering With Missing Values, John Reisner, Hieu Pham, Sigurdur Olafsson, Stephen Vardeman, Jing Li Dec 2019

Biclustermd: An R Package For Biclustering With Missing Values, John Reisner, Hieu Pham, Sigurdur Olafsson, Stephen Vardeman, Jing Li

The R Journal

Biclustering is a statistical learning technique that attempts to find homogeneous partitions of rows and columns of a data matrix. For example, movie ratings might be biclustered to group both raters and movies. biclust is a current R package allowing users to implement a variety of biclustering algorithms. However, its algorithms do not allow the data matrix to have missing values. We provide a new R package, biclustermd, which allows users to perform biclustering on numeric data even in the presence of missing values.


Modeling Regimes With Extremes: The Bayesdfa Package For Identifying And Forecasting Common Trends And Anomalies In Multivariate Time-Series Data, Eric J. Ward, Sean C. Anderson, Luis A. Damiano, Mary E. Hunsicker, Michael A. Litzow Dec 2019

Modeling Regimes With Extremes: The Bayesdfa Package For Identifying And Forecasting Common Trends And Anomalies In Multivariate Time-Series Data, Eric J. Ward, Sean C. Anderson, Luis A. Damiano, Mary E. Hunsicker, Michael A. Litzow

The R Journal

The bayesdfa package provides a flexible Bayesian modeling framework for applying dynamic factor analysis (DFA) to multivariate time-series data as a dimension reduction tool. The core estimation is done with the Stan probabilistic programming language. In addition to being one of the few Bayesian implementations of DFA, novel features of this model include (1) optionally modeling latent process deviations as drawn from a Student-t distribution to better model extremes, and (2) optionally including autoregressive and moving-average components in the latent trends. Besides estimation, we provide a series of plotting functions to visualize trends, loadings, and model predicted values. A secondary …


Coxed: An R Package For Computing Duration-Based Quantities From The Cox Proportional Hazards Model, Jonathan Kropko, Jeffrey J. Harden Dec 2019

Coxed: An R Package For Computing Duration-Based Quantities From The Cox Proportional Hazards Model, Jonathan Kropko, Jeffrey J. Harden

The R Journal

The Cox proportional hazards model is one of the most frequently used estimators in duration (survival) analysis. Because it is estimated using only the observed durations’ rank ordering, typical quantities of interest used to communicate results of the Cox model come from the hazard function (e.g., hazard ratios or percentage changes in the hazard rate). These quantities are substantively vague and difficult for many audiences of research to understand. We introduce a suite of methods in the R package coxed to address these problems. The package allows researchers to calculate duration-based quantities from Cox model results, such as the expected …


Learning To Detect Pedestrians By Watching Videos, Andrew Y. Chen Dec 2019

Learning To Detect Pedestrians By Watching Videos, Andrew Y. Chen

Theses and Dissertations

The field of deep learning has experienced a resurgence in the recent years, particularly resulting with the advent of AlexNet. Supervised learning is currently the most common and practical machine learning method. The struggle with employing supervised learning to approach problems is that it requires training data. Sufficient training data is correlated with performance for deep learning models. The issue is that preparing the training data can be a tedious and labor intensive task, especially on a large scale. The purpose of this paper is to determine how efficient a machine can learn when trained on automatically annotated data. The …


Detection And Mitigation Of Attacks In Nonlinear Stochastic System Using Modified Detector, Chandreyee Bhowmick, S. Jagannathan Dec 2019

Detection And Mitigation Of Attacks In Nonlinear Stochastic System Using Modified Detector, Chandreyee Bhowmick, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

A novel attack detection method is presented for a nonlinear system with known dynamics using the measured output in the presence of additive process and measurement noise. False data injection (FDI) and replay attacks are considered using a modified fault detector. The difference between the measured and the estimated output from an adaptive observer, often known as the innovation signal, is generated and shown to have a Gaussian distribution with non-zero mean. This innovation signal in conjunction with the modified detector is utilized to detect attacks under a stable controller using the estimated state vector. Unlike FDI attack, where the …


Ldakm-Eiot: Lightweight Device Authentication And Key Management Mechanism For Edge-Based Iot Deployment, Mohammad Wazid, Ashok Kumar Das, Sachin Shetty, Joel J. P. C. Rodrigues, Youngho Park Dec 2019

Ldakm-Eiot: Lightweight Device Authentication And Key Management Mechanism For Edge-Based Iot Deployment, Mohammad Wazid, Ashok Kumar Das, Sachin Shetty, Joel J. P. C. Rodrigues, Youngho Park

VMASC Publications

In recent years, edge computing has emerged as a new concept in the computing paradigm that empowers several future technologies, such as 5G, vehicle-to-vehicle communications, and the Internet of Things (IoT), by providing cloud computing facilities, as well as services to the end users. However, open communication among the entities in an edge based IoT environment makes it vulnerable to various potential attacks that are executed by an adversary. Device authentication is one of the prominent techniques in security that permits an IoT device to authenticate mutually with a cloud server with the help of an edge node. If authentication …


Enhanced Label Noise Filtering With Multiple Voting, Donghai Guan, Maqbool Hussain, Weiwei Yuan, Asad Masood Khattak, Muhammad Fahim, Wajahat Ali Khan Dec 2019

Enhanced Label Noise Filtering With Multiple Voting, Donghai Guan, Maqbool Hussain, Weiwei Yuan, Asad Masood Khattak, Muhammad Fahim, Wajahat Ali Khan

All Works

© 2019 by the authors. Label noises exist in many applications, and their presence can degrade learning performance. Researchers usually use filters to identify and eliminate them prior to training. The ensemble learning based filter (EnFilter) is the most widely used filter. According to the voting mechanism, EnFilter is mainly divided into two types: single-voting based (SVFilter) and multiple-voting based (MVFilter). In general, MVFilter is more often preferred because multiple-voting could address the intrinsic limitations of single-voting. However, the most important unsolved issue in MVFilter is how to determine the optimal decision point (ODP). Conceptually, the decision point is a …


Extracting Social Network From Literary Prose, Tarana Tasmin Bipasha Dec 2019

Extracting Social Network From Literary Prose, Tarana Tasmin Bipasha

Graduate Theses and Dissertations

This thesis develops an approach to extract social networks from literary prose, namely, Jane Austen’s published novels from eighteenth- and nineteenth- century. Dialogue interaction plays a key role while we derive the networks, thus our technique relies upon our ability to determine when two characters are in conversation. Our process involves encoding plain literary text into the Text Encoding Initiative’s (TEI) XML format, character name identification, conversation and co-occurrence detection, and social network construction. Previous work in social network construction for literature have focused on drama, specifically manually TEI-encoded Shakespearean plays in which character interactions are much easier to track …


Sentiment Analysis, Quantification, And Shift Detection, Kevin Labille Dec 2019

Sentiment Analysis, Quantification, And Shift Detection, Kevin Labille

Graduate Theses and Dissertations

This dissertation focuses on event detection within streams of Tweets based on sentiment quantification. Sentiment quantification extends sentiment analysis, the analysis of the sentiment of individual documents, to analyze the sentiment of an aggregated collection of documents. Although the former has been widely researched, the latter has drawn less attention but offers greater potential to enhance current business intelligence systems. Indeed, knowing the proportion of positive and negative Tweets is much more valuable than knowing which individual Tweets are positive or negative. We also extend our sentiment quantification research to analyze the evolution of sentiment over time to automatically detect …


Contrasting Geometric Variations Of Mathematical Models Of Self-Assembling Systems, Michael Sharp Dec 2019

Contrasting Geometric Variations Of Mathematical Models Of Self-Assembling Systems, Michael Sharp

Graduate Theses and Dissertations

Self-assembly is the process by which complex systems are formed and behave due to the interactions of relatively simple units. In this thesis, we explore multiple augmentations of well known models of self-assembly to gain a better understanding of the roles that geometry and space play in their dynamics. We begin in the abstract Tile Assembly Model (aTAM) with some examples and a brief survey of previous results to provide a foundation. We then introduce the Geometric Thermodynamic Binding Network model, a model that focuses on the thermodynamic stability of its systems while utilizing geometrically rigid components (dissimilar to other …


Countering Cybersecurity Vulnerabilities In The Power System, Fengli Zhang Dec 2019

Countering Cybersecurity Vulnerabilities In The Power System, Fengli Zhang

Graduate Theses and Dissertations

Security vulnerabilities in software pose an important threat to power grid security, which can be exploited by attackers if not properly addressed. Every month, many vulnerabilities are discovered and all the vulnerabilities must be remediated in a timely manner to reduce the chance of being exploited by attackers. In current practice, security operators have to manually analyze each vulnerability present in their assets and determine the remediation actions in a short time period, which involves a tremendous amount of human resources for electric utilities. To solve this problem, we propose a machine learning-based automation framework to automate vulnerability analysis and …


Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa Dec 2019

Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa

Research Collection School Of Computing and Information Systems

Models that predict software artifact co-changes have been proposed to assist developers in altering a software system and they often rely on coupling. However, developers have not yet widely adopted these approaches, presumably because of the high number of false recommendations. In this work, we conjecture that the contextual information related to software changes, which is collected from issues (e.g., issue type and reporter), developers’ communication (e.g., number of issue comments, issue discussants and words in the discussion), and commit metadata (e.g., number of lines added, removed, and modified), improves the accuracy of co-change prediction. We built customized prediction models …


Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang Dec 2019

Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang

Research Collection School Of Computing and Information Systems

Self-Admitted Technical Debt (SATD) refers to technical debt that is introduced intentionally. Previous studies that identify SATD at the file-level in isolation cannot describe the TD context related to multiple files. Therefore, it is more beneficial to identify the SATD once a change is being made. We refer to this type of TD identification as “Change-level SATD Determination”, and identifying SATD at the change-level can help to manage and control TD by understanding the TD context through tracing the introducing changes. In this paper, we propose a change-level SATD Determination mode by extracting 25 features from software changes that are …


Selective Discrete Particle Swarm Optimization For The Team Orienteering Problem With Time Windows And Partial Scores, Vincent F. Yu, Perwira A. A. N. Redi, Parida Jewpanya, Aldy Gunawan Dec 2019

Selective Discrete Particle Swarm Optimization For The Team Orienteering Problem With Time Windows And Partial Scores, Vincent F. Yu, Perwira A. A. N. Redi, Parida Jewpanya, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This paper introduces the Team Orienteering Problem with Time Windows and Partial Scores (TOPTW-PS),which is an extension of the Team Orienteering Problem with Time Windows (TOPTW). In the context of theTOPTW-PS, each node is associated with a set of scores with respect to a set of attributes. The objective ofTOPTW-PS is to find a set of routes that maximizes the total score collected from a subset of attributes whenvisiting the nodes subject to the time budget and the time window at each visited node. We develop a mathematical model and propose a discrete version of the Particle Swarm Optimization (PSO), …


Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng Dec 2019

Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng

Research Collection School Of Computing and Information Systems

In this paper, we aim at studying the group travel behaviour (GTB) patterns from large-scale auto fare collection (AFC) data. GTB is defined as two or more commuters intentionally and regularly traveling together from an origin to a destination. We propose a method to identify GTB accurately and efficiently and apply our method to the Singapore AFC dataset to reveal the GTB patterns of Singapore commuters. The case study proves that our method is able to identify GTB patterns more accurately and efficiently than the state-of-the-art.


Compositional Verification Of Heap-Manipulating Programs Through Property-Guided Learning, Long H. Pham, Jun Sun, Quang Loc Le Dec 2019

Compositional Verification Of Heap-Manipulating Programs Through Property-Guided Learning, Long H. Pham, Jun Sun, Quang Loc Le

Research Collection School Of Computing and Information Systems

Analyzing and verifying heap-manipulating programs automatically is challenging. A key for fighting the complexity is to develop compositional methods. For instance, many existing verifiers for heap-manipulating programs require user-provided specification for each function in the program in order to decompose the verification problem. The requirement, however, often hinders the users from applying such tools. To overcome the issue, we propose to automatically learn heap-related program invariants in a property-guided way for each function call. The invariants are learned based on the memory graphs observed during test execution and improved through memory graph mutation. We implemented a prototype of our approach …


Optimal Design And Ownership Structures Of Innovative Retail Payment Systems, Zhiling Guo, Dan Ma Dec 2019

Optimal Design And Ownership Structures Of Innovative Retail Payment Systems, Zhiling Guo, Dan Ma

Research Collection School Of Computing and Information Systems

In response to the Fintech trend, an ongoing debate in the banking industry is how to design the new-generation interbank retail payment and settlement system. We propose a two-stage analytical model that takes into account the value-risk tradeoff in the new payment system design, as well as banks’ participation incentives and adoption timing decisions. We find that, as the system base value increases, banks tend to synchronize their investment and adoption decisions. When the system base value is low and banks are heterogeneous, bank association ownership maximizes social welfare. When both the system base value and bank heterogeneity are moderate, …


Smu Teaching Bank: Case Study Of A Multiyear Development Project Utilizing Student Resources, Alan Megargel, Terence P. C. Fan, Venky Shankararaman Dec 2019

Smu Teaching Bank: Case Study Of A Multiyear Development Project Utilizing Student Resources, Alan Megargel, Terence P. C. Fan, Venky Shankararaman

Research Collection School Of Computing and Information Systems

A domain refers to a business sector such as banking, healthcare, insurance, manufacturing etc. For an IS student, it is imperative that the domain knowledge includes a comprehension and understanding of business processes, technology and data related to the chosen domain. For example, when learning the retail banking domain, an IS student must have an understanding of the transactions concerned with retail banking such as fund transfers and loan repayments. The student must also gain a strong foothold in transaction fulfilment processes, the various application services that are used, the data that is transferred, etc. Teaching domain knowledge is very …