Abstract
Understanding the distribution of people's transportation mode is a crucial facet of today's urban mobility for proper transportation planning. The penetration of smartphones combined with their sensing capability is an enabler for crowdsourcing large mobility data such as commuters' GPS records. In this paper, we leverage the GPS traces of commuters to infer five different transportation modes frequently used in urban areas including foot, bike, bus, car and metro. We compare three different approaches commonly reported in the literature for transportation mode detection from the family of machine learning algorithms (random forest -RF) and deep learning architectures (convolutional neural network -CNN and ensemble of autoencoders -EAE). By splitting the dataset into train-test by the period of data collection, as well as the conventional 80-20 split, we evaluate the impact of several data pre-processing decisions on overall classifiers' performance. Our results show RF and CNN performing better upon evaluation on classification metrics such as the f1 score and the area under the Receiver Operating Characteristics (ROC) curve.

Abstract
Decision-making is one of the crucial factors in soccer (association football). The current focus is on analyzing data sets rather than posing what if questions about the game. We propose simulation-based methods that allow us to answer these questions. To avoid simulating complex human physics and ball interactions, we use data to build machine learning models that form the basis of an event-based soccer simulator. This simulator is compatible with the OpenAI GYM API. We introduce tools that allow us to explore and gather insights about soccer, like (1) calculating the risk/reward ratios for sequences of actions, (2) manually defining playing criteria, and (3) discovering strategies through Reinforcement Learning.

Abstract
Risk management is one of the ten knowledge areas discussed in the Project Management Body of Knowledge (PMBOK), which serves as a guide that should be followed to increase the chances of project success. The popularity of research regarding the application of risk management in software projects has been consistently growing in recent years, especially with the application of machine learning techniques to help identify risk levels of risk factors of a project before its development begins, with the goal of improving the likelihood of success of these projects. This paper presents the results of the application of machine learning techniques for risk assessment in software projects. A Python application was developed and, using Scikit-learn, two machine learning models, trained using software project risk data shared by a partner company of this project, were created to predict risk impact and likelihood levels on a scale of 1 to 3. Different algorithms were tested to compare the results obtained by high performance but non-interpretable algorithms (e.g., Support Vector Machine) and the ones obtained by interpretable algorithms (e.g., Random Forest), whose performance tends to be lower than their non-interpretable counterparts. The results showed that Support Vector Machine and Naive Bayes were the best performing algorithms. Support Vector Machine had an accuracy of 69% in predicting impact levels, and Naive Bayes had an accuracy of 63% in predicting likelihood levels, but the results presented in other evaluation metrics (e.g., AUC, Precision) show the potential of the approach presented in this use case.

Abstract
This work addresses the energy-efficient job shop scheduling problem and transport resources with speed scalable machines and vehicles which is a recent extension of the classical job shop problem. In the environment under consideration, the speed with which machines process production operations and the speed with which vehicles transport jobs are also to be decided. Therefore, the scheduler can control both the completion times and the total energy consumption. We propose a mixed-integer linear programming model that can be efficiently solved to optimality for small-sized problem instances.

Abstract
This paper addresses an extension of the flexible job shop scheduling problem by considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this problem involves assigning each production operation to one of the alternative machines, finding the sequence of operations for each machine, assigning each transport task to one of the vehicles, and finding the sequence of transport tasks for each vehicle, simultaneously. Transportation is usually neglected in the literature and when considered, an unlimited number of vehicles is, typically, assumed. Here, we propose the first mixed integer linear programming model for this problem and show its efficiency at solving small-sized instances to optimality. In addition, and due to the NP-hard nature of the problem, we propose a local search based heuristic that the computational experiments show to be effective, efficient, and robust.

Abstract
In this paper we propose and analyze a game theoretical model regarding the dynamical interaction between government fiscal policy choices toward innovation and training (I&T), firm's innovation, and worker's levels of training and education. We discuss four economic scenarios corresponding to strict pure Nash equilibria: the government and I&T poverty trap, the I&T poverty trap, the I&T high premium niche, and the I&T ideal growth. The main novelty of this model is to consider the government as one of the three interacting players in the game that also allow us to analyse the I&T mixed economic scenarios with a unique strictly mixed Nash equilibrium and with I&T evolutionary dynamical cycles.