Amparo Ruiz-Sepulveda

Prof. Dr. Amparo Ruiz-Sepulveda

Full Profesor at Languages and Computational Sciences Departament
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 June 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Antonio Avila-CanoAntonio Avila-Cano
Antonio Avila-Cano
Amparo Ruiz-SepulvedaAmparo Ruiz-Sepulveda
Amparo Ruiz-Sepulveda
FTFrancisco Triguero-Ruiz
Francisco Triguero-Ruiz
There are situations in which a monopoly solution cannot be reached. In these cases, which situation represents the maximum concentration (minimum competitive balance)? It is a relevant question, given that in sports economics, measuring the competitive balance of a league is done through normalized indices. These indices require that the maximum level of concentration be known. Until now, the distribution of results that generates the maximum level of concentration has been identified in the literature as Complete cascade distribution. However, if the scoring system used does not fulfil the stability condition, which implies that the total number of points of a championship is constant, it can be demonstrated that the Complete cascade distribution does not generate the maximum level of concentration. This is the case, for example, with major European football leagues. In this article, we constructed a perfectly unbalanced distribution, which we called a Truncated cascade distribution. This distribution generates the maximum concentration level. Therefore, if we do not use Truncated cascade distribution, there is an overestimation of the concentration measured with normalized indices. Then, the calculated competitive balance will be wrong, that is, underestimated. We provided a spreadsheet for identifying this distribution.

8 October 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
BBBeatriz Barros
Beatriz Barros
RCRicardo Conejo
Ricardo Conejo
Amparo Ruiz-SepulvedaAmparo Ruiz-Sepulveda
Amparo Ruiz-Sepulveda
FTFrancisco Triguero-Ruiz
Francisco Triguero-Ruiz
Students interact with each other in order to solve computer science programming assignments. Group work is encouraged because it has been proven to be beneficial to the learning process. However, sometimes, collaboration might be confused with dishonest behaviours. This article aimed to quantitatively discern between both cases. We collected code similarity measures from students over four academic years and analysed them using statistical and social network analyses. Three studies were carried out: an analysis of the knowledge flow to identify dishonest behaviour, an analysis of the structure of the social organisation of study groups and an assessment of the relationship between successful students and social behaviour. Continuous dishonest behaviour in students is not as alarming as many studies suggest, probably due to the strict control, automatic plagiarism detection and high penalties for unethical behaviour. The boundary between both is given by the amount of similar content and regularity along the course. Three types of study groups were identified. We also found that the best performing groups were not made up of the best individual students but of students with different levels of knowledge and stronger relationships. The best students were usually the central nodes of those groups.