Computer Engineering Commons^™

Optimizing Main Memory Usage In Modern Computing Systems To Improve Overall System Performance, Daniel Jose Campello

FIU Electronic Theses and Dissertations

Operating Systems use fast, CPU-addressable main memory to maintain an application’s temporary data as anonymous data and to cache copies of persistent data stored in slower block-based storage devices. However, the use of this faster memory comes at a high cost. Therefore, several techniques have been implemented to use main memory more efficiently in the literature. In this dissertation we introduce three distinct approaches to improve overall system performance by optimizing main memory usage.

First, DRAM and host-side caching of file system data are used for speeding up virtual machine performance in today’s virtualized data centers. The clustering of VM …

Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar

UNLV Theses, Dissertations, Professional Papers, and Capstones

Clustering a set of points in Euclidean space is a well-known problem having applications in pattern recognition, document image analysis, big-data analytics, and robotics. While there are a lot of research publications for clustering point objects, only a few articles have been reported for clustering a given distribution of obstacles. In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle clustering algorithms.

Neuron Clustering For Mitigating Catastrophic Forgetting In Supervised And Reinforcement Learning, Benjamin Frederick Goodrich

Doctoral Dissertations

Neural networks have had many great successes in recent years, particularly with the advent of deep learning and many novel training techniques. One issue that has affected neural networks and prevented them from performing well in more realistic online environments is that of catastrophic forgetting. Catastrophic forgetting affects supervised learning systems when input samples are temporally correlated or are non-stationary. However, most real-world problems are non-stationary in nature, resulting in prolonged periods of time separating inputs drawn from different regions of the input space.

Reinforcement learning represents a worst-case scenario when it comes to precipitating catastrophic forgetting in neural networks. …

Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch

Research Collection School Of Computing and Information Systems

The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …

Comparison Of Clustering Techniques For Traffic Accident Detection, Nejdet Doğru, Abdülhami̇t Subaşi

Turkish Journal of Electrical Engineering and Computer Sciences

Transportation infrastructure in intelligent transportation systems (ITSs) is complemented with information and communication technologies to achieve better passenger safety and reduced transportation time, fuel consumption, and vehicle wear and tear. This paper shows how data mining techniques are used in ITSs for accident detection and prevention on motorways. In traffic, vehicles show similar behavior to that of vehicles in closed neighborhoods. Vehicles that show different behaviors than neighbor vehicles in cases like accidents, inappropriate lane changes, and speeding can be considered as anomalies and detected. In this paper, a traffic accident is simulated and the effectiveness of different clustering techniques …

Fuzzy Adaptive Resonance Theory: Applications And Extensions, Clayton Parker Smith

Masters Theses

"Adaptive Resonance Theory, ART, is a powerful clustering tool for learning arbitrary patterns in a self-organizing manner. In this research, two papers are presented that examine the extensibility and applications of ART. The first paper examines a means to boost ART performance by assigning each cluster a vigilance value, instead of a single value for the whole ART module. A Particle Swarm Optimization technique is used to search for desirable vigilance values. In the second paper, it is shown how ART, and clustering in general, can be a useful tool in preprocessing time series data. Clustering quantization attempts to meaningfully …

Hot Zone Identification: Analyzing Effects Of Data Sampling On Spam Clustering, Rasib Khan, Mainul Mizan, Ragib Hasan, Alan Sprague

Journal of Digital Forensics, Security and Law

Email is the most common and comparatively the most efficient means of exchanging information in today's world. However, given the widespread use of emails in all sectors, they have been the target of spammers since the beginning. Filtering spam emails has now led to critical actions such as forensic activities based on mining spam email. The data mine for spam emails at the University of Alabama at Birmingham is considered to be one of the most prominent resources for mining and identifying spam sources. It is a widely researched repository used by researchers from different global organizations. The usual process …

M-Fdbscan: A Multicore Density-Based Uncertain Data Clustering Algorithm, Atakan Erdem, Taflan İmre Gündem

Turkish Journal of Electrical Engineering and Computer Sciences

In many data mining applications, we use a clustering algorithm on a large amount of uncertain data. In this paper, we adapt an uncertain data clustering algorithm called fast density-based spatial clustering of applications with noise (FDBSCAN) to multicore systems in order to have fast processing. The new algorithm, which we call multicore FDBSCAN (M-FDBSCAN), splits the data domain into c rectangular regions, where c is the number of cores in the system. The FDBSCAN algorithm is then applied to each rectangular region simultaneously. After the clustering operation is completed, semiclusters that occur during splitting are detected and merged to …

Motion Clustering On Video Sequences Using A Competitive Learning Network, Sali̇h Görgünoğlu, Şafak Altay

Turkish Journal of Electrical Engineering and Computer Sciences

It is necessary to track human movements in crowded places and environments such as stations, subways, metros, and schoolyards, where security is of great importance. As a result, undesired injuries, accidents, and unusual movements can be determined and various precautionary measures can be taken against them. In this study, real-time or existing video sequences are used within the system. These video sequences are obtained from objects such as humans or vehicles, moving actively in various environments. At first, some preprocesses are made respectively, such as converting gray scale, finding the edges of the objects existing in the images, and thresholding …

Online Multi-Stage Deep Architectures For Feature Extraction And Object Recognition, Derek Christopher Rose

Doctoral Dissertations

Multi-stage visual architectures have recently found success in achieving high classification accuracies over image datasets with large variations in pose, lighting, and scale. Inspired by techniques currently at the forefront of deep learning, such architectures are typically composed of one or more layers of preprocessing, feature encoding, and pooling to extract features from raw images. Training these components traditionally relies on large sets of patches that are extracted from a potentially large image dataset. In this context, high-dimensional feature space representations are often helpful for obtaining the best classification performances and providing a higher degree of invariance to object transformations. …

Eetbr: Energy Efficient Token-Based Routing For Wireless Sensor Networks, Taner Çevi̇k, Abdül Hali̇m Zai̇m

Turkish Journal of Electrical Engineering and Computer Sciences

The most significant drawback of wireless sensor networks is energy scarcity. As there is an increasing need for operating these networks for relatively long times, energy saving becomes the key challenge in the design of the architectures and protocols for sensor networks. Therefore, several research studies have been performed for making contributions to the analysis of this energy shortage problem. Most of these research activities have been focused on finding solutions for the energy consumption of the communication unit, which is the dominant energy dissipating component of the sensor nodes. In this paper, a novel, token-based routing protocol adapted with …

A Reputation-Based Privacy Management System For Social Networking Sites, Mehmet Erkan Yüksel, Asim Si̇nan Yüksel, Abdül Hali̇m Zai̇m

Turkish Journal of Electrical Engineering and Computer Sciences

Social networking sites form a special type of virtual community where we share our personal information with people and develop new relationships on the Internet. These sites allow the users to share just about everything, including photos, videos, favorite music, and games, and record all user interactions and retain them for potential use in social data mining. This storing and sharing of large amounts of information causes privacy problems for the users of these websites. In order to prevent these problems, we have to provide strict privacy policies, data protection mechanisms, and trusted and built-in applications that help to protect …

Outlier Rejection Fuzzy C-Means (Orfcm) Algorithm For Image Segmentation, Fasahat Ullah Siddiqui, Nor Ashidi Mat Isa, Abid Yahya

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents a fuzzy clustering-based technique for image segmentation. Many attempts have been put into practice to increase the conventional fuzzy c-means (FCM) performance. In this paper, the sensitivity of the soft membership function of the FCM algorithm to the outlier is considered and the new exponent operator on the Euclidean distance is implemented in the membership function to improve the outlier rejection characteristics of the FCM. The comparative quantitative and qualitative studies are performed among the conventional k-means (KM), moving KM, and FCM algorithms; the latest state-of-the-art clustering algorithms, namely the adaptive fuzzy moving KM , adaptive fuzzy …

Prevention And Detection Of Intrusions In Wireless Sensor Networks, Ismail Butun

USF Tampa Graduate Theses and Dissertations

Wireless Sensor Networks (WSNs) continue to grow as one of the most exciting and challenging research areas of engineering. They are characterized by severely constrained computational and energy

resources and also restricted by the ad-hoc network operational

environment. They pose unique challenges, due to limited power

supplies, low transmission bandwidth, small memory sizes and limited energy. Therefore, security techniques used in traditional networks cannot be directly adopted. So, new ideas and approaches are needed, in order to increase the overall security of the network. Security applications in such resource constrained WSNs with minimum overhead provides significant challenges, and is the …

A Case Study Towards Verification Of The Utility Of Analytical Models In Selecting Checkpoint Intervals, Michael Joseph Harney

Open Access Theses & Dissertations

As high performance computing (HPC) systems grow larger, with increasing numbers of components, failures become more common. Codes that utilize large numbers of nodes and run for long periods of time must take such failures into account and adopt fault tolerance mechanisms to avoid loss of computation and, thus, system utilization. One of those mechanisms is checkpoint/restart. Although analytical models exist to guide users in the selection of an appropriate checkpoint interval, these models are based on assumptions that may not always be true. This thesis examines some of these assumptions, in particular, the consistency of parameters like Mean Time …

Reeling In Big Phish With A Deep Md5 Net, Brad Wardman, Gary Warner, Heather Mccalley, Sarah Turner, Anthony Skjellum

Journal of Digital Forensics, Security and Law

Phishing continues to grow as phishers discover new exploits and attack vectors for hosting malicious content; the traditional response using takedowns and blacklists does not appear to impede phishers significantly. A handful of law enforcement projects — for example the FBI's Digital PhishNet and the Internet Crime and Complaint Center (ic3.gov) — have demonstrated that they can collect phishing data in substantial volumes, but these collections have not yet resulted in a significant decline in criminal phishing activity. In this paper, a new system is demonstrated for prioritizing investigative resources to help reduce the time and effort expended examining this …

Clustering Spam Domains And Destination Websites: Digital Forensics With Data Mining, Chun Wei, Alan Sprague, Gary Warner, Anthony Skjellum

Journal of Digital Forensics, Security and Law

Spam related cyber crimes have become a serious threat to society. Current spam research mainly aims to detect spam more effectively. We believe the identification and disruption of the supporting infrastructure used by spammers is a more effective way of stopping spam than filtering. The termination of spam hosts will greatly reduce the profit a spammer can generate and thwart his ability to send more spam. This research proposes an algorithm for clustering spam domains extracted from spam emails based on the hosting IP addresses and tracing the IP addresses over a period of time. The results show that many …

Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis presents both a review of current MANET routing protocols and a new MANET routing algorithm. The routing protocols reviewed include representative samples from the three primary forms of routing found in MANETS: proactive routing, reactive routing and hybrid routing. Secure algorithms are given special treatment in the review. In addition several protocol enhancements are discussed.

The proposed routing protocol is designed to support networks of a medium size, containing over 200 nodes but less than 3,000 nodes. The design is intentionally simple to allow ease of implementation in comparison with other MANET protocols that provide similar functionality.

Supporting Protocols For Structuring And Intelligent Information Dissemination In Vehicular Ad Hoc Networks, Filip Cuckov

Electrical & Computer Engineering Theses & Dissertations

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for …

Summaritive Digest For Large Document Repositories With Application To E-Rulemaking, Lijun Chen

Browse all Theses and Dissertations

Large document repositories need to be organized and summarized to make them more accessible and understandable. Such needs exist in many applications, including web search, e-rulemaking (electronic rulemaking) and document archiving. Even though much has been done in the areas of document clustering and summarization, there are still many new challenges and issues that need to be addressed as the repositories become larger, more prevalent and dynamic. In this dissertation, we investigate more informative ways to organize and summarize large document repositories, especially e-rulemaking feedback repositories (ERFRs), so that the large repositories can be managed and digested more efficiently and …

Clustering And Hybrid Routing In Mobile Ad Hoc Networks, Lan Wang

Computer Science Theses & Dissertations

This dissertation focuses on clustering and hybrid routing in Mobile Ad Hoc Networks (MANET). Specifically, we study two different network-layer virtual infrastructures proposed for MANET: the explicit cluster infrastructure and the implicit zone infrastructure. In the first part of the dissertation, we propose a novel clustering scheme based on a number of properties of diameter-2 graphs to provide a general-purpose virtual infrastructure for MANET. Compared to virtual infrastructures with central nodes, our virtual infrastructure is more symmetric and stable, but still light-weight. In our clustering scheme, cluster initialization naturally blends into cluster maintenance, showing the unity between these two operations. …

A Model For User Profiling Systems With Interacting Agents, Sanem Sariel, Tevfi̇k Akgün

Turkish Journal of Electrical Engineering and Computer Sciences

Service systems according to users' personal demands and preferences are on their way to provide required services in many application domains. Emulation of interactive model of human societies produces valuable outcomes for such systems. In this work, a system model with interactive agents for multi user service systems is proposed. A novel social interactive agent model using different interaction forms is also included in this proposal. In this model, agents decide how to serve to their users by considering their users' profiles and information from other agents. User clusters are formed by clustering techniques. The Q-learning algorithm is used for …

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan

Research Collection School Of Computing and Information Systems

This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …