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

Computer Engineering Commons

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

Articles 1 - 12 of 12

Full-Text Articles in Computer Engineering

Applications Of Fog Computing In Video Streaming, Kyle Smith May 2019

Applications Of Fog Computing In Video Streaming, Kyle Smith

Computer Science and Computer Engineering Undergraduate Honors Theses

The purpose of this paper is to show the viability of fog computing in the area of video streaming in vehicles. With the rise of autonomous vehicles, there needs to be a viable entertainment option for users. The cloud fails to address these options due to latency problems experienced during high internet traffic. To improve video streaming speeds, fog computing seems to be the best option. Fog computing brings the cloud closer to the user through the use of intermediary devices known as fog nodes. It does not attempt to replace the cloud but improve the cloud by allowing faster ...


Dynamic 3d Network Data Visualization, Brok Stafford May 2018

Dynamic 3d Network Data Visualization, Brok Stafford

Computer Science and Computer Engineering Undergraduate Honors Theses

Monitoring network traffic has always been an arduous and tedious task because of the complexity and sheer volume of network data that is being consistently generated. In addition, network growth and new technologies are rapidly increasing these levels of complexity and volume. An effective technique in understanding and managing a large dataset, such as network traffic, is data visualization. There are several tools that attempt to turn network traffic into visual stimuli. Many of these do so in 2D space and those that are 3D lack the ability to display network patterns effectively. Existing 3D network visualization tools lack user ...


Music Feature Matching Using Computer Vision Algorithms, Mason Hollis May 2017

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


Inferring Intrinsic Beliefs Of Digital Images Using A Deep Autoencoder, Seok H. Lee May 2016

Inferring Intrinsic Beliefs Of Digital Images Using A Deep Autoencoder, Seok H. Lee

Computer Science and Computer Engineering Undergraduate Honors Theses

Training a system of artificial neural networks on digital images is a big challenge. Often times digital images contain a large amount of information and values for artificial neural networks to understand. In this work, the inference model is proposed in order to absolve this problem. The inference model is composed of a parameterized autoencoder that endures the loss of information caused by the rescaling of images and transition model that predicts the effect of an action on the observation. To test the inference model, the images of a moving robotic arm were given as the data set. The inference ...


Tweetement: Pseudo-Relevance Feedback For Twitter Search, Kanatbay Bektemirov May 2015

Tweetement: Pseudo-Relevance Feedback For Twitter Search, Kanatbay Bektemirov

Computer Science and Computer Engineering Undergraduate Honors Theses

Microblogging platforms such as Twitter let users communicate with short messages. Due to the messages’ short content and the users’ tendency to type short queries while searching, it is particularly challenging to locate useful tweets that match user queries. The fundamental problems of word mismatch due to ambiguity are especially acute. To solve this problem, this thesis explores and compares multiple automatic query expansion methods that involve the most frequent hashtags and keywords. We built a Web service that provides real-time Twitter Search results incorporating automatic query expansion. Six pseudo-relevance feedback methods were studied and the numbers indicate that results ...


Powersearch: Augmenting Mobile Phone Search Through Personalization, Xiangyu Liu Dec 2011

Powersearch: Augmenting Mobile Phone Search Through Personalization, Xiangyu Liu

Computer Science and Computer Engineering Undergraduate Honors Theses

Cell phone has become a fundamental element of people's life. People use it to call each other, browse websites, send text messages, etc. Among all the functionalities, the most important and frequently used is the search functionality. Based on ComScore, in July 2008, Google was estimated to host 235 millions searches per day. However, unlike the search on desktop, the search on cell phone has one critical constrain: battery. Cell phone performing a normal Google search, the battery drains very fast. The reason is that when sending a query to and fetching the results from Google, cell phone keeps ...


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