LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
http://hdl.handle.net/2117/3486
2024-03-28T14:36:06ZBateria de afasias Western. Cuaderno de estímulos en castellano.
http://hdl.handle.net/2117/377170
Bateria de afasias Western. Cuaderno de estímulos en castellano.
Zaragoza Cortés, Maite; Diéguez-Vide, Faustino; Gómez Ruiz, María Isabel; Rosell Clarí, Vicent; Catala Roig, Neus; Baixeries i Juvillà, Jaume; Hernández Fernández, Antonio
Quadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües.
Quadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia.
2022-11-25T13:17:01ZZaragoza Cortés, MaiteDiéguez-Vide, FaustinoGómez Ruiz, María IsabelRosell Clarí, VicentCatala Roig, NeusBaixeries i Juvillà, JaumeHernández Fernández, AntonioQuadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües.Impact of a Gamification Learning System on the Academic Performance of Mechanical Engineering Students
http://hdl.handle.net/2117/374377
Impact of a Gamification Learning System on the Academic Performance of Mechanical Engineering Students
Pàmies Vilà, Rosa; Fabregat Sanjuan, Albert; Puig Ortiz, Joan; Jordi Nebot, Lluïsa; Hernández Fernández, Antonio
This study examines the effects of using a gamification tool as a teaching strategy. Specifically, Kahoot! is evaluated as a tool for enhancing student learning. The activities were part of the laboratory sessions of the subject Mechanism and Machine Theory during two consecutive academic years. We analyze the effect of a gamification learning system on both, students’ grades and motivation, in a course with a large number of students (n1 = 283 students, n2 = 306 students). The students were divided into three different groups (control group, gamification group and writing group) and their results were evaluated depending on the learning method applied during the class. In terms of gamification, this project introduces real-time feedback to stimulate the interest of students and help them use the typical tools and methodologies of game-based learning. The analysis of their performance in the laboratory exam shows significant differences between the group that used gamification and the groups that did not. The results suggest that gamification in engineering lab activities has a positive effect on students’ motivation and learning outcome. The study concludes that game-based elements and competitive activities enhanced student performance
2022-10-13T12:10:32ZPàmies Vilà, RosaFabregat Sanjuan, AlbertPuig Ortiz, JoanJordi Nebot, LluïsaHernández Fernández, AntonioThis study examines the effects of using a gamification tool as a teaching strategy. Specifically, Kahoot! is evaluated as a tool for enhancing student learning. The activities were part of the laboratory sessions of the subject Mechanism and Machine Theory during two consecutive academic years. We analyze the effect of a gamification learning system on both, students’ grades and motivation, in a course with a large number of students (n1 = 283 students, n2 = 306 students). The students were divided into three different groups (control group, gamification group and writing group) and their results were evaluated depending on the learning method applied during the class. In terms of gamification, this project introduces real-time feedback to stimulate the interest of students and help them use the typical tools and methodologies of game-based learning. The analysis of their performance in the laboratory exam shows significant differences between the group that used gamification and the groups that did not. The results suggest that gamification in engineering lab activities has a positive effect on students’ motivation and learning outcome. The study concludes that game-based elements and competitive activities enhanced student performanceCompression principle and Zipf’s Law of brevity in infochemical communication
http://hdl.handle.net/2117/374318
Compression principle and Zipf’s Law of brevity in infochemical communication
Hernández Fernández, Antonio; González Torre, Iván
Compression has been presented as a general principle of animal communication. Zipf’s Law of brevity is a manifestation of this postulate and can be generalized as the tendency of more frequent communicative elements to be shorter. Previous works supported this claim, showing evidence of Zipf’s Law of brevity in animal acoustical communication and human language. However, a significant part of the communicative effort in biological systems is carried out in other transmission channels, such as those based on infochemicals. To fill this gap, we seek, for the first time, evidence of this principle in infochemical communication by analysing the statistical tendency of more frequent infochemicals to be chemically shorter and lighter. We analyse data from the largest and most comprehensive open-access infochemical database known as Pherobase, recovering Zipf’s Law of brevity in interspecific communication (allelochemicals) but not in intraspecific communication (pheromones). Moreover, these results are robust even when addressing different magnitudes of study or mathematical approaches. Therefore, different dynamics from the compression principle would dominate intraspecific chemical communication, defying the universality of Zipf’s Law of brevity. To conclude, we discuss the exception found for pheromones in the light of other potential communicative paradigms such as pressures on successful communication or the Handicap principle.
2022-10-13T08:03:07ZHernández Fernández, AntonioGonzález Torre, IvánCompression has been presented as a general principle of animal communication. Zipf’s Law of brevity is a manifestation of this postulate and can be generalized as the tendency of more frequent communicative elements to be shorter. Previous works supported this claim, showing evidence of Zipf’s Law of brevity in animal acoustical communication and human language. However, a significant part of the communicative effort in biological systems is carried out in other transmission channels, such as those based on infochemicals. To fill this gap, we seek, for the first time, evidence of this principle in infochemical communication by analysing the statistical tendency of more frequent infochemicals to be chemically shorter and lighter. We analyse data from the largest and most comprehensive open-access infochemical database known as Pherobase, recovering Zipf’s Law of brevity in interspecific communication (allelochemicals) but not in intraspecific communication (pheromones). Moreover, these results are robust even when addressing different magnitudes of study or mathematical approaches. Therefore, different dynamics from the compression principle would dominate intraspecific chemical communication, defying the universality of Zipf’s Law of brevity. To conclude, we discuss the exception found for pheromones in the light of other potential communicative paradigms such as pressures on successful communication or the Handicap principle.Desvelando los misterios de las feromonas
http://hdl.handle.net/2117/374081
Desvelando los misterios de las feromonas
Hernández Fernández, Antonio; González Torre, Iván
Aunque a los humanos nos llame más la atención todo lo audiovisual, la mayor parte de la comunicación que se da en los seres vivos se realiza mediante señales químicas. La vida es química, más que cualquier otra cosa. La comunicación entre cada célula en el interior de los organismos es fundamentalmente química, como también la que realizan las bacterias entre sí, las plantas para crecer y multiplicarse, o los insectos. Las leyes que rigen estos canales químicos de comunicación siguen siendo, en gran medida, un misterio. En este artículo se resumen las principales leyes lingüísticas que se han encontrado en la comunicación química, tras el análisis de la base de datos Pherobase.
2022-10-06T11:35:23ZHernández Fernández, AntonioGonzález Torre, IvánAunque a los humanos nos llame más la atención todo lo audiovisual, la mayor parte de la comunicación que se da en los seres vivos se realiza mediante señales químicas. La vida es química, más que cualquier otra cosa. La comunicación entre cada célula en el interior de los organismos es fundamentalmente química, como también la que realizan las bacterias entre sí, las plantas para crecer y multiplicarse, o los insectos. Las leyes que rigen estos canales químicos de comunicación siguen siendo, en gran medida, un misterio. En este artículo se resumen las principales leyes lingüísticas que se han encontrado en la comunicación química, tras el análisis de la base de datos Pherobase.La ignorancia tecnológica
http://hdl.handle.net/2117/372880
La ignorancia tecnológica
Hernández Fernández, Antonio
La Tecnología fue una materia que entró por accidente en la Enseñanza Secundaria Obligatoria (ESO) del sistema educativo español. Aunque los legisladores de la época puede que no lo reconozcan jamás, el pecado original de la Tecnolo-gía fue provenir de la antigua Formación Profesional (FP). Lo curioso es que se trata de un saber fundamental en la historia humana: la tecnología es tan inherente a nuestra especie como el lenguaje. En pleno siglo XXI, si somos conscientes de nuestra esencia tecnológica, descubriremos que fue un acierto su inclusión, que la educación tecnológica es imprescindible y que, sin duda, deberíamos potenciar su presencia diferenciada en el currículo desde el parvulario. No obstante, tras sucesivos arrinconamientos en los currículos de secundaria, y jamás presente explícitamente ni en educación infantil ni en primaria, las últimas diluciones homeopáticas de la asignatura han llevado a los legisladores a cambios de nombre muy indicativos de la ignorancia tecnológica imperante: “Tecnología y digitalización” reza el último de los dislates, incluido en la LOMLOE . La moda y el mantra político de la digitalización finalmente se ha plasmado en el BOE.
2022-09-15T13:43:27ZHernández Fernández, AntonioLa Tecnología fue una materia que entró por accidente en la Enseñanza Secundaria Obligatoria (ESO) del sistema educativo español. Aunque los legisladores de la época puede que no lo reconozcan jamás, el pecado original de la Tecnolo-gía fue provenir de la antigua Formación Profesional (FP). Lo curioso es que se trata de un saber fundamental en la historia humana: la tecnología es tan inherente a nuestra especie como el lenguaje. En pleno siglo XXI, si somos conscientes de nuestra esencia tecnológica, descubriremos que fue un acierto su inclusión, que la educación tecnológica es imprescindible y que, sin duda, deberíamos potenciar su presencia diferenciada en el currículo desde el parvulario. No obstante, tras sucesivos arrinconamientos en los currículos de secundaria, y jamás presente explícitamente ni en educación infantil ni en primaria, las últimas diluciones homeopáticas de la asignatura han llevado a los legisladores a cambios de nombre muy indicativos de la ignorancia tecnológica imperante: “Tecnología y digitalización” reza el último de los dislates, incluido en la LOMLOE . La moda y el mantra político de la digitalización finalmente se ha plasmado en el BOE.A note on the query complexity of learning DFA
http://hdl.handle.net/2117/370704
A note on the query complexity of learning DFA
Balcázar Navarro, José Luis; Díaz Cort, Josep; Gavaldà Mestre, Ricard; Watanabe, Osamu
It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries for learning deterministic finite automata. First we consider two different learning situations and show lower bounds on the query complexity of learning deterministic finite automata. We then investigate the query complexity in general setting, and show some trade-off phenomenon between the number of membership and equivalence queries.
2022-07-20T11:08:38ZBalcázar Navarro, José LuisDíaz Cort, JosepGavaldà Mestre, RicardWatanabe, OsamuIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries for learning deterministic finite automata. First we consider two different learning situations and show lower bounds on the query complexity of learning deterministic finite automata. We then investigate the query complexity in general setting, and show some trade-off phenomenon between the number of membership and equivalence queries.Categorical formalisation of relativisation : pied piping, islands, and extraction sites
http://hdl.handle.net/2117/370618
Categorical formalisation of relativisation : pied piping, islands, and extraction sites
Morrill, Glyn
2022-07-20T08:27:50ZMorrill, GlynA first-order isomorphism theorem
http://hdl.handle.net/2117/370609
A first-order isomorphism theorem
Allender, Eric; Balcázar Navarro, José Luis; Immerman, Neil
We show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds.
2022-07-20T08:05:27ZAllender, EricBalcázar Navarro, José LuisImmerman, NeilWe show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds.Some structural complexity aspects of neural computation
http://hdl.handle.net/2117/370366
Some structural complexity aspects of neural computation
Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Siegelmann, H.; Sontag, Eduardo D.
Recent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are rationals, and nonuniform circuits if the weights are reals. Here we develop further connections between the languages recognized by such neural nets and other complexity classes. We present connections to space-bounded classes, simulation of parallel computational models such as Vector Machines, and a discussion of the characterizations of various nonuniform classes in terms of Kolmogorov complexity.
2022-07-18T12:18:31ZBalcázar Navarro, José LuisGavaldà Mestre, RicardSiegelmann, H.Sontag, Eduardo D.Recent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are rationals, and nonuniform circuits if the weights are reals. Here we develop further connections between the languages recognized by such neural nets and other complexity classes. We present connections to space-bounded classes, simulation of parallel computational models such as Vector Machines, and a discussion of the characterizations of various nonuniform classes in terms of Kolmogorov complexity.The [Theta]-operator and the low hierarchy
http://hdl.handle.net/2117/370137
The [Theta]-operator and the low hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos
Long and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the [Theta]-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of NP. In this paper we show a surprising property of the [Theta]-operator and as a consequence, we get easily the [Theta]-lowness results given in [LS-91]. Besides, we clarify the situation of the classes in L[supra P,[Alpha]] [sub 2] for which their membership to L[supra P,[Theta]] [sub 2] was not clear.
S'estudien propietats de l'operador Theta y les seves conseqüències sobre la jerarquia low
2022-07-13T10:39:14ZCastro Rabal, JorgeSeara Ojea, CarlosLong and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the [Theta]-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of NP. In this paper we show a surprising property of the [Theta]-operator and as a consequence, we get easily the [Theta]-lowness results given in [LS-91]. Besides, we clarify the situation of the classes in L[supra P,[Alpha]] [sub 2] for which their membership to L[supra P,[Theta]] [sub 2] was not clear.