Polytechnic University of Turin

About: Polytechnic University of Turin is a education organization based out in Turin, Piemonte, Italy. It is known for research contribution in the topics: Finite element method & Computer science. The organization has 11553 authors who have published 41395 publications receiving 789320 citations. The organization is also known as: POLITO & Politecnico di Torino.

Congestion-management schemes: a comparative analysis under a unified framework

Abstract: The restructuring of the electricity industry has spawned the introduction of new independent grid operators (IGOs), typically called transmission system operators (TSOs); independent system operator (ISOs); or regional transmission organizations (RTOs), in various parts of the world. An important task of an IGO is congestion management (CM) and pricing. This activity has significant economic implications on every market participant in the IGO's region. The paper briefly reviews the CM schemes and the associated pricing mechanism used by the IGOs in five representative schemes. These were selected to illustrate the various CM approaches in use: England and Wales, Norway, Sweden, PJM, and California. The authors develop a unified framework for the mathematical representation of the market dispatch and redispatch problems that the IGO must solve in CM in these various jurisdictions. They use this unified framework to develop meaningful metrics to compare the various CM approaches so as to assess their efficiency and the effectiveness of the market signals provided to the market participants. They compare, using a small test system, side by side, the performance of these schemes.

Performance of space-time codes for a large number of antennas

Abstract: We study the asymptotic behavior of space-time codes when the number of transmit and receive antennas grows to infinity. Specifically, we determine the behavior of pairwise error probabilities with maximum-likelihood (ML) decoding and with three types of receiver interfaces: the ML interface, the linear zero-forcing (ZF) interface, and the linear minimum-mean-square-error (MMSE) interface. Two situations are studied: when the number of receiving antennas grows to infinity while the number of transmitting antennas is finite, and when both numbers grow to infinity but their ratio remains constant. We show that with ML or linear interfaces the asymptotic performance of space-time codes is determined by the Euclidean distances between codewords. Moreover, with the two linear interfaces examined here the number r of receive antennas must be much larger than the number t of transmit antennas to avoid a sizeable loss of performance; on the other hand, when r /spl Gt/ t, the performance of these linear interfaces comes close to that of ML. The dependence of error probabilities on Euclidean distance is valid for intermediate signal-to-noise ratios (SNRs) even when the number of antennas is small. Simulations validate our theoretical findings, and show how asymptotic results may be substantially valid even in a nonasymptotic regime: thus, even for few antennas, off-the-shelf codes may outperform space-time codes designed ad hoc.

Extreme point results for robust stabilization of interval plants with first-order compensators

Abstract: It has been shown previously that a first-order compensator robustly stabilizes an internal plant family if and only if it stabilizes all of the extreme plants. These extreme plants are obtained by considering all possible combinations for the extreme values of the numerator and denominator coefficients. In this work, the authors prove a stronger result, namely, that it is necessary and sufficient to stabilize only sixteen of the extreme plants. These sixteen plants are generated using the Kharitonov polynomials associated with the numerator and denominator. Furthermore, when additional information about the compensator is specified (sign of the gain and signs and relative magnitudes of the pole and zero), then, in some cases, it is necessary and sufficient to stabilize eight critical plants, while, in other cases, it is necessary and sufficient to stabilize twelve critical plants. >