Abstract
Energy management in buildings can be largely improved by considering adequate forecasting techniques to find load consumption patterns. While these forecasting techniques are relevant, decision making is needed to decide the forecasting technique that suits best each context, thus improving the accuracy of predictions. In this paper, two forecasting methods are used including artificial neural network and k-nearest neighbor. These algorithms are considered to predict the consumption of a building equipped with devices recording consumptions and sensors data. These forecasts are performed from five-to-five minutes and the forecasting technique decision is taken into account as an enhanced factor to improve the accuracy of predictions. This decision making is optimized with the support of the multi-armed bandit, the reinforcement learning algorithm that analyzes the best suitable method in each five minutes. Exploration alternatives are considered in trial and test studies as means to find the best suitable level of unexplored territory that results in higher accumulated rewards. In the case-study, four contexts have been considered to illustrate the application of the proposed methodology.

Abstract
Sponsored advertising on search engines is one of the fastest growing online advertising marketplaces. The space available for paid ads, or positions, is sold using auctions and payment is calculated considering the number of clicks each position receives. Two mechanisms are generally used in position auctions: Generalized Second Price (GSP) (e.g. Google, Yahoo!) and Vickrey-Clarke-Groves (VCG) (e.g. Facebook). To understand which mechanism guarantees the highest payoff to market players (search engines and advertisers), a multi-agent simulation is developed in Netlogo. Using the generated data, a supervised learning-based analysis on search engines and bidders' payoffs is made using linear regression models and regression trees. Results suggest that the average payoff for auctioneers (the search engines) and bidders (the advertisers), the price for each position, and first bidder's payment, are significantly different in the GSP and VCG mechanisms. We also found the mechanism that generates the highest payoff for the search engine is the VCG, while for the bidders it is the GSP.

Abstract
In this paper we introduce and develop the concept of interval-weighted networks (IWN), a novel approach in Social Network Analysis, where the edge weights are represented by closed intervals composed with precise information, comprehending intrinsic variability. We extend IWN for both Newman's modularity and modularity gain and the Louvain algorithm, considering a tabular representation of networks by contingency tables. We apply our methodology to two real-world IWN. The first is a commuter network in mainland Portugal, between the twenty three NUTS 3 Regions (IWCN). The second focuses on annual merchandise trade between 28 European countries, from 2003 to 2015 (IWTN). The optimal partition of geographic locations (regions or countries) is developed and compared using two new different approaches, designated as Classic Louvain and Hybrid Louvain , which allow taking into account the variability observed in the original network, thereby minimizing the loss of information present in the raw data. Our findings suggest the division of the twenty three Portuguese regions in three main communities for the IWCN and between two to three country communities for the IWTN. However, we find different geographical partitions according to the community detection methodology used. This analysis can be useful in many real-world applications, since it takes into account that the weights may vary within the ranges, rather than being constant.