Abstract
In soccer, in order to evaluate teams' performance, a complex set of variables must be analyzed (aside from the final game result). However, in some cases, the concepts used by the analysts are different when compared to the ones used by the coach or the players. The main goal of this research project is the development of an ontology capable of standardizing the concepts related to a soccer game. Using Protégé (as development tool) and OWL (as language), low- and high-level concepts were created and validated by 60 soccer experts. From the 40 tested concepts, 33 were completely validated, which constitutes excellent indicators about their understanding and correction. In the future, the ontology developed in this project will be used as a base for a real-time analysis system capable of executing soccer player behavior analysis.

Abstract

Abstract
A reconfigurable dual-band monopole array with high isolation for WLAN MIMO application is proposed. This antenna array contains two C-shaped monopoles with a shorting line, on which two RF switches were integrated, connecting the two antenna elements that are separated by a distance of 0.09 lambda(2.4GHz). High isolation at 2.4 or 5.2 GHz bands can be achieved by changing the states of the RF switches. Experiment results indicate that the proposed antenna array has a - 10 dB bandwidth that covers the required frequencies for dual-band WLAN applications with an isolation higher than 20 dB over the lower operation bands when the RF switches are 'ON', and an isolation higher than 17 dB at the higher operation band when the switches are 'OFF'.

Abstract
Algorithmic entropy and Shannon entropy are two conceptually different information measures, as the former is based on size of programs and the later in probability distributions. However, it is known that, for any recursive probability distribution, the expected value of algorithmic entropy equals its Shannon entropy, up to a constant that depends only on the distribution. We study if a similar relationship holds for Renyi and Tsallis entropies of order a, showing that it only holds for Renyi and Tsallis entropies of order 1 (i.e., for Shannon entropy). Regarding a time bounded analogue relationship, we show that, for distributions such that the cumulative probability distribution is computable in time t(n), the expected value of time-bounded algorithmic entropy (where the alloted time is nt(n) log(nt(n))) is in the same range as the unbounded version. So, for these distributions, Shannon entropy captures the notion of computationally accessible information. We prove that, for universal time-bounded distribution m(t)(x), Tsallis and Renyi entropies converge if and only if a is greater than 1.

Abstract
This paper describes the Hybrid User Centered Development Methodology (HUCDM). This methodology is a simple, iterative and incremental development process. The methodology is based on structured disciplined development processes, on principles of User Centered Development (UCD) processes, specified in the International Organization for Standardization - ISO 13407, as well as practices and values of agile methods for software development. The evaluation during the development process is another pillar of the methodology given the principles of the metrics defined in ISO / IEC 9126-1. HUCDM aims to propose a methodology for the development of educational resources with recognized quality and viable from economic standpoint in Small and Medium Enterprises (SMEs) in Portugal.

Abstract