Abstract
MUSIC OFTEN EVOKES A REGULAR BEAT AND A pleasurable sensation of wanting to move to that beat called groove. Recent studies show that a rhythmic pattern's ability to evoke groove increases at moderate levels of syncopation, essentially, when some notes occur earlier than expected. We present two studies that investigate that effect of syncopation in more realistic polyphonic music examples. First, listeners rated their urge to move to music excerpts transcribed from funk and rock songs, and to algorithmically transformed versions of these excerpts: 1) with the original syncopation removed, and 2) with various levels of pseudorandom syncopation introduced. While the original excerpts were rated higher than the de-syncopated, the algorithmic syncopation was not as successful in evoking groove. Consequently, a moderate level of syncopation increases groove, but only for certain syncopation patterns. The second study provides detailed comparisons of the original and transformed rhythmic structures that revealed key differences between them in: 1) the distribution of syncopation across instruments and metrical positions, 2) the counter-meter figures formed by the syncopating notes, and 3) the number of pickup notes. On this basis, we form four concrete hypotheses about the function of syncopation in groove, to be tested in future experiments.

Abstract
This paper explores a strict relation between two core notions of the semantics of programs and of fuzzy logics: Kleene Algebras and (pseudo) uninorms. It shows that every Kleene algebra induces a pseudo uninorm, and that some pseudo uninorms induce Kleene algebras. This connection establishes a new perspective on the theory of Kleene algebras and provides a way to build (new) Kleene algebras. The latter aspect is potentially useful as a source of formalism to capture and model programs acting with fuzzy behaviours and domains. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
Background: The multimedia capturing of live lectures has increased within higher education institutions, even in the pre-COVID-19 period. Despite student satisfaction, the video lecture capture (VLC) influence on students' attainment and achievement of intended learning outcomes is controversial. Methods: To explore the impact of VLC, a cross-sectional study across 2016/17 (n=209 students) and 2017/18 (n=206 students) was conducted in the course of Mechanistic Toxicology in Pharmaceutical Education. Results: The results showed that 73% and 90% of the assessed students entirely viewed the videos of theoretical (550 minutes) and practical/laboratory classes (250 minutes), respectively. VLC impacted student attainment and the achievement of intended learning outcomes on the capacity to understand the subjects and apply knowledge. Conclusion: The effectiveness of VLC is to be considered under the framework of constructive alignment and the specificities of the course.

Abstract

Abstract
There are Optimization Problems that are too complex to be solved efficiently by deterministic methods. For these problems, where deterministic methods have proven to be inefficient, if not completely unusable, it is common to use approximate methods, that is, optimization methods that solve the problems quickly, regardless of their size or complexity, even if they do not guarantee optimal solutions. In other words, methods that find acceptable solutions, efficiently. One particular type of approximate method, which is particularly effective in complex problems, are metaheuristics. Particle Swarm Optimization is a population-based metaheuristic, which has been particularly successful. In order to broaden the application and overcome the limitation of Particle Swarm Optimization, a discrete version of the metaheuristics is proposed. The Discrete Particle Swarm Optimization, DPSO, will change the PSO algorithm so it can be applied to discrete optimization problems. This alteration will focus on the velocity update equation. The DPSO was tested in an instance of the Traveling Salesman Problem, att48, 48 points problems proposed by Padberg and Rinaldi, which showed some promising results.

Abstract
We propose a new approach for the lastmile delivery problem where, besides serving as collecting points of orders for customers, parcel lockers are also used as transshipment nodes in a 2-echelon delivery system. Moreover, we consider that a customer (occasional courier) visiting a locker may accept a compensation to make a delivery to another customer on their regular traveling path. The proposed shared use of the locker facilities - by customers that prefer to self-pick up their orders, and also as a transfer deposit for customers that prefer home delivery - will contribute to better usage of an already available storage capacity. Furthermore, the use of occasional couriers (OCs) brings an extra layer of flexibility to the delivery process and may positively contribute to achieving some environmental goals: although non-consolidation of deliveries may, at first sight, seem negative, by only considering OCs that would go to the locker independently of making or not a delivery on their way home, and their selection being constrained by a maximum detour, the carbon footprint can be potentially reduced when compared to that of dedicated vehicles. We present a mixed-integer linear programming formulation for the problem that integrates three delivery options - depot to locker, depot to locker followed by final delivery by a professional fleet, and depot to locker followed by final delivery by an OC. Furthermore, to assess the impact of OCs' no show on the delivery process, we extend the formulation to re-schedule the delivery of previous undelivered parcels, and analyze the impact of different no-show rates. Thorough computational experiments show that the use of OCs has a positive impact both on the delivery cost and on the total distance traveled by the dedicated fleets. Experiments also show that the negative impact of no-shows may be reduced by using lockers with higher capacities.