Abstract
Dynamic logic is a powerful framework for reasoning about imperative programs. An extension with a concurrent operator, called concurrent propositional dynamic logic (CPDL) [20], was introduced to formalise programs running in parallel. In a different direction, other authors proposed a systematic method for generating multi-valued propositional dynamic logics to reason about weighted programs [15]. This paper presents the first step of combining these two frameworks to introduce uncertainty in concurrent computations. In the proposed framework, a weight is assigned to each branch of the parallel execution, resulting in a (possible) asymmetric parallelism, inherent to the fuzzy programming paradigm [2,23]. By adopting such an approach, a family of logics is obtained, called multi-valued concurrent propositional dynamic logics (GCDL(A)), parametric on an action lattice A specifying a notion of "weight" assigned to program execution. Additionally, the validity of some axioms of CPDL is discussed in the new family of generated logics.

Abstract
Power systems rely on a broad set of information and sensors to maintain reliable and secure operation. Proper processing of such information, to guarantee the integrity of power system data, is a requirement in any modern control centre, typically performed by state estimation associated with bad data processing algorithms. This paper shows that contrarily to a commonly assumed claim regarding bad data processing, in some cases of single gross error (GE) the noncritical measurement contaminated with GE does not present the largest normalized residual. Based on the analysis of the elements of the residual sensitivity matrix, the paper formally demonstrates that such claim does not always hold. Besides this demonstration, possible vulnerabilities for traditional bad data processing are mapped through the Undetectability Index (UI). Computational simulations carried out on IEEE 14 and IEEE 118 test systems provide insight into the paper proposition.

Abstract
The goal of this study is to examine the effects of the sense of presence and immersive tendencies on learning outcomes while comparing different media formats (Interactive VR, Non-interactive VR and Video). An experiment was conducted with 36 students that watched a Biology lesson about the human cells. Contrary to expected, the results demonstrate that the Non-interactive VR was the most successful format. Sense of presence and immersive tendencies did not have an effect on learning gain, and the latter was not a critical factor to experience the sense of presence. The findings provide empirical evidence to help understand the influence of these variables on learning in VR.

Abstract
This paper addresses a permutation flowshop scheduling problem, with the objective of minimizing total weighted squared tardiness. The focus is on providing efficient procedures that can quickly solve medium or even large instances. Within this context, we first present multiple dispatching heuristics. These include general rules suited to various due date-related environments, heuristics developed for the problem with a linear objective function, and procedures that are suitably adapted to take the squared objective into account. Then, we describe several improvement procedures, which use one or more of three techniques. These procedures are used to improve the solution obtained by the best dispatching rule. Computational results show that the quadratic rules greatly outperform the linear counterparts, and that one of the quadratic rules is the overall best performing dispatching heuristic. The computational tests also show that all procedures significantly improve upon the initial solution. The non-dominated procedures, when considering both solution quality and runtime, are identified. The best dispatching rule, and two of the non-dominated improvement procedures, are quite efficient, and can be applied to even very large-sized problems. The remaining non-dominated improvement method can provide somewhat higher quality solutions, but it may need excessive time for extremely large instances.

Abstract
Epilepsy is one of the most common neurological disorders, affecting up to 1% of the World population. Patients with epilepsy may suffer from severe consequences from seizures (e.g. injuries) when not monitored. Automatic seizure detection systems could mitigate this problem, improving seizure tracking and alerting a caregiver during a seizure. Existing unimodal solutions for seizure detection, based on electroencephalogram (EEG) and electrocardiogram (ECG) still have an unacceptable level of false positives, which can be reduced by combining these two biosignals. In this paper, EEG and ECG data from 7 epileptic patients with diverse recording length and seizure types were used for analyzing the importance of multimodal seizure detection, at a total of around 110 h 2 m. A leave one seizure out cross validation was selected, grouping data containing the period before a seizure and the seizure period. A proof of concept of multimodal seizure detection which uses a deep learning architecture directly on raw data is performed - a Fully Convolutional Neural Network and an architecture based on LSTM were tested. The network based on LSTM achieved better performance - using the best of one or a combination of both signals, all patients had above 91% detected seizures, a specificity per epoch above 0.96 +/- 0.06 and a detection delay below 8.5 +/- 12 s. These results show potential for developing a patient-specific approach for seizure detection that can be transferred to the ambulatory.

Abstract
In public transport, traveler dissatisfaction is widespread, due to long waits and travel time, or the low frequency of the service provided. Public transport providers are increasingly concerned about improving the service provided. To improve public transport, detailed knowledge of the network and its weaknesses is necessary. An easy and cheap way to achieve this information is to extract knowledge from the data daily collected in a public transport network. Thus, this chapter focuses on data analysis resulting from the smartcard-based ticketing system. The main objective is to detect patterns of average speed for all days of the week and times of the day, along with pairs of consecutive stops. To perform the analyses, the average speed was deduced from ticketing data, and clustering methods were applied. The results show that it is possible to find segments with similar patterns and identify days and times with similar patterns.