The development and implementation of math projects in a HEI: expectations, objectives, experiences and analysis

An overwhelming problem in Math Curriculums in Higher Education Institutions (HEI), we are daily facing in the last decade, is the substantial differences in Math background of our students. When you try to transmit, engage and teach subjects/contents that your “audience” is unable to respond to and/or even understand what we are trying to convey, it is somehow frustrating. In this sense, the Math projects and other didactic strategies, developed through Learning Management System Moodle, which include an array of activities that combine higher order thinking skills with math subjects and technology, for students of HE, appear as remedial but important, proactive and innovative measures in order to face and try to overcome these considerable problems. In this paper we will present some of these strategies, developed in some organic units of the Polytechnic Institute of Porto (IPP). But, how “fruitful” are the endless number of hours teachers spent in developing and implementing these platforms? Do students react to them as we would expect? Do they embrace this opportunity to overcome their difficulties? How do they use/interact individually with LMS platforms? Can this environment that provides the teacher with many interesting tools to improve the teaching – learning process, encourages students to reinforce their abilities and knowledge? In what way do they use each available material – videos, interactive tasks, texts, among others? What is the best way to assess student’s performance in these online learning environments? Learning Analytics tools provides us a huge amount of data, but how can we extract “good” and helpful information from them? These and many other questions still remain unanswered but we look forward to get some help in, at least, “get some drafts” for them because we feel that this “learning analysis”, that tackles the path from the objectives to the actual results, is perhaps the only way we have to move forward in the “best” learning and teaching direction.

Factoriality and the pin-reutenauer procedure

We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature is closed under taking factors within the free pro-V semigroup on the same set of generators. Furthermore, we show that the natural analogue of the Pin-Reutenauer descriptive procedure for the closure of a rational language in the free group with respect to the profinite topology holds for the pseudovariety of all finite semigroups. As an application, we establish that a pseudovariety enjoys this property if and only if it is full.

Statistical mechanics of multi-edge networks

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Statistical mechanics of multi-edge networks

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Pistes per a l'avaluació: Com hauria de ser l’avaluació de l’educació matemàtica infantil?

Sobre l'avaluació del coneixement matemàtic dels infants

L'ús de quaderns d'activitats per aprendre matemàtiques a l'educació infantil

Aquest article fa una reflexió sobre el panorama actual referent a læús dels quaderns de matemàtiques a læeducació infantil, com també sobre algunes qüestions que tenen a veure amb les professionals i els professionals implicats en el desenvolupament del pensament matemàtic de les criatures dæaquesta etapa

Proceedings of JAC 2010. Journées Automates Cellulaires

The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.

Impacts des TIC sur la motivation des étudiants à l’apprentissage des mathématiques à l’Université Abdou Moumouni au Niger

Cette recherche porte sur l’amélioration de la motivation à l’apprentissage des mathématiques à l’Université Abdou Moumouni. Elle se situe dans une dynamique globale de mise au point d’actions pédagogiques pour remédier au problème préoccupant de la motivation à l’apprentissage des sciences. Plus spécifiquement, il s’agit de prospecter si les environnements virtuels d’apprentissage peuvent contribuer à l’amélioration de la transmission des savoirs dans un contexte universitaire au Niger. Ainsi, notre recherche vise à mieux comprendre l’impact de l’intégration des TIC sur la motivation chez des étudiants à apprendre les mathématiques au Niger. Les trois objectifs spécifiques de notre recherche sont : explorer les impacts sur le sentiment de compétence chez des étudiants à l’apprentissage des mathématiques dans un contexte d’intégration pédagogique des TIC; mieux comprendre le changement des types de motivations autodéterminées à l’apprentissage des mathématiques chez des étudiants exposés à une intégration pédagogique des TIC; comprendre les perceptions de l’usage d’un environnement virtuel à l’apprentissage des mathématiques chez des étudiants et l’évolution de leurs motivations autodéterminées. Se fondant sur une méthodologie de type mixte, cette recherche quasi-expérimentale a consisté en la collecte de données quantitatives au moyen de 2 questionnaires sur la motivation (sentiment de compétence et sentiment d’autodétermination) en pré-test et en post-test. Pour les données qualitatives, nous avons eu recours à des entrevues dirigées auprès de 9 participants. Au total 61 étudiants inscrits en science de la vie et de la terre, dont 51 hommes, ont participé à la recherche. La thèse respecte le mode de présentation par articles. Chacun des trois articles est en lien avec un des trois objectifs de la recherche, dans l’ordre cité plus haut. Les principaux résultats indiquent un impact positif sur la motivation à travers un recul du sentiment négatif de compétence chez les étudiants ayant bénéficié de l’apport des TIC comparativement aux étudiants ordinaires. En ce qui concerne le sentiment d’autodétermination, chez les étudiants ayant bénéficié de l’apport pédagogique des TIC, il est mis en évidence une stagnation ou une légère baisse des motivations peu ou pas autodéterminées et une légère hausse ou une stagnation des motivations autodéterminées chez les étudiants ayant bénéficié de l’apport des TIC. Finalement, la recherche a permis de mettre en relief l'existence de corrélations positives entre l’augmentation des motivations autodéterminées et la perception d’une qualité positive de l’expérience d'innovation pédagogique que représente l’environnement virtuel d’apprentissage des mathématiques. En définitive, cette recherche fait ressortir l’importance de l'intégration pédagogique des TIC pour améliorer les pratiques pédagogiques actuelles, et satisfaire deux besoins psychologiques fondamentaux, notamment le sentiment de compétence et le sentiment d’autodétermination, deux composantes essentielles de la motivation selon la théorie de l’autodétermination de Deci et Ryan. Les résultats obtenus dégagent des perspectives intéressantes en vue de renforcer les recours aux environnements virtuels d'apprentissage au profit de la motivation à l'apprentissage des mathématiques. Les forces et les limites de la recherche sont discutées et un ensemble de recommandations sont émises à l’intention des acteurs académiques, notamment les perspectives assez prometteuses de l’intégration pédagogique des TIC au service de l'apprentissage des sciences en Afrique, et au Niger en particulier.

Clique Irreducibility and Clique Vertex Irreducibility of Graphs

A graphs G is clique irreducible if every clique in G of size at least two,has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irreducibility and clique irreducibility of graphs which are non-complete extended p-sums (NEPS) of two graphs are studied. We prove that if G(c) has at least two non-trivial components then G is clique vertex reducible and if it has at least three non-trivial components then G is clique reducible. The cographs and the distance hereditary graphs which are clique vertex irreducible and clique irreducible are also recursively characterized.

Convex extendable trees

The concept of convex extendability is introduced to answer the problem of finding the smallest distance convex simple graph containing a given tree. A problem of similar type with respect to minimal path convexity is also discussed.

Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes

An antimedian of a pro le = (x1; x2; : : : ; xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the pro le. The antimedian function is de ned on the set of all pro les on G and has as output the set of antimedians of a pro le. It is a typical location function for nding a location for an obnoxious facility. The `converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes.

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

Mathematical Morphology on Hypergraphs Using Vertex-Hyperedge Correspondence

The focus of this paper is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyperedge set of a hypergraph , by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of . This paper also studies the concept of morphological adjunction on hypergraphs for which both the input and the output are hypergraphs

Innovación y mejora del proceso de evaluación del aprendizaje. Una investigación-acción colaborativa en la asignatura Matemática I de los estudios de ingeniería de la UNEXPO, Vicerrectorado Puerto Ordaz, Venezuela

Esta investigación es un trabajo de intervención que se ha enmarcado dentro de la metodología cualitativa, bajo una perspectiva interpretativa, asumiendo como fundamento el desarrollo de un proceso de análisis participativo, en la que se han unido docentes y estudiantes en un proceso de reconocimiento y comprensión de la dinámica que gira alrededor del proceso de enseñanza y aprendizaje de Matemática I, en la Universidad Nacional Experimental Politécnica "Antonio José de Sucre" (UNEXPO), Vicerrectorado Puerto Ordaz, Estado Bolívar, Venezuela. Es por ello que la investigación se ha situado, particularmente, en la perspectiva de la investigación-acción colaborativa, en la que han participado los profesores colaboradores de manera activa en una serie de acciones promotoras de cambios en sus ámbitos de actuación y de acuerdo con sus necesidades, para interpretar las implicaciones de esos cambios en su desarrollo y valorar las transformaciones que se iban dando dentro del proceso.