Seminari - Dipartimento InformaticaSeminari - Dipartimento Informatica validi dal 16.12.2018 al 16.12.2019.
http://www.di.univr.it/?ent=seminario&rss=0&lang=it
A level set based method for fixing overhangs in 3D printing
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4579
Relatore: Emiliano Cristiani; Provenienza: IAC-CNR di Roma; Data inizio: 2018-12-17; Ora inizio: 15.15; Note orario: Sala Verde; Riassunto: Title: A level set based method for fixing overhangs in 3D printing Speaker:Emiliano Cristiani - IAC-CNR di Roma (with Simone Cacace and Leonardo Rocchi) 3D printers based on the additive manufacturing technology create objects layer-by-layer dropping fused material. As a consequence, strong overhangs cannot be printed because the new-come material does not find a suitable support over the last deposed layer. In these cases, one can add support structures (scaffolds) which make the object printable, to be removed at the end. In this talk we show how the level set method can be used to create object-dependent support structures specifically conceived to reduce both the amount of additional material and the printing time. We also review some open problems about 3D printing which can be of interests for the mathematical community. Contact Person: Giacomo Albi .
Mon, 17 Dec 2018 15:30:00 +0100http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4579Control of hybrid systems: numerical and software tools (2 ECTS)
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4498
Relatore: Peter Collins; Provenienza: Maastricht University; Data inizio: 2019-03-13; Note orario: starting date; Referente interno: Marco Caliari.
Wed, 13 Mar 2019 00:00:00 +0100http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4498Metric Regularity and Control of Ordinary Differential Equations (2 ECTS)
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4518
Relatore: Marc Quincampoix; Provenienza: Université Bretagne Occidentale, Brest, France; Data inizio: 2019-04-01; Ora inizio: 9.00; Referente interno: Antonio Marigonda; Riassunto: Metric regularity property extends the well-known Inverse Function Theorem to the case where the function is neither necessarily regular nor injective. The goal of this series of lectures consists in studying this property in Banach spaces, giving equivalent characterizations and stability results (known as Lyusternik-Graves Theorem). In control theory metric regularity can be used to study the controllability through metric regularity of the reachable map, or stability of first-order necessary conditions foroptimal control problems. Speaker: Marc Quincampoix Universiteacute; Bretagne Occidentale, Brest, France.
Mon, 1 Apr 2019 09:00:00 +0200http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4518Introduction to game theory and applications (2 ECTS)
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4522
Relatore: Averboukh Yurii; Provenienza: Krasovskii Institute of Mathematics and Mechanics and Ural Federal University, Yekaterinburg, Russia; Data inizio: 2019-04-10; Referente interno: Antonio Marigonda; Riassunto: Abstract: The game theory studies the interaction between the agents acting to achieve their own purposes. Now the results of game theory are applied in the various fields of science. In particular, it plays the crucial role in the modern economics. I will restrict my attention to the deterministic games with complete information. I will consider non-cooperative and cooperative games. The course will consists of two parts. First one is devoted to one-shot games. In the second part I will discuss discrete-time dynamical games. I will start with the zero-sum one-short games. Here I introduce the mixed strategies and prove the existence of the solution. The natural generalization of zero-sum games are nonzero-sum games. We will consider such solution concepts as Nash equilibrium and Stackelberg solution. The cooperative one-shot game will finish the first part of the course. In the second part the main approaches to the design of solutions of dynamical games as dynamic programming and folk theorems will be introduced. Furthermore, I would like to discuss the concept of time-consistency both for non-cooperative and cooperative cases. The theoretical results will be illustrated by model examples. These examples will give an insight to optimal behaviour.
Wed, 10 Apr 2019 00:00:00 +0200http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4522High performance computing - Montecarlo methods (2 ECTS)
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4499
Relatore: Jerome Lelong; Provenienza: Institut Polytechnique Grenoble; Data inizio: 2019-04-16; Note orario: starting date; Referente interno: Marco Caliari.
Tue, 16 Apr 2019 00:00:00 +0200http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4499Connectivity parameters of graphs (2 ECTS)
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4494
Relatore: John Baptist Gauci; Provenienza: University of Malta; Data inizio: 2019-04-29; Note orario: Mnicourse - 6 lectures; Referente interno: Giuseppe Mazzuoccolo; Riassunto: The property of a graph being connected depends only on whether the graph contains a path for every pair of vertices. However, besides the classical connectivity measures that study the minimum number of vertices or edges that need to be deleted to disconnect the graph, other types of connectivity have recently received much attention. These include connectivity parameters that impose some restrictions on the components of the remaining graph; a notion proposed by Harary (1983) and known as conditional connectivity. Given a graph G and some graph theoretical property P, the size of the smallest set S of vertices (or edges), if such a set exists, such that the graph G-S is disconnected and every remaining component has property P is the conditional connectivity (or conditional edge-connectivity) of G. Although, theoretically, any property P can be chosen, the most popular choices of P are those having practical applications. During this course we will mainly focus on maximal connectivity and on certain conditional connectivity parameters of graphs. We will present well-known bounds for these parameters and discuss sufficient conditions for the bounds to be attained in terms of vertex-degrees, diameter and girth. Finally we review related results for some families of graphs, including partite graphs, product graphs, circulant graphs, and hypercubes.
Mon, 29 Apr 2019 00:00:00 +0200http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4494Numerical Methods for Energy Finance (1 ECTS)
http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4532
Relatore: Tony Ware; Provenienza: University of Calgary; Data inizio: 2019-05-13; Referente interno: Leonard Peter Bos; Riassunto: The basis of numerical methods for finance in oil, gas and electricity markets.
Mon, 13 May 2019 00:00:00 +0200http://www.di.univr.it/?ent=seminario&rss=0&lang=it&id=4532