Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Computer Engineering
Investigating Dataset Distinctiveness, Andrew Ulmer, Kent W. Gauen, Yung-Hsiang Lu, Zohar R. Kapach, Daniel P. Merrick
Investigating Dataset Distinctiveness, Andrew Ulmer, Kent W. Gauen, Yung-Hsiang Lu, Zohar R. Kapach, Daniel P. Merrick
The Summer Undergraduate Research Fellowship (SURF) Symposium
Just as a human might struggle to interpret another human’s handwriting, a computer vision program might fail when asked to perform one task in two different domains. To be more specific, visualize a self-driving car as a human driver who had only ever driven on clear, sunny days, during daylight hours. This driver – the self-driving car – would inevitably face a significant challenge when asked to drive when it is violently raining or foggy during the night, putting the safety of its passengers in danger. An extensive understanding of the data we use to teach computer vision models – …
Deep Neural Network Architectures For Modulation Classification Using Principal Component Analysis, Sharan Ramjee, Shengtai Ju, Diyu Yang, Aly El Gamal
Deep Neural Network Architectures For Modulation Classification Using Principal Component Analysis, Sharan Ramjee, Shengtai Ju, Diyu Yang, Aly El Gamal
The Summer Undergraduate Research Fellowship (SURF) Symposium
In this work, we investigate the application of Principal Component Analysis to the task of wireless signal modulation recognition using deep neural network architectures. Sampling signals at the Nyquist rate, which is often very high, requires a large amount of energy and space to collect and store the samples. Moreover, the time taken to train neural networks for the task of modulation classification is large due to the large number of samples. These problems can be drastically reduced using Principal Component Analysis, which is a technique that allows us to reduce the dimensionality or number of features of the samples …
Sort Vs. Hash Join On Knights Landing Architecture, Victor L. Pan, Felix Lin
Sort Vs. Hash Join On Knights Landing Architecture, Victor L. Pan, Felix Lin
The Summer Undergraduate Research Fellowship (SURF) Symposium
With the increasing amount of information stored, there is a need for efficient database algorithms. One of the most important database operations is “join”. This involves combining columns from two tables and grouping common values in the same row in order to minimize redundant data. The two main algorithms used are hash join and sort merge join. Hash join builds a hash table to allow for faster searching. Sort merge join first sorts the two tables to make it more efficient when comparing values. There has been a lot of debate over which approach is superior. At first, hash join …