[Todos CMAT] Excelente noticia

[Ricardo Fraiman]

Felicitaciones !!!
Una gran alegría
Ricardo


On Thu, Jul 9, 2015 at 11:57 AM, adriana da luz <adaluz en cmat.edu.uy> wrote:

> Felicidades!!! que buena noticia XD
>
> On Thu, Jul 9, 2015 at 4:51 PM, Bojana Femic <femicenelsur en gmail.com>
> wrote:
>
>> Qué bueno! Felicitaciones Pilar, Flor y Marcos!
>>
>> 2015-07-09 11:09 GMT-03:00 raul ures <ures en fing.edu.uy>:
>>
>>> Felicitaciones!
>>>
>>> 2015-07-09 10:20 GMT-03:00 Eleonora Catsigeras <eleonora17 en gmail.com>:
>>>
>>>>  Tengo el agrado de compartir con ustedes la siguiente excelente
>>>> noticia:
>>>>
>>>> El comité científico del evento EquaDiff 2015
>>>> http://equadiff2015.sciencesconf.org/resource/page/id/1
>>>> que se está desarrollando en Lyon, Francia
>>>> otorgó el primer premio como mejor trabajo presentado en forma póster
>>>> al de nuestros compañeros Pilar Lorenzo, Marcos Barrios,  y Florencia
>>>> Cubría  (ver título y resumen al pie)
>>>>
>>>> ¡Felicitaciones a Pilar, Marcos y Florencia!
>>>>
>>>> Title: Dynamics of cooperative neuronal networks
>>>> depending on their associated graphs.
>>>> Authors: Pilar Lorenzo (1), Marcos Barrios , and Florencia Cubr ía
>>>> Instituto de Matem atica y Estad ística Rafael Laguardia, Universidad
>>>> de la Rep ública, Uruguay
>>>> (IMERL, UdelaR)
>>>>
>>>> Abstract
>>>> We investigate the dynamics of abstract neuronal networks modelled as
>>>> impulsive di fferencial equations on arbitrarily large dimensions, mutually
>>>> coupled by impulses. In particular, we study the dynamics that is induced
>>>> by the graph of impulsive interactions, for certain classes of graphs.
>>>> The methodology of research is mathematical with rigorous proofs based
>>>> on the mathematical theory of dynamical systems and the theory of graphs.
>>>>
>>>> The main tool we use is the consideration of the pulses ocurring in the
>>>> whole network during certain time interval. For strongly connected graphs
>>>> we prove that every neuron fi res infinitely many times.
>>>>
>>>> For complete graphs we find an optimal lower bound on the network size
>>>> that ensures the existence of the so called "grand coalition". Also, if the
>>>> graph is not complete but each neuron has enough connections, the grand
>>>> coalition is still present. Finally, we construct extensions from the
>>>> strongly connected and star-shaped graphs that also imply the existence
>>>> the grand coalition.
>>>>
>>>> (1) Speaker
>>>>
>>>>  plorenzo@ fing.edu.uy
>>>>  marcosb en fi ng.edu.uy
>>>>  fcubria en cmat.edu.uy
>>>>
>>>>
>>>>
>>>
>>
>> _______________________________________________
>> Lista Todos CMAT
>> Todos en cmat.edu.uy
>> http://www.cmat.edu.uy/cgi-bin/mailman/listinfo/todos
>>
>>
>
> _______________________________________________
> Lista Todos CMAT
> Todos en cmat.edu.uy
> http://www.cmat.edu.uy/cgi-bin/mailman/listinfo/todos
>
>
------------ próxima parte ------------
Se ha borrado un adjunto en formato HTML...
URL: <http://www.cmat.edu.uy/pipermail/todos/attachments/20150709/c8046554/attachment.html>