Theory and Algorithms Commons^™

Spectral Decomposition Of The Scattered Light Due To Deposits On The Solar Panel Surface, And Cross Correlated To Power Loss, Suzanna Ho

UNLV Theses, Dissertations, Professional Papers, and Capstones

The electric energy generated by solar panels declines due to dust particulates, bird deposits, water spots, and other contaminants that inhibit sunlight absorption and promote light scattering. As part of our research, we use cameras to capture images of solar panels, and analyze the images to detect the amount of scattered light. The more scattered light there is, the less light there is to penetrate the solar panel glass and reach the part of the panel that converts incident light to electric energy; therefore, less energy is generated. In this paper, we discuss the classification algorithm we developed to classify …

Concurrent Localized Wait-Free Operations On A Red Black Tree, Vitaliy Kubushyn

UNLV Theses, Dissertations, Professional Papers, and Capstones

A red-black tree is a type of self-balancing binary search tree. Some wait-free algorithms have been proposed for concurrently accessing and modifying a red-black tree from multiple threads in shared memory systems. Most algorithms presented utilize the concept of a "window", and are entirely top-down implementations. Top-down algorithms like these have to operate on large portions of the tree, and operations on nodes that would otherwise not overlap at all still have to compete with and help one another.

A wait-free framework is proposed for obtaining ownership of small portions of the tree at a time in a bottom-up manner. …

Feasibility Of Scalable Quantum Computers, Benjamin N. Goodberry

Selected Honors Theses

No abstract provided.

Band Selection For Hyperspectral Images Using Probabilistic Memetic Algorithm, Liang Feng, Ah-Hwee Tan, Meng-Hiot Lim, Si Wei Jiang

Research Collection School Of Computing and Information Systems

Band selection plays an important role in identifying the most useful and valuable information contained in the hyperspectral images for further data analysis such as classification, clustering, etc. Memetic algorithm (MA), among other metaheuristic search methods, has been shown to achieve competitive performances in solving the NP-hard band selection problem. In this paper, we propose a formal probabilistic memetic algorithm for band selection, which is able to adaptively control the degree of global exploration against local exploitation as the search progresses. To verify the effectiveness of the proposed probabilistic mechanism, empirical studies conducted on five well-known hyperspectral images against two …

Networked Employment Discrimination, Tamara Kneese

Media Studies

Employers often struggle to assess qualified applicants, particularly in contexts where they receive hundreds of applications for job openings. In an effort to increase efficiency and improve the process, many have begun employing new tools to sift through these applications, looking for signals that a candidate is “the best fit.” Some companies use tools that offer algorithmic assessments of workforce data to identify the variables that lead to stronger employee performance, or to high employee attrition rates, while others turn to third party ranking services to identify the top applicants in a labor pool. Still others eschew automated systems, but …

Comparison Of Optimization Techniques In Large Scale Transportation Problems, Tapojit Kumar

Journal of Undergraduate Research at Minnesota State University, Mankato

The Transportation Problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. Although it can be solved as a Linear Programming problem, other methods exist. Linear Programming makes use of the Simplex Method, an algorithm invented to solve a linear program by progressing from one extreme point of the feasible polyhedron to an adjacent one. The algorithm contains tactics like pricing and pivoting. For a Transportation Problem, a simplified version of the regular Simplex …

Comparison Of Sequence Alignment Algorithms, Tejas Gandhi

Journal of Undergraduate Research at Minnesota State University, Mankato

The fact that biological sequences can be represented as strings belonging to a finite alphabet (A, C, G, and T for DNA) plays an important role in connecting biology to computer science. String representation allows researchers to apply various string comparison techniques available in computer science. As a result, various applications have been developed that facilitate the task of sequence alignment. The problem of finding sequence alignments consists of finding the best match between two biological sequences. A best match can infer an evolutionary relationship and functional similarity. However, there is a lack of research on how reliable and efficient …

Improved Storm Data Processing Through Parallel Computing Approaches, Shauna Smith

Journal of Undergraduate Research at Minnesota State University, Mankato

A previous research study conducted at Michigan Technological University by Dr. Deborah Nykanen and her colleague Dr. Daniel Harris analyzed storm data in order to develop algorithms that will allow coarse resolution rainfall forecasted by weather models to be optimally used in high resolution hydrology models with the goal of improving stream flow predictions and early detection algorithms that can be used to warn communities about potential flash floods. This research was performed by analyzing a series of independent radar images derived from Weather Surveillance Radar-1988 Doppler (WSR-88D) data obtained from Dr. James A. Smith at Princeton University using a …

Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook

Journal of Undergraduate Research at Minnesota State University, Mankato

Most algorithms’ performance is limited by the data structures they use. Internal algorithms then decide the performance of the data structure. This cycle continues until fundamental results, verified by analysis and experiment, prevent further improvement. In this paper I examine one specific example of this. The focus of this work is primarily on a new variant of the pairing heap. I will review the new implementation, compare its theoretical performance, and discuss my original contribution: the first preliminary data on its experimental performance. It is instructive to provide some background information, followed by a formal definition of heaps in 1.1. …

Improved Microrobotic Control Through Image Processing And Automated Hardware Interfacing, Archit R. Aggarwal, Wuming Jing, David J. Cappelleri

The Summer Undergraduate Research Fellowship (SURF) Symposium

Untethered submilliliter-sized robots (microrobots) are showing potential use in different industrial, manufacturing and medical applications. A particular type of these microrobots, magnetic robots, have shown improved performance in power and control capabilities compared to the other thermal and electrostatic based robots. However, the magnetic robot designs have not been assessed in a robust manner to understand the degree of control in different environments and their application feasibility. This research project seeks to develop a custom control software interface to provide a holistic tool for researchers to evaluate the microrobotic performance through advance control features. The software deliverable involved two main …

Multi-Valued Argumentation Frameworks, Pierpaolo Dondio

Conference papers

In this paper we explore how the seminal Dung’s abstract argumentation framework can be extended to handle arguments containing gradual concepts. We allow arguments to have a degree of truth associated with them and we investigate the degree of truth to which each argument can be considered accepted, rejected and undecided by an abstract argumentation semantics. We propose a truth-compositional recursive computation, and we discuss examples using the major multi-valued logics such as Godel’s, Zadeh’s and Łukasiewicz's logic. The findings are a contribution in the field of non-monotonic approximate reasoning and they also represent a well-grounded proposal towards the introduction …

A Comparative Study Of Underwater Robot Path Planning Algorithms For Adaptive Sampling In A Network Of Sensors, Sreeja Banerjee

School of Computing: Dissertations, Theses, and Student Research

Monitoring lakes, rivers, and oceans is critical to improving our understanding of complex large-scale ecosystems. We introduce a method of underwater monitoring using semi-mobile underwater sensor networks and mobile underwater robots in this thesis. The underwater robots can move freely in all dimension while the sensor nodes are anchored to the bottom of the water column and can move only up and down along the depth of the water column. We develop three different algorithms to optimize the path of the underwater robot and the positions of the sensors to improve the overall quality of sensing of an area of …

A Characterization Of Open Shop Scheduling Problems Using The Hall Theorem And Network Flow, Arunasri Chitti

UNLV Theses, Dissertations, Professional Papers, and Capstones

Open shop scheduling problems are combinatorial problems where jobs with certain processing requirements on a number of different machines must be arranged in such a way that objectives related to completion time are optimized. Such problems have applications over a wide spectrum including such as communications, routing and manufacturing.

Many open shop problems are NP-hard but there are a number of special cases which possess polynomial solutions in the case of few machines or few jobs or when preemption of jobs is permitted. Many such solutions are based in the theory of matching or Hall's theorem, or more generally network …

A Taxonomy Of Polynomially Solvable Shop Problems With Limited Number Of Machines Or Jobs, Megha Sairam Darapuneni

UNLV Theses, Dissertations, Professional Papers, and Capstones

Among shop scheduling problems, job shop and mixed shop are one of the most general models encompassing open shop and flow shop. Many job shop problems are NP hard, but there are numerous cases, which possess polynomial solutions when the number of jobs or the number of machines (or both) is limited.

This thesis gives an overview of methods and algorithms for solving - in polynomial time - such special shop problems, including open, flow, job shop and mixed shop. The tools used include Monge interchange, dynamic programming, greedy techniques and sweep line algorithms and the primary focus of this …

Approaches For Generating 2d Shapes, Pratik Shankar Hada

UNLV Theses, Dissertations, Professional Papers, and Capstones

Constructing a two dimensional shape from given a set of point sites is a well known problem in computation geometry. We present a critical review of the existing algorithms for constructing polygonal shapes. We present a new approach calledinward dentingfor constructing simple polygons. We then extend the proposed approach for modeling polygons with holes. This is the

first known algorithm for modeling holes in the interior of 2d shapes. We also present experimental investigations of the quality of the solutions generated by the proposed algorithms.

For this we implemented the proposed algorithms in Java programming language. The prototype program can …

Ultimate Codes: Near-Optimal Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Chong Wang, Ke Zhou, Yuhong Zhao

School of Computing: Technical Reports

As modern storage systems have grown in size and complexity, RAID-6 is poised to replace RAID-5 as the dominant form of RAID architectures due to its ability to protect against double disk failures. Many excellent erasure codes specially designed for RAID-6 have emerged in recent years. However, all of them have limitations. In this paper, we present a class of near perfect erasure codes for RAID-6, called the Ultimate codes. These codes encode, update and decode either optimally or nearly optimally, regardless of what the code length is. This implies that utilizing these codes we can build highly efficient and …

S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang

School of Computing: Technical Reports

RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) array codes are the most popular erasure codes that can be used for implementing RAID-6, since they enable optimal storage efficiency and efficient encoding and decoding algorithms. In this paper, we propose a new class of MDS array codes called …

Structure Preserving Large Imagery Reconstruction, Ju Shen, Jianjun Yang, Sami Taha Abu Sneineh, Bryson Payne, Markus Hitz

Computer Science Faculty Publications

With the explosive growth of web-based cameras and mobile devices, billions of photographs are uploaded to the internet. We can trivially collect a huge number of photo streams for various goals, such as image clustering, 3D scene reconstruction, and other big data applications. However, such tasks are not easy due to the fact the retrieved photos can have large variations in their view perspectives, resolutions, lighting, noises, and distortions. Furthermore, with the occlusion of unexpected objects like people, vehicles, it is even more challenging to find feature correspondences and reconstruct realistic scenes. In this paper, we propose a structure-based image …

Evaluation Of Ct Images Created Using A New Metal Artifact Reduction Reconstruction Algorithm For Radiation Therapy Treatment Planning, John Niemkiewicz, Andrew G. Palmiotti, Marc S. Miner, Lee E. Stunja, Jenelle Bergene

Department of Radiation Oncology

No abstract provided.

A Novel Algorithm Based On Visual Saliency Attention For Localization And Segmentation In Rapidly-Stained Leukocyte Images, Xin Zheng, Yong Wang, Guoyou Wang, Zhong Chen

Research Collection School Of Computing and Information Systems

In this paper, we propose a fast hierarchical framework of leukocyte localization and segmentation in rapidly-stained leukocyte images (RSLI) with complex backgrounds and varying illumination. The proposed framework contains two main steps. First, a nucleus saliency model based on average absolute difference is built, which locates each leukocyte precisely while effectively removes dyeing impurities and erythrocyte fragments. Secondly, two different schemes are presented for segmenting the nuclei and cytoplasm respectively. As for nuclei segmentation, to solve the overlap problem between leukocytes, we extract the nucleus lobes first and further group them. The lobes extraction is realized by the histogram-based contrast …

Idpal – A Partially-Adiabatic Energy-Efficient Logic Family: Theory And Applications To Secure Computing, Mihail T. Cutitaru

Electrical & Computer Engineering Theses & Dissertations

Low-power circuits and issues associated with them have gained a significant amount of attention in recent years due to the boom in portable electronic devices. Historically, low-power operation relied heavily on technology scaling and reduced operating voltage, however this trend has been slowing down recently due to the increased power density on chips. This dissertation introduces a new very-low power partially-adiabatic logic family called Input-Decoupled Partially-Adiabatic Logic (IDPAL) with applications in low-power circuits. Experimental results show that IDPAL reduces energy usage by 79% compared to equivalent CMOS implementations and by 25% when compared to the best adiabatic implementation. Experiments ranging …

Building Algorithm Portfolios For Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The present study introduces an automated mechanism to build algorithm portfolios for memetic algorithms. The objective is to determine an algorithm set involving combinations of crossover, mutation and local search operators based on their past performance. The past performance is used to cluster algorithm combinations. Top performing combinations are then considered as the members of the set. The set is expected to have algorithm combinations complementing each other with respect to their strengths in a portfolio setting. In other words, each algorithm combination should be good at solving a certain type of problem instances such that this set can be …

Verifying Monadic Second-Order Properties Of Graph Programs, Christopher M. Poskitt, Detlef Plump

Research Collection School Of Computing and Information Systems

The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to express important global properties of graphs such as acyclicity, connectedness, or existence of paths. In this paper, we extend the nested graph conditions of Habel, Pennemann, and Rensink to make them equivalently expressive to monadic second-order logic on graphs. We present a weakest liberal precondition construction for these assertions, and demonstrate its use in verifying …

A Simple Polynomial-Time Randomized Distributed Algorithm For Connected Row Convex Constraints, T. K. Satish Kumar, Nguyen Duc Thien, William Yeoh, Sven Koenig

Research Collection School Of Computing and Information Systems

In this paper, we describe a simple randomized algorithm that runs in polynomial time and solves connected row convex (CRC) constraints in distributed settings. CRC constraints generalize many known tractable classes of constraints like 2-SAT and implicational constraints. They can model problems in many domains including temporal reasoning and geometric reasoning, and generally speaking, play the role of "Gaussians" in the logical world. Our simple randomized algorithm for solving them in distributed settings, therefore, has a number of important applications. We support our claims through a theoretical analysis and empirical results.

Network And Energy-Aware Resource Selection Model For Opportunistic Grids, Izaias Faria, Mario Dantas, Miriam A M Capretz, Wilson Higashino

Electrical and Computer Engineering Publications

Due to increasing hardware capacity, computing grids have been handling and processing more data. This has led to higher amount of energy being consumed by grids; hence the necessity for strategies to reduce their energy consumption. Scheduling is a process carried out to define in which node tasks will be executed in the grid. This process can significantly impact the global system performance, including energy consumption. This paper focuses on a scheduling model for opportunistic grids that considers network traffic, distance between input files and execution node as well as the execution node status. The model was tested in a …

Query Analyzer And Manager For Complex Event Processing As A Service, Wilson Higashino, Cedric Eichler, Miriam A M Capretz, Thierry Monteil, M. Beatriz F. Toledo, Patricia Stolf

Electrical and Computer Engineering Publications

Complex Event Processing (CEP) is a set of tools and techniques that can be used to obtain insights from high-volume, high-velocity continuous streams of events. CEP-based systems have been adopted in many situations that require prompt establishment of system diagnostics and execution of reaction plans, such as in monitoring of complex systems. This article describes the Query Analyzer and Manager (QAM) module, a first effort toward the development of a CEP as a Service (CEPaaS) system. This module is responsible for analyzing user-defined CEP queries and for managing their execution in distributed cloud-based environments. Using a language-agnostic internal query representation, …

Evaluation Of Particle Swarm Optimization Applied To Grid Scheduling, Wilson Higashino, Miriam A M Capretz, M. Beatriz F. Toledo

Electrical and Computer Engineering Publications

The problem of scheduling independent users’ jobs to resources in Grid Computing systems is of paramount importance. This problem is known to be NP-hard, and many techniques have been proposed to solve it, such as heuristics, genetic algorithms (GA), and, more recently, particle swarm optimization (PSO). This article aims to use PSO to solve grid scheduling problems, and compare it with other techniques. It is shown that many often-overlooked implementation details can have a huge impact on the performance of the method. In addition, experiments also show that the PSO has a tendency to stagnate around local minima in high-dimensional …

Contextual Anomaly Detection In Big Sensor Data, Michael Hayes, Miriam A M Capretz

Electrical and Computer Engineering Publications

Performing predictive modelling, such as anomaly detection, in Big Data is a difficult task. This problem is compounded as more and more sources of Big Data are generated from environmental sensors, logging applications, and the Internet of Things. Further, most current techniques for anomaly detection only consider the content of the data source, i.e. the data itself, without concern for the context of the data. As data becomes more complex it is increasingly important to bias anomaly detection techniques for the context, whether it is spatial, temporal, or semantic. The work proposed in this paper outlines a contextual anomaly detection …

Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

A top-k query shortlists the k records in a dataset that best match the user's preferences. To indicate her preferences, the user typically determines a numeric weight for each data dimension (i.e., attribute). We refer to these weights collectively as the query vector. Based on this vector, each data record is implicitly mapped to a score value (via a weighted sum function). The records with the k largest scores are reported as the result. In this paper we propose an auxiliary feature to standard top-k query processing. Specifically, we compute the maximal locus within which the query vector incurs no …

Fault Attacks On Hyperelliptic Curve Discrete Logarithm Problem Over Binary Field, Mingqiang Wang, Haiyang Xue, Tao Zhan

Research Collection School Of Computing and Information Systems

In this paper, we present invalid-curve attacks that apply to the hyperelliptic curve scalar multiplication (HECSM) algorithm proposed by Avanzi et al. on the genus 2 hyperelliptic curve over binary field. We observe some new properties of the HECSM. Our attacks are based on these new properties and the observation that the parameters f 0 and f 1 of the hyperelliptic curve equation are not utilized for the HECSM. We show that with different “values” for curve parameters f 0, f 1, there exsit cryptographically weak groups in the Koblitz hyperelliptic curve. Also, we compute the theoretical probability of getting …