CIIC - Artigos em Revistas com Peer Review
URI permanente para esta coleção:
Navegar
Percorrer CIIC - Artigos em Revistas com Peer Review por Domínios Científicos e Tecnológicos (FOS) "Ciências Naturais::Matemáticas"
A mostrar 1 - 4 de 4
Resultados por página
Opções de ordenação
- Automatic Transcription of Polyphonic Piano Music Using Genetic Algorithms, Adaptive Spectral Envelope Modeling, and Dynamic Noise Level EstimationPublication . Reis, Gustavo; Fernandez de Vega, Francisco; Ferreira, AníbalThis paper presents a new method for multiple fundamental frequency (F0) estimation on piano recordings. We propose a framework based on a genetic algorithm in order to analyze the overlapping overtones and search for the most likely F0 combination. The search process is aided by adaptive spectral envelope modeling and dynamic noise level estimation: while the noise is dynamically estimated, the spectral envelope of previously recorded piano samples (internal database) is adapted in order to best match the piano played on the input signals and aid the search process for the most likely combination of F0s. For comparison, several state-of-the-art algorithms were run across various musical pieces played by different pianos and then compared using three different metrics. The proposed algorithm ranked first place on Hybrid Decay/Sustain Score metric, which has better correlation with the human hearing perception and ranked second place on both onset-only and onset–offset metrics. A previous genetic algorithm approach is also included in the comparison to show how the proposed system brings significant improvements on both quality of the results and computing time.
- Customized crowds and active learning to improve classificationPublication . Costa, Joana; Silva, Catarina; Antunes, Mário; Ribeiro, BernardeteTraditional classification algorithms can be limited in their performance when a specific user is targeted. User preferences, e.g. in recommendation systems, constitute a challenge for learning algorithms. Additionally, in recent years user’s interaction through crowdsourcing has drawn significant interest, although its use in learning settings is still underused. In this work we focus on an active strategy that uses crowd-based non-expert information to appropriately tackle the problem of capturing the drift between user preferences in a recommendation system. The proposed method combines two main ideas: to apply active strategies for adaptation to each user; to implement crowdsourcing to avoid excessive user feedback. A similitude technique is put forward to optimize the choice of the more appropriate similitude-wise crowd, under the guidance of basic user feedback. The proposed active learning framework allows non-experts classification performed by crowds to be used to define the user profile, mitigating the labeling effort normally requested to the user. The framework is designed to be generic and suitable to be applied to different scenarios, whilst customizable for each specific user. A case study on humor classification scenario is used to demonstrate experimentally that the approach can improve baseline active results.
- Indicator-based multi objective evolutionary algorithms and an application in filament winding processPublication . Yevseyeva, Iryna; de Melo, Francisco Queirós; Grácio, José; Basto-Fernandes, VitorThis work presents recent developments on multi objective evolutionary algorithms, so-called set-based evolutionary algorithms. These techniques are shown to approximate a Pareto front of efficient solutions taking into account both quality of the approximation and its diversity, both important in the design of these methods. Set-based evolutionary algorithms outperform their predecessors on a variety of benchmark problems and are suggested as tools to be used for solving complex mechanical engineering problems, such as filament winding process discussed in this work.
- Solving large-scale SONET network design problems using bee-inspired algorithmsPublication . Bernardino, Eugénia Moreira; Bernardino, Anabela Moreira; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel AngelIn the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or bandwidth has significantly augmented. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. In this paper, we consider two problems that arise in the design of optical telecommunication networks, namely the SONET Ring Assignment Problem (SRAP) and the Intraring Synchronous Optical Network Design Problem (IDP), known to be NP-hard. In SRAP, the objective is to minimise the number of rings (i.e., DXCs). In IDP, the objective is to minimise the number of ADMs. Both problems are subject to a ring capacity constraint. To solve these problems, we propose two bee-inspired algorithms: Hybrid Artificial Bee Colony and Hybrid Bees Algorithm. We hybridise the basic form of these algorithms with local search, in order to refine newly constructed solutions. We also perform comparisons with other algorithms from the literature and use larger instances. The simulation results verify the effectiveness and robustness of the proposed algorithms.