Network virtualization and overlay networks have emerged as powerful tools for improving the flexibility of the Internet. Overlays are used to provide a wide range of useful services in today's networking environment, and they are also viewed as important building blocks for an agile and evolvable future Internet. Regardless of the specific service it provides, an overlay needs assistance in several areas in order to perform properly throughout its existence. This dissertation focuses on the mechanisms underlying the provision of auxiliary support services that perform control and management functions for overlays, such as overlay assignment, resource allocation, overlay monitoring and diagnosis. The priorities and objectives in the design of such mechanisms depend on network conditions and the virtualization environment. We identify opportunities for improvements that can help provide auxiliary services more effectively at different overlay life stages and under varying assumptions. The contributions of this dissertation are the following: 1. An overlay assignment algorithm designed to improve an overlay's diagnosability, which is defined as its property to allow accurate and low-cost fault diagnosis. The main idea is to increase meaningful sharing between overlay links in a controlled manner in order to help localize faults correctly with less effort. 2. A novel definition of bandwidth allocation fairness in the presence of multiple resource sharing overlays, and a routing optimization technique to improve fairness and the satisfaction of overlays. Evaluation analyzes the characteristics of different fair allocation algorithms, and suggests that eliminating bottlenecks via custom routing can be an effective way to improve fairness. 3. An optimization solution to minimize the total cost of monitoring an overlay by determining the optimal mix of overlay and native links to monitor, and an analysis of the effect of topological properties on monitoring cost and the composition of the optimal mix of monitored links. We call our approach multi-layer monitoring and show that it is a flexible approach producing minimal-cost solutions with low errors. 4. A study of virtual network embedding in software defined networks (SDNs), identifying the challenges and opportunities for embedding in the SDN environment, and presenting two VN embedding techniques and their evaluation. One objective is to balance the stress on substrate components, and the other is to minimize the delays between VN controllers and switches. Each technique optimizes embedding for one objective while keeping the other within bounds.

As the "network of network", the Internet has been playing a central and crucial role in modern society, culture, knowledge, businesses and so on in a period of over two decades by supporting a wide variety of network technologies and applications. However, due to its popularity and multi-provider nature, the future development of the Internet is limited to simple incremental updates. To address this challenge, network virtualization has been propounded as a potential candidate to provide the essential basis for the future Internet architecture. Network virtualization is capable of providing an open and flexible networking environment in which service providers are allowed to dynamically compose multiple coexisting heterogeneous virtual networks on a shared substrate network. Such a flexible environment will foster the deployment of diversified services and applications. A major challenge in network virtualization area is the Virtual Network Embedding (VNE), which aims to statically or dynamically allocate virtual nodes and virtual links on substrate resources, physical nodes and paths. Making effective use of substrate resources requires high-efficient and survivable VNE techniques. The main contribution of this thesis is two high-performance p-Cycle-based survivable virtual network embedding approaches. These approaches take advantage of p-Cycle-based protection techniques that minimize the backup resources while providing a full VN protection scheme against link and node failures.

Semantic text matching is a fundamental task for many applications in NaturalLanguage Processing (NLP). Traditional methods using term frequencyinversedocument frequency (TF-IDF) to match exact words in documentshave one strong drawback which is TF-IDF is unable to capture semanticrelations between closely-related words which will lead to a disappointingmatching result. Neural networks have recently been used for various applicationsin NLP, and achieved state-of-the-art performances on many tasks.Recurrent Neural Networks (RNN) have been tested on text classificationand text matching, but it did not gain any remarkable results, which is dueto RNNs working more effectively on texts with a short length, but longdocuments. In this paper, Convolutional Neural Networks (CNN) will beapplied to match texts in a semantic aspect. It uses word embedding representationsof two texts as inputs to the CNN construction to extract thesemantic features between the two texts and give a score as the output ofhow certain the CNN model is that they match. The results show that aftersome tuning of the parameters the CNN model could produce accuracy,prediction, recall and F1-scores all over 80%. This is a great improvementover the previous TF-IDF results and further improvements could be madeby using dynamic word vectors, better pre-processing of the data, generatelarger and more feature rich data sets and further tuning of the parameters.

In this paper a test set embedding based on accumulator driven by an odd additive constant is presented. The problem is formulated around finding the location of the test pattern in the sequence generated by the accumulator, given a odd constant C and test set T, in terms of linear Diophantine equation of two variables. We show that the search space for finding the best constant corresponding to the shortest length, is greatly reduced. Experimental results show a significant improvement in run time with practically acceptable test length.

This thesis considers three separate but connected problems regarding energy networks: the load flow problem, the optimal power flow problem, and the islanding problem. All three problems are non-convex non linear problems, and so have the potential of returning local solutions. The goal of this thesis is to find solution methods to each of these problems that will minimize the chances of returning a local solution. The thesis first considers the load ow problem and looks into a novel approach to solving load flows, the Holomorphic Embedding Load Flow Method (HELM). The current literature does not provide any HELM models that can accurately handle general power networks containing PV and PQ buses of realistic sizes. This thesis expands upon previous work to present models of HELM capable of solving general networks efficiently, with computational results for the standard IEEE test cases provided for comparison. The thesis next considers the optimal power flow problem, and creates a framework for a load flow-based OPF solver. The OPF solver is designed with incorporating HELM as the load flow solver in mind, and is tested on IEEE test cases to compare it with other available OPF solvers. The OPF solvers are also tested with modified test cases known to have local solutions to show how a LF-OPF solver using HELM is more likely to find the global optimal solution than the other available OPF solvers. The thesis finally investigates solving a full AC-islanding problem, which can be considered as an extension of the transmission switching problem, using a standard MINLP solver and comparing the results to solutions obtained from approximations to the AC problem. Analysing in detail the results of the AC-islanding problem, alterations are made to the standard MINLP solver to allow better results to be obtained, all the while considering the trade-off between results and elapsed time.

Submitted by Socorro Pontes (socorrop@ufersa.edu.br) on 2017-09-11T15:01:23Z No. of bitstreams: 1 JorgeLOC_TESE.pdf: 1815389 bytes, checksum: e1806d37e3ce1f16a7256649edcda60b (MD5) / Approved for entry into archive by Vanessa Christiane (referencia@ufersa.edu.br) on 2017-09-11T16:28:08Z (GMT) No. of bitstreams: 1 JorgeLOC_TESE.pdf: 1815389 bytes, checksum: e1806d37e3ce1f16a7256649edcda60b (MD5) / Approved for entry into archive by Vanessa Christiane (referencia@ufersa.edu.br) on 2017-09-11T16:28:40Z (GMT) No. of bitstreams: 1 JorgeLOC_TESE.pdf: 1815389 bytes, checksum: e1806d37e3ce1f16a7256649edcda60b (MD5) / Made available in DSpace on 2017-09-11T16:29:54Z (GMT). No. of bitstreams: 1 JorgeLOC_TESE.pdf: 1815389 bytes, checksum: e1806d37e3ce1f16a7256649edcda60b (MD5) Previous issue date: 2017-07-28 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Drip irrigation system in the radiation area of the agricultural crop in order to provide that a partner of the soil is close to the field capacity. In this irrigation system as dripping tapes are exposed to physical-chemical and microbiological agents that increase the appearance of emitter obstruction, reducing the operational life cycle of the system that operate with water of inferior quality. The objective of this study was to study the variation of irrigation water temperature and salinity as factors that contribute to the process of obstruction of the tapes, reducing its useful life, control solution of flow rate uniformity of the emitters of the drip tapes under laboratory conditions. For this, an experimental bench was set up not Laboratory of Machine Instrumentation and Agricultural Mechanization of the Universidade Federal Rural do Semi-Árido, in Mossoró-RN; Where the experimental tests were carried out with three types of drip tapes operated under controlled conditions of temperature, water salinity and service pressure. The experimental bench has the following dimensions: 1,50m x 3,50m (width and length), height of 1,00 m and 1,20 m (low point and highest point respectively). On the same saw, fixed four fiber cement tiles in an area of 0.90 m x 3.00 m (width and length), with slope of 8% and at its base to insert a collecting trough connected to the ground water reservoir of 0.10m3. To allow a recirculation of the test water, a 1/4 hp centrifugal pump was used. Four lines of tapes with three meters of length were used in the workbench, which were submitted to short test cycles, established at 100, 250, 500 and 750 hours of operation and water temperature of 20 and 30ºC. To control the temperature of the water with the heating system with power of 2.00 kW and cooling of 7.04 kW. The electrical conductivity of water ranged from 0.52 dS m-1 to 2.56 dS m-1. After the end of each cycle of operation, samples of the tapes were collected for scanning electron microscopy of the holes and internal walls. The flow rate and the Distribution Uniformity Coefficient were used to monitor the hydraulic performance of the drip tapes. The results indicated that the increase of salinity of the irrigation water resulted in a decrease in the flow rate of the drip irrigation system, without causing a change in the classification of the Distribution Uniformity Coefficient. Water quality analyzes indicated a potential risk for soil sodification. The increase in temperature and salinity increased the formation of microorganisms and precipitates of calcium, resulting in increased frequency of maintenance in the system / No sistema de irrigação localizada por gotejamento á água é aplicada em baixa intensidade e alta frequência na região radicular da cultura agrícola de forma a propiciar que a umidade do solo esteja próxima à capacidade de campo. Neste sistema de irrigação as fitas gotejadoras são expostas a agentes físico-químicas e microbiológicas que potencializam o surgimento de obstrução dos emissores, reduzindo o ciclo de vida operacional do sistema que operam com água de qualidade inferior. O presente trabalho objetivou estudar a variação da temperatura e salinidade da água de irrigação como fatores que contribuem para o processo de obstrução das fitas gotejadoras, reduzindo sua vida útil, sob os parâmetros de redução da uniformidade da vazão dos emissores das fitas gotejadoras em condições laboratoriais. Para isto, montou-se uma bancada experimental no Laboratório de Instrumentação de Máquinas e Mecanização Agrícola da Universidade Federal Rural do Semi-Árido, em Mossoró-RN; onde foram realizados os ensaios experimentais com três tipos de fitas gotejadoras operadas em condições controladas de temperatura, salinidade da água e pressão de serviço. A bancada experimental apresenta as seguintes dimensões 1,50m x 3,50m (largura e comprimento), altura de 1,00m e 1,20m (ponto maio baixo e ponto mais elevado respectivamente). Sobre a mesma foram fixadas quatro telhas de fibrocimento numa área de 0,90m x 3,00m (largura e comprimento), com declividade de 8% e na sua base foi inserida uma calha coletora conectada ao reservatório térreo de 0,10m3. Para permitir a recirculação da água do ensaio foi utilizado um conjunto motobomba centrífuga de 1/4cv. Na bancada foram utilizadas quatro linhas de fitas gotejadoras com três metros de comprimento cada, sendo estas submetidas a ciclos de ensaios de curta e longa duração, estabelecido em 100, 250, 500 e 750 h de operação, e temperatura da água de 20 e 30ºC. Para o controle da temperatura da água foi utilizado sistema de aquecimento com potência de 2,00 kW e refrigeração de 7,04 kW. A condutividade elétrica da água variou de 0,52 dS m-1 a 2,56 dS m-1. Após o término de cada ciclo de operação foram coletadas amostras das fitas para a realização de microscopia eletrônica de varredura dos orifícios e paredes internas. Empregou-se a vazão e o Coeficiente de Uniformidade de Distribuição no monitoramento do desempenho hidráulico das fitas gotejadoras. Os resultados obtidos indicaram que o aumento da salinidade da água de irrigação acarretou o decréscimo da vazão do sistema de irrigação localizada por gotejamento, sem ocasionar alteração da classificação do Coeficiente de Uniformidade de Distribuição. As análises da qualidade da água indicaram risco potencial para sodificação do solo. O aumento da temperatura e salinidade potencializou a formação de microrganismos e precipitados de cálcio, resultando no aumento da frequência de manutenções no sistema / 2017-09-11

In this thesis an algebraic structure, called real calculus, is used as a way to represent noncommutative manifolds in an algebraic setting. Several classical geometric concepts are defined for real calculi, such as metrics and affine connections, and real calculus homomorphisms are introduced. These homomorphisms are then used to define embeddings of real calculi representing manifolds, anda notion of minimal embedding is introduced. The motivating example of the thesis is the noncommutative torus as embedded into a localization of the noncommutative 3-sphere, where it is shown that the noncommutative torus is a minimal embedding of the noncommutative 3-sphere for certain perturbations of the standard metric.

PEREIRA, Rodrigo Mendes.Geometria métrica e topologia de superfícies algebricamente parametrizadas. 2016. 68 f. Tese (Doutorado em Matemática) – Centro de Ciências, Universidade Federal do Ceará, Fortaleza, 2016. / Submitted by Andrea Dantas (pgmat@mat.ufc.br) on 2017-06-09T17:57:35Z No. of bitstreams: 1 2016_tese_rmpereira.pdf: 663687 bytes, checksum: 396b9fef564fece1bd791fcf3677b5e5 (MD5) / Rejected by Rocilda Sales (rocilda@ufc.br), reason: Oi Andrea, Favor informar ao aluno para fazer as seguintes correções: No Resumo e Abstract não tem recuo. Os termos das palavras-chave e abstract são separadas e finalizadas por ponto. nAS Referências, o sobrenome dos autores são em caixa alta. Ex: WHITNEY, Hassler. Dois ou três autores: SOBRENOME, Nome; SOBRENOME, Nome Rocilda on 2017-06-13T12:22:02Z (GMT) / Submitted by Andrea Dantas (pgmat@mat.ufc.br) on 2017-06-19T17:03:38Z No. of bitstreams: 1 2016_tese_rmpereira.pdf: 663687 bytes, checksum: 396b9fef564fece1bd791fcf3677b5e5 (MD5) / Rejected by Rocilda Sales (rocilda@ufc.br), reason: Oi Andrea, Estou devolvendo novamente o arquivo do Rodrigo, pois ele não fez as correções. Elton disse que ele veio ontem e foi dito o quais eram. Estou enviando as mesmas. Favor repassar pra ele. Caso ele não tenha entendido são essas as correções: Sumário a Abstracts não tem o recuo. As palavras-chave e keywords são separados e finalizados por ponto. E Referências : Os sobrenomes dos autores são em caixa alta: BALLETSEROS, J .J .Nuno. BIRBRAIR, L. ; FERNANDES, A.; GRANDJEAN, V. SE FOR MAIS DE 3 AUTORES INDICA-SE APENAS O PRIMEIRO ACRESCENTANDO A EXPRESSÃO ET AL. Birbrair, L ET AL. on 2017-06-21T14:06:19Z (GMT) / Submitted by Andrea Dantas (pgmat@mat.ufc.br) on 2017-06-22T12:40:49Z No. of bitstreams: 1 2016_tese_rmpereira.pdf: 661684 bytes, checksum: c8673d7c6d1002a51d5c45584e60f6b7 (MD5) / Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2017-06-22T14:20:44Z (GMT) No. of bitstreams: 1 2016_tese_rmpereira.pdf: 661684 bytes, checksum: c8673d7c6d1002a51d5c45584e60f6b7 (MD5) / Made available in DSpace on 2017-06-22T14:20:44Z (GMT). No. of bitstreams: 1 2016_tese_rmpereira.pdf: 661684 bytes, checksum: c8673d7c6d1002a51d5c45584e60f6b7 (MD5) Previous issue date: 2016-07-20 / In this work, we study the singularities of the surfaces obtained as an image of a plane by an algebraic or analytic application in the spaces R3 and R4. We study the topological and metric properties of the knots that are obtained as a link of this surfaces. Normal embedding criterion are obtained for the surfaces and, in addition, the connections between the topology of the knot and normal embedding are investigated. We will also give a description of the tangent cones of these surfaces at the singular points. / Nesse trabalho, estudamos as singularidades das superfícies obtidas como imagem de um plano por uma aplicação algébrica ou analítica no espaços R3 e R4. Estudamos as propriedades topológicas e métricas dos nós que são obtidos como link de tais superfícies. É obtido critérios de mergulho normal para a superfície-imagem e, além disso, é investigado as ligações entre a topologia do nó e o mergulho normal. Faremos ainda uma descrição dos cones tangentes destas superfícies nos pontos singulares.

A virtualização de redes tem se tornado cada vez mais proeminente nos últimos anos. Tal técnica permite a criação de infraestruturas de rede que se adaptam a necessidades específicas de aplicações de rede distintas, além de dar suporte à instanciação de ambientes favoráveis para o desenvolvimento e avaliação de novas arquiteturas e protocolos. Apesar de esforços recentes (motivados principalmente pela busca de mecanismos para avaliar propostas relacionadas à Internet do Futuro) terem contribuído substancialmente para a materialização desse conceito, nenhum preocupou-se em conciliar alocação eficiente de recursos e satisfação de requisitos de segurança (e.g., confidencialidade). É importante ressaltar que, no contexto de redes virtuais, a proteção de infraestruturas de rede compartilhadas constitui condição fundamental para seu uso em larga escala. É de grande importância que o impacto negativo causado pelo aprovisionamento de segurança seja considerado no processo de mapeamento de redes virtuais, de forma a permitir o uso integral dos recursos físicos sem subestimar requisitos de capacidade. Portanto, nesta dissertação, são propostos um modelo ótimo e um al- goritmo heurístico para realizar o mapeamento de redes virtuais em substratos físicos que têm por objetivo otimizar a utilização de recursos físicos garantindo a satisfação de requisitos de segurança. Ambas as abordagens possuem uma modelagem precisa de custos adicionais associados a mecanismos de segurança usados para proteger re- des virtuais, e são capazes de atender requisições de redes virtuais de forma online. Além disso, são apresentados os resultados de um extensivo processo de avaliação realizado, incluindo uma comparação detalhada entre o modelo ótimo e o algoritmo heurístico. Os experimentos revelam que o modelo baseado em Programação Linear Inteira é capaz de alocar redes virtuais de forma ótima em substratos físicos com até cem roteadores, enquanto que o algoritmo heurístico é capaz de adaptar-se a infraestruturas maiores, provendo mapeamentos sub-ótimos em um curto espaço de tempo. / Network virtualization has become increasingly prominent in recent years. It enables the creation of network infrastructures that are specifically tailored to the needs of distinct network applications and supports the instantiation of favorable en- vironments for the development and evaluation of new architectures and protocols. Although recent efforts (motivated mainly by the search for mechanisms to eval- uate Future Internet proposals) have contributed substantially to materialize this concept, none of them has attempted to combine efficient resource mapping with ful- fillment of security requirements (e.g., confidentiality). It is important to note that, in the context of virtual networks, the protection of shared network infrastructures constitutes a fundamental condition to enable its use in large scale. Considering the negative impact of security provisions in the virtual network embedding process is of paramount importance in order to fully utilize physical re- sources without underestimating capacity requirements. Therefore, in this thesis we propose both an optimal model and a heuristic algorithm for embedding virtual networks on physical substrates that aim to optimize physical resource usage while meeting security requirements. Both approaches feature precise modeling of over- head costs of security mechanisms used to protect virtual networks, and are able to handle virtual network requests in an online manner. In addition, we present the results of an extensive evaluation we carried out, including a detailed comparison of both the optimal model and the heuristic algorithm. Our experiments show that the Integer Linear Programming (ILP) model is capable of optimally embedding virtual networks on physical infrastructures with up to a hundred routers, while the heuristic algorithm is capable of scaling to larger infrastructures, providing timely, sub-optimal mappings.

Virtualização permite o compartilhamento de uma rede física entre uma ou mais redes virtuais. O Problema de Mapeamento de Redes Virtuais é um dos principais desafios na virtualização de redes. Esse problema consiste em mapear uma rede virtual em uma rede física, respeitando restrições de capacidade. O presente trabalho mostra que encontrar uma solução factível para esse problema é NP-Difícil. Mesmo assim, muitas instâncias podem ser pode ser resolvidas na prática através da exploração de sua estrutura. Nós apresentamos um algoritmo de Branch & Price aplicado a instâncias de diferentes topologias e tamanhos. Os experimentos realizados sugerem que o algoritmo proposto é superior ao modelo de programação linear resolvido com CPLEX. / Virtualization allows one or more virtual networks to share physical infrastructures. The Virtual Network Embedding problem (VNEP) is one of the main challenges in the virtualization of physical networks. This problem consists in mapping a virtual network into a physical network while respecting capacity constraints. This work shows that finding a feasible solution for this problem is NP-Hard. However, many instances can be solved up to optimality in practice by exploiting the problem structure. We present a Branch & Price algorithm applied to instances of different topologies and sizes. The experimental results suggest that the proposed algorithm is superior to the Integer Linear Programming model solved by CPLEX.