The mechanical behaviour of the three advanced high strength steel grades, Docol 600DP, Docol 1200M and HyTens 1000, has been experimentally investigated under various types of deformation, and material models have been developed, which account for the experimentally observed behaviour. Two extensive experimental programmes have been conducted in this work. In the first, the dual phase Docol 600DP steel and martensitic Docol 1200M steel were subjected to deformations both under linear and non-linear strain paths. Regular test specimens were made both from virgin materials, i.e. as received, and from materials pre-strained in various directions. The plastic strain hardening, as well as plastic anisotropy and its evolution during deformation of the two materials, were evaluated and modelled with a phenomenological model. In the second experimental program, the austenitic stainless HyTens 1000 steel was subjected to deformations under various proportional strain paths and strain rates. It was shown experimentally that the material is sensitive both to dynamic and static strain ageing. A phenomenological model accounting for these effects was developed, calibrated, implemented in a Finite Element software and, finally,validated. Both direct methods and inverse analyses were used in order to calibrate the parameters in the material models. The agreement between the  numerical and experimental results are in general very good. This thesis is divided into two main parts. The background, theoretical framework and mechanical experiments are presented in the rst part. In the second part, two papers are appended.

Doctor of Philosophy / Department of Educational Leadership / Charles R. Oaklief / This ex post facto research was conducted using parametric and non-parametric analysis to determine if the mass retirement of community college presidents between 2001 and 2007 had precipitated a diminution in educational qualifications, a reduction in pre-presidential community college experience, or a change in presidential career paths of first time community college presidents by era (before and after 2001). Seven hundred eighty-five currently serving presidents of comprehensive community colleges were surveyed. The overall return rate of the survey was 53.25%: the useable return rate was 49.30%. Parametric (independent samples t-test) and non-parametric (Mann-Whitney and chi square) tests were used to determine if there were significant differences in educational qualifications, pre-presidential community college experience, and presidential career paths of first time community college presidents by era (before and after 2001). The study found: - A diminution of the educational qualifications after 2001 with fewer presidents holding doctorates at the time of their first presidential appointments compared to presidents appointed before 2001; - A significant increase in pre-presidential community college experience of presidents appointed after 2001 at the time of their first presidential appointments compared to presidents appointed before 2001; - A significant difference in presidential career paths by era. Specifically, presidents appointed after 2001 were significantly less likely to have entered the community college system from K12 or from non-educational management positions. Presidents appointed after 2001 were also significantly less likely to have served as a community college Chief Academic Officer and significantly more likely to have served as a community college Primary Academic Officer, Chief Students Affairs Officer, or Vice President.

Thesis (MSc) -- Stellenbosch University, 2004. / ENGLISH ABSTRACT: The Internet is fast evolving into a commercial platform that carries a mixture of narrow- and broadband applications such as voice, video, and data. Users expect a certain level of guaranteed service from their service providers and consequently the need exists for efficient Internet traffic engineering to enable better Quality of Service (QoS) capabilities. Multi-protocol Label Switching (MPLS) is a label switching protocol that has emerged as an enabling technology to achieve efficient traffic engineering for QoS management in IP networks. The ability of the MPLS protocol to create explicit virtual connections called Label Switched Paths (LSPs) to carry network traffic significantly enhances the traffic engineering capabilities of communication networks. The MPLS protocol supports two options for explicit LSP selection: offline LSP computation using an optimization method and dynamic route selection where a single node makes use of current available network state information in order to compute an explicit LSP online. This thesis investigates various methods for the selection of explicit bandwidth guaranteed LSPs through dynamic route selection. We address the problem of computing a sequence of optimal LSPs where each LSP can carry a specific traffic demand and we assume that no prior information regarding the future traffic demands are available and that the arrival sequence of LSP requests to the network is unknown. Furthermore, we investigate the rerouting abilities of the online LSP selection methods to perform MPLS failure restoration upon link failure. We propose a new online routing framework known as Least Interference Optimization (LIO) that utilizes the current bandwidth availability and traffic flow distribution to achieve efficient traffic engineering. We present the Least Interference Optimization Algorithm (LIOA) that reduces the interference among competing network flows by balancing the number and quantity of flows carried by a link for the setup of bandwidth guaranteed LSPs in MPLS networks. The LIOA routing strategy is evaluated and compared against well-known routing strategies such as the Minimum Hop Algorithm (MHA), Minimum Interference Routing Algorithm (MIRA), Open Shortest Path First (OSPF) and Constraint Shortest Path First (CSPF) by means of simulation. Simulation results revealed that, for the network topologies under consideration, the routing strategies that employed dynamic network state information in their routing decisions (LIOA, CSPF and MIRA) generally outperformed the routing strategies that only rely on static network information (OSPF and MHA). In most simulation experiments the best performance was achieved by the LIOA routing strategy while the MHA performed the worse. Furthermore we observed that the computational complexity of the MIRA routing strategy does not translate into equivalent performance gains. We employed the online routing strategies for MPLS failure recovery upon link failure. In particular we investigated two aspects to determine the efficiency of the routing strategies for MPLS rerouting: the suitability of the LSP configuration that results due to the establishment of LSPs prior to link failure and the ability of the online routing strategy to reroute failed LSPs upon link failure. Simulation results revealed similar rerouting performance for all online routing strategies under investigation, but a LSP configuration most suitable for online rerouting was observed for the LIOA routing strategy. / AFRIKAANSE OPSOMMING:Die Internet is voordurend besig om te evoleer in 'n medium wat 'n wye reeks moderne kommunikasietegnologiee ondersteun, insluitende telefoon, video en data. Internet gebruikers verwag gewaarborgde diens van hul diensverskaffers en daar bestaan dus 'n vraag na doeltreffende televerkeerbeheer vir gewaarborgde Internet diensgehalte. Multiprotokol Etiketskakeling (MPLS) is 'n etiketskakeling protokol wat doeltreffende televerkeerbeheer en diensgehalte moontlik maak deur die eksplisiete seleksie van virtuele konneksies vir die transmissie van netwerkverkeer in Internetprotokol (IP) netwerke. Hierdie virtuele konneksies staan bekend as etiketgeskakelde paaie. Die MPLS protokol ondersteun tans twee moontlikhede vir eksplisiete seleksie van etiketgeskakelde paaie: aflyn padberekening met behulp van optimeringsmetodes en dinamiese aanlyn padseleksie waar 'n gekose node 'n eksplisiete pad bereken deur die huidige stand van die netwerk in ag te neem. In hierdie tesis word verskeie padseleksiemetodes vir die seleksie van eksplisiete bandwydte-gewaarborgde etiketgeskakelde paaie deur mid del van dinamiese padseleksie ondersoek. Die probleem om 'n reeks optimale etiketgeskakelde paaie te bereken wat elk 'n gespesifeerde verkeersaanvraag kan akkommodeer word aangespreek. Daar word aanvaar dat geen informasie in verband met die toekomstige verkeersaanvraag bekend is nie en dat die aankomsvolgorde van etiketgeskakelde pad verso eke onbekend is. Ons ondersoek verder die herroeteringsmoontlikhede van die aanlyn padseleksiemetodes vir MPLS foutrestorasie in die geval van skakelonderbreking. Vir hierdie doel word 'n nuwe aanlyn roeteringsraamwerk naamlik Laagste Inwerking Optimering (LIO) voorgestel. LIO benut die huidige beskikbare bandwydte en verkeersvloeidistribusie van die netwerk om doeltreffende televerkeerbeheer moontlik te maak. Ons beskryf 'n Laagste Inwerking Optimering Algoritme (LIOA) wat die inwerking tussen kompeterende verkeersvloei verminder deur 'n balans te handhaaf tussen die aantal en kwantiteit van die verkeersvloeistrome wat gedra word deur elke netwerkskakel. Die LIOA roeteringstrategie word geevalueer met behulp van simulasie en die resultate word vergelyk met ander bekende roeteringstrategiee insluitende die Minimum Node Algorithme (MHA), die Minimum Inwerking Algoritme (MIRA), die Wydste Kortste Pad Eerste Algoritme (OSPF) en die Beperkte Kortste Pad Eerste Algoritme (CSPF). Die resultate van die simulasie-eksperimente to on dat, vir die netwerk topologiee onder eksperimentasie, die roeteringstratgiee wat roeteringsbesluite op dinamiese netwerk informasie baseer (LIOA, MIRA, CSPF) oor die algemeen beter vaar as die wat slegs staatmaak op statiese netwerkinformasie (MHA, OSPF). In die meeste simulasie-eksperimente vaar die LIOA roeteringstrategie die beste en die MHA roeteringstrategie die slegste. Daar word verder waargeneem dat die komputasiekomplesiteit van die MIRA roeteringstrategie nie noodwendig weerspieel word in die sukses van roeteringsuitkoms nie. In die geval waar die aanlyn roeteringstrategiee aangewend word vir MPLS foutrestorasie, toon die resultate van simulasie-eksperimente dat al die roeteringstrategiee min of meer dieselfde uitkoms lewer ten opsigte van herroetering van onderbreekte verkeersvloei. Die konfigurasie van etiketgeskakelde paaie deur die LIOA roeteringstrategie voor skakelonderbreking is egter die geskikste vir televerkeer herroetering na skakelonderbreking

This thesis consists of an introductory part and the following four self-contained papers: In Paper [I] we analyze the implications of social identity and self-categorization for optimal redistributive income taxation. A two-type model is supplemented by an assumption that individuals select themselves into social categories, in which norms are formed and education effort choices partly depend on these norms. The results show, among other things, that externality correction by a welfarist government leads to an element of tax progression that serves to reduce the discrepancy between the effort norm and the actual effort chosen by low-productivity individuals in the high-effort group. Furthermore, if the preference for social identity is sufficiently strong, increased wage-inequality leads to higher social welfare through a relaxation of the selection constraint. It may thus be desirable to use publicly provided education to induce more wage-inequality, even if higher wage-inequality increases the intrinsic utility of a potential mimicker. In Paper [II] I employ high quality register data to present new facts about income mobility in Sweden. The focus of the paper is regional differences in mobility, using a novel approach based on a multilevel model. This method is well-suited when regions differ greatly in population size as is the case in Sweden. The maximum likelihood estimates are substantially more precise than those obtained by running separate OLS regressions. I find small regional differences in income mobility when measured in relative terms. Regional differences are large when adopting an absolute measure and focusing on children with below-median parent income. On the national level I find that the association between parent and child income ranks has decreased over time, implying increased mobility. In Paper [III] I study the long term effects of inter-municipal moving during childhood on income using Swedish register data. Due to the richness of the data I am able to control for important sources of selection into moving, such as parent separation, parents' unemployment, education, long run income, and immigration background. I find that children's long run incomes are significantly negatively affected by moving during childhood, and the effect is larger for those who move more often. For children who move once, I also estimate the effect of the timing and the quality of the move. I measure the quality of each neighborhood based on the adult outcomes for individuals who never move. The quality of a move is defined as the difference in quality between the origin and the destination. Given that a family moves, I find that the negative effect of childhood moving on adult income is increasing in age at move. Children benefit economically from the quality of the region they move to only if they move before age 12 (sons) and age 16 (daughters). In Paper [IV] I study the bias of IGE estimates for different missing-data scenarios based on simulated income processes. Using an income process from the income dynamics and risks literature to generate two linked generations’ complete income histories, I use Monte Carlo methods to study the relationship between available data patterns and the bias of the IGE. I find that the traditional approach using the average of the typically available log income observations leads to IGE estimates that are around 40 percent too small. Moreover, I show that the attenuation bias is not reduced by averaging over many father income observations. Using just one income observation for each generation at the optimal age (as discussed in the paper) or using weighted instead of unweighted averages can reduce the bias. In addition, the rank-rank slope is found to be clearly less sensitive to missing data.

Στη διπλωματική εργασία προς παρουσίαση, πραγματευόμαστε ένα νέο είδος γραφημάτων, τα χρονικά γραφήματα, και διάφορες παραλλαγές τους. Ένα χρονικό γράφημα είναι μια διατεταγμενη τριάδα G={V,E,L}, όπου V ένα μη κενό πεπερασμένο σύνολο που καλείται σύνολο κορυφών, E ένα σύνολο m στοιχείων, καθένα από τα οποία είναι δισύνολο στοιχείων του V (καλείται σύνολο ακμών), και L= {L_e, για κάθε e στοιχείο του E} = {L_e_1, L_e_2, ..., L_e_m}, όπου L_e_i, i = 1,..., m, σύνολο θετικών ακεραίων τιμών που αντιστοιχίζονται στην ακμή e_i του συνόλου E (καλείται ανάθεση χρονικών ετικετών ή απλώς ανάθεση). Οι τιμές που αντιστοιχίζονται σε κάθε ακμή του γραφήματος καλούνται χρονικές ετικέτες της ακμής και δηλώνουν τις χρονικές στιγμές, κατά τις οποίες έχουμε τη δυνατότητα να τη διασχίσουμε (από το ένα της άκρο προς το άλλο). Για να αντιληφθεί κανείς το ενδιαφέρον των χρονικών γραφημάτων, μπορεί να σκεφτεί τη δυνατότητα εφαρμογής τους στην καθημερινότητα. Για παράδειγμα, οι χρονικές ετικέτες που ανατίθενται σε μία ακμή ενός κατευθυνόμενου χρονικού γραφήματος μπορούν να παραλληλιστούν με τις ώρες, στις οποίες γίνονται αναχωρήσεις αεροπλάνων από μία πόλη προς μια άλλη. Έτσι, η μελέτη των χρονικών γραφημάτων θα μπορούσε να συμβάλει στην οργάνωση των πτήσεων ενός αεροδρομίου. Ένα χρονικό μονοπάτι (ή «ταξίδι») σε ένα χρονικό γράφημα είναι ένα μονοπάτι, στις ακμές του οποίου μπορούμε να βρούμε αυστηρά αύξουσα σειρά χρονικών ετικετών. Στην εργασία, μεταξύ άλλων, γίνεται μελέτη της συνδετικότητας στα χρονικά γραφήματα, καθώς και κατασκευή και μελέτη αλγορίθμων εύρεσης χρονικών μονοπατιών («ταξιδίων») που φθάνουν το δυνατόν συντομότερα στον προορισμό τους (τελική κορυφή μονοπατιού). Επιπλέον, μελετώνται στατιστικά τα Χρονικά Γραφήματα, με επικέντρωση στο αναμενόμενο πλήθος χρονικών μονοπατιών σε ένα γράφημα, καθώς και στη Χρονική Διάμετρο ενός γραφήματος, όπως αυτή ορίζεται στην εργασία. / In the thesis, we are dealing with a new type of graphs,called Temporal Graphs, and several variants. A temporal graph is an ordered triplet G={V,E,L}, where V stands for a nonempty finite set (called set of vertices), E stands for a set of m elements, each of which are 2-element subsets of V (called set of edges), and L= {L_e, for all e in E} = {L_e_1, L_e_2, ..., L_e_m}, where L_e_i, i = 1, ..., m, is a set of positive integers mapped to edge e_i in E (called assignment of time labels or simply assignment). The values assigned to each edge of the graph are called time labels of the edge and indicate the times at which we can cross it (from one end to the other). In order to understand the interest of temporal graphs, one may think their applicability to everyday life. For example, the time labels assigned to an edge of a directed temporal graph can be paralleled to the flight departure times from one city to another. Therefore, the study of temporal graphs could contribute to the organization of flights at an airport. A temporal path (or «journey») in a temporal graph is a path, on the edges of which we can find strictly ascending time labels. In the thesis, among others, we study the connectivity of temporal graphs and we construct and study several algorithms that find temporal paths which arrive the soonest possible at their destination (final vertice of the path). Furthermore, we examine temporal graphs statistically, focusing on the expected number of temporal paths in a graph as well as in the Temporal Diameter of a graph, also defined in the thesis.

Ce mémoire traite des parcours de musiciens migrants d’origine arabe à Montréal. Il s’intéresse à la manière dont ces derniers construisent leurs carrières musicales dans ce contexte et acquièrent la reconnaissance des différents acteurs qu’ils côtoient – pairs, intervenants culturels, public. La méthodologie adoptée est de nature qualitative et correspond à une perspective ethnosociologique, le contexte musical de l’étude inscrivant la démarche dans le domaine de la sociomusicologie. Cinq musiciens ayant migré d’un pays arabe avec une pratique musicale préalable ont été rencontrés, ainsi que cinq acteurs du milieu musical qui interagissent avec eux. Ce corpus d’entretiens a été complété par de l’observation et l’étude de traces (ex. : disques, cv). La démarche d’enquête a permis d’élaborer un ensemble de propositions visant à comprendre les phénomènes sociaux observés. Il apparaît que ces musiciens construisent leurs carrières montréalaises grâce à une actualisation et réappropriation originale des sources et influences musicales accumulées au fil de leur vie, processus néanmoins tributaire des rouages du milieu musical. Celui-ci est constitué de multiples acteurs ayant chacun leurs objectifs, intérêts, contraintes vis-à-vis desquels les musiciens doivent s’ajuster, négocier, faire des compromis. Puis, l’ethnicité arabe qui est construite et mise en scène par les performances musicales peut vraisemblablement agir comme outil pour se démarquer dans le contexte montréalais. Cependant, les dynamiques qui sous-tendent les rapports sociaux que ces artistes entretiennent dans la métropole font en sorte qu’ils ont ultimement peu d’emprise sur la manière dont se manifeste la reconnaissance à leur égard et vis-à-vis de leurs pratiques musicales. / This thesis examines the career paths of migrant musicians of Arab descent living in Montreal. It looks at how they build their musical careers in this context and gain recognition from the various actors they encounter – peers, cultural stakeholders, the public. The methodology adopted is qualitative in nature and corresponds to an ethnosociological perspective, with the musical context of the study placing the approach in the field of sociomusicology. Five musicians with existing musical practices who had migrated from Arab countries were interviewed, along with five members of the musical milieu who interact with them. This series of interviews was supplemented by observation and archival research (ex.: albums, cv). This investigative approach allowed for the elaboration of a set of proposals aiming to understand the observed social phenomena. It would seem that these musicians build their Montreal careers thanks to renewal and original reappropriation of musical sources and influences accumulated throughout their lives, a process that is nevertheless dependant on the workings of the music scene. This milieu is made up of multiple actors with their own objectives, interests, and constraints around which the musicians must adapt, negotiate, and make compromises. Additionally, the Arab ethnicity that is constructed and staged through musical performances can presumably act as a device for standing out in the Montreal scene. However, the dynamics underpinning these artists’ social relationships within the city ultimately give them little control over the manner in which recognition is manifested for the individuals as artists or for their musical practices.

L'émergence défie la hiérarchie économique mondiale. C'est particulièrement la capacité des pays émergents à s'imposer sur des segments à forte valeur ajoutée de la chaîne globale de valeur qui renouvelle les enjeux de l'économie du développement. Nous optons de ce fait pour une lecture technologique de l'émergence. L'émergence par la technologie s'est appuyée sur des systèmes institutionnels divers. Nous cherchons dans cette thèse à caractériser la diversité des modèles socio-économiques de remontée technologique des pays émergents. En adaptant le cadre des systèmes sociaux de production et d'innovation (SSIP) de Amable, Barré et Boyer (1997) aux spécificités de ces pays, nous analysons les arrangements institutionnels observables dans 27 pays émergents en 2005 (science et technologie, éducation, insertion internationale, marchés des biens, du travail et financier) et mettons au jour la diversité des modèles d'émergence. Cinq architectures institutionnelles sont révélées : les SSIP cocktail, dirigiste, dé-centralisé, mené par la finance et libéralisé. Les complémentarités institutionnelles variables les soutenant expliquent qu'aucune homogénéisation ne se soit produite malgré les forces de la mondialisation. Il n'existe ainsi pas de structure optimale à mettre en place pour s'engager dans l'émergence. Au contraire nous montrons que, puisque ces cinq modèles créent des avantages comparatifs institutionnels divers, les stratégies de remontée technologique privilégiées doivent être adaptées. De cette façon, les facteurs de croissance majeurs à soutenir sont dépendants non pas de la distance à la frontière mais de l'architecture institutionnelle nationale. / Emerging countries challenge the world economic hierarchy. It is above all their capabilities to upgrade within the global value chain which offers new insights and poses new questions to development economists. For this reason, we choose to study emergence into the technological prism.Different institutional systems have sustained technological emergence. In this thesis, we want to characterize the diversity of socio-economic models of technological upgrading in emerging countries. By adapting the Social Systems of Innovation and Production (SSIP) framework of Amable, Barré & Boyer (1997) for the study of 27 emerging countries in 2005, we analyse their institutional arrangements through six key domains (science and technology, education, international insertion, products, labour and financial markets) in order to observe the diversity of emerging models. We reveal the existence of five institutional architectures: cocktail, directed, de-centralised, finance-led and liberalised models. There is no world homogenisation even in an intense globalisation period because various institutional complementarities sustain these models. No optimal structure has to be adopted to enter into emergence. On the contrary, we show that, as institutional comparative advantages differ among this five emerging models, technological upgrading strategies have to be suitable. In this way, growth enhancing factors depend on national institutional architecture rather than on proximity to world technological frontier.

Esta dissertação apresenta a edição fac-similar e diplomática em perspectiva genética de 53 notas de planejamento do romance Avalovara de Osman Lins. Esta seleção permitiu verificar quais foram os procedimentos empregados na composição do texto, da estrutura rigorosa do livro e o registro da utilização destas notas na obra publicada em 1973. A edição contempla documentos autógrafos, datiloscritos e impressos rasurados que, de modo geral, contêm um discurso indicativo. Com isso, é possível perceber certas particularidades relacionadas ao processo de criação do romance além de estabelecer novas propostas de estudo para a obra. / This dissertation presents the diplomatic and fac-simile edition of 53 planning notes of the Avalovara, a novel by Osman Lins, through a genetic perspective. The selection was limited to these documents in order to check the procedures employed in the text composition and in its rigorous structure, as well as the record of the use of these notes in the volume published in 1973. The edition includes handwritten, typed and scrapped printed documents that, in general, display an indicative discourse. Through this edition, it is possible both to notice certain peculiarities related to the creative process of the novel and to establish new perspectives of study for the novel.

O Problema dos K Menores Caminhos é uma generalização do Problema do Menor Caminho, em que desejamos encontrar os K caminhos de menor custo entre dois vértices de um grafo. Estudamos e implementamos algoritmos que resolvem esse problema em grafos dirigidos, com peso nos arcos e que permitem apenas caminhos sem repetição de vértices na resposta. Comparamos seus desempenhos utilizando grafos do 9th DIMACS Implementation Challenge. Identificamos os pontos fortes e fracos de cada algoritmo, e propusemos uma variante híbrida dos algoritmos de Feng e de Pascoal. Essa variante proposta obteve desempenho superior aos algoritmos base em alguns grafos, e resultado superior a pelo menos um deles na grande maioria dos testes. / The K-Shortest Path Problem is a generalization of the Shortest Path Problem, in which we must find the K paths between two vertices in a graph that have the lowest costs. We study some K-Shortest Path Problem algorithms applied to weighted directed graphs, allowing only paths with no repeated vertices. We compare empirically implementation of some algorithms, using instance graphs from the 9th DIMACS Implementation Challenge. We identify the strengths and weaknesses of each algorithm, and we propose a hybrid version of Feng\'s and Pascoal\'s algorithms. This proposed variant achieve better perfomance compared to both base algorithms in some graphs, and it is better than at least one of them in most cases.

Na modelagem epidemiológica é importante descrever situações da vida real, neste caso baseados no artigo (Brockmann; Helbing, 2013) apresentamos um modelo da dinâmica da propagação de uma doença infecciosa numa população que está divida em regiões e entre alguma delas existe mobilidade, representados por uma rede. Com o fim de saber se dada uma origem em quanto tempo e quantos casos são esperados nas outras regiões, expomos a definição da distância efetiva e consequentemente os caminhos mais prováveis dependente da mobilidade que respondem as questões. A dengue é uma doença infecciosa que vem sendo uma preocupação no mundo, particularmente no Brasil é um problema de saúde pública. No ano 2012 o estado de Rio de Janeiro reportou 13 cidades com maior incidência nas quais 7 delas estão correlacionadas, porém não é estabelecido como foi a mobilidade para ter estes resultados. Nós propomos aplicamos o modelo mencionado, obtendo as probabilidades das viagens entre estas cidades. / In epidemiological modeling it is important to describe real-life situations, in this case based on the article (\\cite) we present a model of the dynamics of the spread of an infectious disease in a population that is divided into regions and between some of them there is mobility, represented by a network In order to know if given an origin in how long and how many cases are expected in the other regions, we present the definition of the effective distance and consequently the most likely paths depending on the mobility that answer the questions. Dengue is an infectious disease that has been a concern in the world, particularly in Brazil is a problem of public health. In the year $ 2012 $ the state of Rio de Janeiro reported 13 cities with higher incidence in which $ 7$ of them are correlated, but it is not established how mobility was to have these results. We propose apply the mentioned model, obtaining the probabilities of travel between these cities.