2021/2022 edition

Information about the courses Syllabus_2021_2022

Information about acceptance of candidates to MAP-PDMA can be consulted HERE

For relevant dates, click here and here

Information About the First Semester

Information About the Second Semester

SEMINARS

Seminar #16: MAP-PDMA PhD Program 2021/2022 — January 31, 15h00

* Place: via Zoom, URL: https://videoconf-colibri.zoom.us/j/86389857315

* Title: Modeling and forecasting with stochastic differential equations and other stochastic processes

* Speaker: Paula Milheiro Oliveira, Faculdade de Engenharia da Universidade do Porto, poliv@fe.up.pt

Abstract: Many real world systems exhibit a stochastic behavior as a result of random influences or uncertainty. Examples of these type of stochastic dynamics occur throughout the physical, social and life sciences as well as in engineering, just to name a few domains.

Various methods of advanced modelling are needed for an increasing number of complex systems. For a model to describe the future evolution of the system, it must: (i) capture the inherently linear or non-linear behavior of the system; (ii) provide means to accommodate for noise due to approximations and measurement errors. This calls for methods that are capable of bridging the gap between physical world and statistical modelling.

We will give an overview on the modeling procedure and illustrate the main ideas on a couple of real world examples. Many other examples exist including in other fields of application, e.g. in population growth, the neurosciences, infectious diseases and epidemiology, the new green energy systems, financial markets, new materials and mechanical structures. Once the mode is fit, forecasting equations can be derived by applying statistical principles. Short term as well as long term forecasts can be computed.

We will depart from the fundamental concepts on stochastic differential equations and present the main up to date challenges in terms of modeling and forecasting. The need for using Stochastic Differential Equations also appears in a rather natural way in problems involving Big Data. We will make this relation evident in the exposition. Computer programs and languages like R or Matlab are useful in solving this type of modeling problems.

References

[1] Braumann, C.A. (2019). Introduction to Stochastic Differential Equations
with Applications to Modeling in Biology and Finance. Wiley.

[2] Mao, X. (2007). Stochastic differential equations and their applications.
Horwood Publishing.


Seminar #15: MAP-PDMA PhD Program 2021/2022 — January 28, 17h15

* Place: via Zoom, URL: https://videoconf-colibri.zoom.us/j/86389857315

* Title: Determining groups in multiple survival curves

* Speaker: Luís Meira-Machado, Centre of Mathematics, University of Minho

* Abstract: Survival analysis includes a wide variety of methods for analyzing time-to-event data. One basic but important goal in survival analysis is the comparison of survival curves between groups. Several nonparametric methods have been proposed in the literature to test for the equality of survival curves for censored data. When the null hypothesis of equality of curves is rejected, leading to the clear conclusion that at least one curve is different, it can be interesting to ascertain whether curves can be grouped or if all these curves are different from each other. A method is proposed that allows determining groups with an automatic selection of their number. The applicability of the proposed method is illustrated using real data. We will discuss the possibility of extending the proposed methods to determine groups is other curves such as the cumulative hazard curves in competing risks model.

References

[1] N.M. Villanueva, M. Sestelo, L. Meira-Machado, A method for determining groups in multiple survival curves, Statistics in Medicine, 38(5), 866–877, 2019.

[2] L. Meira-Machado, M. Sestelo, Estimation in the progressive illness-death model: A nonexhaustive review, Biometrical Journal 61(2), 245–263, 2019.

[3] N.M. Villanueva, M. Sestelo, L. Meira-Machado, J. Roca-Pardiñas, clustcurv: An R Package for Determining Groups in Multiple Curves, The R Journal, 13, 2073–4859, 2021.


Seminar #14: MAP-PDMA PhD Program 2021/2022 — January 28, 16h15

* Place: via Zoom, URL: https://videoconf-colibri.zoom.us/j/86389857315

* Title: Polarized natural deduction

* Speaker: José Espírito Santo, Center of Mathematics, University of Minho

* Abstract: A natural deduction system [1] is presented for polarized, intuitionistic, propositional logic with several interesting properties [2]: it has a privileged relationship with a standard focused sequent calculus [3]; it enjoys the subformula property; polarity decides whether the elimination rules are generalized or not [4]; there are no commutative conversions; and even atomic formulas have introduction, elimination and normalization rules. In the corresponding polarized lambda-calculus, reduction follows a paradigm that subsumes both call-by-name and call-by-value [5].

References

[1] Dag Prawitz. Natural Deduction. A Proof-Theoretical Study. Almquist and Wiksell, Stockholm, 1965.

[2] José Espírito Santo. The polarized λ-calculus. Electronic Notes in Theoretical Computer Science 332: 149–168, 2017.

[3] Chuck Liang and Dale Miller. Focusing and polarization in linear, intuitionistic, and classical logics. Theoretical Computer Science, 410(46):4747–4768, 2009.

[4] Jan von Plato. Natural deduction with general elimination rules. Archive for Mathematical Logic, 40(7):541–567, 2001.

[5] Paul B. Levy. Call-by-push-value: Decomposing call-by-value and call-by-name. Higher Order and Symbolic Computation, 19(4): 377–414, 2006.


Seminar #13: MAP-PDMA PhD Program 2021/2022 — January 21, 2022, 17h00, Room 11.3.21

* Title: Dynamic neural fields: theory and applications

* Speaker: Wolfram Erlhagen, Centre of Mathematics, University of Minho

* Abstract: Dynamic Neural Fields (DNFs) formalized by nonlinear integro-differential equations have been originally introduced as a model framework for explaining basic principles of neural information processing in which the interactions of billions of neurons are treated as a continuum. The intention is to reduce the enormous complexity of neural interactions to simpler population properties that are tractable by mathematical analysis. More recently, complex models consisting of several connected DNFs have been developed to explain higher level cognitive functions (e.g., memory, decision making, prediction and learning) and to implement these functionalities in autonomous robots. I will give an overview about the physiological motivation of DNFs, the mathematical analysis of their dynamic behaviors, and their application in cognitive robotics. As an example study, I focus on “multi-bump” solutions that have been proposed as a neural substrate for a multi-item memory function. I show how the existence and stability properties of these solutions can be exploited to endow a robot with the capacity to efficiently learn the timing and serial order of sequential events. I also discuss new mathematical challenges that are motivated by robotics applications.

References

[1] S.-I. Amari (1977). Dynamics of pattern formation in lateral-inhibition type neural fields, Biological Cybernetics 27 (2), 77-87.

[2] W. Erlhagen, E. Bicho (2006). The dynamic neural field approach to cognitive robotics, Journal of Neural Engineering 3 (3), R36

[3] F. Ferreira., W. Erlhagen, E. Bicho (2016). Multi-bump solutions in a neural field model with external inputs. Physica D: Nonlinear Phenomena, 326, 32-51.

[4] W. Wojtak, S. Coombes, D. Avitabile, E. Bicho, W. Erlhagen (2021). A dynamic neural field model of continuous input integration. Biological Cybernetics, 1-21.

[5] F. Ferreira, W. Wojtak, E. Sousa, L. Louro, E. Bicho, W. Erlhagen (2020). Rapid learning of complex sequences with time constraints: A dynamic neural field model. IEEE Transactions on Cognitive and Developmental Systems. DOI: 10.1109/TCDS.2020.2991789



Seminar #12: MAP-PDMA PhD Program 2021/2022 — January 21, 2022, 16h00, Room 11.3.21

* Title: Expected utility theory and clustering

* Speaker: Irene Brito, Center of Mathematics, University of Minho

* Abstract: In decision theory, for example in the actuarial and economic context, the expected utility model describes how individuals choose between uncertain or risky prospects [1]. According to that model, there exists a utility function to appraise different risky outcomes and a decision maker chooses the outcome which maximizes expected utility. The utility function is used to model the individual’s preferences.

Several problems in machine learning, for example data classification problems, rely on partitioning a given data set into disjoint, non-empty subsets. Clustering is a process of organizing a data set into subsets – clusters – in such a way that objects belonging to the same cluster are similar [2]. The aim is to form a partition, where the clusters are constructed using a metric (for example the Euclidean metric), minimizing the dissimilarity between elements belonging to the same cluster.

The aim of utility clustering is to solve classification problems taking into account the preferences of decisions, by replacing the usual metrics with utility functions [3].

In this seminar I will present a brief introduction to the theory of expected utility and to clustering and explain then the fundamentals of the utility clustering theory. The equivalence of the traditional K-means clustering and the utility clustering with a quadratic utility function will be shown [3].

References

[1] R. Kaas et al., Modern actuarial risk theory, 2nd ed., Springer, 2008.

[2] B.S. Everitt et al., Cluster Analysis, 5th Edition, Wiley and Sons, 2011.

[3] S. Clain, I. Brito, Utility clustering, in preparation, 2021.


Seminar #11: MAP-PDMA PhD Program 2022/2021 — January 14, 17h15, Room 11.3.21, DMat-UA

* Title: Study of convex Semi-infinite Programming problems: general approaches, applications, and open problems

* Speaker: Tatiana Tchemisova, CIDMA, Department of Mathematics, University of Aveiro

* Abstract: Problems of convex Optimization consist in search for extrema of convex functions in domains which are convex sets. Many times the success of the process of solution of such problems depends on the way how the feasible sets are described. The problems where the feasible sets are described with the help of a finite number of convex functions (constraint functions) belong to the convex Nonlinear Programming; such problems are rather well studied and there are solvers developed for them. In the case when the number of constraints is infinite, we deal with problems of Semi-infinite Programming.

In the talk, we present different approaches to solving convex SIP problems, and speak about the open questions and problems.


Seminar #10: MAP-PDMA PhD Program 2022/2021 — January 14, 16h15, Room 11.3.21, DMat-UA

* Title: Compositional data: some challenges in the world of Multivariate Statistics

* Speaker: Adelaide Freitas, CIDMA, Department of Mathematics, University of Aveiro

* Abstract: In the relative scale, 5% is a half of 10% and 45% forms a fraction of 0.9 of 50%. Obviously! However, in absolute scale, both comparisons produce the same difference. Whenever multivariate observations in a data set represent quantitative descriptions of the parts of some whole, conveying only relative information between parts, statistical techniques adequate to analyze compositional data should be used. Since compositional data are positive multivariate data with constant sum constraint, classic statistical methods (dealing with differences) can be not appropriate to be considered on them. Compositional data has emerged over the last years in numerous scientific fields. We illustrate some examples and list some difficulties to work with compositional data, namely in the area of exploratory multivariate statistics. We review some transformations proposed to overcumber the constraint imposed by the definition and discuss some challenges in the analysis of compositions of compositional data.


Seminar #9: MAP-PDMA PhD Program 2021/2022 — December 17, 16h30

* Place: via zoom, https://videoconf-colibri.zoom.us/j/86389857315

* Title: Multivariate and multiscale complexity under long-range correlation: application in cardiovascular variability

* Speaker: Ana Paula Rocha, CMUP, Department of Mathematics, University of Porto

* Abstract: An intrinsic feature of some physiological or econometric systems, is their dynamical complexity, resulting from the activity of several coupled mechanisms operating across multiple temporal scales. The cardiovascular system is one of such systems and specific complex characteristics such as long memory and volatility have been considered from a model based ARFIMA-GARCH parametric viewpoint. Entropy rate is another current measure of complexity. Recently, an efficient estimation of the linear multiscale entropy (MSE) was introduced using a state space formulation, able to attend the simultaneous presence of short-term dynamics and long-range correlations by using ARFI modeling. Given the interactions present in these systems, natural generalizations consider a multivariate approach with VARFI models. Within this framework, for Gaussian processes, we propose to estimate the Transfer Entropy, or equivalently Granger Causality, allowing to quantify the information flow and assess directed interactions accounting for long-range correlations.

The methods are applied in experimental and clinical cardiovascular stress situations, allowing to discriminate between health and disease and to assess disease severity. Moreover the developed measures appear to reflect the changes in the cardiovascular variability system dynamics.


Seminar #8: MAP-PDMA PhD Program 2021/2022 — December 10, 16h30

* Place: via zoom, https://videoconf-colibri.zoom.us/j/86389857315

* Title: From Newton’s cooling law to turbulent filtration of non-Newtonian fluids through a porous medium

* Speaker: Eurica Henriques, Dep. of Mathematics – University of Trás-os-Montes e Alto Douro (UTAD), Centre of Mathematics CMAT – University of Minho: Pole CMAT-UTAD

* Abstract: Differential equations govern several phenomena and their study gives rise to some answers and several other questions. In this seminar we go on a tour starting at Newton’s cooling law (an ordinary differential equation), stoping briefly at some well known partial differential equations (pde) and ending on a doubly nonlinear pde. We will present recent results concerning regularity aspects of the weak solutions to the doubly nonlinear pde
\begin{displaymath}
u_t-\textrm{div} \big(|u|^{m-1} |Du|^{p-2} Du\big)=0 , \qquad p>1
\end{displaymath}


Seminar #7: MAP-PDMA PhD Program 2021/2022 — December 3, 16h30

* Place: via zoom, https://videoconf-colibri.zoom.us/j/86389857315

* Title: Pak-Stanley labeling of hyperplane arrangements

* Speaker: Rui Duarte, CIDMA, Department of Mathematics, University of Aveiro

* Abstract: In the nineties Pak and Stanley introduced a construction in which every region of the m-Shi arrangement of hyperplanes is labeled with a m-parking function. In this talk we consider the same construction applied to the regions of the m-Catalan arrangement and to the regions of the Ish arrangement. We characterize the Pak-Stanley labels of the regions and of the relatively bounded regions of these arrangements. Finally, we present an algorithm for the inverse.

This is joint work with António Guedes de Oliveira (CMUP, Department of Mathematics, University of Porto)


Seminar #6: MAP-PDMA PhD Program 2021/2022 — November 26, 16h15

* Place: via zoom, https://videoconf-colibri.zoom.us/j/86389857315

* Speaker: Thomas Kahl, Center of Mathematics, University of Minho

* Title: Algebraic topology and concurrency theory

* Abstract: It has been discovered relatively recently that concepts and methods from algebraic topology may be employed profitably in concurrency theory, the field of computer science that studies systems of simultaneously executing processes. A very expressive combinatorial-topological model of concurrency is given by higher-dimensional automata. In this talk, I will present a method to extract homological information from HDAs that is meaningful from a computer science point of view.


Seminar #5: MAP-PDMA PhD Program 2021/2022 — November 26, 16h15, Room 11.3.21, DMat-UA

* Speaker: Vera Afreixo, CIDMA, University of Aveiro

* Title: Stable variable selection — an approach based on penalized regression procedures

* Abstract: The challenge in finding a plausible method to apply in genomic data is due to its high dimensionality. Penalized regression methods were applied in a combined way with methods based on Akaike’s Information Criterion (AIC) to evaluate the importance of potential predictors and to contribute to stable variable selection.


Seminar #4: MAP-PDMA PhD Program 2021/2022 — November 12, 16h30

* Place: via zoom, https://videoconf-colibri.zoom.us/j/86389857315

* Speaker: Ana Jacinta Soares, Centre of Mathematics, University of Minho

* Title: Modeling and applications in kinetic theory of mixtures

* Abstract: In many problems arising in the interface of mathematics with engineering, natural and life sciences, one important aspect is the presence of different scaling regimes of evolution. For example, when modeling biological systems, one should describe not only the global behaviour of the cellular populations but also the cellular dynamics and the biological expression of cells. In fluid dynamics, many problems are described by a macroscopic approach, like Euler or Navier-Stokes, but a microscopic model is needed to describe transition regimes like gas-surface interactions. The kinetic theory is a branch of statistical mechanics that provides a detailed description of the gas at small scales. It allows to obtain the corresponding macroscopic analogue as the hydrodynamic limit of the kinetic equations. Thus, it offers a very convenient approach to many different problems.

In this seminar, I will present some interesting problems and applications of the kinetic theory to both fluid dynamical processes and and biological systems.


Seminar #3: MAP-PDMA PhD Program 2021/2022 — November 5, 16h15, Room 11.3.21, DMat-UA

* Speaker: Domenico Catalano, CIDMA, University of Aveiro

* Title: Hypermaps and their classification

* Abstract: Maps are embeddings of graphs on compact surfaces generalized by hypermaps, replacing graphs by hypergraphs. There are three main approaches to investigate and partially classify hypermaps. Namely by studying hypermaps
• on the same surface or class of surfaces,
• with the same hypergraph or class of hypergraphs,
• with the same group or class of groups of symmetries.
After an introduction to the topic, I will give an idea how classifications of hypermaps can be achieved in each of the above three main ways.


Seminar #2: MAP-PDMA PhD Program 2021/2022 — October 29, 16h00, Room 11.3.21, DMat-UA

* Speaker: Dirk Hofmann, CIDMA, University of Aveiro

* Title: It’s all about the maps

* Abstract: Category theory is a relatively new area of mathematics which arose originally from the study of a relationship between geometry and algebra; by now it pervades almost all of modern mathematics. Intuitively, every discipline of mathematics can be organised in at least one category; furthermore, category theory encourages a shift of perspective: the focus is placed on the relations (maps or morphisms) between entities (spaces, groups, rings, . . . ) rather than emphasising the entities themselves. In this talk we give an introduction into the theory of categories and the vocabulary surrounding it. We pay special attention to what is is arguably the most successful categorical notion: that of an adjunction. If time permits, we will go one step further and follow Bill Lawvere’s important observation that “. . . the kinds of structures which actually arise in the practice of geometry and analysis are far from being ‘arbitrary’ . . . , as concentrated in the thesis that fundamental structures are themselves categories.”


Seminar #1: MAP-PDMA PhD Program 2021/2022 — October 22, 16h00, Room 11.3.21, DMat-UA

* Speaker: Ivan Beschastnyi, CIDMA, University of Aveiro

* Title: Sub-Riemannian geometry and its applications

Abstract: In this talk I will explain the basic notions of sub-Riemannian geometry. It is a geometry that models dynamical systems with constraints. Even though its formal definition arose fairly recently, in the end of the XX century, its roots go to antiquity and the isoperimetric problem. After the main definitions are be given, I will show some applications to robotics and neuroscience.