Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Computer Engineering
Powersearch: Augmenting Mobile Phone Search Through Personalization, Xiangyu Liu
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 communicating …
Application Of The Empirical Mode Decomposition On The Characterization And Forecasting Of The Arrival Data Of An Enterprise Cluster, Linh Bao Ngo
Graduate Theses and Dissertations
Characterization and forecasting are two important processes in capacity planning. While they are closely related, their approaches have been different. In this research, a decomposition method called Empirical Mode Decomposition (EMD) has been applied as a preprocessing tool in order to bridge the input of both characterization and forecasting processes of the job arrivals of an enterprise cluster. Based on the facts that an enterprise cluster follows a standard preset working schedule and that EMD has the capability to extract hidden patterns within a data stream, we have developed a set of procedures that can preprocess the data for characterization …
Mapping Device With Wireless Communication, Xiangyu Liu
Mapping Device With Wireless Communication, Xiangyu Liu
Electrical Engineering Undergraduate Honors Theses
Wireless communication is one of the most powerful communication methods that people use nowadays. The key advantage of wireless communications is that it can cover large distances without having to run any cables from one end to the other. Based on this advantage, wireless communication has many important applications, such as remote controls, cell phones, and global positioning system (GPS). This senior design project is developed to use wireless communication technology to map the geographic characteristics of an unknown place. It contains two wireless communication modules with Atmega1281 microprocessor, two robots with the 8051 microcontroller, six pairs of infrared transmitters …
Location-Aware Traffic Management On Mobile Phones, Sarath Krishna Mandava
Location-Aware Traffic Management On Mobile Phones, Sarath Krishna Mandava
Graduate Theses and Dissertations
The growing number of mobile phone users is a primary cause of congestion in cellular networks. Therefore, cellular network providers have turned to expensive and differentiated data plans. Unfortunately, as the number of smartphone users keeps increasing, changing data plans only provides a temporary solution. A more permanent solution is offloading 3G traffic to networks in orthogonal frequency bands. One such plausible network is open Wi-Fi, which is free by definition. As Wi-Fi networks become ubiquitous, there are several areas where there is simultaneous Wi-Fi and 3G coverage. In this thesis, we study the feasibility of offloading 3G traffic to …
On The Complexity Of Grid Coloring, Daniel Christopher Apon
On The Complexity Of Grid Coloring, Daniel Christopher Apon
Graduate Theses and Dissertations
This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational complexity, and communication complexity. The prototypical example of such a problem is Monochromatic-Rectangle-Free Grid Coloring. In an instance of Monochromatic-Rectangle-Free Grid Coloring, we are given a chessboard-like grid graph of dimensions n and m, where the vertices of the graph correspond to squares in the chessboard, and a number of allowed colors, c. The goal is to assign one of the allowed colors to each vertex of the grid graph so that no four vertices arranged in an axis-parallel rectangle are colored monochromatically. Our results include: 1. A conditional, …
File System Simulation: Hierarchical Performance Measurement And Modeling, Hai Quang Nguyen
File System Simulation: Hierarchical Performance Measurement And Modeling, Hai Quang Nguyen
Graduate Theses and Dissertations
File systems are very important components in a computer system. File system simulation can help to predict the performance of new system designs. It offers the advantages of the flexibility of modeling and the cost and time savings of utilizing simulation instead of full implementation. Being able to predict end-to-end file system performance against a pre-defined workload can help system designers to make decisions that could affect their entire product line, involving several million dollars of investment. This dissertation presents detailed simulation-based performance models of the Linux ext3 file system and the PVFS parallel file system. The models are developed …
An Expressive Vocal Midi Controller, Brady Hurlburt
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.
Parallelizing Scale Invariant Feature Transform On A Distributed Memory Cluster, Stanislav Bobovych
Parallelizing Scale Invariant Feature Transform On A Distributed Memory Cluster, Stanislav Bobovych
Inquiry: The University of Arkansas Undergraduate Research Journal
Scale Invariant Feature Transform (SIFT) is a computer vision algorithm that is widely-used to extract features from images. We explored accelerating an existing implementation of this algorithm with message passing in order to analyze large data sets. We successfully tested two approaches to data decomposition in order to parallelize SIFT on a distributed memory cluster.