Computer Engineering Commons^™

Campus Grids: A Framework To Facilitate Resource Sharing, Derek J. Weitzel

School of Computing: Dissertations, Theses, and Student Research

It is common at research institutions to maintain multiple clusters. These might fulfill different needs and policies, or represent different owners or generations of hard- ware. Many of these clusters are under utilized while researchers at other departments may require these resources. This may be solved by linking clusters with grid mid- dleware. This thesis describes a distributed high throughput computing framework to link clusters without changing security or execution environments. The framework initially keeps jobs local to the submitter, overflowing if necessary to the campus, and regional grid. The framework is implemented spanning two campuses at the Holland Computing …

Examination Of Chaotic Signal Encryption And Recovery For Secure Communication Using Hybrid Acousto-Optic Feedback, Monish Ranjan Chatterjee, Mohammed A. Al-Saedi

Electrical and Computer Engineering Faculty Publications

Generation of chaos from acousto-optic (A-O)Bragg cell modulators with an electronic feedback has been studied for over 3 decades. Since an acousto-optic Bragg cell with zeroth- and first-order feedback exhibits chaotic behavior past the threshold for bistability, such a system was recently examined for possible chaotic encryption of simple messages (such as a low-amplitude sinusoidal signal) applied via the bias input of the sound cell driver. Subsequent recovery of the message signal was carried out via a heterodyne-type strategy employing a locally generated chaotic carrier, with threshold parameters matched to the transmitting Bragg cell.

In this paper, we present numerical …

Joggler: Data Harvest And Analysis Tool, Ondrej Nebesky

Departmental Technical Reports (CS)

Linear-Time Resource Allocation In Security Games With Identical Fully Protective Resources, Octavio Lerma, Vladik Kreinovich, Chris Kiekintveld

Departmental Technical Reports (CS)

Game theory has become an important tools for making resource allocations decision in security domains, including critical infrastructure protection. Many of these games are formulated as Stackelberg security games. We present new analysis and algorithms for a class of Stackelberg security games with identical, fully protective defender resources. The first algorithm has worst-case complexity linear in the number of possible targets, but works only for a restricted case. The second algorithm can find and optimal resource allocation for the general case in time O(n log(n)).

When Is Busemann Product A Lattice? A Relation Between Metric Spaces And Corresponding Space-Time Models, Hans-Peter Künzi, Francisco Zapata, Vladik Kreinovich

Departmental Technical Reports (CS)

The causality relation of special relativity is based on the assumption that the speed of all physical processes is limited by the speed of light. As a result, an event (t,x) occurring at moment t at location x can influence an event (y,s) if and only if s >= t+d(x,y)/c. We can simplify this formula if we use units of time and distance in which c=1 (e.g., by using a light second as a unit of distance). In this case, the above causality relation takes the form s >= t+d(x,y). Since the actual space can be non-Euclidean, H. Busemann generalized …

An Expressive Vocal Midi Controller, Brady Hurlburt

Electrical Engineering Undergraduate Honors Theses

The choice of controller often characterizes the performance obtained from an electronic instrument. Controllers exist that allow electronic musicians to mimic the expressive qualities of keyboard, wind, string, and percussion instruments, but vocalists have been largely neglected. To fill this need, a realtime software vocal MIDI controller named Grove is developed and demonstrated. Grove's pitch and time analyses are shown to be accurate, and it has mappable control signals that go beyond the capabilities of previous audio-to-MIDI converters to facilitate an expressive performance. Grove's source code is available under the GNU GPL v3 license.

Integration Of Communication Constraints Into Physiocomimetic Swarms Via Placement Of Location Based Virtual Particles, Joshua J. Haley

HIM 1990-2015

This thesis describes a change to the Physiocomimetics Robotic Swarm Control framework that implements communication constraints into swarm behavior. These constraints are necessary to successfully implement theoretical applications in the real world. We describe the basic background of swarm robotics, the Physiocomimetics framework and methods that have attempted to implement communications constraints into robotic swarms. The Framework is changed by the inclusion of different virtual particles at a global and local scale that only cause a force on swarm elements if those elements are disconnected from a swarm network. The global particles introduced are a point of known connectivity and …

Computations Under Time Constraints: Algorithms Developed For Fuzzy Computations Can Help, Karen Villaverde, Olga Kosheleva, Martine Ceberio

Departmental Technical Reports (CS)

In usual computers -- that use binary representation of real numbers -- an irrational real number (and even a rational number like 1.3 or 1.2) can only be computed with a finite accuracy. The more accuracy we need, the larger the computation time. It is therefore reasonable to characterize the complexity of computing a real number a by the accuracy D(t) that we can achieve in time t. Once we know this characteristic for two numbers a and b, how can we compute a similar characteristic for, e.g., c = a + b$? In this paper, we show that the …

Uniqueness Of Reconstruction For Yager's T-Norm Combination Of Probabilistic And Possibilistic Knowledge, Nitaya Buntao, Vladik Kreinovich

Departmental Technical Reports (CS)

Often, about the same real-life system, we have both measurement-related probabilistic information expressed by a probability measure P(S) and expert-related possibilistic information expressed by a possibility measure M(S). To get the most adequate idea about the system, we must combine these two pieces of information. For this combination, R. Yager -- borrowing an idea from fuzzy logic -- proposed to use a t-norm f(a,b)$ such as the product f(a,b)=a*b, i.e., to consider a set function f(S)=f(P(S),M(S)). A natural question is: can we uniquely reconstruct the two parts of knowledge from this function f(S)? In our previous paper, we showed that …

Towards Optimal Knowledge Processing: From Centralization Through Cyberinsfrastructure To Cloud Computing, Octavio Lerma, Eric Gutierrez, Chris Kiekintveld, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the most efficient way to store and process data is cloud computing, when we store the data so as to minimize the expenses and increase the efficiency. In this paper, we provide an analytical solution to the corresponding optimization problem.

Functional Verification Of Class Invariants In Cleanjava, Carmen Avila, Yoonsik Cheon

Departmental Technical Reports (CS)

In a Cleanroom-style functional program verification, a program is viewed as a mathematical function from one program state to another, and a verification is done by comparing two functions, the implemented and the expected behaviors of a program. The technique requires a minimal mathematical background and supports forward reasoning, but it doesn't support assertions such as class invariants. However, assertions such as class invariants are not only a practical programming tool but also play a key role in the correctness proof of a program by specifying conditions and constraints that an object has to satisfy and thus defining valid states …

Estimating Probability Of Failure Of A Complex System Based On Partial Information About Subsystems And Components, With Potential Applications To Aircraft Maintenance, Christelle Jacob, Didier Dubois, Janette Cardoso, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

Exploration Of Spatial Diversity In Multi-Antenna Wireless Communication Systems, Shichuan Ma

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

With increasing demand on wireless internet and personal multimedia, the data rate of wireless communications is expected to increase dramatically. Future wireless networks face challenges of supporting data rates higher than one gigabits per second. Among various technologies, multi-antennas, also known as multiple-input multiple-output (MIMO), are undoubtedly the most promising to enable higher data rates. By employing the extra degrees of freedom in the spatial domain, multi-antenna techniques enhance the wireless communication systems through array gain, spatial diversity, and spatial multiplexing. Although multi-antenna systems have been utilized for more than ten years, a thorough analysis of various aspects of multi-antenna …

A Relativistic Enhancement To Software Transactional Memory, Philip William Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Relativistic Programming is a technique that allows low overhead, linearly-scalable concurrent reads. It also allows joint access parallelism between readers and a writer. Unfortunately, it has so far been limited to a single writer so it does not scale on the write side. Software Transactional Memory (STM) is a technique that allows programs to take advantage of disjoint access parallelism on both the read-side and write-side. Unfortunately, STM systems have a higher overhead than many other synchronization mechanisms so although STM scales, STM starts from a lower baseline. We propose combining relativistic programming and software transactional memory in a way …

Energy Efficient Compressed Sensing In Wireless Sensor Networks Via Random Walk, Robert Brian Fletcher

Masters Theses and Doctoral Dissertations

In this paper, we explore the problem of data acquisition using compressive sensing (CS) in wireless sensor networks. Unique properties of wireless sensor networks require we minimize communication cost for efficient power usage. At first, a compressive distributed sensing (CDS) algorithm is proposed but is then modified to decrease communication costs. The final algorithm presented is compressive distributed sensing with random walk CDS(RW); an algorithm that combines the data gathering and projection generation process of CDS.CDS(RW) uses rateless encoding, graph algorithms, and belief propagation decoding to improve upon the communication cost associated with CDS. In the end, we show that …

Protein Structure-Based Method For Identification Of Horizontal Gene Transfer In Bacteria, Swetha Billa

School of Computing: Dissertations, Theses, and Student Research

Horizontal Gene Transfer is defined as the movement of genetic material from one strain of species to another. Bacteria, being an asexual organism were always believed to transfer genes vertically. But recent studies provide evidence that shows bacteria can also transfer genes horizontally.

HGT plays a major role in evolution and medicine. It is the major contributor in bacterial evolution, enabling species to acquire genes to adapt to the new environments. Bacteria are also believed to develop drug resistance to antibiotics through the phenomenon of HGT. Therefore further study of HGT and its implications is necessary to understand the effects …

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 …

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

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 …

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 …

Flexible Tuning Software: Beyond Equal Temperament, Erica Sponsler

Renée Crown University Honors Thesis Projects - All

The premise of this creative Capstone project was to develop a computer instrument that is capable of tuning itself flexibly in such a way as to not require a tempering of the Western scale, as is necessary for fixedly tuned instruments. The difficulty in creating such a system of tuning arises from the mathematical paradox of the musical harmonic series, which is the sequence of frequencies that sound naturally as overtones over a fundamental pitch. They follow a proportional pattern of 1:2, 2:3, 3:4, etc. These small-integer ratios of frequencies represent the consonant (in-tune) harmonic intervals. When an interval does …

Growndswell Iphone Application Development, Arti Chandok

Renée Crown University Honors Thesis Projects - All

GrowndSwell is a location-based social networking service developed to primarily solve the problem of trying to text several friends in order to convey a simple piece of information: “What are you planning to do today?” This capstone project is focused on developing an iPhone application as a tool for users to convey this information in an efficient and fun manner. The problem requires several tools to capture the market through development of phone applications that are compatible on several platforms and creating an attractive website for brand awareness. This capstone project has focused its attention on the product development of …

Clustering Educational Digital Library Usage Data: Comparisons Of Latent Class Analysis And K-Means Algorithms, Beijie Xu

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

There are common pitfalls and neglected areas when using clustering approaches to solve educational problems. A clustering algorithm is often used without the choice being justified. Few comparisons between a selected algorithm and a competing algorithm are presented, and results are presented without validation. Lastly, few studies fully utilize data provided in an educational environment to evaluate their findings. In response to these problems, this thesis describes a rigorous study comparing two clustering algorithms in the context of an educational digital library service, called the Instructional Architect.

First, a detailed description of the chosen clustering algorithm, namely, latent class analysis …

Field-Programmable Gate Array Implementation Of A Scalable Integral Image Architecture Based On Systolic Arrays, Juan Alberto De La Cruz

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The integral image representation of an image is important for a large number of modern image processing algorithms. Integral image representations can reduce computation and increase the operating speed of certain algorithms, improving real-time performance. Due to increasing demand for real-time image processing performance, an integral image architecture capable of accelerating the calculation based on the amount of available resources is presented. Use of the proposed accelerator allows for subsequent stages of a design to have data sooner and execute in parallel. It is shown here how, with some additional resources used in the Field Programmable Gate Array (FPGA), a …

Computational Efficiency Of A Hybrid Mass Concentration And Spherical Harmonic Modeling, Nathan Piepgrass

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Through Spherical Harmonics, one can describe complex gravitational fields. However as the order and degree of the spherical harmonics increases, the computation speed rises exponentially. In addition, for onboard applications of spherical harmonics, the processors are radiation hardened in order to mitigate negative effects of the space environment on electronics. But, those processors have outdated processing speeds, resulting in a slower onboard spherical harmonic program.

This thesis examines a partial solution to the slow computation speed of spherical harmonics programs. The partial solution was to supplant the gravity models in the flight software. The spherical harmonics gravity model can be …

Optical Network-On-Chip Architectures And Designs, Lei Zhang

UNLV Theses, Dissertations, Professional Papers, and Capstones

As indicated in the latest version of ITRS roadmap, optical wiring is a viable interconnection technology for future SoC/SiC/SiP designs that can provide broad band data transfer rates unmatchable by the existing metal/low-k dielectric interconnects. In this dissertation study, a set of different optical interconnection architectures are presented for future on-chip optical micro-networks.

Three Optical Network-on-Chip (ONoC) architectures, i.e., Wavelength Routing Optical Network-on-Chip (WRON), Redundant Wavelength Routed Optical Network (RDWRON) and Recursive Wavelength Routed Optical Network (RCWRON) are proposed. They are fully connected networks designed based on passive switching Microring Resonator (MRR) optical switches. Given enough different routing optical wavelengths, …

Interactive Opengl Animation, Lusha Zhang

Renée Crown University Honors Thesis Projects - All

This is an interactive animation created using C language, with support from the OpenGL, GLUT and the SDL frameworks. The concept behind this animation is to utilize the functions provided by OpenGL to achieve visual effects involving lighting, texture, motion, modeling and interaction.

Based on experiment and research on various libraries, the Simple DirectMedia Layer (SDL) framework was chosen to implement an audio frame buffer to play background music. The animation involved significant mathematical calculation in terms of motion and modeling. The animation is an underwater scene that contains randomly generated bubbles, a dolphin and a whale. Textures were applied …

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 …

An Empirical Study Of Student Programming Bugs, Amy Hansen

Undergraduate Honors Capstone Projects

Students in introductory computer science courses often have difficulty with coding and problem solving, which results in bugs. These bugs cause both student frustration and attrition of many of our CS majors. In this work, we seek to understand the bugs that students encounter. We have two sources of data. First, we collect and analyze 450 bugs that were brought to our tutor lab by our CS 1 and CS2 students. Second, we analyze bugs in CS I homework assignments. The results show that the majority of the problems are due to problem solving skills, while the remaining problems involve …

Ontology For Psychophysiological Dysregulation Of Anger/Aggression, Swathi Vasanthapuram

School of Computing: Dissertations, Theses, and Student Research

The advancement of Information Technology in the last four decades led to the use of computers in medicine. A new area called Medical Informatics has emerged. This area comprises the application of IT to healthcare with the aim of creating tools that help healthcare personnel diagnose and treat patients more accurately and efficiently. IT not only provides tools for storing, integrating, and updating patient information base but also for processing information efficiently. One of such tools is a Clinical Decision Support System. Ontologies are an integral part of clinical decision support systems because they help formalize and integrate domain knowledge. …