Ponències/Comunicacions de congressos
http://hdl.handle.net/2117/3920
2024-03-29T04:46:26ZStatistics inquiry and the students’ engagement in the change of paradigm
http://hdl.handle.net/2117/405013
Statistics inquiry and the students’ engagement in the change of paradigm
Freixanet de la Iglesia, Maria Josep; Alsina Aubach, Montserrat; Bosch Casabò, Marianna
The Anthropological Theory of the Didactic introduces an instructional proposal called “study and research paths” (SRPs) based on the study of open questions that integrates inquiry processes with the study of new content to elaborate answers to the questions addressed. The aim of this paper is to analyse the students’ perspectives to an activity carried out as an SRP to teach statistics in grade 10 and compare it to a previous one implemented as a more traditional statistical project. The analysis is based on the results of a survey and semi-structured interviews to students who participated in both the SRP and the project activity. They show an increase of students’ responsibilities in the inquiry process and an improvement of their engagement.
2024-03-20T12:20:47ZFreixanet de la Iglesia, Maria JosepAlsina Aubach, MontserratBosch Casabò, MariannaThe Anthropological Theory of the Didactic introduces an instructional proposal called “study and research paths” (SRPs) based on the study of open questions that integrates inquiry processes with the study of new content to elaborate answers to the questions addressed. The aim of this paper is to analyse the students’ perspectives to an activity carried out as an SRP to teach statistics in grade 10 and compare it to a previous one implemented as a more traditional statistical project. The analysis is based on the results of a survey and semi-structured interviews to students who participated in both the SRP and the project activity. They show an increase of students’ responsibilities in the inquiry process and an improvement of their engagement.Moving from an ERASMUS+ innovation project on mathematics in engineering education to the teaching practice: Learnings from the UPC experience
http://hdl.handle.net/2117/404938
Moving from an ERASMUS+ innovation project on mathematics in engineering education to the teaching practice: Learnings from the UPC experience
Serrat Piè, Carles; Estela Carbonell, M. Rosa; Bruguera Padró, Maria Montserrat; Pantazi, Chara
The main aim of this Research-to-Practice Workin-Progress paper is to analyze, discuss and share with the academic community the application of the outputs of research and innovation projects to the real teaching practice with students at the engineering schools. In particular we will focus on the results of the innovation project EngiMath in which the authors were participating. Some EngiMath@UPC figures show the project relevance and impact: 20 faculty members belonging to 3 departments collaborating in, teaching at 9 technical schools located in 7 campuses, involving 15 bachelor degrees and 13 math subjects, and potentially impacting on almost 2000 students in the course 2021-2022. Details on the project implementation, students’ follow-up methodology, qualitative and quantitative analysis of the longitudinal student-specific profiles and performance of the course, pros and cons discussion, main conclusions and recommended actions to be taken into account when using this open online educational resource will be introduced and discussed along the paper.
2024-03-19T13:01:48ZSerrat Piè, CarlesEstela Carbonell, M. RosaBruguera Padró, Maria MontserratPantazi, CharaThe main aim of this Research-to-Practice Workin-Progress paper is to analyze, discuss and share with the academic community the application of the outputs of research and innovation projects to the real teaching practice with students at the engineering schools. In particular we will focus on the results of the innovation project EngiMath in which the authors were participating. Some EngiMath@UPC figures show the project relevance and impact: 20 faculty members belonging to 3 departments collaborating in, teaching at 9 technical schools located in 7 campuses, involving 15 bachelor degrees and 13 math subjects, and potentially impacting on almost 2000 students in the course 2021-2022. Details on the project implementation, students’ follow-up methodology, qualitative and quantitative analysis of the longitudinal student-specific profiles and performance of the course, pros and cons discussion, main conclusions and recommended actions to be taken into account when using this open online educational resource will be introduced and discussed along the paper.Classification systems for the built environment: a cornerstone for the long-term performance analysis
http://hdl.handle.net/2117/404912
Classification systems for the built environment: a cornerstone for the long-term performance analysis
Serrat Piè, Carles; Royano García, Verónica; Gibert Armengol, Vicente; Rapinski, Jacek
In the long-term performance analysis of the built environment, classification systems are seen as a key consideration. When classifying residential building objects, characteristics such as accuracy, exhaustivity, and consistency are required. It is noticeable that while organizations around the world are working to develop an internationally agreed standard classifier, the use of national classification systems remains widespread. Therefore, this paper focuses on reviewing the most popular classification systems such as CoClass, Uniclass 2015 and OmniClass®, among others, and discusses their strengths and weaknesses, in order to be useful both to the research and technical communities. Based on this, two main contributions are derived. On the one hand, the paper points out that there is no international consensus to use a common classification system. On the other hand, some recommendations are given and illustrated to meet the challenges of classifying existing buildings, in particular under a functional assessment approach.
2024-03-19T10:43:04ZSerrat Piè, CarlesRoyano García, VerónicaGibert Armengol, VicenteRapinski, JacekIn the long-term performance analysis of the built environment, classification systems are seen as a key consideration. When classifying residential building objects, characteristics such as accuracy, exhaustivity, and consistency are required. It is noticeable that while organizations around the world are working to develop an internationally agreed standard classifier, the use of national classification systems remains widespread. Therefore, this paper focuses on reviewing the most popular classification systems such as CoClass, Uniclass 2015 and OmniClass®, among others, and discusses their strengths and weaknesses, in order to be useful both to the research and technical communities. Based on this, two main contributions are derived. On the one hand, the paper points out that there is no international consensus to use a common classification system. On the other hand, some recommendations are given and illustrated to meet the challenges of classifying existing buildings, in particular under a functional assessment approach.El problema inverso de autovalores para matrices de Jacobi no negativas y bisimétricas
http://hdl.handle.net/2117/404707
El problema inverso de autovalores para matrices de Jacobi no negativas y bisimétricas
Encinas Bachiller, Andrés Marcos; Jiménez Jiménez, María José; Mitjana Riera, Margarida; Marijuan López, Carlos; Pisonero Pérez, Miriam
En esta comunicación presentamos nuestros recientes resultados en el problema inverso nonegativo para matrices de Jacobi bisimétricas, que consisten en nuevas condiciones necesarias
para que una lista dada de números reales sea realizable por una matriz de Jacobi bisimétrica no
negativa. La principal novedad de nuestras técnicas es considerar las diferencias entre autovalores como las variables fundamentales, en lugar de utilizar como tales a los propios autovalores.
También hemos obtenido la expresión de la única realización de Jacobi bisimétrica de cualquier
lista de tamaño no superior a seis.
2024-03-15T11:08:20ZEncinas Bachiller, Andrés MarcosJiménez Jiménez, María JoséMitjana Riera, MargaridaMarijuan López, CarlosPisonero Pérez, MiriamEn esta comunicación presentamos nuestros recientes resultados en el problema inverso nonegativo para matrices de Jacobi bisimétricas, que consisten en nuevas condiciones necesarias
para que una lista dada de números reales sea realizable por una matriz de Jacobi bisimétrica no
negativa. La principal novedad de nuestras técnicas es considerar las diferencias entre autovalores como las variables fundamentales, en lugar de utilizar como tales a los propios autovalores.
También hemos obtenido la expresión de la única realización de Jacobi bisimétrica de cualquier
lista de tamaño no superior a seis.Graphs attaining the upper bound on the isolation number
http://hdl.handle.net/2117/404686
Graphs attaining the upper bound on the isolation number
Lemanska, Magdalena; Mora Giné, Mercè; Souto Salorio, María josé
A set D of vertices of a graph is isolating if the set of vertices not belonging to D or not having a neighbour in D is independent. The isolation number of a graph G, denoted by ¿(G), is the minimum cardinality of an isolating set. It is known that ¿(G) = n/3 if G is a connected graph of order n, n = 3, different from a cycle of order 5. Moreover, trees attaining this upper bound have been characterized. In this work we characterize all unicyclic and block graphs of order n such that ¿(G) = n/3.
2024-03-15T09:33:53ZLemanska, MagdalenaMora Giné, MercèSouto Salorio, María joséA set D of vertices of a graph is isolating if the set of vertices not belonging to D or not having a neighbour in D is independent. The isolation number of a graph G, denoted by ¿(G), is the minimum cardinality of an isolating set. It is known that ¿(G) = n/3 if G is a connected graph of order n, n = 3, different from a cycle of order 5. Moreover, trees attaining this upper bound have been characterized. In this work we characterize all unicyclic and block graphs of order n such that ¿(G) = n/3.Shortest coordinated motion for square robots
http://hdl.handle.net/2117/403861
Shortest coordinated motion for square robots
Esteban Pascual, Guillermo; Halperin, Dan; Ruíz, Víctor; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio
We study the problem of determining minimum-length coordinated motions for two axis-aligned square robots translating in an obstacle-free plane: Given feasible start and goal configurations, find a continuous motion for the two squares from start to goal, comprising only robot-robot collision-free configurations, such that the total Euclidean distance traveled by the two squares is minimal among all possible such motions. We present an adaptation of the tools developed for the case of discs by Kirkpatrick and Liu [Characterizing minimum-length coordinated motions for two discs. Proceedings 28th CCCG, 252-259, 2016; CoRR abs/1607.04005, 2016.] to the case of squares. Certain aspects of the case of squares are more complicated, requiring additional and more involved arguments over the case of discs. Our contribution can serve as a basic component in optimizing the coordinated motion of two squares among obstacles, as well as for local planning in sampling-based algorithms, which are often used in practice, in the same setting.
2024-03-06T12:30:57ZEsteban Pascual, GuillermoHalperin, DanRuíz, VíctorSacristán Adinolfi, VeraSilveira, Rodrigo IgnacioWe study the problem of determining minimum-length coordinated motions for two axis-aligned square robots translating in an obstacle-free plane: Given feasible start and goal configurations, find a continuous motion for the two squares from start to goal, comprising only robot-robot collision-free configurations, such that the total Euclidean distance traveled by the two squares is minimal among all possible such motions. We present an adaptation of the tools developed for the case of discs by Kirkpatrick and Liu [Characterizing minimum-length coordinated motions for two discs. Proceedings 28th CCCG, 252-259, 2016; CoRR abs/1607.04005, 2016.] to the case of squares. Certain aspects of the case of squares are more complicated, requiring additional and more involved arguments over the case of discs. Our contribution can serve as a basic component in optimizing the coordinated motion of two squares among obstacles, as well as for local planning in sampling-based algorithms, which are often used in practice, in the same setting.Shortest paths in portalgons
http://hdl.handle.net/2117/403858
Shortest paths in portalgons
Löffler, M.; Ophelders, Tim; Silveira, Rodrigo Ignacio; Staals, Frank
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric. We refer to such a representation as a portalgon, and we call two portalgons equivalent if the surfaces they represent are isometric. We analyze the complexity of shortest paths. We call a fragment happy if any shortest path on the portalgon visits it at most a constant number of times. A portalgon is happy if all of its fragments are happy. We present an efficient algorithm to compute shortest paths on happy portalgons. The number of times that a shortest path visits a fragment is unbounded in general. We contrast this by showing that the intrinsic Delaunay triangulation of any polyhedral surface corresponds to a happy portalgon. Since computing the intrinsic Delaunay triangulation may be inefficient, we provide an efficient algorithm to compute happy portalgons for a restricted class of portalgons.
2024-03-06T12:17:17ZLöffler, M.Ophelders, TimSilveira, Rodrigo IgnacioStaals, FrankAny surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric. We refer to such a representation as a portalgon, and we call two portalgons equivalent if the surfaces they represent are isometric. We analyze the complexity of shortest paths. We call a fragment happy if any shortest path on the portalgon visits it at most a constant number of times. A portalgon is happy if all of its fragments are happy. We present an efficient algorithm to compute shortest paths on happy portalgons. The number of times that a shortest path visits a fragment is unbounded in general. We contrast this by showing that the intrinsic Delaunay triangulation of any polyhedral surface corresponds to a happy portalgon. Since computing the intrinsic Delaunay triangulation may be inefficient, we provide an efficient algorithm to compute happy portalgons for a restricted class of portalgons.El secreto mejor guardado: aprendiz de hacker
http://hdl.handle.net/2117/403602
El secreto mejor guardado: aprendiz de hacker
Gómez Urgellés, Joan Vicenç
Se presenta una experiencia de aprendizaje de aritmética modular contextualizada en el mundo de la seguridad informática. Todo ello bajo el hilo conductor de una hipotética historia, presentada como un juego de ordenador, de unos jóvenes que quieren "averiguar" donde el profesor esconde el examen de matemáticas y evidentemente su contenido. El escenario consiste en ir descubriendo secretos y resolviendo "enigmas" hasta llegar al objetivo; por eso necesitan el uso de los algoritmos propios de codificación y elementos de álgebra lineal. Por tanto, el objetivo es el aprendizaje de aritmética modular a partir de los modelos matemáticos involucrados. De hecho, el juego presentado en la comunicación queda plasmado en la web: https://view.genial.ly/61a0dbbcbc61af0dff73b86b/presentation-presentacion-basica
la cual contiene toda la trama que debe seguirse. Se contextualiza en primer curso de matemáticas del Grado de Informática de la UPC
2024-03-01T14:05:14ZGómez Urgellés, Joan VicençSe presenta una experiencia de aprendizaje de aritmética modular contextualizada en el mundo de la seguridad informática. Todo ello bajo el hilo conductor de una hipotética historia, presentada como un juego de ordenador, de unos jóvenes que quieren "averiguar" donde el profesor esconde el examen de matemáticas y evidentemente su contenido. El escenario consiste en ir descubriendo secretos y resolviendo "enigmas" hasta llegar al objetivo; por eso necesitan el uso de los algoritmos propios de codificación y elementos de álgebra lineal. Por tanto, el objetivo es el aprendizaje de aritmética modular a partir de los modelos matemáticos involucrados. De hecho, el juego presentado en la comunicación queda plasmado en la web: https://view.genial.ly/61a0dbbcbc61af0dff73b86b/presentation-presentacion-basica
la cual contiene toda la trama que debe seguirse. Se contextualiza en primer curso de matemáticas del Grado de Informática de la UPCJet transport-based analysis of absolute reachable domain under a single impulse
http://hdl.handle.net/2117/401895
Jet transport-based analysis of absolute reachable domain under a single impulse
Zhang, Junhua; Chen, Jianlin; Li, Wenchao; Masdemont Soler, Josep; Shi, Min
This paper proposes a jet transport-based semi-analytical method to precisely compute spacecraft absolute reachable domain under a single impulse, with the consideration of the main orbital perturbations. Firstly, the transition relationship between the Cartesian coordinates and the cylindrical coordinates is employed to map four main orbital perturbations, including non-spherical gravity, solar radiation pressure, solar and lunar attractions, from the Earth's inertial reference system to the cylindrical coordinate reference system. Then, for ease of illustration, the nonlinear dynamical model described by the cylindrical coordinates is employed and a random single impulse with fixed size and arbitrary direction is suitable parameterized by a state interval set. Finally, the differential algebra technique implemented in Jet Transport package is used to precisely and efficiently represent the propagation behavior of a single impulse set along the nonlinear spacecraft dynamical model. As a result, the envelope of the absolute reachable domain can be obtained as a polynomial representation. Numerical simulations, considering different types of orbital perturbations, are carried out to compute spacecraft reachable domain under a single impulse.
2024-02-14T11:49:35ZZhang, JunhuaChen, JianlinLi, WenchaoMasdemont Soler, JosepShi, MinThis paper proposes a jet transport-based semi-analytical method to precisely compute spacecraft absolute reachable domain under a single impulse, with the consideration of the main orbital perturbations. Firstly, the transition relationship between the Cartesian coordinates and the cylindrical coordinates is employed to map four main orbital perturbations, including non-spherical gravity, solar radiation pressure, solar and lunar attractions, from the Earth's inertial reference system to the cylindrical coordinate reference system. Then, for ease of illustration, the nonlinear dynamical model described by the cylindrical coordinates is employed and a random single impulse with fixed size and arbitrary direction is suitable parameterized by a state interval set. Finally, the differential algebra technique implemented in Jet Transport package is used to precisely and efficiently represent the propagation behavior of a single impulse set along the nonlinear spacecraft dynamical model. As a result, the envelope of the absolute reachable domain can be obtained as a polynomial representation. Numerical simulations, considering different types of orbital perturbations, are carried out to compute spacecraft reachable domain under a single impulse.Computational methodologies for quasi-periodic orbits and invariant manifold connections in non-autonomous problems
http://hdl.handle.net/2117/401879
Computational methodologies for quasi-periodic orbits and invariant manifold connections in non-autonomous problems
Li, Ruilong; Masdemont Soler, Josep; Zhu, Zhanxia
Semi-analytical and numerical techniques to systematically analyze and compute natural connections between quasi-periodic orbits associated to non-autonomous systems are considered. Focusing in the non-autonomous Sun-Earth+Moon coherent qbcp model, the center-unstable and center-stable invariant manifolds of Lyapunov quasiperiodic orbits are parameterized and a methodology to detect heteroclinic connections between manifolds is introduced. The methodology aims to decrease the number of degrees of freedom of the problem and to address the issue of searching good initial conditions inside the high dimensional state space. In this way, connections are found by searching approximate patch points on a Poincaré section and then they are refined to obtain smooth connections. The procedure is suitable for the implementation of a continuation method in the families.
2024-02-14T10:37:00ZLi, RuilongMasdemont Soler, JosepZhu, ZhanxiaSemi-analytical and numerical techniques to systematically analyze and compute natural connections between quasi-periodic orbits associated to non-autonomous systems are considered. Focusing in the non-autonomous Sun-Earth+Moon coherent qbcp model, the center-unstable and center-stable invariant manifolds of Lyapunov quasiperiodic orbits are parameterized and a methodology to detect heteroclinic connections between manifolds is introduced. The methodology aims to decrease the number of degrees of freedom of the problem and to address the issue of searching good initial conditions inside the high dimensional state space. In this way, connections are found by searching approximate patch points on a Poincaré section and then they are refined to obtain smooth connections. The procedure is suitable for the implementation of a continuation method in the families.