951 resultados para Distributed space-time code


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This article proposes a methodology to address the urban evolutionary process, demonstrating how it is reflected in literature. It focuses on “literary space,” presented as a territory defined by the period setting or as evoked by the characters, which can be georeferenced and drawn on a map. It identifies the different locations of literary space in relation to urban development and the economic, political, and social context of the city. We suggest a new approach for mapping a relatively comprehensive body of literature by combining literary criticism, urban history, and geographic information systems (GIS). The home-range concept, used in animal ecology, has been adapted to reveal the size and location of literary space. This interdisciplinary methodology is applied in a case study to nineteenth- and twentieth-century novels involving the city of Lisbon. The developing concepts of cumulative literary space and common literary space introduce size calculations in addition to location and structure, previously developed by other researchers. Sequential and overlapping analyses of literary space throughout time have the advantage of presenting comparable and repeatable results for other researchers using a different body of literary works or studying another city. Results show how city changes shaped perceptions of the urban space as it was lived and experienced. A small core area, correspondent to a part of the city center, persists as literary space in all the novels analyzed. Furthermore, the literary space does not match the urban evolution. There is a time lag for embedding new urbanized areas in the imagined literary scenario.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Thesis submitted in fulfilment of the requirements for the Degree of Master of Science in Computer Science

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Eradication of code smells is often pointed out as a way to improve readability, extensibility and design in existing software. However, code smell detection remains time consuming and error-prone, partly due to the inherent subjectivity of the detection processes presently available. In view of mitigating the subjectivity problem, this dissertation presents a tool that automates a technique for the detection and assessment of code smells in Java source code, developed as an Eclipse plugin. The technique is based upon a Binary Logistic Regression model that uses complexity metrics as independent variables and is calibrated by expert‟s knowledge. An overview of the technique is provided, the tool is described and validated by an example case study.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Product fundamentals are essential in explaining heterogeneity in the product space. The scope for adapting and transferring capabilities into the production of different goods determines the speed and intensity of the structural transformation process and entails dissimilar development opportunities for nations. Future specialization patterns become then partly determined by the current network of products’ relatedness. Building on previous literature, this paper explicitly compares methodological concepts of product connectivity to conclude in favor of the density measure we propose combined with the Revealed Relatedness Index (RRI) approach presented by Freitas and Salvado (2011). Overall, RRI specifications displayed more consistent behavior when different time horizons are equated.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Existing wireless networks are characterized by a fixed spectrum assignment policy. However, the scarcity of available spectrum and its inefficient usage demands for a new communication paradigm to exploit the existing spectrum opportunistically. Future Cognitive Radio (CR) devices should be able to sense unoccupied spectrum and will allow the deployment of real opportunistic networks. Still, traditional Physical (PHY) and Medium Access Control (MAC) protocols are not suitable for this new type of networks because they are optimized to operate over fixed assigned frequency bands. Therefore, novel PHY-MAC cross-layer protocols should be developed to cope with the specific features of opportunistic networks. This thesis is mainly focused on the design and evaluation of MAC protocols for Decentralized Cognitive Radio Networks (DCRNs). It starts with a characterization of the spectrum sensing framework based on the Energy-Based Sensing (EBS) technique considering multiple scenarios. Then, guided by the sensing results obtained by the aforementioned technique, we present two novel decentralized CR MAC schemes: the first one designed to operate in single-channel scenarios and the second one to be used in multichannel scenarios. Analytical models for the network goodput, packet service time and individual transmission probability are derived and used to compute the performance of both protocols. Simulation results assess the accuracy of the analytical models as well as the benefits of the proposed CR MAC schemes.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The present work aims to develop the theme "The summary procedure and the reform of 2013". The purpose of its analysis serves the interest to understand the virtues and disadvantages of the changes introduced by Act n.º 20/2013 to our Code of Criminal Procedure, and the main focus of the present reflection is to further the impact of the measures taken by the legislator to the summary proceedings. The opening of the most serious crimes to summary procedure is a reform measure duly highlighted because it is a true innovation in the Portuguese penal system. Therefore, it urges to analyse not only the consequences of this measure, as well as if the objectives of its introduction in the summary procedure system are met. It should be noted that the legislator intends to promote speedy trial, and at the same time, ensure compliance with the Constitutional rights associated to the accused. At this point it is important to realize if there is a restriction of the accused essential guarantees. On the other hand, it should be noted that the typical characteristics of summary proceedings might have been invariably modified, due to the innovative aspect of the reform. That said, the changes might have fostered a mischaracterization of the typical format of the summary procedure, both in terms of the nature of the proceedings and in terms of its space and objectives within the penal system. Reflecting on the above will provide a deeper understanding of the volatile balance between the Portuguese governing prosecution efficiency and the Constitution, as well as the future of the criminal policy in Portugal.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This work was supported by FCT (Fundação para a Ciência e Tecnologia) within Project Scope (UID/CEC/00319/2013), by LIP (Laboratório de Instrumentação e Física Experimental de Partículas) and by Project Search-ON2 (NORTE-07-0162- FEDER-000086), co-funded by the North Portugal Regional Operational Programme (ON.2 - O Novo Norte), under the National Strategic Reference Framework, through the European Regional Development Fund.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação de Mestrado em Engenharia Informática

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação de Mestrado em Engenharia Informática

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this work we perform a comparison of two different numerical schemes for the solution of the time-fractional diffusion equation with variable diffusion coefficient and a nonlinear source term. The two methods are the implicit numerical scheme presented in [M.L. Morgado, M. Rebelo, Numerical approximation of distributed order reaction- diffusion equations, Journal of Computational and Applied Mathematics 275 (2015) 216-227] that is adapted to our type of equation, and a colocation method where Chebyshev polynomials are used to reduce the fractional differential equation to a system of ordinary differential equations

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Tese de Doutoramento em Ciência e Engenharia de Polímeros e Compósitos

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Tese de Doutoramento em Engenharia Eletrónica e Computadores.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Distributed data aggregation is an important task, allowing the de- centralized determination of meaningful global properties, that can then be used to direct the execution of other applications. The resulting val- ues result from the distributed computation of functions like count, sum and average. Some application examples can found to determine the network size, total storage capacity, average load, majorities and many others. In the last decade, many di erent approaches have been pro- posed, with di erent trade-o s in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of ag- gregation algorithms, it can be di cult and time consuming to determine which techniques will be more appropriate to use in speci c settings, jus- tifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally de nes the concept of aggrega- tion, characterizing the di erent types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

An appropriate assessment of end-to-end network performance presumes highly efficient time tracking and measurement with precise time control of the stopping and resuming of program operation. In this paper, a novel approach to solving the problems of highly efficient and precise time measurements on PC-platforms and on ARM-architectures is proposed. A new unified High Performance Timer and a corresponding software library offer a unified interface to the known time counters and automatically identify the fastest and most reliable time source, available in the user space of a computing system. The research is focused on developing an approach of unified time acquisition from the PC hardware and accordingly substituting the common way of getting the time value through Linux system calls. The presented approach provides a much faster means of obtaining the time values with a nanosecond precision than by using conventional means. Moreover, it is capable of handling the sequential time value, precise sleep functions and process resuming. This ability means the reduction of wasting computer resources during the execution of a sleeping process from 100% (busy-wait) to 1-1.5%, whereas the benefits of very accurate process resuming times on long waits are maintained.