Feb 172024
 

Isometric Immersions and Harmonic Maps

Prof. Cezar Oniciuc
Universitatea “Alexandru Ioan Cuza” Iași

Outline

1. Generalities on Riemannian Geometry
2. Isometric immersions (submanifolds) – generalities
3. Special isometric immersions: umbilicals, minimal, CMC
4. Operators on vector bundle
5. Harmonic maps between Riemannian manifolds: first and second variation; fundamental examples

Schedule

May 21st, 16.00-18.00 Aula II
May 22nd, 16.00-18.00 Aula II
May 23rf, 16.00-18.00 Aula II

May 28th, 16.00-18.00 Aula II
May 29th, 16.00-18.00 Aula II
May 30th, 16.00-18.00 Aula II

June 4th, 16.00-18.00 Aula II
June 6th, 16.00-18.00 Aula II

 

 Scritto da in 17 Febbraio 2024  Senza categoria  Commenti disabilitati su PhD Course: Isometric Immersions and Harmonic Maps
Feb 102024
 

MAIN PhD Seminars 2024

Date Speaker(s)
March, 6th Marco Casula
March, 13rd Luca Zedda
March, 20th Filippo Maria Cassanello
March, 27th Alessandro Iannella
April, 3rd Elisa Crabu
April, 17th Jacopo Mereu
April, 24th Alessandra Perniciano
May, 8th Antonio Sanna
May, 15th Giuseppe Demuru
May, 22nd Massimiliano Fadda
Federico Meloni
May, 29th Andrea Cabriolu
Giorgia Nieddu

All the seminars start at 5 PM.

 

Marco Casula: Bochner-Euclidean volume

We will start with examples of calculating the volume of objects in three-dimensional space and then extend the definition to any manifold. Therefore we will introduce a new and different volume on complex manifolds, with particular attention to cases of finite and infinite volumes. The work is based on the article by Loi-Placini.

Luca Zedda: Self-Supervised Learning: The Dark Matter of Artificial Intelligence

In this seminar, we shall delve into the concept of Self-Supervised Learning, an intriguing and rapidly expanding branch of artificial intelligence. Fundamental concepts of this innovative approach will be introduced, demonstrating how it is possible to connect the process of human cognitive development to that of artificial within the context of deep learning. Through the analysis of self-supervised models, it will be explained how AI can autonomously learn, addressing the challenges posed by the lack of explicit annotations in data and the application of these technologies to real-world scenarios.

Filippo Maria Cassanello: An alternative approach to the Hölder continuity of solution of the fractional p-laplacian

In this seminar we will define the non-local operator “fractional p-laplacian” by also talking about his biological interpretation for describing the movement of population in hostile habitat. Then we will give a different proof of the Hölder continuity of weak solution of this operator by extending the approach that DiBenedetto developped for the p-laplacian. This work is based on the paper “An alternative approach to the Hölder continuity of solution of some elliptic equations” of Duzgun, Marcellini, Vespri and is in collaboration with Prof. Antonio Iannizzotto.

Alessandro Iannella: The Transitional Space: Generative Artificial Intelligence as an Opportunity for Professional Growth for Teachers
This seminar aims to illustrate the benefits, risks, and challenges of using Generative Artificial Intelligence in teaching, also drawing on concepts and metaphors from psychology and sociology. Particular attention will be paid to the different phases of the teaching process, from design to evaluation.

Elisa Crabu: Mathematical tools for Computer Vision

Photometric Stereo is a Computer Vision tecnique that leads to reconstructing the digital shape of an object from a set of images, obtained by lighting the object with a light source placed at different positions around it. The method, by estimating the surface normals, computes an approximation of the surface. In this talk we will describe the main steps of the solution method, presenting the mathematical tools that underlie it, including the singular value decomposition, least square problems and the numerical solution of partial differential equations.

Jacopo Mereu: AI-supported End User Development in VR

End-User Development (EUD) is a research field that aims to design and develop software or hardware technology (digital artifacts) such that their consumers (end users) should be able to adapt such artifacts according to their needs. End users are not a static category; the unique context of the application determines their identity, skills, and experience. In the context of this seminar, the end users are proficient programmers in Unity but lack expertise in constructing Extended Reality environments. The research aims to assist these end users in using a XR Development toolkit, the Mixed Reality Toolkit (MRTK), whose latest version has recently been released. Large Language Models (LLMs) have been chosen as the method to support the end users. These models are trained with extensive documents, allowing them to acquire knowledge across various domains. However, their knowledge has a temporal limitation, as the models lack information about events or developments occurring after a certain date. Consequently, an LLM may lack information about the MRTK3 library. This seminar thus presents a practical case of enhancing the performance of an LLM in a domain where it possesses limited or no prior knowledge.

Alessandra Perniciano: Radiomics: the issue of high dimensional data

Radiomics, a branch of Computer Vision, involves the extraction and analysis of quantitative features from medical imaging modalities such as MRI, PET, and CT scans. The central idea behind Radiomics is that imaging features specific to various diseases may offer valuable insights into predicting prognosis and treatment outcomes across different types of pathologies. Notably, these characteristics remain elusive through traditional visual inspection methods employed in current radiologic practice, yet they provide insights into the underlying biological processes. However, the quantitative extraction of features leads to a situation of high dimensionality where not all the extracted features are necessarily relevant. During this seminar, I will present the challenges related to high dimensionality in Radiomics, providing an analysis of the current state of knowledge and discussing some future development directions.

Antonio Sanna: Harmonic and Biharmonic maps between Riemannian Manifolds

The object of this seminar is the definition of harmonic maps and biharmonic maps between Riemannian manifolds. During the exposition we will introduce the energy functional for smooth maps between two Riemannian manifolds,  and, deriving the corresponding Euler-Lagrange equation — in order to find its critical maps, we will define a certain vector field, called tension field, which is identically zero when the map is harmonic, i.e. critical. We will extend the notion of harmonic maps to that of biharmonic maps which are the critical points of the bienergy functional. We will see that harmonic maps are trivially biharmonic. Thus a crucial problem is to understand when the converse is also true, that is: under what conditions biharmonic maps are harmonic. Beyond this theoretical exploration, we will give some examples of biharmonic maps which are not harmonic. In particular, we will consider the geometrically interesting case of biharmonic isometric immersions.

Giuseppe Demuru: An Introduction to Causal Inference

Causal inference involves the study of cause-and-effect relationships among variables, based on experimental or observational data. Understanding these relationships in depth is essential for making informed decisions and solving complex problems. The well-known statement “Correlation does not imply causation” underscores that simple associations do not necessarily imply causality. Causal inference utilizes methods such as Potential Outcomes (PO) and Directed Acyclic Graphs (DAGs) to identify and quantify the true causal relationships among variables.

Massimiliano Fadda: Translating HTML in proprietary JSON

Growens is an integrated industrial group that creates technologies for content creation, predictive marketing, and mobile messaging, aimed at organizations wishing to communicate effectively with their customers. The seminar will introduce the reasons that led the company to develop this project. An overview of the technologies and methodologies identified for its resolution will then be provided, introducing the architecture of the system that allows the conversion of generic HTML pages into proprietary Json.

Federico Meloni: Mesh generation in the volumetric domain

Representing an object in the virtual world is becoming a frequent practice in fields like industries, entertainment, medicine. To digitally represent an object, the space is discretized due to the inability of a computer to represent space continuously. Therefore, we utilize a series of primitives such as points, segments, polygons, and eventually polyhedra to represent an object, called in this context a mesh. A three-dimensional mesh can be superficial if only the exterior of the object is represented, or volumetric if it includes a description of the volume within. The latter unlocks the possibility of performing a variety of operations such as physical simulations, fluid dynamics, and many others. In this context, algorithms for automatic generation of volumetric meshes are becoming increasingly important and valuable. This seminar will review the basic concepts before proceeding to present high-level algorithms for generating volumetric meshes.

Andrea Cabriolu: A Bayesian approach to an optimization algorithm for the dynamic scheduling of astronomical observations

In the context of the dynamic scheduling of observations with Sardinia Radio Telescope, a key role is played by Optimizer, a set of algorithms to optimize the sequence of the astronomical observations. The calculations are based on several parameters, like weather conditions, device availability, operator’s availability and others. In this talk I’ll introduce the architecture which allows the communication between Optimizer and the whole scheduling system, consisting of a central database and a bunch of other components. The core concepts of the Bayesian statistics will be introduced as well, since this is the main pillar of the computing performed by the algorithm, to optimize the parameters set regargind the observations to be scheduled.

Giorgia Nieddu: State of art on the use of A.I. in mathematics education

In this seminar the most recent results on the use of A.I. in mathematics education, its areas of application, limits and possibilities will be presented.

 Scritto da in 10 Febbraio 2024  Senza categoria  Commenti disabilitati su MAIN PhD Seminars 2024
Gen 142024
 

Foliations

Prof. Gianluca Bande
Dipartimento di Matematica e Informatica
Università degli Studi di Cagliari

Abstract

The course is an introduction to the Theory of Foliations. Basic knowledge of Differential Geometry is required and the basics of Fundamental Group.

Outline

– Definition(s) and examples of Foliations. Dynamical systems. Frobenius’ Theorem.
– Holonomy of a leaf and the Reeb Stability Theorem. Basic and foliated Cohomology. Godbillion-Vey class for a codimension 1 foliation on a 3-manifold.
– The Reeb foliation: definition and a 3D-printer model. Novikov and Likorisch Theorem.

Schedule

The course spans over 3 lectures of 2 hours each (6 hours total). The lectures will be given on February 5, February 12, February 15 – 2024 at 4:30 p.m. in Room B of the Department of Mathematics and Computer Science.

Exam

The final exam consists in a presentation.

References

1. C. Camacho and A. Lins Neto, Geometric theory of foliations, Birkhäuser, 1985.
2.
A. Candel; L. Conlon, Foliations I, Grad. Stud. Math. 23, American Mathematical Society, Providence, 2000.
3.
P. Tondeur, Geometry of Foliations, Monogr. Math 90, Birkhäuser Verlag, Basel, 1997.

 Scritto da in 14 Gennaio 2024  Senza categoria  Commenti disabilitati su PhD Course: Foliations
Set 212023
 

Geometric Analysis

Prof. Antonio Greco
Dipartimento di Matematica e Informatica
Università degli Studi di Cagliari

Abstract

The course is an introduction to the problem of determining the shape of solutions to boundary-value problems for second-order partial differential equations, mainly of elliptic type, occasionally parabolic.

Outline

– Review of the weak maximum principle, the strong maximum principle, and the Hopf lemma.
– Some motivations for Geometric Analysis and some characteristic results: the soap bubble theorem (Aleksandrov’s theorem), Serrin’s overdetermined problem, the Gidas-Ni-Nirenberg symmetry result.
– Convexity of solutions to the Dirichlet problem. Quasiconvexity.
– The Morse index of a solution and its role in Geometric Analysis. Work in progress.

Schedule

The course spans over 8 lectures of 2 hours each (16 hours total), one lecture per week. Details will be specified on the occasion of the first lecture, which will be given on October 20, 2023 at 4 p.m. in room B of the Department of Mathematics and Computer Science

Exam

The final exam consists in a presentation, and it can be recognized as 3.2 CFR.

References

1. Gidas, B.; Ni, Wei-Ming; Nirenberg, L. Symmetry and related properties via the maximum principle. Commun. Math. Phys. 68, 209-243 (1979).
2. Berestycki, H.; Nirenberg, L. On the method of moving planes and the sliding method. Bol. Soc. Bras. Mat., Nova Sér. 22, No. 1, 1-37 (1991).
3. Fraenkel, L. E. An introduction to maximum principles and symmetry in elliptic problems. Cambridge University Press. x, 340 p. (2011).
4. Protter, Murray H.; Weinberger, Hans F. Maximum principles in differential equations. Prentice-Hall, Inc. X, 261 p. (1967).
5. Serrin, James. A symmetry problem in potential theory. Arch. Ration. Mech. Anal. 43, 304-318 (1971).
6. Sperb, Rene P. Maximum principles and their applications. Academic Press. IX, 224 p. (1981).

Dic 182013
 

The consortium of Italian Computer Science PhD granting institutions under the auspices of GRIN, organizes an annual school offering three graduate-level courses aimed at first-year PhD students in Computer Science. In addition to introducing students to timely research topics, the school is meant to promote acquaintance and collaboration among young European researchers. The 2014 edition of the School is the 20th in the series.

The school will offer 3 courses each consisting of 13 hours of lectures:

  • Big Data Analysis of Patterns in Media Content – Nello Cristianini, University of Bristol (UK)
  • An Introduction to Probabilistic and Quantum Programming – Ugo Dal Lago, University of Bologna (Italy)
  • Development of dynamically evolving and self-adaptive software – Carlo Ghezzi, Politecnico di Milano (Italy)

Full details about the school are available here.

Giu 192013
 
Upcoming PhD course

Reversible Computing

July 15-19, 2013
Dipartimento di Matematica e Informatica - Via Ospedale 72, Cagliari

Ivan Lanese
Università di Bologna & INRIA FOCUS Team

Abstract. Reversible computing emerges spontaneously in many areas, such as  quantum computing or biological modeling. Also, reversible computing
allows for recoverability: when an error occurs reversibility allows one to go back to a past state and try again. Reversibility is well  understood in a sequential setting: to reverse a computation one has  to recursively undo the last step. This is not possible in a concurrent scenario, since it may not be clear which the last performed action is.

We will study reversibility for concurrent interacting systems. In particular, we consider causal consistent reversibility, where only actions which have produced no consequences can be undone. We consider uncontrolled forms of reversibility first. However, uncontrolled  reversibility is not suitable for programming safe applications, since  backward steps should be triggered only when an error state is reached. To this end we define a rollback operator allowing the  programmer to control when backward steps are performed. We also show that specifying alternatives is useful to avoid looping behaviors. We  make our intuitions formal using reversible process calculi.  Finally, we discuss applications of our theory to transactions and to debugging.


The official presentation of the course will be on July 15 (Monday) in Aula C, at 10:00. The schedule of the course will be fixed during this meeting.

Course schedule.
  • Monday 15, 10.00-12.00 Aula F [slides]
  • Tuesday 16, 10.00-12.00 Aula F [slides]
  • Wednesday 17, 10.00-12.00 Aula C [slides]
  • Thursday 18, 10.00-12.00 Aula C [slides]
  • Friday 19, 10.00-12.00 Aula C [slides]

The course has been funded by the PhD Course in Computer Science of the University of Cagliari.

 Scritto da in 19 Giugno 2013  Senza categoria  Commenti disabilitati su PhD course: Reversible Computing
Giu 192013
 
Upcoming Seminar

A Tool for Verifying Bisimilarity in CCP

June 26, 10.00 (Aula F)
Palazzo delle Scienze - Cagliari

Andres Aristizabal
Pontificia Universidad Javeriana Cali - Colombia


Abstract.
Concurrent constraint programming (ccp) is a well-established formalism for specifying processes posting and querying (partial) information in shared-memory concurrent systems. Bisimilarity is recognized as the finest behavioural equivalence in concurrency theory.

In this talk we present a tool for verifying the adequate notion of bisimilarity in ccp [FoSSaCS'11] following the theoretical algorithms presented in [SAC'12] and [ICE'12]. Also we intend to describe the structure of the tool, thus, the steps which have to be followed in order to obtain an efficient and consistent tool.

All in all, we give the main insights of a web-based tool to verify strong and weak bisimilarity in ccp, i.e., preliminary concepts, the syntax used by the tool, some flowcharts describing important implemented algorithms, the structure of the tool and the way it works while interacting with an user.  

Apr 152013
 
Upcoming Seminar

Lending Petri Nets (and contracts)

April 16, 15.00 (Aula F)
April 17, 11.00 (Lab. 5)
Palazzo delle Scienze - Cagliari

G. Michele Pinna
Dipartimento di Matematica e Informatica - Università degli Studi di Cagliari


Abstract.
In the first part of this seminar, we give a brief introduction to Petri nets, one of the classical models of distributed systems. Petri nets have been applied in various areas, among which the description and analysis of business processes.

In the second part, w
e present Lending Petri nets, a variant of Petri nets which allows places to "lend" tokens under the guarantee that credits will be honoured - that is, lent tokens are eventually returned.

Lending Petri nets are then exploited to model contracts for business processes. In particular, we show how they can be used to formalise contracts which protect themselves while still realizing the desired choreography. We relate Lending Petri nets with Propositional Contract Logic, by showing a translation of formulae into our Petri nets which preserves the logical notion of agreement, and allows for compositional verification.

 Scritto da in 15 Aprile 2013  Senza categoria  Commenti disabilitati su Seminar: Lending Petri Nets (and contracts)
Mar 012013
 
Upcoming Seminar

A Calculus of Controlled Monotonicity

March 5, 15.00
Aula F - Palazzo delle Scienze - Cagliari

Gabriele Pulcini
Dipartimento di Informatica - Scienza e Ingegneria - Università di Bologna


Abstract.
We introduce a cut-free logical system involving serio-parallel structures relying on preorders. This system describes processes displaying a
kind of controlled monotonicity (e.g. biochemical processes) by means of a specific variant of standard Gentzen-style sequents called "embedded sequents".

Set 052012
 
Upcoming Seminar

Circularity, event structures, and contracts

Sept 11, 12.00
Aula C - Palazzo delle Scienze - Cagliari

Tiziana Cimoli
Dipartimento di Matematica e Informatica - Università degli Studi di Cagliari


Abstract.
Contracts will play an increasingly important role in the specification and implementation of distributed (cloud) systems. Quoting from [1], “Absent radical improvements in security technology, we expect that users will use contracts and courts, rather than clever security engineering, to guard against provider malfeasance”. Contracts describe the promised behavior of a software agent, from the point of view of the actions it may perform, the interactions it may participate into, and its goals. A primary use of contracts if that of postponing actual interaction with other agents until an agreement on the mutually promised behaviour has been found. As in the real world, promises are not always kept by software systems, and so contracts may be helpful also after the agreement to disciplinate the interaction among agents, and to establish liability in case of violations.

At a very abstract level, a contract can be seen as sets of events, together with relations to specify the causal dependencies and the conflicts between events. This seems to suggest event structures - one of the fundamental causal models for concurrency - as a natural candidate for representing contracts. For instance, one can interpret the enabling b|-a of a stable event structure as the contract clause “I will do a after you have done b”.

However, event structures do not capture a crucial aspect of contracts, i.e. the capability of reaching an agreement in the presence of circularity in the declared promises. For instance, one would expect that the contract where A promises a in change of b, and B promises b in change of a, has an agreement. This contrasts with the fact that the event structure with enablings b|-a and a|-b has only one configuration - the empty set. This is because a|-b actually models the fact that b may only happen after a has been done, and b|-a as the fact that a may happen after b - and so neither a nor b can happen. Of course, A could simply declare to do a, without asking b to be performed first - but this would not protect A from a misbehaving B.

To reconcile causality with circularity, A could relax her contract, i.e. she could do a in change of the promise of B to do b. In this case A can safely do the first step, because either B does b, or he will be culpable of a contract violation.

In this talk we present an extension of event structures which allows for this kind of reasoning. The contract a||-b (intuitively, “I will do a if you promise to do b”) reaches an agreement with the dual contract b||-a, while protecting the participant who offers it. We characterise configurations of these event structures as provability of formulae in the contract logic PCL, an extension of intuitionistic logic with a “contractual implication” connective.

We then focus on the problem of determining, in any state of the execution of a contract, which events have to be done next. This problem is trivial in classical event structures (one has to do the events whose causes have already been done), while it becomes relevant in the presence of circularity: indeed, before performing an event a (whose causes have not already been done) one has to be sure that its causes will be done, eventually in the future. Also in this case we devise a logical characterisation via an encoding in the logic PCL.

References

[1]  Michael Armbrust, Armando Fox, Rean Griffith, Anthony D. Joseph, Randy Katz, Andy Konwinski, Gunho Lee, David Patterson, Ariel Rabkin, Ion Stoica, Matei Zaharia. A View of Cloud Computing. Communications of the ACM, Vol. 53 No. 4, Pages 50-58, 2010
contatti | accessibilità Università degli Studi di Cagliari
C.F.: 80019600925 - P.I.: 00443370929
note legali | privacy