Otimização estocástica para a exploração de centrais de concentração solar considerando incerteza e risco

Dissertação para obtenção do grau de Mestre em Engenharia Eletrotécnica

NoC contention analysis using a branch-and-prune algorithm

“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the traversal time of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.

GPU implementation of a hyperspectral coded aperture algorithm for compressive sensing

This paper presents a new parallel implementation of a previously hyperspectral coded aperture (HYCA) algorithm for compressive sensing on graphics processing units (GPUs). HYCA method combines the ideas of spectral unmixing and compressive sensing exploiting the high spatial correlation that can be observed in the data and the generally low number of endmembers needed in order to explain the data. The proposed implementation exploits the GPU architecture at low level, thus taking full advantage of the computational power of GPUs using shared memory and coalesced accesses to memory. The proposed algorithm is evaluated not only in terms of reconstruction error but also in terms of computational performance using two different GPU architectures by NVIDIA: GeForce GTX 590 and GeForce GTX TITAN. Experimental results using real data reveals signficant speedups up with regards to serial implementation.

Step count algorithm adapted to indoor localization

This paper presents a step count algorithm designed to work in real-time using low computational power. This proposal is our first step for the development of an indoor navigation system, based on Pedestrian Dead Reckoning (PDR). We present two approaches to solve this problem and compare them based in their error on step counting, as well as, the capability of their use in a real time system.

Traveled Distance Estimation Algorithm for Indoor Localization

This paper presents an ankle mounted Inertial Navigation System (INS) used to estimate the distance traveled by a pedestrian. This distance is estimated by the number of steps given by the user. The proposed method is based on force sensors to enhance the results obtained from an INS. Experimental results have shown that, depending on the step frequency, the traveled distance error varies between 2.7% and 5.6%.

Hyperspectral imagery framework for unmixing and dimensionality estimation

In hyperspectral imagery a pixel typically consists mixture of spectral signatures of reference substances, also called endmembers. Linear spectral mixture analysis, or linear unmixing, aims at estimating the number of endmembers, their spectral signatures, and their abundance fractions. This paper proposes a framework for hyperpsectral unmixing. A blind method (SISAL) is used for the estimation of the unknown endmember signature and their abundance fractions. This method solve a non-convex problem by a sequence of augmented Lagrangian optimizations, where the positivity constraints, forcing the spectral vectors to belong to the convex hull of the endmember signatures, are replaced by soft constraints. The proposed framework simultaneously estimates the number of endmembers present in the hyperspectral image by an algorithm based on the minimum description length (MDL) principle. Experimental results on both synthetic and real hyperspectral data demonstrate the effectiveness of the proposed algorithm.

Hyperspectral unmixing algorithm via dependent component analysis

This paper introduces a new method to blindly unmix hyperspectral data, termed dependent component analysis (DECA). This method decomposes a hyperspectral images into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA assumes that each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abudances are modeled as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. The effectiveness of the proposed method is illustrated using simulated data based on U.S.G.S. laboratory spectra and real hyperspectral data collected by the AVIRIS sensor over Cuprite, Nevada.

Burrows-wheeler transform in secondary memory

Master’s Thesis in Computer Engineering

A lightweight distributed super peer election algorithm for unstructured dynamic P2P systems

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Long term follow-up and patterns of response of ALT in patients with chronic hepatitis NANB/C treated with recombinant interferon-alpha

The response to interferon treatment in chronic hepatitis NANB/C has usually been classified as complete, partial or absent, according to the behavior of serum alanine aminotransferase (ALT). However, a more detailed observation of the enzymatic activity has shown that the patterns may be more complex. The aim of this study was to describe the long term follow-up and patterns of ALT response in patients with chronic hepatitis NANB/C treated with recombinant interferon-alpha. A follow-up of 6 months or more after interferon-a was achieved in 44 patients. We have classified the serum ALT responses into six patterns and the observed frequencies were as follows: I. Long term response = 9 (20.5%); II. Normalization followed by persistent relapse after IFN = 7 (15.9%); III. Normalization with transient relapse = 5 (11.9%); IV. Temporary normalization and relapse during IFN = 4 (9.1%); V. Partial response (more than 50% of ALT decrease) = 7 (15.9%); VI. No response = 12 (27.3%). In conclusion, ALT patterns vary widely during and after IFN treatment and can be classified in at least 6 types.

Spatial metrics and Landsat data for urban landuse change detection: case of Addis Ababa, Ethiopia.

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

Expatriates recruitment and selection for long-term international assignments in portuguese companies

Long-term international assignments’ increase requires more attention being paid for the preparation of these foreign assignments, especially on the recruitment and selection process of expatriates. This article explores how the recruitment and selection process of expatriates is developed in Portuguese companies, examining the main criteria on recruitment and selection of expatriates’ decision to send international assignments. The paper is based on qualitative case studies of companies located in Portugal. The data were collected through semi-structured interviews of 42 expatriates and 18 organisational representatives as well from nine Portuguese companies. The findings show that the most important criteria are: (1) trust from managers, (2) years in service, (3) previous technical and language competences, (4) organisational knowledge and, (5) availability. Based on the findings, the article discusses in detail the main theoretical and managerial implications. Suggestions for further research are also presented.

Short-term Wind Forecasting to Support Virtual Power Player Operation

This paper proposes a wind speed forecasting model that contributes to the development and implementation of adequate methodologies for Energy Resource Man-agement in a distribution power network, with intensive use of wind based power generation. The proposed fore-casting methodology aims to support the operation in the scope of the intraday resources scheduling model, name-ly with a time horizon of 10 minutes. A case study using a real database from the meteoro-logical station installed in the GECAD renewable energy lab was used. A new wind speed forecasting model has been implemented and it estimated accuracy was evalu-ated and compared with a previous developed forecast-ing model. Using as input attributes the information of the wind speed concerning the previous 3 hours enables to obtain results with high accuracy for the wind short-term forecasting.

Short-term Load Forecasting Based on Load Profiling

Load forecasting has gradually becoming a major field of research in electricity industry. Therefore, Load forecasting is extremely important for the electric sector under deregulated environment as it provides a useful support to the power system management. Accurate power load forecasting models are required to the operation and planning of a utility company, and they have received increasing attention from researches of this field study. Many mathematical methods have been developed for load forecasting. This work aims to develop and implement a load forecasting method for short-term load forecasting (STLF), based on Holt-Winters exponential smoothing and an artificial neural network (ANN). One of the main contributions of this paper is the application of Holt-Winters exponential smoothing approach to the forecasting problem and, as an evaluation of the past forecasting work, data mining techniques are also applied to short-term Load forecasting. Both ANN and Holt-Winters exponential smoothing approaches are compared and evaluated.

Stochastic Short-term Incentive-based Demand Response Scheduling of Load-serving Entities

In competitive electricity markets it is necessary for a profit-seeking load-serving entity (LSE) to optimally adjust the financial incentives offering the end users that buy electricity at regulated rates to reduce the consumption during high market prices. The LSE in this model manages the demand response (DR) by offering financial incentives to retail customers, in order to maximize its expected profit and reduce the risk of market power experience. The stochastic formulation is implemented into a test system where a number of loads are supplied through LSEs.