Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

2023

Automatic characterisation of Dansgaard-Oeschger events in palaeoclimate ice records

Autores
Barbosa, S; Silva, ME; Dias, N; Rousseau, D;

Publicação

Abstract
Greenland ice core records display abrupt transitions, designated as Dansgaard-Oeschger (DO) events, characterised by episodes of rapid warming (typically decades) followed by a slower cooling. The identification of abrupt transitions is hindered by the typical low resolution and small size of paleoclimate records, and their significant temporal variability. Furthermore, the amplitude and duration of the DO events varies substantially along the last glacial period, which further hinders the objective identification of abrupt transitions from ice core records Automatic, purely data-driven methods, have the potential to foster the identification of abrupt transitions in palaeoclimate time series in an objective way, complementing the traditional identification of transitions by visual inspection of the time series.In this study we apply an algorithmic time series method, the Matrix Profile approach, to the analysis of the NGRIP Greenland ice core record, focusing on:- the ability of the method to retrieve in an automatic way abrupt transitions, by comparing the anomalies identified by the matrix profile method with the expert-based identification of DO events;- the characterisation of DO events, by classifying DO events in terms of shape and identifying events with similar warming/cooling temporal patternThe results for the NGRIP time series show that the matrix profile approach struggles to retrieve all the abrupt transitions that are identified by experts as DO events, the main limitation arising from the diversity in length of DO events and the method’s dependence on fixed-size sub-sequences within the time series. However, the matrix profile method is able to characterise the similarity of shape patterns between DO events in an objective and consistent way.

2023

A Review on the Video Summarization and Glaucoma Detection

Autores
Correia, T; Cunha, A; Coelho, P;

Publicação
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

Abstract
Glaucoma is a severe disease that arises from low intraocular pressure, it is asymptomatic in the initial stages and can lead to blindness, due to its degenerative characteristic. There isn’t any available cure for it, and it is the second most common cause of blindness in the world. Regular visits to the ophthalmologist are the best way to prevent or contain it, with a precise diagnosis performed with professional equipment. From another perspective, for some individuals or populations, this task can be difficult to accomplish, due to several restrictions, such as low incoming resources, geographical adversities, and traveling restrictions (distance, lack of means of transportation, etc.). Also, logistically, due to its dimensions, relocating the professional equipment can be expensive, thus becoming inviable to bring them to remote areas. As an alternative, some low-cost products are available in the market that copes with this need, namely the D-Eye lens, which can be attached to a smartphone and enables the capture of fundus images, presenting as major drawback lower quality imaging when compared to professional equipment. Some techniques rely on video capture to perform summarization and build a full image with the desired features. In this context, the goal of this paper is to present a review of the methods that can perform video summarization and methods for glaucoma detection, combining both to indicate if individuals present glaucoma symptoms, as a pre-screening approach. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

2023

Flexibility Modeling and Trading in Renewable Energy Communities

Autores
Agrela, J; Rezende, I; Soares, T; Gouveia, C; Silva, R; Villar, J;

Publicação
2023 19TH INTERNATIONAL CONFERENCE ON THE EUROPEAN ENERGY MARKET, EEM

Abstract
This work presents an approach to the flexibility of energy consumption in Renewable Energy Communities (RECs). A two-stage model for quantifying the flexibility provided by the domestic energy resources operation and its negotiation in a market platform is proposed. In stage 1, the optimal consumption of each prosumer is determined, as well as the respective technical flexibility of their resources, namely the maximum and minimum resource operation limits. In stage 2, this technical flexibility is offered in a local flexibility-only market structure, in which both the DSO and the prosumers can present their flexibility needs and requirements. The flexibility selling and buying bids of the prosumers participating in the market are priced based on their base tariff, which is the energy cost of the prosumers corresponding to their optimal schedule of the first stage when no flexibility is provided. Therefore, providing flexibility is an incentive to reduce their energy bill or increase their utility, encouraging their participation in the local flexibility market.

2023

An introduction to the two-dimensional rectangular cutting and packing problem

Autores
Oliveira, O; Gamboa, D; Silva, E;

Publicação
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH

Abstract
Cutting and packing problems have been widely studied in the last decades, mainly due to the variety of industrial applications where the problems emerge. This paper presents an overview of the solution approaches that have been proposed for solving two-dimensional rectangular cutting and packing problems. The main emphasis of this work is on two distinct problems that belong to the cutting and packing problem family. The first problem aims to place onto an object the maximum-profit subset of items, that is, output maximization, while the second one aims to place all the items using as few identical objects as possible, that is, input minimization. The objective of this paper is not to be exhaustive but to provide a solid grasp on two-dimensional rectangular cutting and packing problems by describing their most important solution approaches.

2023

Markov-Based Neural Networks for Heart Sound Segmentation: Using Domain Knowledge in a Principled Way

Autores
Martins, ML; Coimbra, MT; Renna, F;

Publicação
IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS

Abstract
This work considers the problem of segmenting heart sounds into their fundamental components. We unify statistical and data-driven solutions by introducing Markov-based Neural Networks (MNNs), a hybrid end-toend framework that exploits Markov models as statistical inductive biases for an Artificial Neural Network (ANN) discriminator. We show that an MNN leveraging a simple onedimensional Convolutional ANN significantly outperforms two recent purely data-driven solutions for this task in two publicly available datasets: PhysioNet 2016 (Sensitivity: 0.947 +/- 0.02; Positive Predictive Value : 0.937 +/- 0.025) and the CirCor DigiScope 2022 (Sensitivity: 0.950 +/- 0.008; Positive Predictive Value: 0.943 +/- 0.012). We also propose a novel gradient-based unsupervised learning algorithm that effectively makes the MNN adaptive to unseen datum sampled from unknown distributions. We perform a cross dataset analysis and show that an MNN pre-trained in the CirCor DigiScope 2022 can benefit from an average improvement of 3.90% Positive Predictive Value on unseen observations from the PhysioNet 2016 dataset using this method.

2023

Bayesian Federated Learning: A Survey

Autores
Cao, LB; Chen, H; Fan, XH; Gama, J; Ong, YS; Kumar, V;

Publicação
PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023

Abstract
Federated learning (FL) demonstrates its advantages in integrating distributed infrastructure, communication, computing and learning in a privacy-preserving manner. However, the robustness and capabilities of existing FL methods are challenged by limited and dynamic data and conditions, complexities including heterogeneities and uncertainties, and analytical explainability. Bayesian federated learning (BFL) has emerged as a promising approach to address these issues. This survey presents a critical overview of BFL, including its basic concepts, its relations to Bayesian learning in the context of FL, and a taxonomy of BFL from both Bayesian and federated perspectives. We categorize and discuss client- and server-side and FLbased BFL methods and their pros and cons. The limitations of the existing BFL methods and the future directions of BFL research further address the intricate requirements of real-life FL applications.

  • 485
  • 4357