Large Graph Analysis in the GMine System

Current applications have produced graphs on the order of hundreds of thousands of nodes and millions of edges. To take advantage of such graphs, one must be able to find patterns, outliers and communities. These tasks are better performed in an interactive environment, where human expertise can guide the process. For large graphs, though, there are some challenges: the excessive processing requirements are prohibitive, and drawing hundred-thousand nodes results in cluttered images hard to comprehend. To cope with these problems, we propose an innovative framework suited for any kind of tree-like graph visual design. GMine integrates (a) a representation for graphs organized as hierarchies of partitions - the concepts of SuperGraph and Graph-Tree; and (b) a graph summarization methodology - CEPS. Our graph representation deals with the problem of tracing the connection aspects of a graph hierarchy with sub linear complexity, allowing one to grasp the neighborhood of a single node or of a group of nodes in a single click. As a proof of concept, the visual environment of GMine is instantiated as a system in which large graphs can be investigated globally and locally

Upgrading Plan for Conventional Distribution Networks Considering Virtual Microgrid Systems

It is widely agreed that the integration of distributed generators (DGs) to power systems is an inevitable trend, which can help to solve many issues in conventional power systems, such as environmental pollution and load demand increasing. According to the study of European Liaison on Electricity grid Committed Towards long-term Research Activities (ELECTRA), in the future, the control center of power systems might transfer from transmission networks to distribution networks since most of DGs will be integrated to distribution networks. However, the infrastructure of conventional distribution networks (CDNs) has not enough capabilities to face challenges from DG integration. Therefore, it is necessary to make a long-term planning to construct smart distribution networks (SDNs). Although many planning strategies are already proposed for constructing SDNs, most of them are passive methods which are based on traditional control and operating mechanisms. In this thesis, an active planning framework for upgrading CDNs to SDNs is introduced by considering both current infrastructure of CDNs and future requirements of SDNs. Since conventional centralised control methods have limited capabilities to deal with huge amount of information and manage flexible structure of SDNs, virtual microgrids (VMs) are designed as basic units to realise decentralised control in this framework. Based on the idea of cyber-physical-socioeconomic system (CPSS), the structure and interaction of cyber system layer, physical system layer as well as socioeconomic system layer are considered in this framework to improve the performance of electrical networks. Since physical system layer is the most fundamental and important part in the active planning framework, and it affects the function of the other two layers, a two-phase strategy to construct the physical system layer is proposed. In the two-phase strategy, phase 1 is to partition CDNs and determine VM boundaries, and phase 2 is to determine DG allocation based on the partitioning results obtained in phase 1. In phase 1, a partitioning method considering structural characteristics of electrical networks rather than operating states is proposed. Considering specific characteristics of electrical networks, electrical coupling strength (ECS) is defined to describe electrical connection among buses. Based on the modularity in complex network theories, electrical modularity is defined to judge the performance of partitioning results. The effectiveness of this method is tested in three popular distribution networks. The partitioning method can detect VM boundaries and partitioning results are in accord with structural characteristics of distribution networks. Based on the partitioning results obtained in phase 1, phase 2 is to optimise DG allocation in electrical networks. A bi-level optimisation method is proposed, including an outer optimisation and an inner optimisation. The outer optimisation focus on long-term planning goals to realise autonomy of VMs while the inner optimisation focus on improving the ability of active energy management. Both genetic algorithm and probabilistic optimal power flow are applied to determine the type, size, location and number of DGs. The feasibility of this method is verified by applying it to PG&E 69-bus distribution network. The operation of SDNs with VMs is a very important topic since the integration of DGs will lead to bidirectional power flow and fault current variation in networks. Considering the similarity between microgrids and VMs, a hybrid control and protection scheme for microgrids is introduced, and its effectiveness is tested through Power Systems Computer Aided Design (PSCAD) simulation. Although more research is needed because SDNs are more complicated than microgrids, the hybrid scheme has great potential to be applied to VMs

Electricity based external similarity of categorical attributes

Abstract. Similarity or distance measures are fundamental and critical properties for data mining tools. Categorical attributes abound in databases. The Car Make, Gender, Occupation, etc. fields in a automobile insurance database are very informative. Sadly, categorical data is not easily amenable to similarity computations. A domain expert might manually specify some or all of the similarity relationships, but this is error-prone and not feasible for attributes with large domains, nor is it useful for cross-attribute similarities, such as between Gender and Occupation. External similarity functions define a similarity between, say, Car Makes by looking at how they co-occur with the other categorical attributes. We exploit a rich duality between random walks on graphs and electrical circuits to develop REP, an external similarity function. REP is theoretically grounded while the only prior work was ad-hoc. The usefulness of REP is shown in two experiments. First, we cluster categorical attribute values showing improved inferred relationships. Second, we use REP effectively as a nearest neighbour classifier.