Engineering Commons^™

Classification Of Images Based On Pixels That Represent A Small Part Of The Scene. A Case Applied To Microaneurysms In Fundus Retina Images, Pablo F. Ordonez, Pablo F. Ordonez

Master of Science in Computer Science Theses

Convolutional Neural Networks (CNNs), the state of the art in image classification, have proven to be as effective as an ophthalmologist, when detecting Referable Diabetic Retinopathy (RDR). Having a size of less than 1\% of the total image, microaneurysms are early lesions in DR that are difficult to classify. The purpose of this thesis is to improve the accuracy of detection of microaneurysms using a model that includes two CNNs with different input image sizes, 60x60 and 420x420 pixels. These models were trained using the Kaggle and Messidor datasets and tested independently against the Kaggle dataset, showing a sensitivity of …

Feature Selection And Improving Classification Performance For Malware Detection, Carlos A. Cepeda Mora

Master of Science in Computer Science Theses

The ubiquitous advance of technology has been conducive to the proliferation of cyber threats, resulting in attacks that have grown exponentially. Consequently, researchers have developed models based on machine learning algorithms for detecting malware. However, these methods require significant amount of extracted features for correct malware classification, making that feature extraction, training, and testing take significant time; even more, it has been unexplored which are the most important features for accomplish the correct classification.

In this Thesis, it is created and analyzed a dataset of malware and clean files (goodware) from the static and dynamic features provided by the online …

On Intelligent Mitigation Of Process Starvation In Multilevel Feedback Queue Scheduling, Joseph E. Brown

Master of Science in Computer Science Theses

CPU time-share process schedulers for computer operating systems have existed since Corbato published his paper on the Compatible Time Sharing System in 1962 [8]. With this new type of scheduler came the need to effectively divide CPU time between N processes, where N could be 2 or more processes. Modern time-sharing process schedulers which have been developed in the decades since have been designed to favor shorter, interactive processes over long-running processes, especially when incoming demand for CPU time exceeds supply and process starvation is inevitable. These schedulers, including Linux CFS, FreeBSD Ule, and the Solaris Fair Share Scheduler, are …