Abstract
Looking for health information is one of the most popular activities online. However, the specificity of language on this domain is frequently an obstacle to comprehension, especially for the ones with lower levels of health literacy. For this reason, search engines should consider the readability of health content and, if possible, adapt it to the user behind the search. In this work, we explore methods to assess the readability of health content automatically. We propose features capable of measuring the specificity of a medical text and estimate the knowledge necessary to comprehend it. The features are based on information retrieval metrics and the log-likelihood of a text with lay and medico-scientific language models. To evaluate our methods, we built and used a dataset composed of health articles of Simple English Wikipedia and the respective documents in ordinary Wikipedia. We achieved a maximum accuracy of 88% in binary classifications (easy versus hard-to-read). We found out that the machine learning algorithm does not significantly interfere with performance. We also experimented and compared different features combinations. The features using the values of the log-likelihood of a text with lay and medico-scientific language models perform better than all the others.

Abstract
Research data management is the basis for making data more Findable, Accessible, Interoperable and Reusable. In this context, little attention is given to research data in image format. This article presents the preliminary results of a study on the habits related to the management of images in research. We collected 107 answers from researchers using a questionnaire. These researchers were PhD students, fellows and university professors from Life and Health Sciences, Exact Sciences and Engineering, Natural and Environmental Sciences and Social Sciences and Humanities. This study shows that 83.2% of researcher use images as research data, however, its use is generally not accompanied by a guidance document such as a research data management plan. These results provide valuable insights into the processes and habits regarding the production and use of images in the research context. © 2020, Springer Nature Switzerland AG.

Abstract
Application execution required in cloud and fog architectures are generally heterogeneous in terms of device and application contexts. Scaling these requirements on these architectures is an optimization problem with multiple restrictions. Despite countless efforts, task scheduling in these architectures continue to present some enticing challenges that can lead us to the question how tasks are routed between different physical devices, fog nodes and cloud. In fog, due to its density and heterogeneity of devices, the scheduling is very complex and in the literature, there are still few studies that have been conducted. However, scheduling in the cloud has been widely studied. Nonetheless, many surveys address this issue from the perspective of service providers or optimize application quality of service (QoS) levels. Also, they ignore contextual information at the level of the device and end users and their user experiences. In this paper, we conducted a systematic review of the literature on the main task by: scheduling algorithms in the existing cloud and fog architecture; studying and discussing their limitations, and we explored and suggested some perspectives for improvement.

Abstract
Escalonamento na arquitetura cloud e no paradigma fog continuam a apresentar alguns desafios aliciantes. Na cloud, segundo o conhecimento dos autores, ela é amplamente estudada e em muitas pesquisas é abordada na perspetiva de provedores de serviço. Na fog, é muito complexo e, existem poucos estudos. Procurando trazer contributos inovadores nas áreas de escalonamento de tarefas, neste artigo, propomos uma solução para o problema de escalonamento de aplicações móveis sensíveis ao contexto para o paradigma fog computing onde diferentes parâmetros de contexto são normalizados através da normalização Min-Max, as prioridades são definidas através da aplicação da técnica da Regressão Linear Múltipla (RLM) e o escalonamento é feito recorrendo a técnica de Otimização de Programação Não Linear Multi-objetivo (MONLP).;Scheduling in cloud architecture and in the fog paradigm continue to present some exciting challenges. In the cloud, according to the authors' knowledge, it is widely studied and in many researches, it is addressed from the perspective of service providers. In fog, it is very complex and there are few studies. Trying to bring innovative contributions in the areas of task scheduling, in this paper we propose a solution to the problem of context-aware scheduling of mobile applications for the fog computing paradigm, where different context parameters are normalized through Min-Max normalization, priorities are defined by applying the Multiple Linear Regression (MLR) technique and scheduling is performed using Multi-Objective Nonlinear Programming Optimization (MONLP) technique.

Abstract
The resource-constrained project scheduling problem (RCPSP) is one of the most studied problems in the project scheduling literature, and aims at constructing a project schedule with a minimum makespan that satisfies both the precedence relations of the network and the limited availability of the renewable resources. The problem has attracted attention due to its NP hardness status, and different algorithms have been proposed that solve a wide variety of RCPSP instances to optimality or near-optimality. In this paper, we analyse the hardness of this problem from an experimental point-of-view by testing different algorithms on a huge set of existing instances and detect which ones are difficult to solve. To that purpose, we propose a three-phased approach that makes use of five elementary blocks, well-performing algorithms and a huge amount of computational power to transform easy RCPSP instances into very hard ones. The purpose of this study is to create insight and understanding into what makes an RCPSP instance hard, and propose a new dataset that consists of a small set of instances that are impossible to solve with the algorithms currently existing in the literature. These instances should be as small as possible in terms of number of activities and resources, and should be as diverse as possible in terms of network structure and resource strictness. Such a dataset should enable researchers to focus their attention on the development of radically new algorithms to solve the RCPSP rather than gradually improving current algorithms that can solve the existing RCPSP instances only slightly better.

Abstract
The exchange of academic marks between HEIs (Higher Education Institutions) is mandatory in every student mobility programs (i.e. the EU Erasmus Program) but that process remains to present date with insufficient technological support and the absence of a comprehensive reference model that allows the integration of potential technological solutions for the exchange of academic data with existing Academic Information Systems seems to limit greatly the possibility of adopting solutions of this type referred to in the existing literature. This work addresses this issue, conducting an initial bibliographic review aimed at the identification of the fundamental requirements of such an architecture as well as explores some of the technologies that are showing potential for usage in the safe exchange of academic results between partner HEIs, with particular interest in blockchain technology applied in an educational context.