An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining

Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs. Experimental evaluation is presented for multiple types of problem instances. These instances include unit disk graphs, which represent a model of wireless networks, random scale-free networks, as well as samples from two social networks and real-world graphs studied in network science. Our experiments indicate that RLS$_o$ performs better than both a classical greedy approximation algorithm and two metaheuristic algorithms based on ant colony optimisation and local search. The order-based algorithm is able to find small dominating sets for graphs with tens of thousands of vertices. In addition, we propose a multi-start variant of RLS$_o$ that is suitable for solving the minimum weight dominating set problem. The application of RLS$_o$ in graph mining is also briefly demonstrated

MARA-Net: Single Image Deraining Network with Multi-level connections and Adaptive Regional Attentions

Removing rain streaks from single images is an important problem in various computer vision tasks because rain streaks can degrade outdoor images and reduce their visibility. While recent convolutional neural network-based deraining models have succeeded in capturing rain streaks effectively, difficulties in recovering the details in rain-free images still remain. In this paper, we present a multi-level connection and adaptive regional attention network (MARA-Net) to properly restore the original background textures in rainy images. The first main idea is a multi-level connection design that repeatedly connects multi-level features of the encoder network to the decoder network. Multi-level connections encourage the decoding process to use the feature information of all levels. Channel attention is considered in multi-level connections to learn which level of features is important in the decoding process of the current level. The second main idea is a wide regional non-local block (WRNL). As rain streaks primarily exhibit a vertical distribution, we divide the grid of the image into horizontally-wide patches and apply a non-local operation to each region to explore the rich rain-free background information. Experimental results on both synthetic and real-world rainy datasets demonstrate that the proposed model significantly outperforms existing state-of-the-art models. Furthermore, the results of the joint deraining and segmentation experiment prove that our model contributes effectively to other vision tasks

Modeling Tolerance in Dynamic Social Networks

The study of social networks has become increasingly important in recent years. Multi-agent systems research has proven to be an effective way of representing both static and dynamic social networks in order to model and analyze many different situations. Previous implementations of multi-agent systems have observed a phenomenon called tolerance between agents through simulation studies, which is defined as an agent maintaining an unrewarding connection. This concept has also arisen in the social sciences through the study of networks. We aim to bridge this gap between simulation studies in multi-agent systems and real-world observations. This project explores how local interactions of autonomous agents in a network relate to the development of tolerance. We have developed a new model for multi-agent system interactions based on these observations. We also claim that tolerance is directly observable in real dynamic social networks, and the parameters that govern tolerance of a system can be estimated using a Hidden Markov Model