Noticias en español
Seminars appear in decreasing order in relation to date. To find an activity of your interest just go down on the list. Normally seminars are given in English. If not, they will be marked as Spanish Only.
“Recovering a function from a subdifferential”
Abstract: The issue of recovering a function from its derivative or one of its directional derivatives is a central issue that dates back to the seminal work of Lebesgue (1904). The question of recovering a function from its subdifferential is more recent and has been the subject of intensive research in recent years, since the seminal work of Moreau and Rockafellar (1970) on convex functions, up to the many successive works of Thibault and his co-authors on increasingly broad classes of functions beyond the convex functions....
“Opportunities for collaboration with the School of Mathematics & Statistics at University College Dublin, Ireland”
ABSTRACT: We will present an overview of the research topics and graduate programs available at the UCD School of Mathematics & Statistics, Ireland’s number one according to QS World Rankings in both Mathematics and Statistics & Operations Research. We are at the forefront of collaborative research in computational science and data analytics. Active international collaborations include high-performance computing across disciplines (ranging from black hole binaries to molecular dynamics to fluid mechanics to cryptography and financial...
Fault-Tolerant Decentralized Runtime Monitoring
Abstract: Runtime verification is aiming at extracting information from a running system, and using it to detect and possibly react to behaviors violating a given correctness property. Decentralized runtime verification involves a set of monitors observing the behavior of the underlying system. In this talk, the investigation of decentralized runtime verification in which not only the elements of the observed system, but also the monitors themselves are subject to failures will be presented. In this context, it is unavoidable that...
What is…the inverse function theorem
Abstract: After a gentle introduction to the paradigm of the inverse function theorem, advanced version of this theorem will be presented for nonsmooth functions and set-valued mappings.
P-Stability: Graph generation, randomization and k-degree anonymity
With the motivation of social network privacy and the aim of anonymizing the graph structure of a social network, several methods have been studied. One of the most basic is that of k-degree anonymization. It consists of making the least edge modifications to a given graph, in order that for every degree value of a vertex in the modified graph there are at least k repetitions of it in the degree sequence. This implies that no vertex can be uniquely identified by its degree, hence, the modified graph is k-degree anonymous. Another...
Coloquio Optimización A mediodía de Optimización y análisis variacional”
EXPOSITORES – Pr. Dimitri Bertsekas, Departamento de Ingeniería Eléctrica e Informática en la Facultad de Ingeniería en el Instituto de Tecnología de Massachusetts (MIT), en Cambridge, Massachusetts. – Pr. Assen Dontchev, Mathematical Reviews y la Universidad de Michigan. – Pr. R. Tyrrell Rockafellar, Departamentos de matemáticas y matemáticas aplicadas en la Universidad de Washington, Seattle.
Inference of Gene Regulatory Networks from Gene Expression Data using Artificial Neural Networks
Abstract: Gene Regulatory Networks (GRNs) are directed networks where nodes represent genes, and edges exist solely if the Transcription Factor (TF) encoded by a source gene directly regulates the expression of another target gene. Two main approaches exist for the inference of GRNs, high-throughput experiments and computational methods that solely make use of gene expression data. While the first ones are expensive and time consuming, the second ones are faster and require fewer resources. Computational methods for the inference of GRNs can...
Neurological Diseases, Brain Dynamics and Mathematical Modelling
Abstract: Se adjunta
Twin peaks
Abstract: I will discuss some questions and results on random labelings of graphs conditioned on having a small number of peaks (local maxima). The main open question is to estimate the distance between two peaks on a large discrete torus, assuming that the random labeling is conditioned on having exactly two peaks. Joint work with Sara Billey, Soumik Pal, Lerna Pehlivan and Bruce Sagan.
From the fluid flow through a partially perforated domain to Darcy’s law: the homogenization of the natural Stokes problem
Abstract: One considers the Stokes problem in the case of a partially perforated domain (the perforated part models a porous medium, the boundary of which is just assumed Lipschitz). A single fluid is considered and the external force in the porous medium is properly scaled. The purpose of the talk is to present a proof of the homogenization of this problem using the periodic unfolding method. In the homogenized limit, the problem become an uncoupled pair of problems, one is the standard Stokes problem in the normal part of the domain,...
