Search

Installations of an Energy Storage System (ESS) with various functions such as power stabilization of renewable energy, demand management, and frequency adjustment are increasing. In particular, ESS for demand management is being established for high-voltage customers (300 KVA–1000 KVA) who have placed an Auto Section Switch (ASS) at the connection point within the distribution system. However, a power outage may occur in the Power Receiving System (PRS) when a short-circuit fault due to insulation breakdown occurs at the ESS DC side. The reason for this breakdown is that the fault current is reduced by transformer impedance, and the ASS is opened before the DC power fuse. Therefore, using the Graphic Solution Method (GSM), this paper presents an operation algorithm for protection coordination that isolates the fault section by first operating the DC power fuse with a small fault current. Furthermore, fault analysis modeling for a PRS composed of a switchgear section, a main distribution panel, a Power Conditioning System (PCS), a power fuse, and a battery is performed through PSCAD/EMTDC. From the simulation results, it is confirmed that the fault section is quickly isolated, and power outages for high-voltage customers are prevented because the DC power fuse selected by the proposed operation algorithm of protection coordination is opened before the ASS. [ABSTRACT FROM AUTHOR]

A graph is a very important structure to describe many applications in the real world. In many applications, such as dependency graphs and debt graphs, it is an important problem to find and remove cycles to make these graphs be cycle-free. The common algorithm often leads to an out-of-memory exception in commodity personal computer, and it cannot leverage the advantage of multicore computers. This paper introduces a new problem, cycle detection and removal with vertex priority. It proposes a multithreading iterative algorithm to solve this problem for large-scale graphs on personal computers. The algorithm includes three main steps: simplification to decrease the scale of graph, calculation of strongly connected components, and cycle detection and removal according to a pre-defined priority in parallel. This algorithm avoids the out-of-memory exception by simplification and iteration, and it leverages the advantage of multicore computers by multithreading parallelism. Five different versions of the proposed algorithm are compared by experiments, and the results show that the parallel iterative algorithm outperforms the others, and simplification can effectively improve the algorithm's performance. [ABSTRACT FROM AUTHOR]

Seamless texture mapping is one of the key technologies for photorealistic 3D texture reconstruction. In this paper, a method of rapid texture optimization of 3D urban reconstruction based on oblique images is proposed aiming at the existence of texture fragments, seams, and inconsistency of color in urban 3D texture mapping based on low-altitude oblique images. First, we explore implementing radiation correction on the experimental images with a radiation procession algorithm. Then, an efficient occlusion detection algorithm based on OpenGL is proposed according to the mapping relation between the terrain triangular mesh surface and the images to implement the occlusion detection of the visible texture on the triangular facets as well as create a list of visible images. Finally, a texture clustering algorithm is put forward based on Markov Random Field utilizing the inherent attributes of the images and solve the energy function minimization by Graph-Cuts. The experimental results display that the method is capable of decreasing the existence of texture fragments, seams, and inconsistency of color in the 3D texture model reconstruction. [ABSTRACT FROM AUTHOR]

We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property of being isomorphic to a directed graph. In particular, we show that, as a consequence of the properties associated with the MAG structure, a MAG can be represented in matrix form. Moreover, we also show that any possible MAG function (algorithm) can be obtained from this matrix-based representation. This is an important theoretical result since it paves the way for adapting well-known graph algorithms for application in MAGs. We present a set of basic MAG algorithms, constructed from well-known graph algorithms, such as degree computing, Breadth First Search (BFS), and Depth First Search (DFS). These algorithms adapted to the MAG context can be used as primitives for building other more sophisticated MAG algorithms. Therefore, such examples can be seen as guidelines on how to properly derive MAG algorithms from basic algorithms on directed graphs. We also make available Python implementations of all the algorithms presented in this paper. [ABSTRACT FROM AUTHOR]

Algorithmic metatheorems state that if a problem can be described in a certain logic and the inputs are structured in a certain way, then the problem can be solved with a certain amount of resources. As an example, by Courcelle's Theorem, all monadic second-order ("in a certain logic") properties of graphs of bounded tree width ("structured in a certain way") can be solved in linear time ("with a certain amount of resources"). Such theorems have become valuable tools in algorithmics: if a problem happens to have the right structure and can be described in the right logic, they immediately yield a (typically tight) upper bound on the time complexity of the problem. Perhaps even more importantly, several complex algorithms rely on algorithmic metatheorems internally to solve subproblems, which considerably broadens the range of applications of these theorems. This paper is intended as a gentle introduction to the ideas behind algorithmic metatheorems, especially behind some recent results concerning space and circuit classes, and tries to give a flavor of the range of their applications. [ABSTRACT FROM AUTHOR]

The MEMS vector hydrophone is a novel acoustic sensor with a "four-beam-cilia" structure. Based on the MEMS vector hydrophone with this structure, the paper studies the method of estimated direction of arrival (DOA). According to various research papers, many algorithms can be applied to vector hydrophones. The beam-forming approach and bar graph approach are described in detail. Laboratory tests by means of the a standing-wave tube are performed to validate the theoretical results. Both the theoretical analysis and the results of tests prove that the proposed MEMS vector hydrophone possesses the desired directional function. [ABSTRACT FROM AUTHOR]

The eccentricity of a node in a graph is defined as the length of a longest shortest path starting at that node. The eccentricity distribution over all nodes is a relevant descriptive property of the graph, and its extreme values allow the derivation of measures such as the radius, diameter, center and periphery of the graph. This paper describes two new methods for computing the eccentricity distribution of large graphs such as social networks, web graphs, biological networks and routing networks.We first propose an exact algorithm based on eccentricity lower and upper bounds, which achieves significant speedups compared to the straightforward algorithm when computing both the extreme values of the distribution as well as the eccentricity distribution as a whole. The second algorithm that we describe is a hybrid strategy that combines the exact approach with an efficient sampling technique in order to obtain an even larger speedup on the computation of the entire eccentricity distribution. We perform an extensive set of experiments on a number of large graphs in order to measure and compare the performance of our algorithms, and demonstrate how we can efficiently compute the eccentricity distribution of various large real-world graphs. [ABSTRACT FROM AUTHOR]

This paper is a review which presents and explains the decomposition of graphs by clique minimal separators. The pace is leisurely, we give many examples and figures. Easy algorithms are provided to implement this decomposition. The historical and theoretical background is given, as well as sketches of proofs of the structural results involved. [ABSTRACT FROM AUTHOR]

Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called MLS and MLSM. In this paper, we investigate the properties of the vertex that is numbered 1 by MLS on a chordal graph and by MLSM on an arbitrary graph. We explain how this vertex is an extremity of the graph. Moreover, we show the remarkable property that the minimal separators included in the neighborhood of this vertex are totally ordered by inclusion. [ABSTRACT FROM AUTHOR]

This paper presents an innovative computer graphic method for viewshed generation from big point clouds. The proposed approach consists in simplification of typical methods for viewshed formation that are based on sorting and binary trees. The proposed method is based on the k-d tree concept optimized with radial segmentation and a dedicated mathematical algorithm for subtree rejection. The final visualization of the viewshed is designed with a graphic method using triangulated irregular network (TIN) surfaces from the accepted subtrees. [ABSTRACT FROM AUTHOR]