2021
Autores
Bernardo, G; Bernardes, G;
Publicação
ACM International Conference Proceeding Series
Abstract
In this paper, we advance a multimodal optimization music mashup creation model for loop recombination at scale. The motivation to pursue such a model is to 1) tackle current scalability limitations in state-of-the-art (brute force) models while enforcing the 2) compatibility, i.e., recombination quality, of audio loops, and 3) a pool of diverse solutions that can accommodate personal user preferences or promote different musical styles. To this end, we adopt the Artificial Immune System (AIS) opt-aiNet algorithm to efficiently compute a population of compatible and diverse mashups from loop recombinations. Optimal mashups result from local minima in a feature space that objectively represents harmonic and rhythmic compatibility. We implemented our model as a prototype application named Mixmash-AIS, and conducted an objective evaluation that tackles three dimensions: loop recombination compatibility, mashups diversity, and computational model efficiency. The conducted evaluation compares the proposed system to a standard genetic algorithm (GA) and a brute force (BF) approach. While the GA stands as the most efficient algorithm, its poor results in terms of compatibility reinforce the primacy of the AIS opt-aiNet in efficiently finding optimal compatible loop mashups. Furthermore, the AIS opt-aiNet showed to promote a diverse mashup population, outperforming both GA or BF approaches. © 2021 Owner/Author.
2021
Autores
Gama, J; Veloso, B; Aminian, E; Ribeiro, RP;
Publicação
9TH INTERNATIONAL CONFERENCE ON BIG DATA ANALYTICS, BDA 2021
Abstract
This article presents our recent work on the topic of learning from data streams. We focus on emerging topics, including fraud detection, learning from rare cases, and hyper-parameter tuning for streaming data. © 2021, Springer Nature Switzerland AG.
2021
Autores
Carvalhais, M;
Publicação
Computational Synthesis and Creative Systems - Artificial Intelligence and the Arts
Abstract
2021
Autores
Vahedipour Dahraie, M; Rashidizadeh Kermani, H; Shafie Khah, M; Catalao, JPS;
Publicação
IEEE TRANSACTIONS ON SMART GRID
Abstract
This article addresses the optimal bidding strategy problem of a virtual power plant (VPP) participating in the day-ahead (DA), real-time (RT) and spinning reserve (SR) markets (SRMs). The VPP comprises a number of dispatchable energy resources (DERs), renewable energy resources (RESs), energy storage systems (ESSs) and a number of customers with flexible demand. A two-stage risk-constrained stochastic problem is formulated for the VPP scheduling, where the uncertainty lies in the energy and reserve prices, RESs production, load consumption, as well as calls for reserve services. Based on this model, the VPP bidding/offering strategy in the DA market (DAM), RT market (RTM) and SRM is decided aiming to maximize the VPP profit considering both supply and demand-sides (DS) capability for providing reserve services. On the other hand, customers participate in demand response (DR) programs by using load curtailment (LC) and load shifting (LS) options as well as by providing reserve service to minimize their consumption costs. The proposed model is implemented on a test VPP and the optimal decisions are investigated in detail through a numerical study. Numerical simulations demonstrate the effectiveness of the proposed scheduling strategy and its operational advantages and the computational effectiveness.
2021
Autores
Alam, MI; Halder, R; Pinto, JS;
Publicação
JOURNAL OF SYSTEMS AND SOFTWARE
Abstract
Deductive verification has gained paramount attention from both academia and industry. Although intensive research in this direction covers almost all mainstream languages, the research community has paid little attention to the verification of database applications. This paper proposes a comprehensive set of Verification Conditions (VCs) generation techniques from database programs, adapting Symbolic Execution, Conditional Normal Form, and Weakest Precondition. The validity checking of the generated VCs for a database program determines its correctness w.r.t. the annotated database properties. The developed prototype DBverify based on our theoretical foundation allows us to instantiate VC generation from PL/SQL codes, yielding to detailed performance analysis of the three approaches under different circumstances. With respect to the literature, the proposed approach shows its competence to support crucial SQL features (aggregate functions, nested queries, NULL values, and set operations) and the embedding of SQL codes within a host imperative language. For the chosen set of benchmark PL/SQL codes annotated with relevant properties of interest, our experiment shows that only 38% of procedures are correct, while 62% violate either all or part of the annotated properties. The primary cause for the latter case is mostly due to the acceptance of runtime inputs in SQL statements without proper checking.
2021
Autores
Silveira, S; Ramos, J; Silva, O; Almeida, F;
Publicação
Enlightening Tourism
Abstract
Tourism has been a fundamental pillar for the development of the Portuguese economy and has supported and stimulated new opportunities. However, for small and medium enterprises (SMEs) in the hospitality sector, and given their specific characteristics, there are no specific indicators to monitor sustainability, and they are only based on existing generic models such as ETIS, WTO, and Green Globe. Given the complexity of the indicators in these models and their comprehensive vision, it makes it difficult for hospitality SMEs that have limited resources to measure them. Consequently, it is important to focus their attention on the most relevant indicators for their activity. In this sense, this study is relevant in identifying the critical sustainability factors for Portuguese hospitality SMEs. In total, and after the synthesis and assessment of the various indicators, a total of 35 critical indicators were identified, distributed among the economic, social, sustainable management, and environmental dimensions.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.