BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Namur Institute For Complex Systems - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.naxys.be
X-WR-CALDESC:Events for Namur Institute For Complex Systems
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190502T130000
DTEND;TZID=Europe/Paris:20190502T140000
DTSTAMP:20260429T184307
CREATED:20190306T132149Z
LAST-MODIFIED:20190425T133454Z
UID:562-1556802000-1556805600@www.naxys.be
SUMMARY:Nathanaël Kasoro Mulenda (University of Kinshasa\, DRC)
DESCRIPTION:Title: PercoMCV: A hybrid approach of community detection in social networks \nAbstract: Knowledge extraction in social networks is a needful tool as it touches every aspect of our lives such as politic\, socio-economic\, scientific\, etc. Community detection is one of the objectives of this specific tool used for knowledge extraction in social networks. \nMany algorithms of knowledge extraction from social networks have been developed these last years. However\, many of them are not constant\, effective and accurate when facing these social networks with many edges. \nIn this paper\, we propose a new approach of community detection in social networks with many links between communities. The proposed approach has two steps. In the first step\, the algorithm attempts to determine all communities that the clique percolation algorithm may find. In the second step\, the algorithm computes the Eigenvector Centrality method on the output of the first step in order to measure the influence of network nodes and reduce the rate of the unclassified nodes. \nTo assess this new approach\, we test it on different types of networks. Relevant communities that have been detected testifies effectiveness and performance of the approach over other community detection algorithms. \n  \n 
URL:https://www.naxys.be/event/nathanael-kasoro-mulenda-university-of-kinshasa/
LOCATION:E25
CATEGORIES:NAXYS Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190507T130000
DTEND;TZID=Europe/Paris:20190507T140000
DTSTAMP:20260429T184307
CREATED:20190220T180356Z
LAST-MODIFIED:20190425T133242Z
UID:557-1557234000-1557237600@www.naxys.be
SUMMARY:Debmalya Das (Harish-Chandra Research Institute\, Allahabad\, India)
DESCRIPTION:Title: The Quantum Chesire Cat: some new aspects and possibilities \nAbstract: Quantum Chesire Cat is a counterintuitive phenomenon that provides a new window into the nature of the quantum systems in relation to multiple degrees of freedom associated with a single physical entity. Under suitable pre and postselections\, a photon (the cat) can be decoupled from its circular polarization (its grin). In this talk\, we will explore whether the grin without the cat can be teleported to a distant location. This will be a totally disembodied teleportation protocol. Based on the original Quantum Chesire Cat setup\, we design a protocol where the circular polarization is successfully teleported between two spatially separated parties even though the photon is not physically present with them. The process raises questions in our understanding about properties of quantum system. We further demonstrate this by swapping the grins of two Quantum Chesire Cats. We also briefly discuss about a few interesting new aspects of the original Quantum Chesire Cat protocol.
URL:https://www.naxys.be/event/debmalya-das-harish-chandra-research-institute-allahabad-india/
LOCATION:E25
CATEGORIES:NAXYS Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190516T130000
DTEND;TZID=Europe/Paris:20190516T140000
DTSTAMP:20260429T184307
CREATED:20190313T092254Z
LAST-MODIFIED:20190509T205830Z
UID:564-1558011600-1558015200@www.naxys.be
SUMMARY:Maxime Lucas (Lancaster University\, UK & University of Florence\, Italy)
DESCRIPTION:Title: Network synchronisation with time-varying parameters\n \nAbstract: Many systems in nature\, especially living systems\, can be modelled as a collection of interacting oscillators. Such systems can exhibit a plethora of behaviours\, amongst which synchronisation\, a state of maximal coherence\, is of crucial importance. Indeed\, the synchronisation of the beat of heart cells is as necessary as the synchronisation of neurons can be a bad pre-seizure sign. So far\, ensembles of oscillators have been studied mostly as closed systems so that all parameters such as coupling or frequencies are constant. Very often\, however\, living systems are open and under the non-negligible influence of their environment\, which is in general varying with time. This in turn influence internal parameters of the systems: the frequency of our heartbeat is far from constant\, for example. Here\, we include time-variability in our mode\, and see the effect it has on the dynamics and its stability.\n\nHere\, we will see how time-variability can benefit or reduce stability in two scenarios: a temporal network (time-varying topology)\, and a network driven by an external oscillator with a time-varying frequency. We will discuss how\, in the first case\, synchronization is negatively affected\, but that the region of synchronization is enlarged in the second case. Moreover\, we will discuss the importance of looking into the dynamics of such systems at both short and long timescales. Time-varying features in models of living systems can bring us closer to realistic models\, and allow us to reveal richer dynamics resulting from it.
URL:https://www.naxys.be/event/maxime-lucas-marseille/
LOCATION:E25
CATEGORIES:NAXYS Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190523T130000
DTEND;TZID=Europe/Paris:20190523T140000
DTSTAMP:20260429T184307
CREATED:20190212T115441Z
LAST-MODIFIED:20190426T055429Z
UID:542-1558616400-1558620000@www.naxys.be
SUMMARY:Pauline Thémans (UNamur)
DESCRIPTION:Title: Pharmacokinetic modeling and strategies for drug dosing recommendation: application to meropenem \nAbstract: Pharmacokinetics (PK) studies the link between the dose and the drug exposure in patients. Thanks to mathematical modeling\, clinical pharmacology is an interesting and promising field of application of control and system theory. We focus on time-dependent antibiotic given by constant intravenous (IV) infusion at regular dosing interval. Meropenem is used as a particular case for which numerical results are reported. \nWe report on the study of two kinds of models: a population pharmacokinetic (popPK) model (empirical approach\, mixed effects modeling) and a physiologically-based pharmacokinetic (PBPK) model (mechanistic approach\, human physiology and drug’s properties considerations). We will describe the results of internal and external validations that were performed. Both models are described by linear time-invariant state-space models. They are shown to be nonnegative and stable\, as expected. \nFrom these models\, the aim is to provide guidelines (decision-making aid) for drug dosing in patients based on relevant patient’s characteristics (covariates) and on other practical conditions (target exposure for efficacy\, dosing interval\, time of infusion\, etc.). The studied approaches are based on open-loop methods. (1) A standard input-output analysis yields the analytical expression of the output trajectories and the asymptotic response. A formula is then derived to compute the dose needed to maintain the (steady) concentration trajectory above a given lower bound. (2) We also describe an optimal control approach on the discrete-time model (minimum principle). \n 
URL:https://www.naxys.be/event/pauline-themans-unamur/
LOCATION:E25
CATEGORIES:NAXYS Seminar
END:VEVENT
END:VCALENDAR