Linear Clustering Process on Networks

Community detection and graph partitioning have seamlessly integrated themselves into the fabric of network science by providing valuable insights into the structure, function, and dynamics of complex networks. In this thesis, a comprehensive performance comparison of the recently introduced Linear Clustering Process (LCP) is carried out against...

Graph Partition and Multiple Choice-UCB Based Algorithms for Edge Server Placement in MEC Environment

The deployment of edge servers make a significant impact on the service quality of a Mobile Edge Computing (MEC) system. This service quality relies on solving two key sub-problems: 1) interference management between servers 2) the placement of MEC servers. To improve the Quality of Service (QoS), we propose a method based on Graph Partition ...

Dynamic Bi-Colored Graph Partitioning

In this work, we focus on partitioning dynamic graphs with two types of nodes (bi-colored), though not necessarily bipartite graphs. They commonly appear in communication network applications, e.g., one color being base stations, the other users, and the dynamic process being the varying connection status between base stations and moving...

Adaptive Graph Partition Methods for Structured Graphs

Graphs can be models for many real-world systems, where nodes indicate the entities and edges indicate the pairwise connections in between. In various cases, it is important to detect informative subsets of nodes such that the nodes within the subsets are ’closer’ to each other. For example, in a cellular network, determining appropriate node...

APmap: An Open-Source Compiler for Automata Processors

A novel type of hardware accelerators called automata processors (APs) have been proposed to accelerate finite-state automata. The bone structure of an AP is a hierarchical routing matrix that connects many memory arrays. With this structure, an AP can process an input symbol every clock cycle, and hence achieve much higher performance...

Divide and Clean: Multi-Constrained Edge Partitioning and its Application in Debris Management

Let G=(V,E) be a connected undirected graph, where every edge has two weights assigned to it. This thesis considers the partitioning of the edge set E of G into subsets with three objectives in mind: i) balance the total amount of the first weight among the subsets, ii) balance the total amount of the second weight among the subsets and iii)...

Implementation of slow coherency based controlled islanding using DIgSILENT powerfactory and MATLAB

Intentional controlled islanding is a novel emergency control technique to mitigate wide-area instabilities by intelligently separating the power network into a set of self-sustainable islands. During the last decades, it has gained an increased attention due to the recent severe blackouts all over the world. Moreover, the increasing...

Game Theoretic Stable Microgrid Formation in the Electricity Grid

The current architecture of the power grid is outdated and will not provide the means to deal with the decentralization of energy sources. The smart grid is a newly envisioned architecture for the power grid that should solve the weaknesses in the current grid. One application that is part of the smart grid vision is the microgrid: a coalition...

Distributed heterogeneous systems for large-scale graph processing

Graph processing is increasingly popular in a variety of scientific and engineering domains. Consequently, graphs and graph-processing algorithms have become increasingly more diverse. Following the big data trend in every computer-related domain, graphs have also become increasingly larger. Processing graphs is requiring more sophisticated...