Polytechnic University of Catalonia

About: Polytechnic University of Catalonia is a education organization based out in Barcelona, Spain. It is known for research contribution in the topics: Finite element method & Population. The organization has 16006 authors who have published 45325 publications receiving 949306 citations. The organization is also known as: UPC - BarcelonaTECH & Technical University of Catalonia.

Wireless-Control Strategy for Parallel Operation of Distributed-Generation Inverters

Abstract: In this paper, a method for the parallel operation of inverters in an ac-distributed system is proposed. This paper explores the control of active and reactive power flow through the analysis of the output impedance of the inverters and its impact on the power sharing. As a result, adaptive virtual output impedance is proposed in order to achieve a proper reactive power sharing, regardless of the line-impedance unbalances. A soft-start operation is also included, avoiding the initial current peak, which results in a seamless hot-swap operation. Active power sharing is achieved by adjusting the frequency in load transient situations only, owing to which the proposed method obtains a constant steady-state frequency and amplitude. As opposed to the conventional droop method, the transient response can be modified by acting on the main control parameters. Linear and nonlinear loads can be properly shared due to the addition of a current harmonic loop in the control strategy. Experimental results are presented from a two-6-kVA parallel-connected inverter system, showing the feasibility of the proposed approach

A survey of graph layout problems

Abstract: Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized. This survey considers their motivation, complexity, approximation properties, upper and lower bounds, heuristics and probabilistic analysis on random graphs. The result is a complete view of the current state of the art with respect to layout problems from an algorithmic point of view.

Exploring the phenotypic consequences of tissue specific gene expression variation inferred from GWAS summary statistics.

Abstract: Scalable, integrative methods to understand mechanisms that link genetic variants with phenotypes are needed. Here we derive a mathematical expression to compute PrediXcan (a gene mapping approach) results using summary data (S-PrediXcan) and show its accuracy and general robustness to misspecified reference sets. We apply this framework to 44 GTEx tissues and 100+ phenotypes from GWAS and meta-analysis studies, creating a growing public catalog of associations that seeks to capture the effects of gene expression variation on human phenotypes. Replication in an independent cohort is shown. Most of the associations are tissue specific, suggesting context specificity of the trait etiology. Colocalized significant associations in unexpected tissues underscore the need for an agnostic scanning of multiple contexts to improve our ability to detect causal regulatory mechanisms. Monogenic disease genes are enriched among significant associations for related traits, suggesting that smaller alterations of these genes may cause a spectrum of milder phenotypes.

Antiextensive connected operators for image and sequence processing

Abstract: This paper deals with a class of morphological operators called connected operators. These operators filter the signal by merging its flat zones. As a result, they do not create any new contours and are very attractive for filtering tasks where the contour information has to be preserved. This paper shows that connected operators work implicitly on a structured representation of the image made of flat zones. The max-tree is proposed as a suitable and efficient structure to deal with the processing steps involved in antiextensive connected operators. A formal definition of the various processing steps involved in the operator is proposed and, as a result, several lines of generalization are developed. First, the notion of connectivity and its definition are analyzed. Several modifications of the traditional approach are presented. They lead to connected operators that are able to deal with texture. They also allow the definition of connected operators with less leakage than the classical ones. Second, a set of simplification criteria are proposed and discussed. They lead to simplicity-, entropy-, and motion-oriented operators. The problem of using a nonincreasing criterion is analyzed. Its solution is formulated as an optimization problem that can be very efficiently solved by a Viterbi (1979) algorithm. Finally, several implementation issues are discussed showing that these operators can be very efficiently implemented.