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

Computer Sciences Commons

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

Algorithms

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 91 - 120 of 357

Full-Text Articles in Computer Sciences

Fair And Diverse Group Formation Based On Multidimensional Features, Mohammed Saad A Alqahtani Dec 2021

Fair And Diverse Group Formation Based On Multidimensional Features, Mohammed Saad A Alqahtani

Graduate Theses and Dissertations

The goal of group formation is to build a team to accomplish a specific task. Algorithms are being developed to improve the team's effectiveness so formed and the efficiency of the group selection process. However, there is concern that team formation algorithms could be biased against minorities due to the algorithms themselves or the data on which they are trained. Hence, it is essential to build fair team formation systems that incorporate demographic information into the process of building the group. Although there has been extensive work on modeling individuals’ expertise for expert recommendation and/or team formation, there has been …


Information Extraction And Classification On Journal Papers, Lei Yu Nov 2021

Information Extraction And Classification On Journal Papers, Lei Yu

School of Computing: Dissertations, Theses, and Student Research

The importance of journals for diffusing the results of scientific research has increased considerably. In the digital era, Portable Document Format (PDF) became the established format of electronic journal articles. This structured form, combined with a regular and wide dissemination, spread scientific advancements easily and quickly. However, the rapidly increasing numbers of published scientific articles requires more time and effort on systematic literature reviews, searches and screens. The comprehension and extraction of useful information from the digital documents is also a challenging task, due to the complex structure of PDF.

To help a soil science team from the United States …


Awegnn: Auto-Parametrized Weighted Element-Specific Graph Neural Networks For Molecules., Timothy Szocinski, Duc Duy Nguyen, Guo-Wei Wei Jul 2021

Awegnn: Auto-Parametrized Weighted Element-Specific Graph Neural Networks For Molecules., Timothy Szocinski, Duc Duy Nguyen, Guo-Wei Wei

Mathematics Faculty Publications

While automated feature extraction has had tremendous success in many deep learning algorithms for image analysis and natural language processing, it does not work well for data involving complex internal structures, such as molecules. Data representations via advanced mathematics, including algebraic topology, differential geometry, and graph theory, have demonstrated superiority in a variety of biomolecular applications, however, their performance is often dependent on manual parametrization. This work introduces the auto-parametrized weighted element-specific graph neural network, dubbed AweGNN, to overcome the obstacle of this tedious parametrization process while also being a suitable technique for automated feature extraction on these internally complex …


Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris Jun 2021

Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris

Dartmouth College Undergraduate Theses

In this thesis, we explore the problem of approximating the number of elementary substructures called simplices in large k-uniform hypergraphs. The hypergraphs are assumed to be too large to be stored in memory, so we adopt a data stream model, where the hypergraph is defined by a sequence of hyperedges.

First we propose an algorithm that (ε, δ)-estimates the number of simplices using O(m1+1/k / T) bits of space. In addition, we prove that no constant-pass streaming algorithm can (ε, δ)- approximate the number of simplices using less than O( m 1+1/k / T ) bits of space. Thus …


The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares Jun 2021

The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares

Open Educational Resources

This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …


Fine-Grained Lower Bounds For Problems On Strings And Graphs, Gary Thomas Hoppenworth Jan 2021

Fine-Grained Lower Bounds For Problems On Strings And Graphs, Gary Thomas Hoppenworth

Honors Undergraduate Theses

The motivation of this thesis is to present new lower bounds for important computational problems on strings and graphs, conditioned on plausible conjectures in theoretical computer science. These lower bounds, called conditional lower bounds, are a topic of immense interest in the field of fine-grained complexity, which aims to develop a better understanding of the hardness of problems that can be solved in polynomial time. In this thesis, we give new conditional lower bounds for four interesting computational problems: the median and center string edit distance problems, the pattern matching on labeled graphs problem, and the subtree isomorphism problem. These …


Novel Hedonic Games And Stability Notions, Jacob Schlueter Jan 2021

Novel Hedonic Games And Stability Notions, Jacob Schlueter

Theses and Dissertations--Computer Science

We present here work on matching problems, namely hedonic games, also known as coalition formation games. We introduce two classes of hedonic games, Super Altruistic Hedonic Games (SAHGs) and Anchored Team Formation Games (ATFGs), and investigate the computational complexity of finding optimal partitions of agents into coalitions, or finding - or determining the existence of - stable coalition structures. We introduce a new stability notion for hedonic games and examine its relation to core and Nash stability for several classes of hedonic games.


Stock Trend Prediction Using Candlestick Charting And Ensemble Machine Learning Techniques With A Novelty Feature Engineering Scheme, Yaohu Lin, Shancun Liu, Haijun Yang, Harris Wu Jan 2021

Stock Trend Prediction Using Candlestick Charting And Ensemble Machine Learning Techniques With A Novelty Feature Engineering Scheme, Yaohu Lin, Shancun Liu, Haijun Yang, Harris Wu

Information Technology & Decision Sciences Faculty Publications

Stock market forecasting is a knotty challenging task due to the highly noisy, nonparametric, complex and chaotic nature of the stock price time series. With a simple eight-trigram feature engineering scheme of the inter-day candlestick patterns, we construct a novel ensemble machine learning framework for daily stock pattern prediction, combining traditional candlestick charting with the latest artificial intelligence methods. Several machine learning techniques, including deep learning methods, are applied to stock data to predict the direction of the closing price. This framework can give a suitable machine learning prediction method for each pattern based on the trained results. The investment …


Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration Jan 2021

Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration

Computer Science Faculty Publications

Assessing the credibility of research claims is a central, continuous, and laborious part of the scientific process. Credibility assessment strategies range from expert judgment to aggregating existing evidence to systematic replication efforts. Such assessments can require substantial time and effort. Research progress could be accelerated if there were rapid, scalable, accurate credibility indicators to guide attention and resource allocation for further assessment. The SCORE program is creating and validating algorithms to provide confidence scores for research claims at scale. To investigate the viability of scalable tools, teams are creating: a database of claims from papers in the social and behavioral …


Law Library Blog (November 2020): Legal Beagle's Blog Archive, Roger Williams University School Of Law Nov 2020

Law Library Blog (November 2020): Legal Beagle's Blog Archive, Roger Williams University School Of Law

Law Library Newsletters/Blog

No abstract provided.


A Partition Based Feature Selection Approach For Mixed Data Clustering, Ashish Dutt Oct 2020

A Partition Based Feature Selection Approach For Mixed Data Clustering, Ashish Dutt

Student Works (2020-2029)

Presently, educational institutions compile and store huge volumes of data, such as student enrolment and attendance records, as well as their examination results. Mining such data yields stimulating information that serves its handlers well. Rapid growth in educational data points to the fact that distilling massive amounts of data requires a more sophisticated set of algorithms. This issue led to the emergence of the field of Educational Data Mining (EDM). Traditional data mining algorithms cannot be directly applied to educational problems, as they may have a specific objective and function. This implies that a pre-processing algorithm has to be enforced …


Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari Aug 2020

Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari

Dissertations

A myriad of emerging applications from simple to complex ones involve human cognizance in the computation loop. Using the wisdom of human workers, researchers have solved a variety of problems, termed as “micro-tasks” such as, captcha recognition, sentiment analysis, image categorization, query processing, as well as “complex tasks” that are often collaborative, such as, classifying craters on planetary surfaces, discovering new galaxies (Galaxyzoo), performing text translation. The current view of “humans-in-the-loop” tends to see humans as machines, robots, or low-level agents used or exploited in the service of broader computation goals. This dissertation is developed to shift the focus back …


Critical Media, Information, And Digital Literacy: Increasing Understanding Of Machine Learning Through An Interdisciplinary Undergraduate Course, Barbara R. Burke, Elena Machkasova Jul 2020

Critical Media, Information, And Digital Literacy: Increasing Understanding Of Machine Learning Through An Interdisciplinary Undergraduate Course, Barbara R. Burke, Elena Machkasova

Irish Communication Review

Widespread use of Artificial Intelligence in all areas of today’s society creates a unique problem: algorithms used in decision-making are generally not understandable to those without a background in data science. Thus, those who use out-of-the-box Machine Learning (ML) approaches in their work and those affected by these approaches are often not in a position to analyze their outcomes and applicability.

Our paper describes and evaluates our undergraduate course at the University of Minnesota Morris, which fosters understanding of the main ideas behind ML. With Communication, Media & Rhetoric and Computer Science faculty expertise, students from a variety of majors, …


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

Atmospheric Contrail Detection With A Deep Learning Algorithm, Nasir Siddiqui

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

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 Department 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) …


Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou Jul 2020

Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou

Theses and Dissertations

This dissertation is focused on the problem of algorithmic robot design. The process of designing a robot or a team of robots that can reliably accomplish a task in an environment requires several key elements. How the problem is formulated can play a big role in the design process. The ability of the model to correctly reflect the environment, the events, and different pieces of the problem is crucial. Another key element is the ability of the model to show the relationship between different designs of a single system. These two elements can enable design algorithms to navigate through the …


Quantum Computing And Quantum Algorithms, Daniel Serban Apr 2020

Quantum Computing And Quantum Algorithms, Daniel Serban

Senior Honors Theses

The field of quantum computing and quantum algorithms is studied from the ground up. Qubits and their quantum-mechanical properties are discussed, followed by how they are transformed by quantum gates. From there, quantum algorithms are explored as well as the use of high-level quantum programming languages to implement them. One quantum algorithm is selected to be implemented in the Qiskit quantum programming language. The validity and success of the resulting computation is proven with matrix multiplication of the qubits and quantum gates involved.


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) …


Cyber-Physical Security With Rf Fingerprint Classification Through Distance Measure Extensions Of Generalized Relevance Learning Vector Quantization, Trevor J. Bihl, Todd J. Paciencia, Kenneth W. Bauer Jr., Michael A. Temple Feb 2020

Cyber-Physical Security With Rf Fingerprint Classification Through Distance Measure Extensions Of Generalized Relevance Learning Vector Quantization, Trevor J. Bihl, Todd J. Paciencia, Kenneth W. Bauer Jr., Michael A. Temple

Faculty Publications

Radio frequency (RF) fingerprinting extracts fingerprint features from RF signals to protect against masquerade attacks by enabling reliable authentication of communication devices at the “serial number” level. Facilitating the reliable authentication of communication devices are machine learning (ML) algorithms which find meaningful statistical differences between measured data. The Generalized Relevance Learning Vector Quantization-Improved (GRLVQI) classifier is one ML algorithm which has shown efficacy for RF fingerprinting device discrimination. GRLVQI extends the Learning Vector Quantization (LVQ) family of “winner take all” classifiers that develop prototype vectors (PVs) which represent data. In LVQ algorithms, distances are computed between exemplars and PVs, and …


Development Of Machine Learning Tutorials For R, John Pintar Jan 2020

Development Of Machine Learning Tutorials For R, John Pintar

All Undergraduate Theses and Capstone Projects

Machine learning (ML) techniques developed in computer science have revolutionized nearly every sector of industry. Despite the prevalence and usefulness of ML, students outside of computer science rarely receive training in ML. Students frequently receive training in statistical analysis, often using the software package R, which is free, open source, and has additional downloadable modules. A popular module is the ML package caret, which contains 238 different ML algorithms, each with 0-9 hyperparameters. caret is powerful, flexible, and provides consistent syntax across algorithms. In the hands of an experienced practitioner, this tunability is welcomed and can increase accuracy. However, when …


Disaster Damage Categorization Applying Satellite Images And Machine Learning Algorithm, Farinaz Sabz Ali Pour, Adrian Gheorghe Jan 2020

Disaster Damage Categorization Applying Satellite Images And Machine Learning Algorithm, Farinaz Sabz Ali Pour, Adrian Gheorghe

Engineering Management & Systems Engineering Faculty Publications

Special information has a significant role in disaster management. Land cover mapping can detect short- and long-term changes and monitor the vulnerable habitats. It is an effective evaluation to be included in the disaster management system to protect the conservation areas. The critical visual and statistical information presented to the decision-makers can help in mitigation or adaption before crossing a threshold. This paper aims to contribute in the academic and the practice aspects by offering a potential solution to enhance the disaster data source effectiveness. The key research question that the authors try to answer in this paper is how …


Developing A Computational Framework For A Construction Scheduling Decision Support Web Based Expert System, Feroz Ahmed Dec 2019

Developing A Computational Framework For A Construction Scheduling Decision Support Web Based Expert System, Feroz Ahmed

Dissertations

Decision-making is one of the basic cognitive processes of human behaviors by which a preferred option or a course of action is chosen from among a set of alternatives based on certain criteria. Decision-making is the thought process of selecting a logical choice from the available options. When trying to make a good decision, all the positives and negatives of each option should be evaluated. This decision-making process is particularly challenging during the preparation of a construction schedule, where it is difficult for a human to analyze all possible outcomes of each and every situation because, construction of a project …


Fractals As Basis For Design And Critique, John Charles Driscoll Oct 2019

Fractals As Basis For Design And Critique, John Charles Driscoll

Dissertations and Theses

The design profession is responding to the complex systems represented by architecture and planning by increasingly incorporating the power of computer technology into the design process. This represents a paradigm shift, and requires that designers rise to the challenge of both embracing modern technologies to perform increasingly sophisticated tasks without compromising their objective to create meaningful and environmentally sensitive architecture. This dissertation investigated computer-based fractal tools applied within a traditional architectural charette towards a design process with the potential to address the complex issues architects and planners face today. We developed and presented an algorithm that draws heavily from fractal …


Scheduling Multiple Parallel Jobs Online, Kefu Lu Aug 2019

Scheduling Multiple Parallel Jobs Online, Kefu Lu

McKelvey School of Engineering Graduate Student Theses & Dissertations

The prevalence of parallel processing has only increased in recent years. Today, most computing machines available on the market shifted from using single processors to possessing a multicore architecture. Naturally, there has been considerable work in developing parallel programming languages and frameworks which programmers can use to leverage the computing power of these machines. These languages allow users to create programs with internal parallelism. The next, and crucial, step is to ensure that the computing system can efficiently execute these parallel jobs. Executing a single parallel job efficiently is a very well-studied problem in parallel computing. In the area of …


New Algorithms For Large Datasets And Distributions, Sutanu Gayen Jul 2019

New Algorithms For Large Datasets And Distributions, Sutanu Gayen

School of Computing: Dissertations, Theses, and Student Research

In this dissertation, we make progress on certain algorithmic problems broadly over two computational models: the streaming model for large datasets and the distribution testing model for large probability distributions.

First we consider the streaming model, where a large sequence of data items arrives one by one. The computer needs to make one pass over this sequence, processing every item quickly, in a limited space. In Chapter 2 motivated by a bioinformatics application, we consider the problem of estimating the number of low-frequency items in a stream, which has received only a limited theoretical work so far. We give an …


Can Algorithms Help Us Decide Who To Trust?, David De Cremer, Jack Mcguire, Yorck Hesselbarth, Ke M Mai Jun 2019

Can Algorithms Help Us Decide Who To Trust?, David De Cremer, Jack Mcguire, Yorck Hesselbarth, Ke M Mai

Research Collection Lee Kong Chian School Of Business

The use of artificial intelligence (AI) and algorithms is increasing within organizations to manage business processes, hire employees, and automate routine organizational decision making. This comes as no surprise, since the application of simple linear algorithms have been shown to outperform human judgment in the accuracy of many administrative tasks. A 2017 Accenture survey also revealed that 85% of executives want to invest more extensively in AI-related technologies over the next three years.


The Right To Human Intervention: Law, Ethics And Artificial Intelligence, Maria Kanellopoulou - Botti, Fereniki Panagopoulou, Maria Nikita, Anastasia Michailaki May 2019

The Right To Human Intervention: Law, Ethics And Artificial Intelligence, Maria Kanellopoulou - Botti, Fereniki Panagopoulou, Maria Nikita, Anastasia Michailaki

Computer Ethics - Philosophical Enquiry (CEPE) Proceedings

The paper analyses the new right of human intervention in use of information technology, automatization processes and advanced algorithms in individual decision-making activities. Art. 22 of the new General Data Protection Regulation (GDPR) provides that the data subject has the right not to be subject to a fully automated decision on matters of legal importance to her interests, hence the data subject has a right to human intervention in this kind of decisions.


Extending And Improving Tla+, Amy House Mar 2019

Extending And Improving Tla+, Amy House

Theses and Dissertations

TLA+ is a mathematically precise specification language based on set theory. We provide a reusable TLA+ module for specifying asynchronous message-passing systems. The syntax and semantics of the TLA+ language are introduced. An example algorithm is translated from pseudocode to TLA+ to show the new module's use. TLC is used to model-check the translated algorithm. An established parallel algorithm for detecting strongly connected components of a graph is translated to PlusCal, a pseudolanguage that can be mechanically translated into TLA+, then a formal correctness proof is given. This algorithm is one proposed to improve the efficiency of liveness checking in …


Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke Mar 2019

Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke

Honors Program: Senior Projects (Public)

In this thesis, Pascal's Triangle modulo n will be explored for n prime and n a prime power. Using the results from the case when n is prime, a novel proof of Lucas' Theorem is given. Additionally, using both the results from the exploration of Pascal's Triangle here, as well as previous results, an efficient algorithm for computation of binomial coefficients modulo n (a choose b mod n) is described, and its time complexity is analyzed and compared to naive methods. In particular, the efficient algorithm runs in O(n log(a)) time (as opposed to …


Smart Parking Systems Design And Integration Into Iot, Charles M. Menne Feb 2019

Smart Parking Systems Design And Integration Into Iot, Charles M. Menne

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

This paper looks at two smart parking reservation algorithms, and examines the ongoing efforts to connect smart systems of different domains in a city's infrastructure. The reservation algorithms are designed to improve the performance of smart parking systems. The first algorithm considers the distance between parking areas and the number of free parking spaces in determining a parking space. The second algorithm uses distance between parking areas and driver destination, parking price, and the number of unoccupied spaces for each parking area. Neither of these smart parking systems cover how they could fit into a larger scale smart system. As …


Rubik's Cube: A Visual And Tactile Learning Of Algorithms And Patterns, Lawrence Muller Feb 2019

Rubik's Cube: A Visual And Tactile Learning Of Algorithms And Patterns, Lawrence Muller

Open Educational Resources

This is a classroom activity report on teaching algorithms as part of a second course in computer programming. Teaching an algorithm in an introductory level programming class is often a dry task for the instructor and the rewards for the student are abstract. To make the learning of algorithms and software more rewarding, this assignment employs a Rubik’s cube.