[Todos CMAT] (Primer anuncio) Invitación a la Defensa de Tesis de Doctorado del PEDECIBA Informática del MSc. Lic. Juan Piccini Ferrer: jueves 28 de Abril, 09:00 horas.
Franco Robledo
frobledo en fing.edu.uy
Lun Mar 28 16:53:31 UYT 2016
Estimados Sres. Investigadores, Docentes y Estudiantes:
Me complace anunciarles que el jueves 28 de Abril tendrá lugar la
Defensa Pública de la Tesis de Doctorado en Informática del PEDECIBA del
MSc. Lic. Juan Piccini Ferrer.
A continuación encontrarán los detalles del evento.
Están todos cordialmente invitados.
Saludos,
Franco Robledo
------------------------------------------------------------------------
Fecha: Jueves 28 de abril de 2016
Hora: 09:00AM.
Lugar: Salón 701 (Sala de Posgrdos del InCo), Facultad de Ingeniería
(Cuerpo Central, Piso 7)
Título de la Tesis: /"//Static Reliability and Resilience in Dynamic
Systems"./
Director Académico: Dr. Ing. Franco Robledo.
Directores de Tesis: Dr. Ing. Franco Robledo; Dr. Ing. Pablo Romero.
Tribunal:
--------
. Dr. Bruno Tuffín (Directeur de Recherche INRIA, Francia) - Revisor -
. Dr. Gerardo Rubino (Directeur de Recherche INRIA, Francia) - Revisor -
. Dr. Juan Cristina (Centro de Investigaciones Nucleares, Facultad de
Ciencias, UDELAR).
. Dr. Guillermo Durán (Director del Instituto de Cálculo, Facultad de
Ciencias Exactas y Naturales, Universidad de Buenos Aires).
. MSc. Ing. Omar Viera (Profesor Titular, Dpto. de Investigación
Operativa, Instituto de Computación, Facultad de Ingeniería, UDELAR).
Abstract:
---------
Two systems are modeled in this thesis. First, we consider a
multi-component stochastic monotone binary system, or SMBS for short.
The reliability of an SMBS is the probability of correct operation. A
statistical approximation of the system reliability is provided for
these systems, inspired in Monte Carlo Methods. Then, we are focused on
the diameter constrained reliability model (DCR), which was originally
developed for delay sensitive applications over the Internet
infrastructure. The computational complexity of the DCR is analyzed.
Networks with an efficient (i.e., polynomial time) DCR computation are
offered, termed Weak graphs.
Second, we model the effect of a dynamic epidemic propagation. Our first
approach is to develop a SIR-based simulation, where unrealistic
assumptions for SIR model (infinite, homogeneous, fully-mixed
population) are discarded.
Finally, we formalize a stochastic process that counts infected
individuals, and further investigate node-immunization strategies,
subject to a budget constraint. A combinatorial optimization problem is
here introduced, called Graph Fragmentation Problem. There, the impact
of a highly virulent epidemic propagation is analyzed, and we
mathematically prove that Greedy heuristic is suboptimal.
Keywords: Stochastic Binary System, Recursive Variance Reduction Method,
Diameter Constrained Reliability, Graph Theory, Complexity Theory,
GRASP, SIR Model, Monte Carlo Methods, Epidemic Model.
--
Dr. Ing. Franco Robledo Amoza
Director del Instituto de Computación,
Director del Laboratorio de Probabilidad y Estadística,
Facultad de Ingeniería, UDELAR
------------ próxima parte ------------
Se ha borrado un adjunto en formato HTML...
URL: <http://www.cmat.edu.uy/pipermail/todos/attachments/20160328/7743fd47/attachment.html>
Más información sobre la lista de distribución Todos