Mapeamento do uso e cobertura da terra a partir da segmentação e classificação de imagens-fração solo, sombra e vegetação derivadas do modelo linear de mistura aplicado a dados do sensor TM/Landsat5, na região do reservatório de Tucuruí - PA

Técnicas de sensoriamento remoto são fundamentais para o monitoramento das mudanças de uso da terra, principalmente em áreas extensas como a Amazônia. O mapeamento de uso da terra, geralmente é realizado por métodos de classificação manual ou digital pixel a pixel, os quais consomem muito tempo. Este estudo aborda a aplicação do modelo linear de mistura em uma imagem Landsat-TM segmentada para o mapeamento das classes de uso da terra na região do reservatório de Tucuruí-PA para os anos de 1996 e 2001.

Detecção de cicatrizes de áreas queimadas baseada no modelo linear de mistura espectral e imagens índice de vegetação utilizando dados multitemporais do sensor MODIS/TERRA no estado do Mato Grosso, Amazônia brasileira

O objetivo desta pesquisa foi avaliar os dados do sensor MODIS para detectar e monitorar cicatrizes de áreas recém queimadas. Utilizamos imagens da reflectância de superfície do sensor MODIS: produto MOD09 (dia 5 de outubro) e produto MOD13A1 (meses de outubro e novembro). Foi avaliada também uma série temporal de um ano dos índices de vegetação (IV) EVI e NDVI (produto MOD13A1). Uma imagem do sensor ETM+ (dia 5 de outubro) foi utilizada como base para a delimitação dos polígonos amostrais e avaliação dos dados MODIS devido a sua melhor resolução espacial. A metodologia focou na aplicação do modelo linear de mistura espectral nas imagens reflectância para a geração das imagens fração sombra. Análises de regressão foram efetuadas para comparação entre o percentual de sombra derivado da imagem ETM+ e das imagens MODIS. As alterações multitemporais nas imagens IV foram avaliadas com base no teste de Tukey. Os resultados mostraram que a imagem fração sombra gerada a partir do produto MOD09 apresentou um R² = 0,66 (p < 0,01) em relação aos dados ETM+. Para as imagens do produto MOD13A1 não foram identificadas relações significativas. Os IV dentro dos mesmos polígonos apresentaram uma variação sazonal durante o ano. No entanto, não houve uma diminuição significativa dos valores destes índices nos meses onde foram observadas as cicatrizes de áreas recém queimadas. Portanto, o produto MOD09 mostrou-se mais eficiente que o produto MOD13A1 para a detecção de cicatrizes de áreas recém queimadas. A análise multitemporal dos IV sugeriu que não foi possível detectar este mesmo padrão na área de estudo.

Otimização com restrições de complementaridade: algoritmos e aplicações

Tese de Doutoramento em Engenharia Industrial e de Sistemas (PDEIS)

Logic programming and artificial neural networks in breast cancer detection

About 90% of breast cancers do not cause or are capable of producing death if detected at an early stage and treated properly. Indeed, it is still not known a specific cause for the illness. It may be not only a beginning, but also a set of associations that will determine the onset of the disease. Undeniably, there are some factors that seem to be associated with the boosted risk of the malady. Pondering the present study, different breast cancer risk assessment models where considered. It is our intention to develop a hybrid decision support system under a formal framework based on Logic Programming for knowledge representation and reasoning, complemented with an approach to computing centered on Artificial Neural Networks, to evaluate the risk of developing breast cancer and the respective Degree-of-Confidence that one has on such a happening.

Modelos de apoio às decisão na conceção e planeamento de um armazém

Programa Doutoral em Engenharia Industrial e de Sistemas.

Electronic transport across linear defects in graphene

We investigate the low-energy electronic transport across grain boundaries in graphene ribbons and infinite flakes. Using the recursive Green’s function method, we calculate the electronic transmission across different types of grain boundaries in graphene ribbons. We show results for the charge density distribution and the current flow along the ribbon. We study linear defects at various angles with the ribbon direction, as well as overlaps of two monolayer ribbon domains forming a bilayer region. For a class of extended defect lines with periodicity 3, an analytic approach is developed to study transport in infinite flakes. This class of extended grain boundaries is particularly interesting, since the K and K0 Dirac points are superposed.

Um modelo de programação inteira para a otimização da distribuição do serviço docente

Dissertação de mestrado em Engenharia Industrial

Wear of PEEK-Ti6Al4V systems under micro-abrasion and linear sliding conditions

Dissertação de mestrado integrado em Engenharia Biomédica

Desenvolvimento e otimização do projeto mecatrónico para um Tribómetro Linear

Dissertação de mestrado integrado em Engenharia Mecânica

Automatização e otimização do escalonamento de pessoal hospitalar

Dissertação de mestrado em Engenharia de Sistemas

Single line for assembly just-in-sequence multiple models

Programa Doutoral em Líderes para as Indústrias Tecnológicas

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.

Towards the design and implementation of aspect-oriented programming for spreadsheets

A spreadsheet usually starts as a simple and singleuser software artifact, but, as frequent as in other software systems, quickly evolves into a complex system developed by many actors. Often, different users work on different aspects of the same spreadsheet: while a secretary may be only involved in adding plain data to the spreadsheet, an accountant may define new business rules, while an engineer may need to adapt the spreadsheet content so it can be used by other software systems.Unfortunately,spreadsheetsystemsdonotoffermodular mechanisms, and as a consequence, some of the previous tasks may be defined by adding intrusive “code” to the spreadsheet. In this paper we go through the design and implementation of an aspect-oriented language for spreadsheets so that users can work on different aspects of a spreadsheet in a modular way. For example, aspects can be defined in order to introduce new business rules to an existing spreadsheet, or to manipulate the spreadsheet data to be ported to another system. Aspects are defined as aspect-oriented program specifications that are dynamically woven into the underlying spreadsheet by an aspect weaver. In this aspect-oriented style of spreadsheet development, differentusers develop,orreuse,aspects withoutaddingintrusive code to the original spreadsheet. Such code is added/executed by the spreadsheet weaving mechanism proposed in this paper.

A study of risk-aware program transformation

In the trend towards tolerating hardware unreliability, accuracy is exchanged for cost savings. Running on less reliable machines, functionally correct code becomes risky and one needs to know how risk propagates so as to mitigate it. Risk estimation, however, seems to live outside the average programmer’s technical competence and core practice. In this paper we propose that program design by source-to-source transformation be risk-aware in the sense of making probabilistic faults visible and supporting equational reasoning on the probabilistic behaviour of programs caused by faults. This reasoning is carried out in a linear algebra extension to the standard, `a la Bird-Moor algebra of programming. This paper studies, in particular, the propagation of faults across standard program transformation techniques known as tupling and fusion, enabling the fault of the whole to be expressed in terms of the faults of its parts.

Metaphorisms in programming

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.