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

Computer Engineering Commons

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

Theory and Algorithms

2014

Institution
Keyword
Publication
Publication Type

Articles 1 - 11 of 11

Full-Text Articles in Computer Engineering

Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook Aug 2014

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 Aug 2014

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 …


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

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

Department of Computer Science and Engineering: 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 …


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

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

CSE 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 Jul 2014

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

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


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

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 …


Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack Jun 2014

Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack

Master's Theses

GenSel is a genetic selection analysis tool used to determine which genetic markers are informational for a given trait. Performing genetic selection related analyses is a time consuming and computationally expensive task. Due to an expected increase in the number of genotyped individuals, analysis times will increase dramatically. Therefore, optimization efforts must be made to keep analysis times reasonable.

This thesis focuses on optimizing one of GenSel’s underlying algorithms for heterogeneous computing. The resulting algorithm exposes task-level parallelism and data-level parallelism present but inaccessible in the original algorithm. The heterogeneous computing solution, ReGen, outperforms the optimized CPU implementation achieving a …


Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo Jun 2014

Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Organizing video search results in a list view is widely adopted by current commercial search engines, which cannot support efficient browsing for complex search topics that have multiple semantic facets. In this article, we propose to organize video search results in a highly structured way. Specifically, videos are placed on a semantic hierarchy that accurately organizes various facets of a given search topic. To pick the most suitable videos for each node of the hierarchy, we define and utilize three important criteria: relevance, uniqueness, and diversity. Extensive evaluations on a large YouTube video dataset demonstrate the effectiveness of our approach.


Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart May 2014

Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Geospatial information fusion is the process of synthesizing information from complementary data sources located at different points in space and time. Spatial phenomena are often measured at discrete locations by sensor networks, technicians, and volunteers; yet decisions often require information about locations where direct measurements do not exist. Traditional methods assume the spatial phenomena to be either discrete or continuous, an assumption that underlies and informs all subsequent analysis. Yet certain phenomena defy this dichotomy, alternating as they move across spatial and temporal scales. Precipitation, for example, appears continuous at large scales, but it can be temporally decomposed into discrete …


Real-Time Scheduling Of Embedded Applications On Multi-Core Platforms, Ming Fan Mar 2014

Real-Time Scheduling Of Embedded Applications On Multi-Core Platforms, Ming Fan

FIU Electronic Theses and Dissertations

For the past several decades, we have experienced the tremendous growth, in both scale and scope, of real-time embedded systems, thanks largely to the advances in IC technology. However, the traditional approach to get performance boost by increasing CPU frequency has been a way of past. Researchers from both industry and academia are turning their focus to multi-core architectures for continuous improvement of computing performance. In our research, we seek to develop efficient scheduling algorithms and analysis methods in the design of real-time embedded systems on multi-core platforms. Real-time systems are the ones with the response time as critical as …


Neutrosophic Logic Approaches Applied To ”Rabot” Real Time Control, Alexandru Gal, Luige Vladareanu, Florentin Smarandache, Hongnian Yu, Mincong Deng Jan 2014

Neutrosophic Logic Approaches Applied To ”Rabot” Real Time Control, Alexandru Gal, Luige Vladareanu, Florentin Smarandache, Hongnian Yu, Mincong Deng

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we present a way of deciding which control law should operate at a time for a mobile walking robot. The proposed deciding method is based on the new research field, called Neutrosophic Logic. The results are presented as a simulated system for which the output is related to the inputs according to the Neutrosophic Logic.