Submitted by Irene Nascimento (irene.kessia@ufpe.br) on 2016-08-02T17:28:54Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) 13_06_16_Guillou%2c A.N. - Versão Digital.pdf: 2609027 bytes, checksum: a4392d787b0a41afa298cb89e67877d8 (MD5) / Made available in DSpace on 2016-08-02T17:28:54Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) 13_06_16_Guillou%2c A.N. - Versão Digital.pdf: 2609027 bytes, checksum: a4392d787b0a41afa298cb89e67877d8 (MD5) Previous issue date: 2016-03-01 / capes / A análise da detecção de bordas das margens de grandes reservatórios de água utilizando imagens de diferentes resoluções espaciais, espectrais, radiométricas e temporais, constitui um problema complexo que requer o uso adequado de técnicas de processamento de imagens, a exemplo dos filtros de bordas e fusão de imagens. O desenvolvimento de novas técnicas de análise integrada de imagens orbitais do OLI LANDSAT-8 (Operational Land Imager- Land Remote Sensing Satellite-8), representa uma demanda a ser atendida no processamento de imagens. Um trecho das bordas do reservatório de Itaparica, entre os Estados Pernambuco e Bahia, constitui uma área de estudo para testes e experimentos de detecção de borda de valor estratégico diante da redução e recuo da lâmina de água, afetando a captação, navegação e uso e ocupação do solo ao redor das margens. Esta é a área de estudo do Projeto INNOVATE (INterplay between the multiple use of water reservoirs via inNOVative coupling of substance cycles in Aquatic and Terrestrial Ecosystems), envolvendo estudos sobre a qualidade da água e uso do solo. Como resultado deste trabalho foi realizada a aplicação de uma metodologia de leitura de pixels para a análise do comportamento espectral dos alvos de interesse e assim podendo gerar uma assinatura espectral para avaliar as melhores bandas a serem trabalhadas. Outro resultado obtido foi a análise espacial feita a partir do cálculo da distância Euclidiana, comparando a borda gerada pela segmentação por crescimento de regiões com as bordas geradas a partir da aplicação do filtro de detecção de borda de Sobel. A partir das análises realizadas, percebeu-se uma grande demanda em sensoriamento remoto, visto que os diferentes resultados motivam o estudo por novas pesquisas em busca de resultados mais precisos. / Edge detection analysis of large reservoirs by using images different spatial resolutions, spectral, radiometric and temporal, is a complex problem that requires the proper use of image processing techniques, such as the edges and merging filters images. The development of new techniques for integrated analysis of satellite images from Landsat-8 OLI (Operational Land Imager- Land Remote Sensing Satellite-8) represents a demand to be met in image processing. An excerpt from the Itaparica’s reservoir edge, between Pernambuco and Bahia, is a study area for testing and strategic value of edge detection experiments on the reduction and decrease of water depth, affecting the capture, navigation and use and land use around the edges. This is the study area of INNOVATE Project (Interplay between the multiple use of water reservoirs via innovative coupling of substance cycles in Aquatic and Terrestrial Ecosystems), involving studies on water quality and land use. As a result of this study, it was used a pixel reading methodology for analyzing the spectral behavior of targets of interest and sign may generate a spectral signature to evaluate the best bands to be worked. Another result was the spatial analysis from the calculation of the Euclidean distance, comparing the edge generated by growth targeting regions with the edges generated from the application of Sobel edge detection filter. Through these analyzes, a great demand was realized in remote sensing, since different results motivate new research study by looking for more accurate results.

A roof is a critical envelope of a building. It provides protection for the building interior against various weather elements, such as snow, rain and wind. Roofs are normally composed of several components such as insulation, barriers and water proofing membrane. A roof edge is the perimetric part of a roof that serves as termination for roof components. In generic terms, a roof edge system is composed of a parapet with metal components, such as coping and cleat/clip. The edge system is typically subjected to negative pressure (suction) due to wind flow over the roof. Therefore, a roof edge is the front-line of defence against wind action. To develop testing standards and design guidelines for roof edges, a project referred as REST (Roof Edge Systems and Technologies) has been initiated in cooperation with the NSERC (Natural Sciences and Engineering Research Council). For the REST project, this thesis contributes in two folds: wind design procedure and the development of an experimental method for testing roof edge components. The present thesis analyzes the wind load calculation procedures as per the National Building Code of Canada (NBCC) and American Society of Civil Engineers (ASCE). This has been achieved by taking side-by-side cities along Canada-USA border; wind load calculations were performed to demonstrate the differences and similarities between the NBCC and ASCE. As a part of the current contribution, the existing version of the online Wind-RCI Calculator was updated from NBCC2005 to NBCC2010 provisions. Towards the experimental contribution, the current study presents a new experimental method for testing and evaluating wind uplift resistance of roof edge systems by simulating wind loads in a lab environment on full-scale mock-ups. The test apparatus had a gust simulator device to mimic wind gusting (dynamic loading). This research investigates three widely used edge systems in North America: Continuous Cleat Configuration (CCC), Discontinuous Cleat Configuration (DCC) and Anchor Clip Configuration (ACC). Preliminary data show that CCC edge system has higher resistance in comparison to DCC and ACC edge systems. The experiments also revealed the need for experimental setup enhancement. Additional investigations by using the enhanced experimental setup were performed on both CCC and DCC edge systems.

A graph is an ordered pair composed by a set of vertices and a set of edges, the latter consisting of unordered pairs of vertices. Two vertices in such a pair are each others neighbors. Two edges are adjacent if they share a common vertex. Denote the amount of edges that share a specific vertex as the degree of the vertex. A proper edge-coloring of a graph is an assignment of colors from some finite set, to the edges of a graph where no two adjacent edges have the same color. A bipartition (X,Y) of a set of vertices V is an ordered pair of two disjoint sets of vertices such that V is the union of X and Y, where all the vertices in X only have neighbors in Y and vice versa. A bipartite graph is a graph whose vertices admit a bipartition (X,Y). Let G be one such graph. An X-interval coloring of G is a proper edge coloring where the colors of the edges incident to each vertex in X form an interval of integers. Denote by χ'int(G,X) the least number of colors needed for an X-interval coloring of G. In this paper we prove that if G is a bipartite graph with maximum degree 3n (n is a natural number), where all the vertices in X have degree 3, then <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathit%7B%5Cchi'_%7Bint%7D%5Cleft(G,X%5Cright)%5Cleq%7D%0A%5C%5C%0A%5Cmathit%7B%5Cleft(n-1%5Cright)%5Cleft(3n+5%5Cright)/2+3%7D%0A%5C%5C%0A%5Cmathit%7Bif%20n%20is%20odd,%7D%0A%5C%5C%0A%5Cmathit%7Bor%7D%0A%5C%5C%0A%5Cmathbf%7B3n%5E%7B2%7D/2+1%7D%0A%5C%5C%0A%5Cmathit%7Bif%20n%20is%20even%7D.%0A" />

Cloud Gaming systems are among the most challenging networked-applications, since they deal with streaming high-quality and bulky video in real-time to players’ devices. While all industry solutions today are centralized, we introduce an AI-assisted hybrid networking architecture that, in addition to the central cloud servers, also uses some players’ computing resources as additional points of service. We describe the problem, its mathematical formulation, and potential solution strategy. Edge computing is a promising paradigm that brings servers closer to users, leading to lower latencies and enabling latency-sensitive applications such as cloud gaming, virtual/augmented reality, telepresence, and telecollaboration. Due to the high number of possible edge servers and incoming user requests, the optimum choice of user-server matching has become a difficult challenge, especially in the 5G era where the network can offer very low latencies. In this thesis, we introduce the problem of fair server selection as not only complying with an application's latency threshold but also reducing the variance of the latency among users in the same session. Due to the dynamic and rapidly evolving nature of such an environment and the capacity limitation of the servers, we propose as solution a Reinforcement Learning method in the form of a Quadruple Q-Learning model with action suppression, Q-value normalization, and a reward function that minimizes the variance of the latency. Our evaluations in the context of a cloud gaming application show that, compared to a existing methods, our proposed method not only better meets the application's latency threshold but is also more fair with a reduction of up to 35\% in the standard deviation of the latencies while using the geo-distance, and it shows improvements in fairness up to 18.7\% compared to existing solutions using the RTT delay especially during resource scarcity. Additionally, the RL solution can act as a heuristic algorithm even when it is not fully trained. While designing this solution, we also introduced action suppression, Quadruple Q-Learning, and normalization of the Q-values, leading to a more scalable and implementable RL system. We focus on algorithms for distributed applications and especially esports, but the principles we discuss apply to other domains and applications where fairness can be a crucial aspect to be optimized.

En el entorno actual, como consecuencia del incremento de la emisión de residuos y la falta de atención al cuidado del medio ambiente, se generó el concepto de sostenibilidad, el cual abarca en todos sus términos un consumo responsable de recursos y medidas que disminuyen el impacto ambiental que tienen las actividades económicas en el medio ambiente, tales como la construcción. El término de construcción sostenible se ha generalizado, pero poco se sabe de las certificaciones y ordenanzas vigentes, y de los beneficios económicos, sociales y ambientales que pueden traer consigo. El caso de estudio es el edificio multifamiliar REBEL del GRUPO INMOBILIARIO INMGENIO S.A.C, que se encuentra ubicado en el distrito de San Borja, actualmente la Municipalidad viene haciendo una serie de ordenanzas que fomentan la construcción de edificaciones sostenibles, una de ellas es la Ordenanza Municipal 593, la cual otorgó la bonificación de altura al caso de estudio por haber contado con una precertificación de edificio sostenible. El objetivo de este estudio fue analizar los costos y beneficios que se generan en edificaciones sostenibles con certificación EDGE respecto a una edificación tradicional, defínase como edificación tradicional a toda aquella que no cuente con ningún tipo de certificación sostenible. Para poder realizar el correcto análisis de costos y beneficios del caso de estudio, se analizó el impacto de la implementación de los requerimientos para la certificación en los costos, y con respecto a los beneficios se evaluó la influencia de estos en el incremento de rentabilidad y el valor agregado al proyecto que este pudo generar. / Tesis

Edge Computation aims to bring the functionality of hyperscale datacenters closer to the end-user as to offer reliable low-latency communication through distributed compute power. With the ongoing rise of 5G standalone promis-ing low latency and high capacity, the possibility of running user real-time applications in a distributed setting has never been closer. The focus of this master’s thesis is to analyze and evaluate the limitation and solution alternatives for application state migration, whilst maintaining service continuity. By employing migration strategies and custom application specific methods, this thesis proposes avenues of minimizing application state divergence and viable, distributed Edge Compute specific, modifications of an orchestration system applicable without breaking core functionality.

Mobile phones have evolved from feature phones to smart phones with processing power that can compete with personal computers ten years ago. Nevertheless, the computing power of personal computers has also multiplied in the past decade. Consequently, the gap between mobile platforms and personal computers and servers still exists. Mobile Cloud Computing (MCC) has emerged as a paradigm that leverages this difference in processing power. It achieve this goal by augmenting smart phones with resources from the cloud, including processing power and storage capacity. Recently, Mobile Edge Computing (MEC) has brought the benefits from MCC one hop away from the end user. Furthermore, it also provides additional advantages, e.g., access to network context information, reduced latency, and location awareness. This thesis explores the advantages provided by MEC in practice by augmenting an existing application called Human-Centric Positioning System (HoPS). HoPS is a system that relies on context information and information extracted from a photograph of signposts to estimate a user's location. This thesis presents the challenges of enabling HoPS in practice, and implement strategies that make use of the advantages provided by MEC to tackle the challenges. Afterwards, it presents an evaluation of the resulting system, and discusses the implications of the results. To summarise, we make three primary contributions in this thesis: (1) we find out that it is possible to augment HoPS and improve its response time by a factor of four by offloading the code processing; (2) we can improve the overall accuracy of HoPS by leveraging additional processing power at the MEC; (3) we observe that improved network conditions can lead to reduced response time, nevertheless, the difference becomes insignificant compared with the heavy processing required. / Utvecklingen av mobiltelefoner har skett på en rusande takt. Dagens smartphones har mer processorkraft än vad stationära datorer hade för tio år sen. Samtidigt så har även datorernas processorer blivit mycket starkare. Därmed så finns det fortfarande klyftor mellan mobil plattform och datorer och servrar. Mobile Cloud Computing (MCC) används idag som en hävstång för de olika plattformernas processorkraft. Den uppnår detta genom att förbättra smartphonens processorkraft och datorminne med hjälp från datormolnet. På sistånde så har Mobile Edge Computing (MEC) gjort så att förmånerna med MCC är ett steg ifrån slutanvändaren. Dessutom så finns det andra fördelar med MEC, till exempel tillgång till nätverkssammanhangsinformation, reducerad latens, och platsmedvetenhet. Denna tes utforskar de praktiska fördelarna med MEC genom att använda tillämpningsprogrammet Human-Centric Positioning System (HoPS). HoPS är ett system som försöker att hitta platsen där användaren befinner sig på genom att använda sammanhängande information samt information från bilder med vägvisare. Tesen presenterar även de hinder som kan uppstå när HoPS implementeras i verkligheten, och använder förmåner från MEC för att hitta lösningar till eventuella hinder. Sedan så utvärderar och diskuterar tesen det resulterande systemet. För att sammanfatta så består tesen av tre huvuddelar: (1) vi tar reda på att det är möjligt att förbättra HoPS och minska svarstiden med en fjärdedel genom att avlasta kodsprocessen; (2) vi tar reda på att man kan generellt förbättra HoPS noggrannhet genom att använda den utökade processorkraften från MEC; (3) vi ser att förbättrade nätverksförutsättningar kan leda till minskad svarstid, dock så är skillnaden försumbar jämfört med hur mycket bearbetning av information som krävs.

In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at least twice. The minimum cardinality of a double dominating set of G is the double domination number. A graph G is double domination edge critical if for any edge uv ε E(Ḡ), the double domination number of G + uv is less than the double domination number of G. We investigate double domination edge critical graphs and characterize the trees and cycles having this property. Then we concentrate on double domination edge critical graphs having small double domination numbers. In particular, we characterize the ones with double domination number three and subfamilies of those with double domination number four.

Guaranteeing Quality of Service (QoS) in an (edge-)cloud environment is one of the biggest open problems in the field of cloud computing. Currently, deploy- ment of cloud applications is managed by cloud orchestration systems, such as Kubernetes. These systems make deployment of applications in cloud easier than ever, offering their users the benefits of availability, scalability and resilience. However, at the moment they are not capable of optimizing the deployment of cloud applications with respect to performance QoS metrics, such as response time and throughput. The thesis proposes an approach that provides probabilistic guarantees on the performance QoS metrics in an (edge-)cloud environment. The approach is based on assessing the performance of cloud applications and subsequently controlling their deployment in a way that the applications are deployed only in the environ- ments in which their performance does not violate their QoS requirements. The thesis also presents a proof-of-concept implementation of that approach. The im- plementation verifies the effectiveness of the approach and will serve for further research.

An E-graph is constructed by replacing each edge in a core graph G with a copy of a graph H. An important property of E-graphs is that their invariant values can be determined from parameters of the original graphs G and H. We determine chromatic number, clique number, vertex and edge cover numbers, vertex and edge independence numbers, circumference, and girth of E-graphs. A characterization of hamiltonian E-graphs is also given.