La Realidad Aumentada en Educación Primaria desde la visión de los estudiantes

Trabajar hoy con recursos digitales en las aulas es una realidad sin posibilidad de cuestionamiento. En este sentido la incorporación de herramientas como la Realidad Aumentada, están reflejando una nueva forma de ver y entender el proceso de enseñanza y de aprendizaje. En este sentido, este artículo presenta la visión que un grupo de profesores en formación tienen de la Realidad Aumentada en la Educación Primaria de modo que se pueda esclarecer la viabilidad o no de la utilización de esta tecnología en el aprendizaje en este nivel educativo. Así, mediante el empleo de un diseño ex post facto, se ha creado un cuestionario conformado por 30 ítems, distribuidos en 6 dimensiones, empleando una escala de respuesta tipo Likert de 5 opciones. La muestra ha estado compuesta por N=520 maestros en formación de la Universidad de Córdoba. El objetivo principal de la investigación ha sido: evaluar las posibilidades y potencialidades que ofrecen diferentes softwares utilizados para la creación de entornos tecnológicos bajo la arquitectura de la Realidad Aumentada para ser utilizados en contextos formativos universitarios. El principal resultado alcanzado refleja la no existencia de diferencias en torno a la percepción que los maestros tienen de la RA en el ámbito de la educación primaria, que esta es una herramienta de difícil uso con alumnado con necesidades específicas de apoyo educativo y, que una vez dominada, sería fácil de ser incorporada a su acción docente.// Working today with digital resources in the classroom is a reality without the possibility of questioning. In this sense, the incorporation of tools such as Augmented Reality (from now on AR) are reflecting a new way of seeing and understanding the teaching and learning process. Its use for curriculum development is very diverse as well as the different ways of incorporating them, depending on the perspective that teachers have of it. In this sense, this article presents the vision that a group of pre-service teachers have of AR in Primary Education, so that the viability or not of the use of this technology in the learning in this educational level can be clarified. Thus, by using an ex post facto design, by the collection the dates a questionnaire with 30 items has been created, distributed in 6 dimensions, using a Likert type response scale of 5 options. The sample has been composed of N=520 students from the University of Córdoba. The main objective of the research has been: to evaluate the possibilities and potentials offered by different software used for the creation of technological environments under the AR architecture to be used in university formative contexts. The main result achieved reflects the non-existence of differences around the perception that teachers have of the RA in the field of primary education that this is a difficult-to-use tool with students with specific educational support needs and that once dominated would be easy to be incorporated into your teaching action

A construction of MDS array codes

In this paper a new construction of MDS array codes is introduced. In order to obtain a code with this property, the parity-check matrix is constructed just using a superregular matrix of blocks composed of powers of the companion matrix of a primitive polynomial. Also a decoding algorithm for these codes is introduced.The work of the first and the second authors was partially supported by Spanish grant MTM2011-24858 of the Ministerio de Economía y Competitividad of the Gobierno de España. The work of first author was also partially supported by a grant for research students from the Generalitat Valenciana with reference BFPI/2008/138. The work of the third author was partially supported by the research project UMH-Bancaja with reference IPZS01

Weighted Reed-Solomon convolutional codes

In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to the context of convolutional codes. For this reason we call them weighted Reed-Solomon (WRS) convolutional codes. We show that under some constraints on the defining parameters these codes are Maximum Distance Profile (MDP), which means that they have the maximal possible growth in their column distance profile. We study the size of the field needed to obtain WRS convolutional codes which are MDP and compare it with the existing general constructions of MDP convolutional codes in the literature, showing that in many cases WRS convolutional codes require significantly smaller fields.Comment: 30 page

Perceived Utility of Video Games in the Learning Process in Secondary Education—Case Studies

The incorporation of videogames into the training of students is a reality that becomes very important to the extent that they are becoming more relevant in their personal lives. Linking aspects of their informal to formal life implies taking into account how students perceive this link. The purpose of this work is to determine what the perceived utility values are among secondary school students towards the inclusion of video games in the curricular development of the contents of the said educational stage, paying attention to the educational approach of video games. The quantitative methodology used is based on explaining the relationship between variables through a multiple linear regression analysis, targeted at 223 secondary education students. It has been proven that this utility is linked to the attitude that the student has towards the following aspects: The culture of educational success, diversity, and inclusion, as well as coexistence. Therefore, we consider that the linkage development of content-video games is an element in value to be incorporated into the classroom methodology by the teacher

Interleaving Shifted Versions of a PN-Sequence

The output sequence of the shrinking generator can be considered as an interleaving of determined shifted versions of a single PN -sequence. In this paper, we present a study of the interleaving of a PN-sequence and shifted versions of itself. We analyze some important cryptographic properties as the period and the linear complexity in terms of the shifts. Furthermore, we determine the total number of the interleaving sequences that achieve each possible value of the linear complexity.This research is partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R. It is also supported by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. Finally, the third author is partially supported by Spanish grant VIGROB-287 of the Universitat d’Alacant

Computational Analysis of Interleaving PN-Sequences with Different Polynomials

Binary PN-sequences generated by LFSRs exhibit good statistical properties; however, due to their intrinsic linearity, they are not suitable for cryptographic applications. In order to break such a linearity, several approaches can be implemented. For example, one can interleave several PN-sequences to increase the linear complexity. In this work, we present a deep randomness study of the resultant sequences of interleaving binary PN-sequences coming from different characteristic polynomials with the same degree. We analyze the period and the linear complexity, as well as many other important cryptographic properties of such sequences.This work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/ 10.13039/501100011033). It was also supported by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. The work of the second author was partially supported by Spanish grant VIGROB-287 of the University of Alicante

A Construction of Bent Functions of n + 2 Variables from a Bent Function of n Variables and Its Cyclic Shifts

We present a method to iteratively construct new bent functions of n + 2 variables from a bent function of n variables and its cyclic shift permutations using minterms of n variables and minterms of 2 variables. In addition, we provide the number of bent functions of n + 2 variables that we can obtain by applying the method here presented, and finally we compare this method with a previous one introduced by us in 2008 and with the Rothaus and Maiorana-McFarland constructions.The work of the first author was partially supported by Spanish Grant MTM2011-24858 of the Ministerio de Economía y Competitividad of the Gobierno de España

An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences

Binary sequences are algebraic structures currently used as security elements in Internet of Things devices, sensor networks, e-commerce, and cryptography. In this work, a contribution to the evaluation of such sequences is introduced. In fact, we present a novel algorithm to compute a fundamental parameter for this kind of structure: the linear complexity, which is related to the predictability (or non-predictability) of the binary sequences. Our algorithm reduced the computation of the linear complexity to just the addition modulo two (XOR logic operation) of distinct terms of the sequence. The performance of this procedure was better than that of other algorithms found in the literature. In addition, the amount of required sequence to perform this computation was more realistic than in the rest of the algorithms analysed. Tables, figures, and numerical results complete the work.This work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), Project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033), co-funded by the European Regional Development Fund (ERDF, EU). It is also supported by Comunidad de Madrid (Spain) under Project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. The work of the second author was partially supported by Spanish Grant VIGROB-287 of the University of Alicante

Meta-analysis of research in e-learning Spanish journal published

E-learning is a way of teaching that presently makes greater sense in the process of democratization of education. This articles describes a meta-analysis performed on Spanish journals found in Social Sciences and Law areas (N = 118) indexed in JCR and SCOPUS and awarded with the FECYT seal, that have published articles on this topic in the last 5 years (2011–2015). The total number of articles analyzed was 108. The main results show that these have focused on studies on academic efficiency, learning, teaching and cognitive styles, and interaction and communication. The main conclusion reached was the need for a study on the reasoning behind why elements such assessments are not treated in these articles

On the construction of new bent functions from the max-weight and min-weight functions of old bent functions

Given a bent function f (x) of n variables, its max-weight and min-weight functions are introduced as the Boolean functions f + (x) and f − (x) whose supports are the sets {a ∈ Fn2 | w( f ⊕la) = 2n−1+2 n 2 −1} and {a ∈ Fn2 | w( f ⊕la) = 2n−1−2 n 2 −1} respectively, where w( f ⊕ la) denotes the Hamming weight of the Boolean function f (x) ⊕ la(x) and la(x) is the linear function defined by a ∈ Fn2 . f + (x) and f − (x) are proved to be bent functions. Furthermore, combining the 4 minterms of 2 variables with the max-weight or min-weight functions of a 4-tuple ( f0(x), f1(x), f2(x), f3(x)) of bent functions of n variables such that f0(x) ⊕ f1(x) ⊕ f2(x) ⊕ f3(x) = 1, a bent function of n + 2 variables is obtained. A family of 4-tuples of bent functions satisfying the above condition is introduced, and finally, the number of bent functions we can construct using the method introduced in this paper are obtained. Also, our construction is compared with other constructions of bent functions