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

Engineering Commons

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

Articles 1 - 15 of 15

Full-Text Articles in Engineering

Accelerating Pattern Recognition Algorithms On Parallel Computing Architectures, Kenneth Rice Dec 2011

Accelerating Pattern Recognition Algorithms On Parallel Computing Architectures, Kenneth Rice

All Dissertations

The move to more parallel computing architectures places more responsibility on the programmer to achieve greater performance. The programmer must now have a greater understanding of the underlying architecture and the inherent algorithmic parallelism. Using parallel computing architectures for exploiting algorithmic parallelism can be a complex task. This dissertation demonstrates various techniques for using parallel computing architectures to exploit algorithmic parallelism. Specifically, three pattern recognition (PR) approaches are examined for acceleration across multiple parallel computing architectures, namely field programmable gate arrays (FPGAs) and general purpose graphical processing units (GPGPUs).
Phase-only filter correlation for fingerprint identification was studied as the first …


The Design Of A Haptic Device For Training And Evaluating Surgeon And Novice Laparoscopic Movement Skills, Ryan Bontreger Dec 2011

The Design Of A Haptic Device For Training And Evaluating Surgeon And Novice Laparoscopic Movement Skills, Ryan Bontreger

All Theses

As proper levels of force application are necessary to ensure patient safety, and training hours with an expert on live subjects are difficult, enhanced computer-based training is needed to teach the next generation of surgeons. Considering the role of touch in surgery, there is a need for a device capable of discerning the haptic ability of surgical trainees. This need is amplified by minimally invasive surgical techniques where a surgeon's sense of tissue properties comes not directly through their own hands but indirectly through the tools. A haptic device capable of producing a realistic range of forces and motions that …


Parallel Implementation Of The Singular Value Decomposition Using Opencl, Bhushan Rayrikar Dec 2011

Parallel Implementation Of The Singular Value Decomposition Using Opencl, Bhushan Rayrikar

All Theses

General-Purpose Graphics Processing Units (GPGPUs) have massively parallel computational capabilities. Low cost and ease of programming make them a popular choice over other parallel architectures such as large clusters and accelerators such as Field-Programmable Gate Arrays (FPGAs). Mature programming frameworks for GPGPUs, such as CUDA from Nvidia and OpenCL from the Khronos Group, reduce the learning curve and development time for programming GPGPU architectures. OpenCL, a relatively new industry standard for parallel computing makes it possible to write a single program for heterogeneous platforms that is portable across multiple platforms including GPGPUs and multi-core processors with minimal coding modifications.
GPGPU …


Performance Analysis And Fitness Of Gpgpu And Multicore Architectures For Scientific Applications, Mohammad Bhuiyan Dec 2011

Performance Analysis And Fitness Of Gpgpu And Multicore Architectures For Scientific Applications, Mohammad Bhuiyan

All Dissertations

Recent trends in computing architecture development have focused on exploiting task- and data-level parallelism from applications. Major hardware vendors are experimenting with novel parallel architectures, such as the Many Integrated Core (MIC) from Intel that integrates 50 or more x86 processors on a single chip, the Accelerated Processing Unit from AMD that integrates a multicore x86 processor with a graphical processing unit (GPU), and many other initiatives from other hardware vendors that are underway.
Therefore, various types of architectures are available to developers for accelerating an application. A performance model that predicts the suitability of the architecture for accelerating an …


A New Approach To Dynamic Modeling Of Continuum Robots, Nivedhitha Giri Dec 2011

A New Approach To Dynamic Modeling Of Continuum Robots, Nivedhitha Giri

All Theses

ABSTRACT
In this thesis, a new approach for developing practically realizable dynamic models for continuum robots is proposed. Based on the new dynamic models developed, a novel technique for analyzing the capabilities of continuum manipulators to be employed in various real world applications has also been proposed and developed.
A section of a continuum arm is modeled using lumped model elements (masses, springs and dampers). It is shown that this model, although an approximation to a continuum structure, can be used to conveniently analyze the dynamics of the arm with suitable tradeoff in accuracy of modeling. This relatively simple model …


Analysis And Implementation Of Room Assignment Problem And Cannon's Algorithm On General Purpose Programmable Graphical Processing Units With Cuda, Harsh Vardhan Dwivedi Dec 2011

Analysis And Implementation Of Room Assignment Problem And Cannon's Algorithm On General Purpose Programmable Graphical Processing Units With Cuda, Harsh Vardhan Dwivedi

All Theses

General-purpose Graphics Processing Units (GP-GPU) has emerged as a popular computing paradigm for high-performance computing over the last few years. The increased interest in GP-GPUs for parallel computing mirrors the trend in general computing with the rise of multi-core processors as an alternative approach to increase processor performance. Many applications that were previously accelerated on distributed processing platforms with MPI or multithreaded techniques such as OpenMP are now being investigated to assess their performance on GP-GPU platforms. Since the GP-GPU platform is designed to give higher performance for parallel problems, applications on other parallel architectures are good candidates for performance …


Measuring Digital System Latency From Sensing To Actuation At Continuous 1 Millisecond Resolution, Weixin Wu Dec 2011

Measuring Digital System Latency From Sensing To Actuation At Continuous 1 Millisecond Resolution, Weixin Wu

All Theses

This thesis describes a new method for measuring the end-to-end latency between sensing and actuation in a digital computing system. Compared to previous work, which generally measures the latency at 16-33 ms intervals or at discrete events separated by hundreds of ms, our new method measures the latency continuously at 1 millisecond resolution. This allows for the observation of variations in latency over sub 1 s periods, instead of relying upon averages of measurements. We have applied our method to two systems, the ?rst using a camera for sensing and an LCD monitor for actuation, and the second using an …


A Comparison Of The Performance Of Neural Q-Learning And Soar-Rl On A Derivative Of The Block Design (Bd)/Block Design Multiple Choice (Bdmc) Subtests On The Wisc-Iv Intelligence Test, Charreau Bell Dec 2011

A Comparison Of The Performance Of Neural Q-Learning And Soar-Rl On A Derivative Of The Block Design (Bd)/Block Design Multiple Choice (Bdmc) Subtests On The Wisc-Iv Intelligence Test, Charreau Bell

All Theses

Teaching an autonomous agent to perform tasks that are simple to humans can be complex, especially when the task requires successive steps, has a low likelihood of successful completion with a brute force approach, and when the solution space is too large or too complex to be explicitly encoded. Reinforcement learning algorithms are particularly suited to such situations, and are based on rewards that help the agent to find the optimal action to execute given a certain state. The task investigated in this thesis is a modified form of the Block Design (BD) and Block Design Multiple Choice (BDMC) subtests, …


An Investigation Into Segmenting Traffic Images Using Various Types Of Graph Cuts, Jonathan Dinger Aug 2011

An Investigation Into Segmenting Traffic Images Using Various Types Of Graph Cuts, Jonathan Dinger

All Theses

In computer vision, graph cuts are a way of segmenting an image into multiple areas. Graphs are built using one node for each pixel in the image combined with two extra nodes, known as the source and the sink. Each node is connected to several other nodes using edges, and each edge has a specific weight. Using different weighting schemes, different segmentations can be performed based on the properties used to create the weights. The cuts themselves are performed using an implementation of a solution to the maximum flow problem, which is then changed into a minimum cut according to …


Dynamics And Control Of The Shoot-The-Moon Tabletop Game, Peng Xu Aug 2011

Dynamics And Control Of The Shoot-The-Moon Tabletop Game, Peng Xu

All Theses

The classic table-top game Shoot-the-Moon has interesting dynamics despite its simple structure, consisting of a steel ball rolling on two cylindrical rods. The two sloped rods are hinged at the lower ends and allowed to freely slide in a slot at the higher end. The ball can amazingly roll upward along the rods under carefully manipulation of the rods. There is also an interaction between ball rotation and translation that cause the ball to ``shoot'' (quickly accelerate).
In this thesis, the kinematics are developed for Shoot-the-Moon and then equations of motion are derived using both Lagrangian and Newtonian approaches. The …


Pose Estimation For Robotic Disassembly Using Ransac With Line Features, Shyam Sundar Aswadha Narayanan May 2011

Pose Estimation For Robotic Disassembly Using Ransac With Line Features, Shyam Sundar Aswadha Narayanan

All Theses

In this thesis, a new technique to recognize and estimate the pose of a given 3-D object from a single real image provided known prior knowledge of its approximate structure is proposed. Metrics to evaluate the correctness of a calculated pose are presented and analyzed. The traditional and the more recent approaches used in solving this problem are explored and the various methodologies adopted are discussed.
The first step in disassembling a given assembly from its image is to recognize the attitude and translation of each of its constituent components - a fundamental problem which is being addressed in this …


Strengthening The Anonymity Of Anonymous Communication Systems, Christopher Abbott May 2011

Strengthening The Anonymity Of Anonymous Communication Systems, Christopher Abbott

All Theses

In this work, we examine why a popular anonymity network, Tor, is vulnerable to timing side-channel attacks. We explore removing this vulnerability from Tor without sacrificing its low-latency which is important for usability.
We find that Tor is vulnerable because inter-packet delays propagate along the network path from the source to the destination. This provides an easily detected signature. We explore techniques for making the timing signature either expensive or impossible to detect.
If each packet took a unique, disjoint path from source to destination the inter-packet delay signature would be undetectable. Jitter and latency would change packet arrival orders. …


Towards Securing Virtualization Using A Reconfigurable Platform, Tushar Janefalkar May 2011

Towards Securing Virtualization Using A Reconfigurable Platform, Tushar Janefalkar

All Theses

Virtualization is no longer limited to main stream processors and servers. Virtualization software for General Purpose Processors (GPP) that allow one Operating System (OS) to run as an application in another OS have become commonplace. To exploit the full potential of the available hardware, virtualization is now prevalent across all systems big and small. Besides GPPs, state-of-the-art embedded processors are now capable of running rich operating systems and their virtualization is now a hot topic of research. However, this technological progress also opens doors for attackers to snoop on data that is not only confined to storage servers but also …


Implementing Transparent Compression And Leveraging Solid State Disks In A High Performance Parallel File System, David Bonnie May 2011

Implementing Transparent Compression And Leveraging Solid State Disks In A High Performance Parallel File System, David Bonnie

All Theses

In recent years computers have been increasing in compute density and speed at a dramatic pace. This increase allows for massively parallel programs to run faster than ever before. Unfortunately, many such programs are being held back by the relatively slow I/O subsystems that they are forced to work with. Storage technology simply has not followed the same curve of progression in the computing world. Because the storage systems are so slow in comparison the processors are forced to idle while waiting for data; a potentially performance crippling condition.
This performance disparity is lessened by the advent of parallel file …


Scalable Capability-Based Authorization For High-Performance Parallel File Systems, Nicholas Mills May 2011

Scalable Capability-Based Authorization For High-Performance Parallel File Systems, Nicholas Mills

All Theses

As the size and scale of supercomputers continues to increase at an
exponential rate the number of users on a given supercomputer will
only grow larger. A larger number of users on a supercomputer places a
greater importance on the strength of information security. Nowhere is
this requirement for security more apparent than the file system, as
users expect their data to be protected from accidental or deliberate
modification.
In spite of the ever-increasing demand for more secure file system
access the majority of parallel file systems do not implement a robust
security protocol for fear it will negatively impact …