Activitats
OpenRotor: Geometria para el modelado 3D
Organitzada per l'estudi Rotor. Xerrada dirigida a artistes visuals i interactius interessats en el modelat 3D. Es tracta d'introduir alguns sistemes de coordenades, les bases de la geometria de corbes i superfícies, i el software matemàtic que ens permet crear els models a partir d'equacions. Imprimirem alguns exemples.
- https://mat.upc.edu/ca/activitats/openrotor-geometria-para-el-modelado-3d
- OpenRotor: Geometria para el modelado 3D
- 2016-06-02T19:00:00+02:00
- 2016-06-02T23:59:59+02:00
- Organitzada per l'estudi Rotor. Xerrada dirigida a artistes visuals i interactius interessats en el modelat 3D. Es tracta d'introduir alguns sistemes de coordenades, les bases de la geometria de corbes i superfícies, i el software matemàtic que ens permet crear els models a partir d'equacions. Imprimirem alguns exemples.
02/06/2016 des de 19:00 (Europe/Madrid / UTC200)
Espai Erre, carrer Àvila, 124, 2-2, 08018 Barcelona
Seminari grup ACES: Yuri B. Shtessel
Yuri B. Shtessel: Output tracking in nonminimum phase systems via sliding modes
- https://mat.upc.edu/ca/activitats/seminari-grup-aces-yuri-b-shtessel
- Seminari grup ACES: Yuri B. Shtessel
- 2016-06-02T15:00:00+02:00
- 2016-06-02T23:59:59+02:00
- Yuri B. Shtessel: Output tracking in nonminimum phase systems via sliding modes
02/06/2016 des de 15:00 (Europe/Madrid / UTC200)
IOC Seminar, ETSEIB building, 11th floor, UPC
Title: Output tracking in nonminimum phase systems via sliding modes
Speaker: Prof. Yuri B. Shtessel, Dept. of Electrical and Computer Engineering, The University of Alabama in Huntsville, Huntsville, USA
Schedule: June 2nd, 2016, 15:00, IOC Seminar (ETSEIB building – 11th floor)
Abstract: The problem of causal output tracking and observation in non-minimum phase nonlinear systems is studied and addressed using sliding mode control techniques. The extended method of Stable System Center (ESSC) that is used for addressing the output tracking in nonminimum phase causal systems is presented. ESSC is used in two-fold manner: i) to generate bounded reference profile for unstable internal states; ii) to estimate states of unstable internal dynamics. Two applications of the proposed technique are considered for illustration purposes: output voltage tracking in a nonminimum phase DC/DC electric power converter and output tracking in SISO systems with time-delayed output feedback. A variety of traditional and higher-order sliding mode (HOSM) control and observation methods is employed in the majority of algorithms. Most of the theoretical results are covered by numerical simulations.
LIMDA Joint Seminar: Victor Diego
ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry
- https://mat.upc.edu/ca/activitats/limda-joint-seminar-victor-diego
- LIMDA Joint Seminar: Victor Diego
- 2016-06-02T12:00:00+02:00
- 2016-06-02T23:59:59+02:00
- ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry
02/06/2016 des de 12:00 (Europe/Madrid / UTC200)
Room C3-005, Campus Nord UPC
Speaker: Víctor Diego, Departament de Matemàtiques, UPC
Title: Distance mean-regular graphs
Abstract:
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V, diameter D, adjacency matrix A, and adjacency algebra A. Then, G is distance mean-regular when, for a given u in V, the averages of the intersection numbers p_{ij}^h(u,v)=|G_i(u)\G_j(v)| (number of vertices at distance i from u and distance j from v) computed over all vertices v at a given distance h in {0,1,ldots,D} from u, do not depend on u. In this work we study some properties and characterizations of these graphs. For instance, it is shown that a distance mean-regular graph is always distance degree-regular, and we give a condition for the converse to be also true. Some algebraic and spectral properties of distance mean-regular graphs are also investigated. We show that, for distance mean regular-graphs, the role of the distance matrices of distance-regular graphs is played for the so-called distance mean-regular matrices. These matrices are computed from a sequence of orthogonal polynomials evaluated at the adjacency matrix of G and, hence, they generate a subalgebra of A. Some other algebras associated to distance mean-regular graphs are also characterized.
CRM: AC Methods of Constructive Approximation and Harmonic Analysis
- https://mat.upc.edu/ca/activitats/crm-ac-methods-of-constructive-approximation-and-harmonic-analysis
- CRM: AC Methods of Constructive Approximation and Harmonic Analysis
- 2016-05-30T12:00:00+02:00
- 2016-06-03T12:00:00+02:00
30/05/2016 a 12:00 fins a 03/06/2016 a 12:00 (Europe/Madrid / UTC200)
Centre de Recerca Matemàtica, Bellaterra,
We want to remind you the upcoming Advanced Course on Methods of Constructive Approximation and Harmonic Analysis which will be held at the Centre de Recerca Matemàtica, Bellaterra,
from May 30 to June 3, 2016.
This event is part of the IRP Constructive Approximation and Harmonic Analysis.
Senior registration fee: 90 €
Junior registration fee: 60 €
Deadline for registration fee: May 7, 2016
We want to emphasize that March 15 is the deadline for grant application with the Clay Mathematics Institute http://www.crm.cat/en/Activities/Curs_2015-2016/Pages/CMI-Grants-Constructive-approximation.aspx . These advanced courses are devoted to different topics in connection with High-dimensional approximation, Harmonic Analysis, and closed areas, such as PDE’s. The courses will focus on the problems which have attracted a lot of attention in the recent years. You can find more information in:
http://www.crm.cat/en/Activities/Curs_2015-2016/Pages/Constructive-Approximation.aspx
We hope that this information is of your interest and we hope to see you soon in Barcelona,
Vladimir Temlyakov, University of South Carolina
Sergey Tikhonov, Centre de Recerca Matemàtica-ICREA
(Scientific Comittee)
Projecte de recerca d'Ivan Paz"
Col·laboració en la programació de la interfície gràfica GeMuSe per al software per a l'exploració perceptual de l'espai de paràmetres d'àudio, per a la composició algorísmica. La interfície està programada en Processing i es comunica amb l'aplicació, programada en supercollider, a través del protocol OSC.
- https://mat.upc.edu/ca/activitats/projecte-de-recerca-divan-paz
- Projecte de recerca d'Ivan Paz"
- 2016-05-26T19:30:00+02:00
- 2016-05-26T23:59:59+02:00
- Col·laboració en la programació de la interfície gràfica GeMuSe per al software per a l'exploració perceptual de l'espai de paràmetres d'àudio, per a la composició algorísmica. La interfície està programada en Processing i es comunica amb l'aplicació, programada en supercollider, a través del protocol OSC.
26/05/2016 des de 19:30 (Europe/Madrid / UTC200)
Hangar centre de producció en arts visuals, Emilia Coranty 16, Can Ricart, 08018 Barcelona
LIMDA Joint Seminar: Jack Koolen
ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry
- https://mat.upc.edu/ca/activitats/limda-joint-seminar-jack-koolen
- LIMDA Joint Seminar: Jack Koolen
- 2016-05-26T12:00:00+02:00
- 2016-05-26T23:59:59+02:00
- ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry
26/05/2016 des de 12:00 (Europe/Madrid / UTC200)
Room C3-005, Campus Nord UPC
Speaker: Jack Koolen, University of Science and Technology of China
Title: Recent progress on 2-walk-regular graphs
Abstract:
In this talk I will present some recent progress on 2-walk-regular graphs.
This is based on joint work with Zhi Qiao, Jongyook Park and Shao-Fei Du.
13th European Research Week on Geometric Graphs
- https://mat.upc.edu/ca/activitats/13th-european-research-week-on-geometric-graphs
- 13th European Research Week on Geometric Graphs
- 2016-05-23T12:00:00+02:00
- 2016-05-27T13:00:00+02:00
23/05/2016 a 12:00 fins a 27/05/2016 a 13:00 (Europe/Madrid / UTC200)
Campus Nord, Universitat Politècnica de Catalunya, Barcelona (Spain)
The Geometric Graphs week (formerly Pseudo Triangulations week) brings together a group of about 20 researchers to work in cooperation on open problems brought by the organizers and the participants.
This year it is organized by the DCCG UPC Research Group.
http://www-ma2.upc.edu/dccg/courses-seminars-conferences-and-workshops/geometric-graphs-week/
Seminari de Geometria Algebraica UPC-UB: Ana Cristina López Martin
Ana Cristina López Martín (Universidad de Salamanca), Equivalencias derivadas y fibras de Kodaira
- https://mat.upc.edu/ca/activitats/seminari-de-geometria-algebraica-upc-ub-ana-cristina-lopez-martin
- Seminari de Geometria Algebraica UPC-UB: Ana Cristina López Martin
- 2016-05-20T15:00:00+02:00
- 2016-05-20T23:59:59+02:00
- Ana Cristina López Martín (Universidad de Salamanca), Equivalencias derivadas y fibras de Kodaira
20/05/2016 des de 15:00 (Europe/Madrid / UTC200)
Aula B1, Facultat de Matemàtiques-Edifici Històric (UB) , Gran Via de Les Corts Catalanes, 585, Barcelona 08007
11 Barcelona Weekend in Group Theory
Els propers 20 i 21 de maig tindrà lloc a la FME el 11è Barcelona Weekend in Group Theory, organitzat pel grup de recerca grupsBcn.
- https://mat.upc.edu/ca/activitats/11-barcelona-weekend-in-group-theory
- 11 Barcelona Weekend in Group Theory
- 2016-05-20T00:00:00+02:00
- 2016-05-21T23:59:59+02:00
- Els propers 20 i 21 de maig tindrà lloc a la FME el 11è Barcelona Weekend in Group Theory, organitzat pel grup de recerca grupsBcn.
20/05/2016 fins a 21/05/2016 (Europe/Madrid / UTC200)
FME
Més informació a Link
Computational geometry seminar 19-05-2016
Speaker: Pilar Cano - Universitat Politècnica de Catalunya and Carleton University A rainbow matching in an edge colored hypergraph is a matching such that each pair of its edges have distinct colors. Brualdi, Ryser and Stein conjectured the existence of a partial n-1 Latin transversal in a Latin square n-matrix. This problem can be translated into finding a rainbow matching in a complete bipartite graph. We extend the result of Erds and Spencer on the existence of rainbow matchings in the complete bipartite graph {n,n} to complete r-partite r-uniform graphs, complete bipartite graphs with repeated edges, and d-regular bipartite graphs minus a matching. The results use the Lopsided version of the Local Lovász Lemma.
- https://mat.upc.edu/ca/activitats/computational-geometry-seminar-19-05-2016
- Computational geometry seminar 19-05-2016
- 2016-05-19T13:15:00+02:00
- 2016-05-19T14:15:00+02:00
- Speaker: Pilar Cano - Universitat Politècnica de Catalunya and Carleton University A rainbow matching in an edge colored hypergraph is a matching such that each pair of its edges have distinct colors. Brualdi, Ryser and Stein conjectured the existence of a partial n-1 Latin transversal in a Latin square n-matrix. This problem can be translated into finding a rainbow matching in a complete bipartite graph. We extend the result of Erds and Spencer on the existence of rainbow matchings in the complete bipartite graph {n,n} to complete r-partite r-uniform graphs, complete bipartite graphs with repeated edges, and d-regular bipartite graphs minus a matching. The results use the Lopsided version of the Local Lovász Lemma.
19/05/2016 de 13:15 a 14:15 (Europe/Madrid / UTC200)
Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)
Activities are regularly announced at Link
Comparteix: