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

Publicações por CRACS

2020

Maximal Spectral Efficiency of OFDM With Index Modulation Under Polynomial Space Complexity

Autores
Queiroz, S; Silva, W; Vilela, JP; Monteiro, E;

Publicação
IEEE WIRELESS COMMUNICATIONS LETTERS

Abstract
In this letter, we demonstrate a mapper that enables all waveforms of OFDM with Index Modulation (OFDM-IM) while preserving polynomial time and space computational complexities. Enabling all OFDM-IM waveforms maximizes the spectral efficiency (SE) gain over the classic OFDM but, as far as we know, the computational overhead of the resulting mapper remains conjectured as prohibitive across the OFDM-IM literature. We show that the largest number of binomial coefficient calculations performed by the original OFDM-IM mapper is polynomial on the number of subcarriers, even under the setup that maximizes the SE gain over OFDM. Also, such coefficients match the entries of the so-called Pascal's triangle (PT). Thus, by assisting the OFDM-IM mapper with a PT table, we show that the maximum SE gain over OFDM can be achieved under polynomial (rather than exponential) time and space complexities.

2020

SDR Testbed of Full-Duplex Jamming for Secrecy

Autores
Silva, A; Gomes, MAC; Vilela, JP; Harrison, WK;

Publicação
2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2020

Abstract
In order to secure wireless communications, we consider the usage of physical-layer security (PLS) mechanisms (i.e. coding for secrecy mechanisms) combined with self-interference generation. We present a prototype implementation of a scrambled coding for secrecy mechanism with interference generation by the legitimate receiver and the cancellation of the effect of self-interference (SI). Regarding the SI cancellation, two algorithms were evaluated: least mean square and recursive least squares. The prototype implementation is performed in real-world software-defined radio (SDR) devices using GNU-Radio. © 2020 IEEE.

2020

Blockchain-based scalable authentication for IoT: Poster abstract

Autores
Mukhandi M.; Andrade E.; Damião F.; Granjal J.; Vilela J.P.;

Publicação
SenSys 2020 - Proceedings of the 2020 18th ACM Conference on Embedded Networked Sensor Systems

Abstract
Device identity management and authentication are one of the critical and primary security challenges in IoT. In order to decrease the IoT attack surface and provide protection from security threats such as introduction of fake IoT nodes and identity theft, IoT requires scalable device identity management systems and resilient device authentication mechanisms. Existing mechanisms for device identity management and device authentication were not designed for huge number of devices and therefore are not suitable for IoT environments. This work presents results of a blockchain-based identity management approach with consensus authentication, as a scalable solution for IoT device authentication management. Our identity management approach relies on having a blockchain secure tamper proof registry and lightweight consensus-based identity authentication.

2020

Bringing Network Coding into SDN: A Case-study for Highly Meshed Heterogeneous Communications

Autores
Cohen, A; Esfahanizadeh, H; Sousa, B; Vilela, JP; Luís, M; Raposo, DMG; Michel, F; Sargento, S; Médard, M;

Publicação
CoRR

Abstract

2019

A Brief Overview on the Strategies to Fight Back the Spread of False Information

Autores
Figueira, A; Guirnaraes, N; Torgo, L;

Publicação
JOURNAL OF WEB ENGINEERING

Abstract
The proliferation of false information on social networks is one of the hardest challenges in today's society, with implications capable of changing users perception on what is a fact or rumor. Due to its complexity, there has been an overwhelming number of contributions from the research community like the analysis of specific events where rumors are spread, analysis of the propagation of false content on the network, or machine learning algorithms to distinguish what is a fact and what is "fake news". In this paper, we identify and summarize some of the most prevalent works on the different categories studied. Finally, we also discuss the methods applied to deceive users and what are the next main challenges of this area.

2019

Preventing Failures by Predicting Students' Grades through an Analysis of Logged Data of Online Interactions

Autores
Cabral, B; Figueira, A;

Publicação
Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, IC3K 2019, Volume 1: KDIR, Vienna, Austria, September 17-19, 2019.

Abstract
Nowadays, students commonly use and are assessed through an online platform. New pedagogy theories that promote the active participation of students in the learning process, and the systematic use of problem-based learning, are being adopted using an eLearning system for that purpose. However, although there can be intense feedback from these activities to students, usually it is restricted to the assessments of the online set of tasks. We propose a model that informs students of abnormal deviations of a “correct” learning path. Our approach is based on the vision that, by obtaining this information earlier in the semester, may provide students and educators an opportunity to resolve an eventual problem regarding the student’s current online actions towards the course. In the major learning management systems available, the interaction between the students and the system, is stored in log. Our proposal uses that logged information, and new one computed by our methodology, such as the time each student spends on an activity, the number and order of resources used, to build a table that a machine learning algorithm can learn from. Results show that our model can predict with more than 86% accuracy the failing situations. Copyright

  • 47
  • 192