Abstract
Deep learning has offered significant performance improvements on several pattern recognition problems. However, the well-known need for large amounts of labeled data limits applicability and performance where those are not available. Hence, this paper proposes an adaptation of the triplet loss for self-learning with entirely unlabeled data, where there is uncertainty in the generated triplets. The methodology was applied to off-the-person electrocardiogram-based biometric authentication and unconstrained face identity verification tasks, including stress experiments designed to simulate more difficult circumstances. Despite the uncertainty related to the use of unlabeled data, the method was mostly capable of avoiding negatively affecting the model's performance. The promising results show the proposed method can be a viable alternative to supervised learning in cases where only unlabeled data are available. The method is especially suitable for training with continuous stream-based datasets such as on person re-identification in video streams and continuous electrocardiogram-based biometrics.

Abstract
In general, games pose interesting and complex problems for the implementation of intelligent agents and are a popular domain in the study of artificial intelligence. In fact, games have been at the center of some of the most well-known achievements in artificial intelligence. From classical board games such as chess, checkers, backgammon and Go, to video games such as Dota 2 and StarCraft II, artificial intelligence research has devised computer programs that can play at the level of a human master and even at a human world champion level. Planning and learning, two well-known and successful paradigms of artificial intelligence, have greatly contributed to these achievements. Although representing distinct approaches, planning and learning try to solve similar problems and share some similarities. They can even complement each other. This has led to research on methodologies to combine the strengths of both approaches to derive better solutions. This paper presents a survey of the multiple methodologies that have been proposed to integrate planning and learning in the context of games. In order to provide a richer contextualization, the paper also presents learning and planning techniques commonly used in games, both in terms of their theoretical foundations and applications.

Abstract
Penetration of renewable energy sources (RESs) and electrical energy storage (EES) systems in distribution systems is increasing, and it is crucial to investigate their impact on systems' operation scheme, reliability, and security. In this paper, expected energy not supplied (EENS) and voltage stability index (VSI) of distribution networks are investigated in dynamic balanced and unbalanced distribution network reconfiguration, including RESs and EES systems. Furthermore, due to the high investment cost of the EES systems, the number of charge and discharge is limited, and the state-of-health constraint is included in the underlying problem to prolong the lifetime of these facilities. The optimal charging/discharging scheme for EES systems and optimal distribution network topology are presented in order to optimize the operational costs, and reliability and security indices simultaneously. The proposed strategy is applied to a large-scale 119-bus distribution test network in order to show the economic justification of the proposed approach.

Abstract
Massive data broadcast by GPS-equipped vehicles provide unprecedented opportunities. One of the main tasks in order to optimize our transportation networks is to build data-driven real-time decision support systems. However, the dynamic environments where the networks operate disallow the traditional assumptions required to put in practice many off-the-shelf supervised learning algorithms, such as finite training sets or stationary distributions. In this paper, we propose BRIGHT: a drift-aware supervised learning framework to predict demand quantities. BRIGHT aims to provide accurate predictions for short-term horizons through a creative ensemble of time series analysis methods that handles distinct types of concept drift. By selecting neighborhoods dynamically, BRIGHT reduces the likelihood of overfitting. By ensuring diversity among the base learners, BRIGHT ensures a high reduction of variance while keeping bias stable. Experiments were conducted using three large-scale heterogeneous real-world transportation networks in Porto (Portugal), Shanghai (China), and Stockholm (Sweden), as well as with controlled experiments using synthetic data where multiple distinct drifts were artificially induced. The obtained results illustrate the advantages of BRIGHT in relation to state-of-the-art methods for this task.

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
In this study, a privacy-based demand response (DR) trading scheme among end-users and DR aggregators (DRAs) is proposed within the retail market framework and by distribution platform optimiser. This scheme aims to obtain the optimum DR volume to be exchanged while considering both DRAs' and customers' preferences. A bi-level programming model is formulated in a day-ahead market within retail markets. In the upper-level problem, the total operation cost of the distribution system is minimised. The production volatility of renewable energy resources is also taken into account in this level through stochastic two-stage programming and Monte-Carlo simulation method. In the lower-level problem, the electricity bill for customers is minimised for customers. The income from DR selling is maximised based on DR prices through secure communication of household energy management systems and DRA. To solve this convex and continuous bi-level problem, it is converted to an equivalent single-level problem by adding primal and dual constraints of lower level as well as its strong duality condition to the upper-level problem. The results demonstrate the effectiveness of different DR prices and different number of DRAs on hourly DR volume, hourly DR cost and power exchange between the studied network and the upstream network.