Monografias em Ciência da Computação

2021

ABSTRACTS

Departmento de Informática 
Pontifícia Universidade Católica do Rio de Janeiro - PUC-Rio
Rio de Janeiro - Brazil


This file contains a list of the technical reports of the Departmento de Informática, Pontifícia Universidade Católica do Janeiro - PUC-Rio, Brazil, which are published in our series Monografias em Ciência da Computação (ISSN 0103-9741). The serie scientific editor is Prof. Carlos Lucena and Rosane Castilho is it's technical editor. Please note that the reports not available for download are available in their print format and can be obtained via the e-mail below.
For any questions, requests or suggestions, please contact:
publicar@inf.puc-rio.br

Last update: 25/AUGUST/2021

INDEX


[MCC01/21]
SANTOS, R.; RODRIGUEZ, N. L.; IERUSALIMSCHY, R. Events in the MPA system. April, 2021. 9 p. Eng.  E-mail: roberto@inf.puc-rio.br

Abstract: Implementing the event-driven paradigm is most commonly done using event loops. In this study, we give an overview of the concepts surrounding the paradigm and discuss the problems of having multiple event loops and the difficulties presented by blocking operations in an event based system. We then present the MPA system, a software used for industrial automation, and debate the usage of events in its applications.

[MCC02/21] [DOI Biblioteca Digital PUC-Rio]
BRANCO, A.; RODRIGUEZ, N. L.; ROSSETTO, S. A virtual machine for reactive programming on IoT devices. July, 2021. 22 p. Eng.  E-mail: noemi@inf.puc-rio.br

Abstract: A large range of Internet of Things (IoT) applications use small embedded devices, combining a resource-constrained microcontroller (MCU) with a radio for wireless communication and, possibly, some sensor and actuators. Computational and memory limitations restrict the approach of creating different layers of abstractions used for conventional operating systems and libraries. The event-driven execution nature of these systems provides opportunities to save battery power, but at the cost of increasing programming complexity. A reactive programming language facilitates the development of event-driven systems in which tasks are associated with incoming events. The Terra system combines the use of ready-made, safe, components with a reactive scripting language, Ceu-T. In this paper we present details of the Terra virtual machine, discussing its ´ design for resource constrained devices. We describe how the virtual machine supports the synchronous reactive programming model of Ceu-T, which triggers the execution of ´ pending trails in response to external events, and how it implements the integration of the scripting language with specialized sets of components.

[MCC03/21] [DOI Biblioteca Digital PUC-Rio]
ALMEIDA, D. F.; KALINOWSKI, M. On psychometric instruments in software engineering research: an ongoing study. August, 2021. 27 p. Eng.  E-mail: kalinowski@inf.puc-rio.br

Abstract: Although software development is an inherently human activity, research in software engineering (SE) has long focused mostly on processes and tools, failing to recall about the human factors behind. Even when explored, researchers typically do not properly use psychology background to better understand human factors in SE, such as the psychometric instruments, which aim to measure human factors. Our goal is to provide a critical review on the use of psychometric instruments in SE research regarding personality. We present a two-step study. First, a systematic mapping of the literature in order to generate a catalog of the psychometric instruments used; second, a preliminary survey to be conducted with social sciences researchers to assess their adoption in SE research. The results so far are quite initial. The next steps direct us to finish the data extraction to finalize the catalog (systematic mapping) and to refine the survey design and apply it with social sciences researchers.

[MCC04/21]
GARCIA, A.; HAEUSLER, H. E. An extension to the minimal grammar problem. September, 2021. 16 p. Eng.  E-mail: hermann@inf.puc-rio.br

Abstract: The smallest grammar problem consists of finding the smallest CFG that generates only a given string. This is an NP-hard problem, and there are various heuristics to solve it described in the literature. In this paper, we propose an extension to this problem, allowing the grammars to have a reverse operator and a complement operator. We argue that the heuristics used to find approximate solutions to the smallest grammar problem can be easily adapted to these extensions. Experiments confirm that these extensions perform better than plain CFGs when applied to virus genome compression.

[MCC05/21]
DUARTE, J. C.; COLCHER, S. Building a noisy audio dataset to evaluate machine learning approaches for automatic speech recognition systems. September, 2021. 17 p. Eng.  E-mail: colcher@inf.puc-rio.br

Abstract: Automatic speech recognition systems are part of people’s daily lives, embedded in personal assistants and mobile phones, helping as a facilitator for human-machine interaction while allowing access to information in a practically intuitive way. Such systems are usually implemented using machine learning techniques, especially with deep neural networks. Even with its high performance in the task of transcribing text from speech, few works address the issue of its recognition in noisy environments and, usually, the datasets used do not contain noisy audio examples, while only mitigating this issue using data augmentation techniques. This work aims to present the process of building a dataset of noisy audios, in a specific case of degenerated audios due to interference, commonly present in radio transmissions. Additionally, we present initial results of a classifier that uses such data for evaluation, indicating the benefits of using this dataset in the recognizer’s training process. Such recognizer achieves an average result of 0.4116 in terms of character error rate in the noisy set (SNR = 30).

[MCC06/21]
BORGES, L.; PEREIRA, V.; MAGALHÃES, P.; LIMA, F.; ENDLER, M. Estudo de algoritmos distribuídos na prática: exemplos e comparações. November, 2021. 32 p. Por.  E-mail: endler@inf.puc-rio.br

Abstract: This text presents examples of the use of distributed algorithms in several application areas - to solve very specific problems of coordination and communication between distributed instances - followed by a discussion of the advantages and limitations of the solutions. We hope that this tech report will contribute to a broader understanding of interesting distributed problems and the proposed solutions, as well as to a better understanding of the possible applications. And the relevance and actuality of these algorithms in the realization of global computational systems, increasingly connected and complex.