Abstract
Event extraction (EE) is one of the core information extraction tasks, whose purpose is to automatically identify and extract information about incidents and their actors from texts. This may be beneficial to several domains such as knowledge base construction, question answering and summarization tasks, to name a few. The problem of extracting event information from texts is longstanding and usually relies on elaborately designed lexical and syntactic features, which, however, take a large amount of human effort and lack generalization. More recently, deep neural network approaches have been adopted as a means to learn underlying features automatically. However, existing networks do not make full use of syntactic features, which play a fundamental role in capturing very long-range dependencies. Also, most approaches extract each argument of an event separately without considering associations between arguments which ultimately leads to low efficiency, especially in sentences with multiple events. To address the above-referred problems, we propose a novel joint event extraction framework that aims to extract multiple event triggers and arguments simultaneously by introducing shortest dependency path in the dependency graph. We do this by eliminating irrelevant words in the sentence, thus capturing long-range dependencies. Also, an attention-based graph convolutional network is proposed, to carry syntactically related information along the shortest paths between argument candidates that captures and aggregates the latent associations between arguments; a problem that has been overlooked by most of the literature. Our results show a substantial improvement over state-of-the-art methods on two datasets, namely ACE 2005 and TAC KBP 2015.

Abstract

Abstract
This paper considers the problem of scheduling jobs in a no-wait flow shop with the objective of minimizing total earliness and tardiness. An exact branch-and-bound algorithm is developed for the problem. Several dispatching heuristics used previously for other environments and two new heuristics were tested under a variety of conditions. It was found that one of the new heuristics consistently performed well compared to the others. An insertion search improvement procedure with speed up methods based on the structure of the problem was proposed and was found to deliver much improved solutions in a reasonable amount of time.

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
Tourism crowdsourcing platforms accumulate and use large volumes of feedback data on tourism-related services to provide personalized recommendations with high impact on future tourist behavior. Typically, these recommendation engines build individual tourist profiles and suggest hotels, restaurants, attractions or routes based on the shared ratings, reviews, photos, videos or likes. Due to the dynamic nature of this scenario, where the crowd produces a continuous stream of events, we have been exploring stream-based recommendation methods, using stochastic gradient descent (SGD), to incrementally update the prediction models and post-filters to reduce the search space and improve the recommendation accuracy. In this context, we offer an update and comment on our previous article (Veloso et al., 2019a) by providing a recent literature review and identifying the challenges laying ahead concerning the online recommendation of tourism resources supported by crowdsourced data.

Abstract
Wiki-based crowdsourced data sources generally lack reliability, as their provenance is not intrinsically marshalled. By using recommendation, one may arguably assess the reliability of wiki-based repositories in order to identify the most interesting articles for a given domain. In this commentary, we explore current trends in scalable modelling and recommendation methods based on side information such as the quality and popularity of wiki articles. The systematic parallelization of such profiling and recommendation algorithms allows the concurrent processing of distributed crowdsourced Wikidata repositories. These algorithms, which perform incremental updating, need further research to improve the performance and generate up-to-date high-quality recommendations. This article builds upon our previous work (Leal et al., 2019) by extending the literature review and identifying important trends and challenges pertaining to crowdsourcing platforms, particularly those of Wikidata provenance.