Budjetti vuodelle 1938, 7 Pl Yk

Puhe

Budjetti vuodelle 1939, 15 Pl Yk

Puhe

Budjetti vuodelle 1937, 10 Pl XIV luku

Puhe

Budjetti vuodelle 1937, 6 Pl Yk

Puhe

The evolution of helping and harming on graphs: the return of the inclusive fitness effect.

Evolutionary graph theory has been proposed as providing new fundamental rules for the evolution of co-operation and altruism. But how do these results relate to those of inclusive fitness theory? Here, we carry out a retrospective analysis of the models for the evolution of helping on graphs of Ohtsuki et al. [Nature (2006) 441, 502] and Ohtsuki & Nowak [Proc. R. Soc. Lond. Ser. B Biol. Sci (2006) 273, 2249]. We show that it is possible to translate evolutionary graph theory models into classical kin selection models without disturbing at all the mathematics describing the net effect of selection on helping. Model analysis further demonstrates that costly helping evolves on graphs through limited dispersal and overlapping generations. These two factors are well known to promote relatedness between interacting individuals in spatially structured populations. By allowing more than one individual to live at each node of the graph and by allowing interactions to vary with the distance between nodes, our inclusive fitness model allows us to consider a wider range of biological scenarios leading to the evolution of both helping and harming behaviours on graphs.

Budjetti v. 1941, 14 A Pl Yk

Puhe

Budjetti, 18 Pl

Puhe

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Extreme prematurity and intra uterine growth restriction effects in brain network topology at school age

Higher risk for long-term behavioral and emotional sequelae, with attentional problems (with or without hyperactivity) is now becoming one of the hallmarks of extreme premature (EP) birth and birth after pregancy conditions leading to poor intra uterine growth restriction (IUGR) [1,2]. However, little is know so far about the neurostructural basis of these complexe brain functional abnormalities that seem to have their origins in early critical periods of brain development. The development of cortical axonal pathways happens in a series of sequential events. The preterm phase (24-36 post conecptional weeks PCW) is known for being crucial for growth of the thalamocortical fiber bundles as well as for the development of long projectional, commisural and projectional fibers [3]. Is it logical to expect, thus, that being exposed to altered intrauterine environment (altered nutrition) or to extrauterine environment earlier that expected, lead to alterations in the structural organization and, consequently, alter the underlying white matter (WM) structure. Understanding rate and variability of normal brain development, and detect differences from typical development may offer insight into the neurodevelopmental anomalies that can be imaged at later stages. Due to its unique ability to non-invasively visualize and quantify in vivo white matter tracts in the brain, in this study we used diffusion MRI (dMRI) tractography to derive brain graphs [4,5,6]. This relatively simple way of modeling the brain enable us to use graph theory to study topological properties of brain graphs in order to study the effects of EP and IUGR on childrens brain connectivity at age 6 years old.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.