Abstract
We present RAMBLE(1), a framework for georeferenced content-sharing in environments that have limited infrastructural communications, as is the case for rescue operations in the aftermath of natural disasters. RAMBLE makes use of mobile edge-clouds, networks formed by mobile devices in close proximity, and lightweight cloudlets that serve a small geographical area. Using an Android app, users ramble whilst generating geo-referenced content (e.g., text messages, sensor readings, photos, or videos), and disseminate that content opportunistically to nearby devices, cloudlets, or even cloud servers, as allowed by intermittent wireless connections. Each RAMBLE-enabled device can both produce information; consume information for which it expresses interest to neighboors, and; serve as an opportunistic cache for other devices. We describe the architecture of the framework and a case-study application scenario we designed to evaluate its behavior and performance. The results obtained reinforce our view that kits of RAMBLE-enabled mobile devices and modest cloudlets can constitute lightweight and flexible untethered intelligence gathering platforms for first responders in the aftermath of natural disasters, paving the way for the deployment of humanitary assistance and technical staff at large.

Abstract
Lock-free implementation techniques are known to improve the overall throughput of concurrent data structures. A hash map is an important data structure used to organize information that must be accessed frequently. A key role of a hash map is the ability to balance workloads by dynamically adjusting its internal data structures in order to provide the fastest possible access to the information. This work extends a previous lock-free hash map design to also support lock-free compression. The main goal is to significantly reduce the depth of the internal hash levels within the hash map, in order to minimize cache misses and increase the overall throughput. To materialize our design, we redesigned the existent search, insert, remove and expand operations in order to maintain the lock-freedom property of the whole design. Experimental results show that lock-free compression effectively improves the search operation and, in doing so, it outperforms the previous design, which was already quite competitive when compared against the concurrent hash map design supported by Intel. © Springer Nature Switzerland AG 2020.

Abstract
This work presents some approaches to overcome current Reinforcement Learning limits. We implement a simple virtual environment and some state-of-the-art Reinforcement Learning algorithms for testing and producing a baseline for comparison. Then we implement a Relational Reinforcement Learning algorithm that shows superior performance to the baseline but requires introducing human knowledge. We also propose that Model-based Reinforcement Learning can help us overcome some of the barriers. For better World models, we explore Inductive Logic Programming methods, such as First-Order Inductive Learner, and develop an improved version of it, more adequate to Reinforcement Learning environments. Finally we develop a novel Neural Network architecture, the Inductive Logic Neural Network, to fill the gaps of the previous implementations, that shows great promise. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020.

Abstract
The present work surveys research that integrates successfully a number of complementary fields in Artificial Intelligence. Starting from integrations in Reinforcement Learning: Deep Reinforcement Learning and Relational Reinforcement Learning, we then present Neural-Symbolic Learning and Reasoning since it is applied to Deep Reinforcement Learning. Finally, we present integrations in Deep Reinforcement Learning, such as, Relational Deep Reinforcement Learning. We propose that this road is breaking through barriers in Reinforcement Learning and making us closer to Artificial General Intelligence, and we share views about the current challenges to get us further towards this goal. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020.

Abstract
Diabetes type I is a chronic disease that requires strict supervision. MyDiabetes is a utility application for diabetic users. This application served as basis to develop a logical unit, composed of logical rules, translated from medical protocols and guidelines, to advise the user. The data in the application is a source of knowledge about the user's health state and diabetes intrinsic characteristics. An existing concern is the weak user adherence and consequential data absence. The implemented solutions were gamification and an interface rework. As later confirmed through a survey, users feel captivated by appealing interfaces, achievements and medals. In a near future, we will resume our work with the S. Joao's hospital, with a new trial and volunteers. User testing will be used to validate the gamification techniques.

Abstract
Many text classification problems in social networks, and other contexts, are also dynamic problems, where concepts drift through time, and meaningful labels are dynamic. In Twitter-based applications in particular, ensembles are often applied to problems that fit this description, for example sentiment analysis or adapting to drifting circumstances. While it can be straightforward to request different classifiers' input on such ensembles, our goal is to boost dynamic ensembles by combining performance metrics as efficiently as possible. We present a twofold performance-based framework to classify incoming tweets based on recent tweets. On the one hand, individual ensemble classifiers' performance is paramount in defining their contribution to the ensemble. On the other hand, examples are actively selected based on their ability to effectively contribute to the performance in classifying drifting concepts. The main step of the algorithm uses different performance metrics to determine both each classifier strength in the ensemble and each example importance, and hence lifetime, in the learning process. We demonstrate, on a drifted benchmark dataset, that our framework drives the classification performance considerably up for it to make a difference in a variety of applications.