O principal objetivo deste trabalho é analisar a aplicabilidade de um minerador de dados para obter relações entre padrões de viagens encadeadas e características sócio-econômicas de viajantes urbanos. Para representar as viagens encadeadas, as viagens correspondentes a cada indivíduo do banco de dados foram codificadas em termos de seqüência de letras que indicam uma ordem cronológica em que atividades são desenvolvidas. O minerador de dados utilizado neste trabalho é árvore de decisão e classificação, uma ferramenta de análise disponível no software S-Plus. A análise foi baseada na pesquisa origem-destino realizada pelo Metrô-SP na região metropolitana de São Paulo, por meio de entrevistas domiciliares, em 1987. Um dos importantes resultados é que indivíduos que têm atributos sócio-econômicos e de viagens similares não se comportam de maneira similar; pelo contrário, eles fazem diferentes padrões de viagens encadeadas, as quais podem ser descritas em termos de probabilidade ou freqüência associada a cada padrão. Portanto, o minerador de dados deve possuir a habilidade para representar essa distribuição. A consistência do resultado foi analisada comparando-os com alguns resultados encontrados na literatura referente a análise de viagem baseada em atividades. A principal conclusão é que árvore de decisão e classificação aplicada a dados individuais, contendo encadeamento de viagem codificado e atributos socioeconômicos e de viagem, permite extrair conhecimento e informações ocultas que ajudam a compreender o comportamento de viagem de viajantes urbanos. / The main aim of this work is to analyze the applicability of a data miner for obtaining relationships between trip-chaining patterns and urban trip-makers socioeconomic characteristics. In order to represent the trip-chains, trips corresponding to each individual in the data set were coded in terms of letters indicating a chronological order in which activities are performed. Data miner applied in this work is decision and classification tree, an analysis tool available in S-Plus software package. The analysis was based on the origin-destination home-interview survey carried out by Metrô-SP in São Paulo metropolitan area. One of the important findings is that individuals having similar socieconomic and trip attributes do not behave in a similar way; on the contrary, they make different trip-chaining patterns, which may be described in term of probability or frequency associated to each pattern. Therefore, the data miner should have ability to represent that distribution. The consistency of results was analyzed by comparing them with some results found in literature related to activity-based travel analysis. The main conclusion is that decision and classification tree applied to individual data, containing coded trip-chaining and socioeconomic and trip attributes, allows extracting hidden knowledge and information that help to understand the travel behaviour of urban trip-makers.

No description available.

Transparent electrodes (TEs) have become important components of displays, touch screens, and solar photovoltaic (PV) energy conversion devices. As electrodes, they must be electrically conductive while being transparent. Transparent materials are normally poor conductors and materials with high electrical conductivity, such as metals, are typically not transparent. From the few candidate materials, indium tin oxide (ITO) is currently the best available, but indium is an expensive material and ITO cost has risen with increasing demand. Therefore, alternative materials or methods are sought to encourage production needs of applications and help in reducing their price. This thesis presents and discusses results of experimental work for a method, field-directed chaining, to produce a TE device which is nanowire-based, with a figure of merit FoM= 2.39 x10E-4 Ohm E-1, comparable to ITO but with potential for far lower cost. Using electric field-directed chaining, multiple parallel long chains of metal nanowires are assembled on inexpensive transparent materials such as glass by field directed nanowire chaining, using methods first demonstrated in our laboratory. In this work, we have improved the fraction of functional chains, by tuning the field/voltage, a key step in increasing the FoM and lowering the cost. The effect of operating parameters on TE optical and electrical properties has been studied and identified as well. From experiments with twenty seven substrates, each with a range of electric field and nanowire concentration, the highest light transmission achieved is 78% and the lowest sheet resistance achieved is 100 Ohm/sq. Among all the operating parameters, the electric field has the most significant influence on the fraction of nanowire chains that are functional. In the operating range of electric field strength available to us, we observed a monotonic increase in the fraction of functional nanowire chains. We found a counter-intuitive change in TE properties in a sub-range of nanowire concentration, associated with a change in the structure of chained patterns. / Graduate

L'émergence de la technologie de virtualisation des fonctions réseau (NFV) a suscité un vif intérêt autour de la conception, la gestion et le déploiement de services réseau de manière flexible, automatisée et indépendante du fournisseur. La mise en œuvre de la technologie NFV devrait être une solution profitable pour les fournisseurs de services et les clients. Cependant, ce changement de paradigme, amorcé par NFV, nécessite un abandon progressif des services réseau fournis à travers des équipements dédiés. En contrepartie, un environnement totalement ou partiellement virtualisé est proposé pour instancier dynamiquement et à la demande des modules logiciels appelés fonctions de réseau virtuelles (VNF). Cette évolution soulève un ensemble de défis liés au déploiement et à l'exploitation de services, tels que l'orchestration et la gestion, la résilience des services, le contrôle de la qualité de service (QoS), l’approvisionnement des ressources, etc. En outre, la question centrale à résoudre dans le contexte NFV est la suivante : « comment placer et chaîner effacement des fonctions virtuelles d’un service afin de fournir un niveau de qualité demandé par le client tout en optimisant l'utilisation des ressources par le fournisseur de services ? ”.Ainsi, cette thèse étudie la problématique du placement et du chaînage des VNF en tenant compte de certaines exigences de service telles que le délai de bout en bout, la disponibilité du service et la consommation d'énergie, et propose un ensemble d'algorithmes et de mécanismes visant à optimiser le déploiement des services demandés/fournis. Nos contributions dans cette thèse sont triples. Premièrement, nous proposons deux algorithmes de placement et de chaînage de VNF sensibles au délai de bout-en-bout pour des applications temps-réel. Les algorithmes proposés visent à respecter le délai approprié de bout-en-bout qui dépend du service déployé (exemples : VoIP, Streaming, etc.). Deuxièmement, nous présentons une analyse comparative de la disponibilité des services et nous proposons deux mécanismes de placement et de chaînage de VNF pour garantir un niveau prédéfini de disponibilité. L’objectif est de fournir des services résilients en ajustant avec précision les paramètres du schéma de protection (nombre, type, emplacement et taille des instances VNF) nécessaires pour atteindre ce niveau de disponibilité en dépit des défaillances du réseau. Enfin, nous proposons une architecture générale qui explore la possibilité d’étendre le paradigme de la virtualisation à l’Internet des objets (IoT). À cette fin, nous définissons un mécanisme de placement et de chaînage respectant les contraintes énergétiques pour des services IoT. Notre architecture propose de découpler et de virtualiser les fonctionnalités inhérentes à un objet connecté de l’équipement IoT physique. En étendant NFV au domaine IoT, notre solution ouvre de nouvelles perspectives d’application en supportant de nouveaux cas d’usages. / The emergence of Network Function Virtualization (NFV) technology has aroused keen interest to design, manage and deploy network services in a flexible, automated and vendor-agnostic manner. Implementing NFV technology is expected to be a win-win solution for both service providers and costumers. However, this paradigm shift, sparked by NFV, calls for a progressive abandon of network services that are provided as hardware appliance and rather it proposes a fully or partially virtualized environment that offers software modules called Virtual Network Functions (VNFs). This shift rises a set of challenges related to service deployment and operation such as orchestration and management, service resiliency, Quality of Service (QoS) and resource provisioning among others. Furthermore, the core question that needs to be solved within NFV context is “What is the best way to place and chain VNFs that form a service in order to meet Service Level Agreement requirements (costumer side) while optimizing resource usage (service provider side)?”.This thesis investigates the problem of VNF Placement and Chaining considering service requirements such as end-to-end delay, service availability and energy consumption and proposes a set of algorithms and mechanisms that aim to achieve an optimized deployment of the requested/provided services. Our contributions in this thesis are threefold. First, we propose a delay-aware Placement and Chaining algorithms for delay-sensitive applications over NFV networks. The proposed algorithms aim to meet the appropriate end-to-end delay defined according to the deployed service (VoIP, Streaming, etc.). Second, we provide a comprehensive service availability benchmarking and we propose two availability-aware mechanisms for VNFs chain. The aim is to provide resilient service provisioning by fine-tuning the parameters of the protection scheme (the number, the type, the placement and the size of the spare instances) needed to reach a predefined availability level, despite network failures. Finally, we propose a framework architecture that explores the possibility to extend the virtualization paradigm to Internet of Things (IoT). Toward this end, we define an energy-aware Placement and Chaining for IoT services where inherent IoT functionalities are decoupled from specific dedicated IoT devices and instantiated on-demand. By bringing together NFV and IoT paradigms, this extension opens new perspectives and push toward designing new use cases.

Les polluants organiques persistants (POPs) sont des substances toxiques ayant la capacité de se bioaccumuler le long de la chaîne alimentaire. Une fois émis dans l'atmosphère, ils sont dispersés par le vent puis se déposent au sol. Du fait de leur persistance, ils peuvent être réémis depuis le sol vers l'atmosphère et parcourir ainsi de longues distances. Ce processus est couramment appelé « effet saut de sauterelle ». On peut donc retrouver les POPs très loin de leurs sources d'émissions. Pour pouvoir prendre des décisions visant à réduire leur impact environnemental, il est nécessaire de comprendre leur comportement dans l'atmosphère mais également dans les autres milieux, tels que le sol, la végétation ou l'eau. De nombreux modèles numériques de complexité variable ont été développés dans le but de prédire le devenir des POPs dans l'environnement. La plupart d'entre eux considèrent le sol comme un compartiment homogène, pouvant ainsi mener à une sous-estimation des réémissions du sol vers l'atmosphère. Or, du fait de la mise en place de réglementations visant à réduire les émissions anthropiques des POPs, la concentration dans l'atmosphère tend à diminuer et le sol, qui semblait jusqu'alors être seulement un réservoir, devient une source potentielle de POPs pour l'atmosphère. Il apparaît donc nécessaire de coupler les modèles de dispersion atmosphérique à un modèle de sol réaliste. Mes recherches ont permis d'étudier l'impact des interactions entre le sol et l'atmosphère sur la concentration dans les différents milieux. Pour cela, nous avons développé un modèle de sol multi-couches permettant de mieux estimer le profil de concentration dans le sol et les échanges entre ces deux milieux. Une analyse de sensibilité a été effectuée afin d'identifier les paramètres clés dans la détermination des réémissions. Puis ce modèle a été couplé à un modèle 3D de chimie-transport atmosphérique. Une étude de cas à l'échelle européenne a alors été réalisée afin d'évaluer ce modèle et d'estimer l'impact des réémissions sur les concentrations de POPs dans l'environnement / Persitent Organic Pollutants (POPs) are toxic substances that bioaccumulate in the food chain. Once emitted in the atmosphere, they are transported by the wind and deposited on soil. Since they are persistent, they can be reemited from soil to atmosphere by volatilization and travel over very long distances. This process is called grasshopper effect. Thus, POPs may be found at significant levels far from their emission source. It is necessary to understand the transport and fate of these pollutants in order to support the decision making process and reduce human exposure to POPs. Regulations over the last decades lead to a decrease of anthropogenic emissions and subsequent decrease of atmospheric concentration. In this context, the soil is no longer a sink of POPs but can be a source to the atmosphere. Many numeric models aim to study the behavior of POPs in the environment. Most of them consider soil compartment as a homogeneous box, leading to an underestimation of reemissions. Then, it appears of great importance to develop more realistic soil models. The objective of my thesis was to develop such a model, with vertical transport within the soil. This model was evaluated against measured concentration soil profile. We also conducted a sensitivity analysis to identify the key parameters involved in the process of reemissions. Then, the soil model was coupled with an atmospheric transport model. A case study was finally undertaken to estimate the impacts of reemissions on global-mass balance of POPs at European scale

<p dir="ltr">Axial spondyloarthritis (axSpA), a disease that due to its complexity and rarity, presents challenges in diagnosis. With a focus on integrating expert knowledge into an intelligent diagnostic system, the research explores the intricate nature of axSpA, emphasizing the challenges associated with its diverse clinical presentation. By leveraging a comprehensive knowledge base curated by domain experts, encompassing insights into pathophysiology, genetic factors, and evolving diagnostic criteria of axSpA, the expert system strives to provide a nuanced understanding of the disease. The methodology employs a hybrid reasoning approach, combining both forward and backward chaining techniques. Forward chaining iteratively processes clinical data and available evidence, applying logical rules to infer potential diagnoses and refine hypotheses, while backward chaining starts with the desired diagnostic goal and works backward through the knowledge base to validate or refute hypotheses. Additionally, certainty theory is incorporated to manage uncertainty in the diagnostic process, assigning confidence levels to conclusions based on the strength of evidence and expert knowledge. By integrating knowledge base, forward and backward chaining, and certainty theory, the research aims to enhance diagnostic precision for this less common yet impactful inflammatory rheumatic condition, emphasizing the importance of early and accurate identification for effective management and improved patient outcomes. The results indicate a significant improvement in diagnostic accuracy, sensitivity, and specificity compared to traditional methods. The system's potential to enhance early diagnosis and treatment outcomes is discussed, along with suggestions for future research to further refine and expand the system.</p>

Cognitive linguists posit that language as a system of meaning is closely related to cognition and to the associated perceptual and physiological structures of the body. From the cognitive semantic viewpoint, cognitive processes underpin and motivate linguistic phenomena such as categorisation, polysemy, metaphor, metonymy and image schemas. The pedagogical implication of the cognitive semantic perspective is that understanding these cognitive motivations facilitates language learning. This dissertation uses an applied cognitive semantic approach to `make sense' of a traditional knowledge system, Traditional Chinese Medicine (TCM). TCM views human physiology as a holistic and dynamic system that exemplifies the same principles as the cosmos-environment. TCM models result in a categorisation of physiological phenomena based on a complex system of experiential and cosmological correspondences. I suggest that the holistic epistemology of cognitive linguistics is well suited to an understanding of these holistic models. From a pedagogical viewpoint, I argue that an analysis of the cognitive motivations which underpin TCM categorisations and the polysemy of some key TCM terms can help the student make sense of TCM as a meaningful system of thought and practice. Both the theoretical and applied approaches explored in this dissertation should have relevance to other traditional knowledge systems, particularly traditional medical systems. / Linguistics / M.A. (Linguistics)

Avec plus de 1000 génomes complets disponibles (la grande majorité venant de bactéries), les analyses comparatives de génomes deviennent indispensables pour leurs annotations fonctionnelles, ainsi que pour la compréhension de leur structure et leur évolution, et s'appliquent par exemple en phylogénomique ou au design des vaccins. L'une des approches de plus utilisées pour comparer des génomes est l'alignement de leurs séquences d'ADN, i.e. alignement de génomes complets, c'est à dire identifier les régions de similarité en s'affranchissant de toute annotation. Malgré des améliorations significatives durant les dernières années, des outils performants pour cette approche ainsi que des méthodes pour l'estimation de la qualité des résultats qu'elle produit, en particulier sur les génomes bactériens, restent encore à développer. Outre leurs grandes tailles qui rendent les solutions classiques basées sur la programmation dynamique inutilisables, l'alignement de génomes complets posent des difficultés supplémentaires dues à leur évolution particulière, comprenant: la divergence, qui estompe les similarités entre les séquences, le réordonnancent des portions génomiques (réarrangements), ou l'acquisition de matériel génétique extérieur, qui produit des régions non alignables entres les séquences, e.g. transfert horizontal des gènes, phages. En conséquence, les solutions pour l'alignement de génomes sont des heuristiques, dont la plus commune est appelée stratégie basée sur des ancres. Cette stratégie commence par identifier un ensemble initial de régions de similarité (phase 1). Ensuite une phase de chaînage sélectionne un sous-ensemble (non-chevauchantes et généralement colinéaires) de ces similarités de poids maximal, nommées ancres (phase 2). Les phases 1 et 2 sont appliquées de manière récursive sur les régions encore non-alignées (phase 3). La dernière phase consiste en l'application systématique des outils d'alignement classiques sur toutes les régions courtes qui n'ont pas encore été alignées. Cette thèse adresse plusieurs problèmes liés à l'alignement de génomes complets dont: l'évaluation de la qualité des résultats produits par les outils d'alignement et l'amélioration de la stratégie basée sur des ancres. Premièrement, nous avons créé un protocole pour évaluer la qualité des résultats d'alignement, contenant des mesures de calcul quantitatives et qualitatives, dont certaines basées sur des connaissances biologiques. Une analyse de la qualité des alignements produits par deux des principaux outils existants sur des paires de génomes bactériens intra-espèces révèle leurs limitations: des similarités non détectées et des portions d'alignement incorrectes. À partir de ces résultats, qui suggèrent un manque de sensibilité et spécificité, nous proposons un nouvel outil pour l'alignement deux à deux de génomes complets, YOC, qui implémente une version simplifiée de la stratégie basée sur des ancres, contenant seulement deux phases. Dans la phase 1, YOC améliore la sensibilité en utilisant comme ancres, pour la première fois dans cette stratégie, des similarités locales basées sur des graines espacées, capables de détecter des similarités plus longues dans des régions plus divergentes. Cette phase est suivie par une méthode de chainage adaptée aux similarités locales, un nouveau type de chaînage colinéaire, permettant des chevauchements proportionnels. Nous avons donné une formulation de ce nouveau problème et réalisé un premier algorithme. L'algorithme, qui adopte une approche de programmation dynamique basée sur le paradigme de la ``sweep-line'', donne une solution optimale, i.e. est exacte, et s'exécute en temps quadratique. Nous avons montré que cet algorithme, comparé au chainage colinéaire classique, améliore les résultats sur des génomes bactériens, tout en restant aussi efficace en pratique. / With more than 1000 complete genomes available (among which, the vast majority come from bacteria), comparative genomic analysis become essential for the functional annotation of genomes, the understanding of their structure and evolution and have applications in phylogenomics or vaccine design. One of the main approaches for comparing genomes is by aligning their DNA sequences, i.e. whole genome alignment (WGA), which means identifying the similarity regions without any prior annotation knowledge. Despite the significant improvements during the last years, reliable tools for WGA and methodology for estimating its quality, in particular for bacterial genomes, still need to be designed. Besides their extremely large lengths that make classical dynamic programming alignment methods unsuitable, aligning whole genomes involves several additional difficulties, due to the mechanisms through which genomes evolve: the divergence, which let sequence sim ilarity vanish over time, the reordering of genomic segments (rearrangements), or the acquisition of external genetic material generating regions that are unalignable between sequences, e.g. horizontal gene transfer, phages. Therefore, whole genome alignment tools implement heuristics, among which the most common is the anchor based strategy. It starts by detecting an initial set of similarity regions (phase 1), and, through a chaining phase (phase 2), selects a non-overlapping maximum-weighted, usually collinear, subset of those similarities, called anchors. Phases 1 and 2 are recursively applied on yet unaligned regions (phase 3). The last phase (phase 4) consists in systematically applying classical alignment tools to all short regions still left unaligned.This thesis addresses several problems related to whole genome alignment: the evaluation of the quality of results given by WGA tools and the improvement of the classical anchor based strategy. We first designed a protocol for evaluating the quality of alignment results, based on both computational and biological measures. An evaluation of the results given by two state of the art WGA tools on pairs of intra-species bacterial genomes revealed their shortcomings: the failure of detecting some of the similarities between sequences and the misalignment of some regions. Based on these results, which imply a lack in both sensitivity and specificity, we propose a novel, pairwise whole genome alignment tool, YOC, implementing a simplified two-phase version of the anchor strategy. In phase 1, YOC improves sensitivity by using as anchors, for the first time, local similarities based on spaced seeds that are capable of detecting larger similarity regions in divergent sequences. This ph ase is followed by a chaining method adapted to local similarities, a novel type of collinear chaining, allowing for proportional overlaps. We give a formulation for this novel problem and provide the first algorithm for it. The algorithm, implementing a dynamic programming approach based on the sweep-line paradigm, is exact and runs in quadratic time. We show that, compared to classical collinear chaining, chaining with overlaps improves on real bacterial data, while remaining almost as efficient in practice. Our novel tool, YOC, is evaluated together with other four WGA tools on a dataset composed of 694 pairs of intra-species bacterial genomes. The results show that YOC improves on divergent cases by detecting more distant similarities and by avoiding misaligned regions. In conclusion, YOC should be easier to apply automatically and systematically to incoming genomes, for it does not require a post-filtering step to detect misalignment and is less complex to calibrate.

A Virtualização de Funções de Rede (NFV – Network Function Virtualization) é um novo conceito arquitetural que está remodelando a operação de funções de rede (e.g., firewall, gateways e proxies). O conceito principal de NFV consiste em desacoplar a lógica de funções de rede dos dispositivos de hardware especializados e, desta forma, permite a execução de imagens de software sobre hardware de prateleira (COTS – Commercial Off-The-Shelf). NFV tem o potencial para tornar a operação das funções de rede mais flexíveis e econômicas, primordiais em ambientes onde o número de funções implantadas pode chegar facilmente à ordem de centenas. Apesar da intensa atividade de pesquisa na área, o problema de posicionar e encadear funções de rede virtuais (VNF – Virtual Network Functions) de maneira escalável e com baixo custo ainda apresenta uma série de limitações. Mais especificamente, as estratégias existentes na literatura negligenciam o aspecto de encadeamento de VNFs (i.e., objetivam sobretudo o posicionamento), não escalam para o tamanho das infraestruturas NFV (i.e., milhares de nós com capacidade de computação) e, por último, baseiam a qualidade das soluções obtidas em custos operacionais não representativos. Nesta tese, aborda-se o posicionamento e o encadeamento de funções de rede virtualizadas (VNFPC – Virtual Network Function Placement and Chaining) como um problema de otimização no contexto intra- e inter-datacenter. Primeiro, formaliza-se o problema VNFPC e propõe-se um modelo de Programação Linear Inteira (ILP) para resolvêlo. O objetivo consiste em minimizar a alocação de recursos, ao mesmo tempo que atende aos requisitos e restrições de fluxo de rede. Segundo, aborda-se a escalabilidade do problema VNFPC para resolver grandes instâncias do problema (i.e., milhares de nós NFV). Propõe-se um um algoritmo heurístico baseado em fix-and-optimize que incorpora a meta-heurística Variable Neighborhood Search (VNS) para explorar eficientemente o espaço de solução do problema VNFPC. Terceiro, avalia-se as limitações de desempenho e os custos operacionais de estratégias típicas de aprovisionamento ambientes reais de NFV. Com base nos resultados empíricos coletados, propõe-se um modelo analítico que estima com alta precisão os custos operacionais para requisitos de VNFs arbitrários. Quarto, desenvolve-se um mecanismo para a implantação de encadeamentos de VNFs no contexto intra-datacenter. O algoritmo proposto (OCM – Operational Cost Minimization) baseia-se em uma extensão da redução bem conhecida do problema de emparelhamento ponderado (i.e., weighted perfect matching problem) para o problema de fluxo de custo mínimo (i.e., min-cost flow problem) e considera o desempenho das VNFs (e.g., requisitos de CPU), bem como os custos operacionais estimados. Os resultados alcaçados mostram que o modelo ILP proposto para o problema VNFPC reduz em até 25% nos atrasos fim-a-fim (em comparação com os encadeamentos observados nas infra-estruturas tradicionais) com um excesso de provisionamento de recursos aceitável – limitado a 4%. Além disso, os resultados evidenciam que a heurística proposta (baseada em fix-and-optimize) é capaz de encontrar soluções factíveis de alta qualidade de forma eficiente, mesmo em cenários com milhares de VNFs. Além disso, provê-se um melhor entendimento sobre as métricas de desempenho de rede (e.g., vazão, consumo de CPU e capacidade de processamento de pacotes) para as estratégias típicas de implantação de VNFs adotadas infraestruturas NFV. Por último, o algoritmo proposto no contexto intra-datacenter (i.e. OCM) reduz significativamente os custos operacionais quando comparado aos mecanismos de posicionamento típicos uti / Network Function Virtualization (NFV) is a novel concept that is reshaping the middlebox arena, shifting network functions (e.g. firewall, gateways, proxies) from specialized hardware appliances to software images running on commodity hardware. This concept has potential to make network function provision and operation more flexible and cost-effective, paramount in a world where deployed middleboxes may easily reach the order of hundreds. Despite recent research activity in the field, little has been done towards scalable and cost-efficient placement & chaining of virtual network functions (VNFs) – a key feature for the effective success of NFV. More specifically, existing strategies have neglected the chaining aspect of NFV (focusing on efficient placement only), failed to scale to hundreds of network functions and relied on unrealistic operational costs. In this thesis, we approach VNF placement and chaining as an optimization problem in the context of Inter- and Intra-datacenter. First, we formalize the Virtual Network Function Placement and Chaining (VNFPC) problem and propose an Integer Linear Programming (ILP) model to solve it. The goal is to minimize required resource allocation, while meeting network flow requirements and constraints. Then, we address scalability of VNFPC problem to solve large instances (i.e., thousands of NFV nodes) by proposing a fixand- optimize-based heuristic algorithm for tackling it. Our algorithm incorporates a Variable Neighborhood Search (VNS) meta-heuristic, for efficiently exploring the placement and chaining solution space. Further, we assess the performance limitations of typical NFV-based deployments and the incurred operational costs of commodity servers and propose an analytical model that accurately predict the operational costs for arbitrary service chain requirements. Then, we develop a general service chain intra-datacenter deployment mechanism (named OCM – Operational Cost Minimization) that considers both the actual performance of the service chains (e.g., CPU requirements) as well as the operational incurred cost. Our novel algorithm is based on an extension of the well-known reduction from weighted matching to min-cost flow problem. Finally, we tackle the problem of monitoring service chains in NFV-based environments. For that, we introduce the DNM (Distributed Network Monitoring) problem and propose an optimization model to solve it. DNM allows service chain segments to be independently monitored, which allows specialized network monitoring requirements to be met in a efficient and coordinated way. Results show that the proposed ILP model for the VNFPC problem leads to a reduction of up to 25% in end-to-end delays (in comparison to chainings observed in traditional infrastructures) and an acceptable resource over-provisioning limited to 4%. Also, we provide strong evidences that our fix-and-optimize based heuristic is able to find feasible, high-quality solutions efficiently, even in scenarios scaling to thousands of VNFs. Further, we provide indepth insights on network performance metrics (such as throughput, CPU utilization and packet processing) and its current limitations while considering typical deployment strategies. Our OCM algorithm reduces significantly operational costs when compared to the de-facto standard placement mechanisms used in Cloud systems. Last, our DNM model allows finer grained network monitoring with limited overheads. By coordinating the placement of monitoring sinks and the forwarding of network monitoring traffic, DNM can reduce the number of monitoring sinks and the network resource consumption (54% lower than a traditional method).

Dans le parler des jeunes du Mexique, on retrouve, entre autres formes de vitalité linguistique, un usage fréquent de jeux phoniques qui transforment ou substituent des lexèmes et syntagmes sans qu'il y ait altération significative du signifié. Ce phénomène linguistique utilise trois procédés phoniques: la suffixation parasitaire, la substitution lexicale basée sur la similitude phonique et l'enchaînement en écho. Le présent mémoire contribue à remplir un vide dans la littérature scientifique et faire connaître ce phénomène peu étudié en explorant les aspects formels linguistiques et les fonctions sociales. Nous cherchons à établir les relations qui existent entre la structure linguistique et les fonctions linguistiques et sociales inhérentes à l'usage de jeux phoniques. L'étude empirique menée dans la ville de Puebla (Mexique) a permis la collecte d'un corpus de plus de deux cents jeux phoniques et la réalisation d'entrevues sociolinguistiques avec dix-huit jeunes de Puebla usagers des expressions étudiées. Nous proposons une classification du corpus de jeux phoniques basée sur la structure formelle afin d'apprécier que le phénomène réponde à des patrons fixes de construction. Suite à une analyse thématique des entrevues que nous appuyons d'exemples de jeux phoniques, nous verrons que l'usage de jeux phoniques joue principalement une fonction poétique, ludique ainsi qu'une fonction de cohésion sociale et une fonction identitaire. La présente étude confirme que le caractère non normatif et cryptique intrinsèque aux jeux de mots sert à renforcer ces fonctions sociales, à la manière d'un parler argotique. / In the youth speech of Mexico a frequent use of phonic wordplays that transform or substitute lexemes and phrases without significant alteration of the signifier are found among linguistic vitality signs. This linguistic phenomenon uses three phonic techniques: parasitic suffixation, lexical substitution based on phonic similarity and echo chaining. This report contributes by filling a void in the scientific literature and to expose this overlooked phenomenon by exploring its formal linguistic aspects and social functions. The aim of this study is to establish the relationship between linguistic structure and linguistic and social functions inherent to phonic wordplay use. The empiric study conducted in Puebla (Mexico) allowed the collection of a corpus of more than two hundred phonic wordplays and the realization of sociolinguistic interviews with eighteen Puebla youth, who employ the studied expressions. This work proposes a classification of the corpus based on their formal structure in order to highlight that the phenomenon conforms to fixed patterns of construction. After a thematic analysis of the interviews, with an emphasis on phonic wordplay examples, we observe that the use of phonic wordplays mainly accomplishes poetic and ludic, as well as social cohesion and identity functions. This study confirms that the non-normative and cryptic characteristics intrinsic to phonic wordplays help to reinforce the aforementioned social functions as an argotic speech. / En el habla de los jóvenes de México encontramos, entre otras muestras de vitalidad lingüística, un uso frecuente de juegos fónicos que transforman o sustituyen lexemas y sintagmas sin que haya alteración significativa del significado. Este fenómeno lingüístico utiliza tres recursos fónicos: la sufijación parasitaria, la sustitución léxica por similitud fónica y el encadenamiento en eco. La presente memoria contribuye a llenar un vacío en la literatura científica y dar a conocer este fenómeno poco estudiado, explorando los aspectos formales lingüísticos y las funciones sociales. Buscamos establecer las relaciones que existen entre la estructura lingüística y las funciones lingüísticas y sociales inherentes al uso de los juegos fónicos. El estudio empírico que se llevó a cabo en la ciudad de Puebla (México) permitió la recolección de un corpus de más de doscientos juegos fónicos y la realización de entrevistas sociolingüísticas con dieciocho jóvenes poblanos usuarios de las expresiones estudiadas. Proponemos una clasificación del corpus de juegos fónicos basada en la estructura formal para apreciar que el fenómeno responde a patrones fijos de construcción. Tras un análisis temático de las entrevistas, que apoyamos con ejemplos de juegos fónicos, veremos que el uso de juegos fónicos cumple principalmente una función poética, lúdica, así como una función de cohesión social y una función identitaria. El presente estudio confirma que el carácter no normativo y críptico intrínseco a los juegos fónicos sirve para reforzar estas funciones sociales, a modo de habla argótica.