Theory and Algorithms Commons^™

Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes

All Graduate Theses, Dissertations, and Other Capstone Projects

This paper will explore the use and construction of Gröbner bases through Buchberger's algorithm. Specifically, applications of such bases for solving systems of polynomial equations will be discussed. Furthermore, we relate many concepts in commutative algebra to ideas in computational algebraic geometry.

Leveraging Peer-To-Peer Energy Sharing For Resource Optimization In Mobile Social Networks, Aashish Dhungana

Theses and Dissertations

Mobile Opportunistic Networks (MSNs) enable the interaction of mobile users in the vicinity through various short-range wireless communication technologies (e.g., Bluetooth, WiFi) and let them discover and exchange information directly or in ad hoc manner. Despite their promise to enable many exciting applications, limited battery capacity of mobile devices has become the biggest impediment to these appli- cations. The recent breakthroughs in the areas of wireless power transfer (WPT) and rechargeable lithium batteries promise the use of peer-to-peer (P2P) energy sharing (i.e., the transfer of energy from the battery of one member of the mobile network to the battery of …

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 …

Comparison Of The Tally Numbering System To Traditional Arithmetic Systems In Field Programmable Gate Arrays, Robert Paul Shredow

EWU Masters Thesis Collection

This research explores the use of heterogeneous computing platforms for use in machine learning as well as different neural network architectures. These platforms and architectures can be used to accelerate the complex operations that are required for machine learning, more specifically neural networks. The use of different architectures, implementing different types of numbering and mathematics systems is explored in hopes of accelerating mathematical functions. The heterogeneous computing platform explored in this thesis is a Field Programmable Gate Arrays (FPGA), specifically a SoC/FPGA which is a ARM CPU and a FPGA in the same chip. FPGAs are unique because they are …

Quantum Computing: Principles And Applications, Yoshito Kanamori, Seong-Moo Yoo

Journal of International Technology and Information Management

The development of quantum computers over the past few years is probably one of the significant advancements in the history of quantum computing. D-Wave quantum computer has been available for more than eight years. IBM has made its quantum computer accessible via its cloud service. Also, Microsoft, Google, Intel, and NASA have been heavily investing in the development of quantum computers and their applications. The quantum computer seems to be no longer just for physicists and computer scientists but also for information system researchers. This paper introduces the basic concepts of quantum computing and describes well-known quantum applications for non-physicists. …

V-Slam And Sensor Fusion For Ground Robots, Ejup Hoxha

Dissertations and Theses

In underground, underwater and indoor environments, a robot has to rely solely on its on-board sensors to sense and understand its surroundings. This is the main reason why SLAM gained the popularity it has today. In recent years, we have seen excellent improvement on accuracy of localization using cameras and combinations of different sensors, especially camera-IMU (VIO) fusion. Incorporating more sensors leads to improvement of accuracy,but also robustness of SLAM. However, while testing SLAM in our ground robots, we have seen a decrease in performance quality when using the same algorithms on flying vehicles.We have an additional sensor for ground …

Landing Throttleable Hybrid Rockets With Hierarchical Reinforcement Learning In A Simulated Environment, Francesco Alessandro Stefano Mikulis-Borsoi

Honors Theses and Capstones

In this paper, I develop a hierarchical Markov Decision Process (MDP) structure for completing the task of vertical rocket landing. I start by covering the background of this problem, and formally defining its constraints. In order to reduce mistakes while formulating different MDPs, I define and develop the criteria for a standardized MDP definition format. I then decompose the problem into several sub-problems of vertical landing, namely velocity control and vertical stability control. By exploiting MDP coupling and symmetrical properties, I am able to significantly reduce the size of the state space compared to a unified MDP formulation. This paper …

Toward Efficient Automation Of Interpretable Machine Learning Boosting, Nathan Neuhaus

All Master's Theses

Developing efficient automated methods for Interpretable Machine Learning (IML) is an important and long-term goal in the field of Artificial Intelligence. Currently the Machine Learning landscape is dominated by Neural Networks (NNs) and Support Vector Machines (SVMs), models which are often highly accurate. Despite high accuracy, such models are essentially “black boxes” and therefore are too risky for situations like healthcare where real lives are at stake. In such situations, so called “glass-box” models, such as Decision Trees (DTs), Bayesian Networks (BNs), and Logic Relational (LR) models are often preferred, however can succumb to accuracy limitations. Unfortunately, having to choose …

Spatial Multi-Objective Land Use Optimization Toward Livability Based On Boundary-Based Genetic Algorithm: A Case Study In Singapore, Kai Cao, Muyang Liu, Shu Wang, Mengqi Liu, Wenting Zhang, Qiang Meng, Bo Huang

Research Collection School Of Computing and Information Systems

In this research, the concept of livability has been quantitatively and comprehensively reviewed and interpreted to contribute to spatial multi-objective land use optimization modelling. In addition, a multi-objective land use optimization model was constructed using goal programming and a weighted-sum approach, followed by a boundary-based genetic algorithm adapted to help address the spatial multi-objective land use optimization problem. Furthermore, the model is successfully and effectively applied to the case study in the Central Region of Queenstown Planning Area of Singapore towards livability. In the case study, the experiments based on equal weights and experiments based on different weights combination have …

Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang

Research Collection School Of Computing and Information Systems

With the significant increase in the use of image information, image restoration has been gaining much attention by researchers. Restoring the structural information as well as the textural information of a damaged image to produce visually plausible restorations is a challenging task. Genetic algorithm (GA) and its variants have been applied in many fields due to their global optimization capabilities. However, the applications of GA to the image restoration domain still remain an emerging discipline. It is still challenging and difficult to restore a damaged image by leveraging GA optimization. To address this problem, this paper proposes a novel GA-based …

Certified Functions For Mesh Generation, Andrey N. Chernikov

Chemistry & Biochemistry Faculty Publications

Formal methods allow for building correct-by-construction software with provable guarantees. The formal development presented here resulted in certified executable functions for mesh generation. The term certified means that their correctness is established via an artifact, or certificate, which is a statement of these functions in a formal language along with the proofs of their correctness. The term is meaningful only when qualified by a specific set of properties that are proven. This manuscript elaborates on the precise statements of the properties being proven and their role in an implementation of a version of the Isosurface Stuffing algorithm by Labelle and …

A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler

Senior Independent Study Theses

Santorini is a two player combinatorial board game. Santorini bears resemblance to the graph theory game of Geography, a game of moving and deleting vertices on a graph. We explore Santorini with game theory, complexity theory, and artificial intelligence. We present David Lichtenstein’s proof that Geography is PSPACE-hard and adapt the proof for generalized forms of Santorini. Last, we discuss the development of an AI built for a software implementation of Santorini and present a number of improvements to that AI.

Distributed Strategy For Power Re-Allocation In High Performance Applications, Vaibhav Sundriyal, Masha Sosonkina

Electrical & Computer Engineering Faculty Publications

To improve the power consumption of parallel applications at the runtime, modern processors provide frequency scaling and power limiting capabilities. In this work, a runtime strategy is proposed to distribute a given power allocation among the cluster nodes assigned to the application while balancing their performance change. The strategy operates in a timeslice-based manner to estimate the current application performance and power usage per node followed by power redistribution across the nodes. Experiments, performed on four nodes (112 cores) of a modern computing platform interconnected with Infiniband showed that even a significant power budget reduction of 20% may result in …

An Assessment Of Pet Dose Reduction With Penalized Likelihood Image Reconstruction Using A Computationally Efficient Model Observer, Howard C. Gifford, C. Ross Schmidtlein, Andrzej Krol, Yuesheng Xu

Mathematics & Statistics Faculty Publications

Developing PET reconstruction algorithms with improved low-count capabilities may provide a timely and cost- effective means of reducing radiation dose in promising clinical applications such as immuno-PET that require long-lived radiotracers. For many PET clinics, the reconstruction protocol consists of postsmoothed ordered-sets expectation-maximization (OSEM) reconstruction, but penalized likelihood methods based on total-variation (TV) regularization could substantially reduce dose. We performed a task-based comparison of postsmoothed OSEM and higher-order TV (HOTV) reconstructions using simulated images of a contrast-detail phantom. An anthropomorphic visual-search model observer read the images in a location-known receiver operating characteristic (ROC) format. Acquisition counts, target uptake, and target …

Sparsity And Weak Supervision In Quantum Machine Learning, Seyran Saeedi

Theses and Dissertations

Quantum computing is an interdisciplinary field at the intersection of computer science, mathematics, and physics that studies information processing tasks on a quantum computer. A quantum computer is a device whose operations are governed by the laws of quantum mechanics. As building quantum computers is nearing the era of commercialization and quantum supremacy, it is essential to think of potential applications that we might benefit from. Among many applications of quantum computation, one of the emerging fields is quantum machine learning. We focus on predictive models for binary classification and variants of Support Vector Machines that we expect to be …

Invariance And Invertibility In Deep Neural Networks, Han Zhang

Theses and Dissertations

Machine learning is concerned with computer systems that learn from data instead of being explicitly programmed to solve a particular task. One of the main approaches behind recent advances in machine learning involves neural networks with a large number of layers, often referred to as deep learning. In this dissertation, we study how to equip deep neural networks with two useful properties: invariance and invertibility. The first part of our work is focused on constructing neural networks that are invariant to certain transformations in the input, that is, some outputs of the network stay the same even if the input …

An Intra-Severity Classification And Adaptation Technique To Improve Dysarthric Speech Recognition Accuracy, Al-Qatab Bassam Ali Qasem

Student Works (2020-2029)

Dysarthria is a motor speech impairment at the neurological and/or muscular levels that caused difficulty in pronouncing words clearly. Automatic speech recognition (ASR) system is increasingly applied as assistive technology to aid an individual with physical disability particularly the speech impaired community such as dysarthria speakers. However, the development of an effective ASR system is hindered by the data sparsity, either in the coverage of the language or the size of the existing speech databases. The speaker adaptation (SA) technique is one of the solutions to overcome the data sparsity issue of ASR for dysarthric speakers. Our proposed method introduces …

The Evolving Fuzzy Clustering Approach For Discriminating Neutron And Gamma-Ray Pulses, Shirkhorshidi Ali Seyed

Student Works (2020-2029)

Having a significant amount of data is not useful unless the data can be processed for extracting knowledge and information. One of the elementary steps in crunching data is to break it down into groups. When the data is small and collected in a controlled manner, and when the training data is appropriately labelled, the trivial approach is to use supervised learning to perform the grouping. Supervised methods need training data and information about groups beforehand; however, in the current reality, with an avalanche of data, this information is not available. Nevertheless, the need for grouping data remains. Clustering, as …

Searching For Needles In The Cosmic Haystack, Thomas Ryan Devine

Graduate Theses, Dissertations, and Problem Reports (ETD)

Searching for pulsar signals in radio astronomy data sets is a difficult task. The data sets are extremely large, approaching the petabyte scale, and are growing larger as instruments become more advanced. Big Data brings with it big challenges. Processing the data to identify candidate pulsar signals is computationally expensive and must utilize parallelism to be scalable. Labeling benchmarks for supervised classification is costly. To compound the problem, pulsar signals are very rare, e.g., only 0.05% of the instances in one data set represent pulsars. Furthermore, there are many different approaches to candidate classification with no consensus on a best …

Satellite Constellation Deployment And Management, Joseph Ryan Kopacz

Electronic Theses and Dissertations

This paper will review results and discuss a new method to address the deployment and management of a satellite constellation. The first two chapters will explorer the use of small satellites, and some of the advances in technology that have enabled small spacecraft to maintain modern performance requirements in incredibly small packages.

The third chapter will address the multiple-objective optimization problem for a global persistent coverage constellation of communications spacecraft in Low Earth Orbit. A genetic algorithm was implemented in MATLAB to explore the design space – 288 trillion possibilities – utilizing the Satellite Tool Kit (STK) software developers kit. …

Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones

UNF Graduate Theses and Dissertations

Characterizing languages D that are maximal with the property that D^* ⊆ S^⊗ is an important problem in formal language theory with applications to coding theory and DNA codewords. Given a finite set of words of a fixed length S, the constraint, we consider its subword closure, S^⊗, the set of words whose subwords of that fixed length are all in the constraint. We investigate these maximal languages and present characterizations for them. These characterizations use strongly connected components of deterministic finite automata and lead to polynomial time algorithms for generating such languages. We prove that …

An Exact Single-Agent Task Selection Algorithm For The Crowdsourced Logistics, Chung-Kyun Han, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

The trend of moving online in the retail industry has created great pressure for the logistics industry to catch up both in terms of volume and response time. On one hand, volume is fluctuating at greater magnitude, making peaks higher; on the other hand, customers are also expecting shorter response time. As a result, logistics service providers are pressured to expand and keep up with the demands. Expanding fleet capacity, however, is not sustainable as capacity built for the peak seasons would be mostly vacant during ordinary days. One promising solution is to engage crowdsourced workers, who are not employed …

A Review Of Emotion Sensing: Categorization Models And Algorithms, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria

Research Collection School Of Computing and Information Systems

Sentiment analysis consists in the identification of the sentiment polarity associated with a target object, such as a book, a movie or a phone. Sentiments reflect feelings and attitudes, while emotions provide a finer characterization of the sentiments involved. With the huge number of comments generated daily on the Internet, besides sentiment analysis, emotion identification has drawn keen interest from different researchers, businessmen and politicians for polling public opinions and attitudes. This paper reviews and discusses existing emotion categorization models for emotion analysis and proposes methods that enhance existing emotion research. We carried out emotion analysis by inviting experts from …

Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin

Research Collection School Of Computing and Information Systems

Sentiment classification is an important branch of cognitive computation—thus the further studies of properties of sentiment analysis is important. Sentiment classification on text data has been an active topic for the last two decades and learning-based methods are very popular and widely used in various applications. For learning-based methods, a lot of enhanced technical strategies have been used to improve the performance of the methods. Feature selection is one of these strategies and it has been studied by many researchers. However, an existing unsolved difficult problem is the choice of a suitable number of features for obtaining the best sentiment …