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

Computer Engineering Commons

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

Computer Sciences

University of Arkansas, Fayetteville

2008

Articles 1 - 6 of 6

Full-Text Articles in Computer Engineering

Mapping Reality Into Virtual Worlds, Josh Mcfarlane Dec 2008

Mapping Reality Into Virtual Worlds, Josh Mcfarlane

Computer Science and Computer Engineering Undergraduate Honors Theses

As virtual worlds become more prevalent, they become increasingly useful as a means of information dissemination. This thesis examines the possible connections between real world objects and their virtual world counterparts. We look at how, by attaching sensors to an object, or by using a smart object with embedded sensors, the information can be relayed to a server. From this information, it will be possible to create a duplicate object in the virtual world and have it mirror the real world object in terms of state and movement. Almost all current solutions for remotely viewing a room or area are ...


Steganography In Ipv6, Barret Miller Dec 2008

Steganography In Ipv6, Barret Miller

Computer Science and Computer Engineering Undergraduate Honors Theses

Steganography is the process of hiding a secret message within another message such that it is difficult to detect the presence of the secret message. In other words, the existence of the secret message is hidden. A covert channel refers to the actual medium that is used to communicate the information such as a message, image, or file. This honors thesis uses steganography within the source address fields of Internet Protocol Version 6 (IPv6) packets to create a covert channel through which clandestine messages are passed from one party to another. A fully functional computer program was designed and written ...


Service Oriented Transitive Closure Solution, Jonathan Baran Aug 2008

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


Pitch Correction On The Human Voice, Suzanne Ownbey May 2008

Pitch Correction On The Human Voice, Suzanne Ownbey

Computer Science and Computer Engineering Undergraduate Honors Theses

No abstract provided.


Visualization Of An Approach To Data Clustering, Marisabel Guevara May 2008

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


Location-Based Hashing For Querying And Searching, Felix Ching May 2008

Location-Based Hashing For Querying And Searching, Felix Ching

Computer Science and Computer Engineering Undergraduate Honors Theses

The rapidly growing information technology in modern days demands an efficient searching scheme to search for desired data. Locality Sensitive Hashing (LSH) is a method for searching similar data in a database. LSH achieves high accuracy and precision for locating desired data, but consumes a significant amount of memory and time. Based on LSH, this thesis presents two novel schemes for efficient and accurate data searching: Locality Sensitive Hashing-SmithWaterman (LSH-SmithWaterman) and Secure Min-wise Locality Sensitive Hashing (SMLSH). Both methods dramatically reduce the memory and time consumption and exhibit high accuracy in data searching. Simulation results demonstrate the efficiency of the ...