Abstract
Intelligent transportation systems (ITS) are gaining attraction in large cities for better traffic management. Traffic forecasting is an important part of ITS, but a difficult one due to the intricate spatiotemporal relationships of traffic between different locations. Despite the fact that remote or far sensors may have temporal and spatial similarities with the predicting sensor, existing traffic forecasting research focuses primarily on modeling correlations between neighboring sensors while disregarding correlations between remote sensors. Furthermore, existing methods for capturing spatial dependencies, such as graph convolutional networks (GCNs), are unable to capture the dynamic spatial dependence in traffic systems. Self-attention-based techniques for modeling dynamic correlations of all sensors currently in use overlook the hierarchical features of roads and have quadratic computational complexity. Our paper presents a new Dynamic Graph Convolution LSTM Network (DyGCN-LSTM) to address the aforementioned limitations. The novelty of DyGCN-LSTM is that it can model the underlying non-linear spatial and temporal correlations of remotely located sensors at the same time. Experimental investigations conducted using four real-world traffic data sets show that the suggested approach is superior to state-of-the-art benchmarks by 25% in terms of RMSE.

Abstract
Determining the relatedness of publications by detecting similarities and connections between researchers and their outputs can help science stakeholders worldwide to find areas of common interest and potential collaboration. To this end, many studies have tried to explore authorship attribution and research similarity detection through the use of automatic approaches. Nonetheless, inferring author research relatedness from imperfect data containing errors and multiple references to the same entities is a long-standing challenge. In a previous study, we conducted an experiment where a homogeneous crowd of volunteers contributed to a set of author name disambiguation tasks. The results demonstrated an overall accuracy higher than 75% and we also found important effects tied to the confidence level indicated by participants in correct answers. However, this study left many open questions regarding the comparative accuracy of a large heterogeneous crowd with monetary rewards involved. This paper seeks to address some of these unanswered questions by repeating the experiment with a crowd of 140 online paid workers recruited via MTurk's microtask crowdsourcing platform. Our replication study shows high accuracy for name disambiguation tasks based on authorship-level information and content features. These findings can be of greater informative value since they also explore hints of crowd behavior activity in terms of time duration and mean proportion of clicks per worker with implications for interface and interaction design.

Abstract

Abstract
In this work, we enhance the EasyCrypt proof assistant to reason about the computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial computations. Our Hoare logic is built on top of the module system used by EasyCrypt for modeling adversaries. We prove that our logic is sound w.r.t. the semantics of EasyCrypt programs-we also provide full semantics for the EasyCrypt module system, which was lacking previously. We showcase (for the first time in EasyCrypt and in other computer-aided cryptographic tools) how our approach can express precise relationships between the probability of adversarial success and their execution time. In particular, we can quantify existentially over adversaries in a complexity class and express general composition statements in simulation-based frameworks. Moreover, such statements can be composed to derive standard concrete security bounds for cryptographic constructions whose security is proved in a modular way. As a main benefit of our approach, we revisit security proofs of some well-known cryptographic constructions and present a new formalization of universal composability.

Abstract
Sectorization is the division of a large area, territory or network into smaller parts considering one or more objectives. Dynamic sectorization deals with situations where it is convenient to discretize the time horizon in a certain number of periods. The decisions will not be isolated, and they will consider the past. The application areas are diverse and increasing due to uncertain times. This work proposes a conceptualization of dynamic sectorization and applies it to a distribution problem with variable demand. Furthermore, Genetic Algorithm is used to obtain solutions for the problem since it has several criteria; Analytical Hierarchy Process is used for the weighting procedure. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
Distribution networks are vulnerable to natural hazards which can cause major social and economic consequences. Identifying vulnerable areas and developing operational strategies, such as dispatching mobile energy systems, can help mitigate the effects of extreme events. Conventional approaches, mainly N-1/N-2 contingency security analysis, are efficient but they do not fully provide a comprehensive picture of the stochastic nature of the hazard impact. Stochastic approaches are more accurate but in general they are computationally expensive and hence not practical for the resilient operational decision-making of distribution system operators. Therefore, this paper develops a novel framework based on an adjacency-resource matrix (ARM) and an unsupervised machine learning algorithm to first identify vulnerable nodes. Next, these vulnerable nodes are utilized in the mitigation stage in order to minimize the expected energy not served (EENS) against a natural hazard. The efficiency of the proposed framework is tested on a 125-node Portuguese distribution system.