Theory and Algorithms Commons^™

Powers And Behaviors Of Directed Self-Assembly, Trent Allen Rogers

Graduate Theses and Dissertations

In nature there are a variety of self-assembling systems occurring at varying scales which give rise to incredibly complex behaviors. Theoretical models of self-assembly allow us to gain insight into the fundamental nature of self-assembly independent of the specific physical implementation. In Winfree's abstract tile assembly model (aTAM), the atomic components are unit square "tiles" which have "glues" on their four sides. Beginning from a seed assembly, these tiles attach one at a time during the assembly process in an asynchronous and nondeterministic manner.

We can gain valuable insights into the nature of self-assembly by comparing different models of self-assembly …

Teaching Introductory Programming Concepts Through A Gesture-Based Interface, Lora Streeter

Graduate Theses and Dissertations

Computer programming is an integral part of a technology driven society, so there is a tremendous need to teach programming to a wider audience. One of the challenges in meeting this demand for programmers is that most traditional computer programming classes are targeted to university/college students with strong math backgrounds. To expand the computer programming workforce, we need to encourage a wider range of students to learn about programming.

The goal of this research is to design and implement a gesture-driven interface to teach computer programming to young and non-traditional students. We designed our user interface based on the feedback …

Tamscript - High Level Programming Interface For The Abstract Tile Assembly Model, Perry Mills

Computer Science and Computer Engineering Undergraduate Honors Theses

This paper describes a programming interface, TAMScript, for use with the PyTAS simulator. The interface allows for the dynamic generation of tile types as the simulation progresses, with the goal of reducing complexity for researchers. This paper begins with an introduction to the PyTAS software and a description of the 3D model which it simulates. Next, the changes made to support a dynamic generation scheme are detailed, and some of the potential benefits of this scheme are outlined. Then several of the example scripts which have been written using the TAMScript interface are reviewed. Finally, the potential for future research …

Computational Complexity Of Determining The Rigidity Of Ftam Assemblies, Ian Perkins

Computer Science and Computer Engineering Undergraduate Honors Theses

In this paper, we discuss a tile-based self-assembly model called the Folding Tile Assembly Model (FTAM). We briefly define what makes the FTAM unique in its ability to have folding 2D tiles. We also discuss the difficulty of determining the computational complexity of certain FTAM properties despite it being simpler for less dynamic models. Specifically, we discuss the property of rigidity in FTAM assemblies by devising a simple definition of rigidity, so that it is easier to determine its complexity. We use a reduction between an assembly and a 3SAT instance along with a series of proofs to give a …

Music Feature Matching Using Computer Vision Algorithms, Mason Hollis

Computer Science and Computer Engineering Undergraduate Honors Theses

This paper seeks to establish the validity and potential benefits of using existing computer vision techniques on audio samples rather than traditional images in order to consistently and accurately identify a song of origin from a short audio clip of potentially noisy sound. To do this, the audio sample is first converted to a spectrogram image, which is used to generate SURF features. These features are compared against a database of features, which have been previously generated in a similar fashion, in order to find the best match. This algorithm has been implemented in a system that can run as …

Ant Colony Optimization For Continuous Spaces, Rachel Findley

Computer Science and Computer Engineering Undergraduate Honors Theses

Ant Colony Optimization (ACO) is an optimization algorithm designed to find semi-optimal solutions to Combinatorial Optimization Problems. The challenge of modifying this algorithm to effectively optimize over a continuous domain is one that has been tackled by several researchers. In this paper, ACO has been modified to use several variations of the algorithm for continuous spaces. An aspect of ACO which is crucial to its success when optimizing over a continuous space is choosing the appropriate object (solution component) out of an infinite set to add to the ant's path. This step is highly important in shaping good solutions. Important …

Wi-Fi Sensing Algorithms Utilizing Zigbee Rf Reciever For Use In Emergency Communications Mesh, Alexander Nelson

Computer Science and Computer Engineering Undergraduate Honors Theses

This thesis introduces the idea of a low-power Wi-Fi sensing wake-up controller for an emergency communications mesh network, progressively developing a prototype system which could be used in a live environment. Wireless network protocols are reviewed, as well as a limited view of cluster analysis, in order to introduce relevant concepts crucial to understanding this thesis. Algorithms for system implementation are developed, and pseudocode, designed to be configurable and platform independent, is given for each. Design goals for the system are identified with potential approaches are defined in order to optimize for each. An example hardware configuration is given, in …

Service Oriented Transitive Closure Solution, Jonathan Baran

Computer Science and Computer Engineering Undergraduate Honors Theses

The goal of this project is a service based solution that utilizes parallel and distributed processing algorithms to solve the transitive closure problem for a large dataset. A dataset may be view conceptually as a table in a database, with a physical structure representing a file containing a sequence of records and fields. Two records are said to be transitively related if and only if they are directly related due to sharing of one or more specific fields, or a sequence may be made from one record to the other under the condition that all intermediate entries are related the …

Visualization Of An Approach To Data Clustering, Marisabel Guevara

Computer Science and Computer Engineering Undergraduate Honors Theses

Using visualization and clustering goals as guidelines, this thesis explores a graphic implementation of a data clustering technique that repositions vertices by applying physical laws of charges and springs to the components of the graph. The resulting visualizations are evidence of the success of the approach as well as of the data sets that lend themselves to a clustering routine. Due to the visual product of the implementation, the algorithm is most useful as an aid in understanding the grouping pattern of a data set. Either for a rapid analysis or to assist in presentation, the visual result of the …

Interpolation Techniques For Overset Grids, Paul S. Sherman, Nathan B. Edgar

Journal of the Arkansas Academy of Science

The use of finite difference schemes in computational aeroacoustics requires the use of structured grids incomputational space. Complex geometries in the physical space can be modeled using multiple overlapping grids that are transformed into computational space. In this work, finite difference schemes are used that necessitate the addition of psuedo- or ghost-points in the overlap region of the grids for closure of the difference stencil. The functional values at these ghost points must be approximated from the values at the original grid points. This paper investigates interpolation techniques for these overset grids. An n th order interpolation scheme using Lagrange …