Hybrid model of a double-fed induction machine and back-to-back converter

This report details the port interconnection of two subsystems: a power electronics subsystem (a back-to-back AC/AC converter (B2B), coupled to a phase of the power grid), and an electromechanical subsystem (a doubly-fed induction machine (DFIM), coupled mechanically to a flywheel and electrically to the power grid and to a local varying load). Both subsystems have been essentially described in previous reports (deliverables D 0.5 and D 4.3.1), although some previously unpublished details are presented here. The B2B is a variable structure system (VSS), due to the presence of control-actuated switches: however from a modelling and simulation, as well as a control-design, point of view, it is sensible to consider modulated transformers (MTF in the bond-graph language) instead of the pairs of complementary switches. The port-Hamiltonian models of both subsystems are presents and coupled through a power-preserving interconnection, and the Hamiltonian description of the whole system is obtained; detailed bond-graphs of all the subsystems and the complete system are provided.

Energy-based modelling and simulation of the interconnection of a back-to-back converter and a doubly-fed induction machine

This paper describes the port interconnection of two subsystems: a power electronics subsystem (a back-to-back AC/CA converter (B2B), coupled to a phase of the power grid), and an electromechanical subsystem (a doubly-fed induction machine (DFIM). The B2B is a variable structure system (VSS), due to presence of control-actuated switches: however, from a modelling simulation, as well as a control-design, point of view, it is sensible to consider modulated transformers (MTF in the bond graph language) instead of the pairs of complementary switches. The port-Hamiltonian models of both subsystems are presented and, using a power-preserving interconnection, the Hamiltonian description of the whole system is obtained; detailed bond graphs of all subsystems and the complete system are also provided. Using passivity-based controllers computed in the Hamiltonian formalism for both subsystems, the whole model is simulated; simulations are run to rest the correctness and efficiency of the Hamiltonian network modelling approach used in this work.

Coneixements i usos lingüístics de l'estudiantat de la Universitat de Lleida (2012 / 2013). Estudi comparatiu dels resultats obtinguts el 1993/1994 amb els de l’actualitat

El treball que teniu a les mans és una recerca sociolingüística que té com a objectiu l’anàlisi dels coneixements i els usos lingüístics de la Universitat de Lleida, a partir de la comparació dels resultats obtinguts a “Coneixements i usos lingüístics de l’estudiantat de la Universitat de Lleida” (Curs 1993/1994), un estudi impulsat des dels Servei de Llengua i Terminologia l’any 1993. L’elaboració del treball es divideix en tres etapes: l’etapa d’investigació, l’etapa d’organització i l’etapa d’interpretació. La primera etapa ha estat destinada a la recollida de dades. He demanat a un total de 1046 alumnes provinents de vint-i-un graus o especialitat diferents que contestessin un qüestionari. La segona etapa consisteix en l’organització de les dades. El primer que he fet ha estat entrar els resultats de cadascuna de les enquestes al programa ACCES, el qual m’ha permès fer les posteriors agrupacions partint sempre del model de 1993. Una vegada he tingut totes les agrupacions fetes, he fet tots els percentatges, gràfiques i taules al programa Excel. Finalment, quan ja he tingut tots els gràfics i taules confeccionats he passat ja a l’última etapa del treball: la interpretació de les dades. Primer he fet una lectura de cadascun dels gràfics i taules, comparant-los posteriorment amb els resultats obtinguts el 1993. Una vegada he tingut tots els comentaris fets he passat ja al més important: la redacció de les conclusions, on intento explicar els canvis més importants que he copsat.

On balanced CSPs with high treewidth

Tractable cases of the binary CSP are mainly divided in two classes: constraint language restrictions and constraint graph restrictions. To better understand and identify the hardest binary CSPs, in this work we propose methods to increase their hardness by increasing the balance of both the constraint language and the constraint graph. The balance of a constraint is increased by maximizing the number of domain elements with the same number of occurrences. The balance of the graph is defined using the classical definition from graph the- ory. In this sense we present two graph models; a first graph model that increases the balance of a graph maximizing the number of vertices with the same degree, and a second one that additionally increases the girth of the graph, because a high girth implies a high treewidth, an important parameter for binary CSPs hardness. Our results show that our more balanced graph models and constraints result in harder instances when compared to typical random binary CSP instances, by several orders of magnitude. Also we detect, at least for sparse constraint graphs, a higher treewidth for our graph models.

A note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits.

Theta-duality on Prym varieties and a Torelli Theorem

Let $\pi : \widetilde C \to C$ be an unramified double covering of irreducible smooth curves and let $P$ be the attached Prym variety. We prove the scheme-theoretic theta-dual equalities in the Prym variety $T(\widetilde C)=V^2$ and $T(V^2)=\widetilde C$, where $V^2$ is the Brill-Noether locus of $P$ associated to $\pi$ considered by Welters. As an application we prove a Torelli theorem analogous to the fact that the symmetric product $D^{(g)}$ of a curve $D$ of genus $g$ determines the curve.

Elements crisipians en àlgebres d-completes i àlgebres de Sales

El autor estudia los elementos de comportamiento clásico, o crisipianos, en álgebras d-completas (introducidas por él mismo como el sustrato algebraico de las lógicas completas) y en álgebras de Sales (sustrato algebraico de las lógicas multivaloradas). Da caracterizaciones de estos elementos en ambos casos. Estudia la relación de dichos elementos con los espectros irreducible, primo y completamente irreducible. Además obtiene que el conjunto de elementos crisipianos de un álgebra de Sales es una subálgebra y es un álgebra de Abbott (o de implicación).

Statistical mechanics of multi-edge networks

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Cosmological networks

Networks often represent systems that do not have a long history of study in traditional fields of physics; albeit, there are some notable exceptions, such as energy landscapes and quantum gravity. Here, we consider networks that naturally arise in cosmology. Nodes in these networks are stationary observers uniformly distributed in an expanding open Friedmann-Lemaitre-Robertson-Walker universe with any scale factor and two observers are connected if one can causally influence the other. We show that these networks are growing Lorentz-invariant graphs with power-law distributions of node degrees. These networks encode maximum information about the observable universe available to a given observer.

WM Program manual

This manual describes how to run the new produced GUI C++ program that so called'WM' program. Section two describes the instructions of the program installation.Section three illustrates test runs description including running the program WM,sample of the input, output files, in addition to some generated graphs followed by the main form of the program created by using the Borland C++ Builder 6.

A Note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits

Entorn de gestió de dades d'ornitologia

Des de fa uns anys, des de l’EPS de la UVic, s’està duent a terme el desenvolupament d’un dispositiu electrònic que proporciona la capacitat de capturar dades sobre un niu d’ocells. El projecte e-niu, que es pot seguir a www.tutara.info/e-niu, està actualment en una fase de test., i s’ha desenvolupat sobretot la part hardware. Aquest projecte té com a objectiu principal crear un entorn web per poder gestionar les dades que s’obtenen del niu d’ocells informatitzat (e-niu). Les dades que ens arriben dels e-nius estan en un arxiu de text, i el que es pretén és que l’usuari que controla el niu, pugui fer diversos anàlisis de les dades d’aquest. A més de poder veure els resultats en diversos tipus de gràfics, també se li vol donar la opció de treure els resultats en format taula o en format Excel, un format aquest últim, molt interessant, ja que donaria a les dades una gran possibilitat de ser tractades posteriorment, com fer seleccions del tipus de dades, treure percentatges, crear altres tipus de gràfics, etc. L’altre gran objectiu és el fet de poder treballar en la creació d’un entorn web complert a nivell gairebé professional amb l’aprenentatge que això comporta, ja que s’ha aplicat la tecnologia client-servidor, és a dir, que el llenguatge de programació està dins el servidor, i quan algun usuari l’executa, el sistema només li envia la presentació en HTML. El sistema de programació que es fa servir és el de les tres capes. La capa de dades, que està formada per una base de dades relacional del tipus MySQL i és on emmagatzemarem tota la informació. La capa de programació de la que s’encarrega el llenguatge PHP, és on s’efectua tot el tractament de les dades i finalment, la capa de presentació, que és la que s’encarrega de mostrar les dades al client en el navegador mitjançant els templates de HTML.