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.
City logistics and smart delivery.
Abstract: he current and expected growing number of people living and working in cities and the limited space available inside city centres implies a greater exchange of inbound and outbound freight flows between city centres and their surrounding regions. Urban freight transports provide economic benefits to society but are also responsible for negative externalities such as congestion, air and water pollution, climate change, accidents and noise. Access restrictions are one of the most applied measures to control urban traffics in the...
COVID-19: Short-term forecast of ICU beds in times of crisis.
Abstract: By early May 2020, the number of new COVID-19 infections started to increase rapidly in Chile, threatening the ability of health services to accommodate all incoming cases. Suddenly, ICU capacity planning became a first-order concern, and the health authorities were in urgent need of tools to estimate the demand for urgent care associated with the pandemic. In this article, we describe the approach we followed to provide such demand forecasts, and we show how the use of analytics can provide relevant support for decision...
On the construction of maximal p-cyclically monotone operators.
Abstract: In this talk we deal with the construction of explicit examples of maximal p-cyclically maximal monotone operators. To the date, there is only one instance of an explicit example of a maximal 2-cyclically monotone operator that is not maximal monotone. We present several other examples, and a proposal of how such examples can be constructed.
Optimization of a Concentrated Solar Power plant.
Abstract This report corresponds to the continuation of another where the characteristics of the parameters and methods of each one of the objects called Parameters, SolarField, Rankine and Reactor were detailed. Here we will present the components of the objective function of the optimization problem described in section 2, which corresponds to the income and costs generated by the concentrated solar power plant for a period of Nyears, as well as the constraints and bounds related to the variables of the problem. Then we...
Eigenvalue splitting of polynomial order for a system of Schrödinger operators with energy-level crossing.
In this talk I will present recent results on the spectral analysis of a 1D semiclassical system of coupled Schrödinger operators each of which has a simple well potential. Such systems arise as important models in the Born-Oppenheimer approximation of molecular dynamics. Focusing on the cases where the two underlying classical periodic trajectories cross to each other which imply an energy-level crossing, we give Bohr-Sommerfeld type quantization rules for the eigenvalues of the system in both tangential and transversal crossing cases. Our...
Aumentando óptimamente la nodo-conectividad de un ciclo en uno.
Abstract: “Definimos el problema de “aumentación de conectividad de grafos” de la forma siguiente: La entrada es un grafo G y un conjunto de aristas E, tal que G es k-conexo y G+E es (k+1)-conexo. Y la salida debe ser un subconjunto F de E de tamaño mínimo tal que G+F sea (k+1)-conexo. Este tipo de problemas se enmarcan en el diseño de redes, muy importante en áreas tales como telecomunicaciones y electricidad. Muchos de estos problemas son NP-dificiles, por lo que es necesario diseñar algoritmos de aproximación para atacar...
Casi todos los árboles dirigidos son n-inevitables.
Resumen: Se mostrará una condición suficiente para ver que un árbol dirigido es n-inevitable, esto se probará a través de un resultado de descomposición de torneos de Kühn, Mycroft y Osthus, y el uso lema de embedding semi-determinista, que nos permite embeber árboles en n-o(1) vértices, finalmente se verá que las condiciones suficientes se cumplen asintótica-casi-seguramente.
Equivalencia orbital fuerte y complejidad factorial en subshifts.
ABSTRACT: Dos sistemas dinámicos topológicos se dicen orbitalmente equivalentes cuando existe un homemorfismo entre los espacios de fase que envía órbitas en órbitas. Dado un subshift minimal, su complejidad factorial es la función $p_X: \N \to \N$ que cuenta el número de cilindros no vacíos de largo $n$. En esta charla discutiremos sobre cómo la complejidad factorial posiblemente restringe las clases de equivalencia orbital (fuerte) para subshifts minimales. Trabajo conjunto con S. Donoso.
