Simulador social como herramienta en la educación para la ciudadanía

En este documento se relata la experiencia de la autora como profesora de preparatoria del Instituto Tecnológico y de Estudios Superiores de Monterrey, Campus Guadalajara. Se expone el trabajo de desarrollo en los estudiantes de la competencia de educación para la ciudadanía a través de un simulador social creado por la autora, con el propósito de fomentar el compromiso ciudadano. El objetivo del estudio es demostrar cómo el estudiante, por medio de un proyecto académico, puede desarrollar ideas que aporten a la sociedad y, al mismo tiempo, empatice con los problemas que la aquejan. El estudiante desarrolla competencias propias de educación para la ciudadanía por medio de la investigación y análisis de su entorno, y adquiere un alto nivel de compromiso hacia la sociedad en donde identifica su papel como ciudadano

Happiness and Cultural Tourism: The Perspective of Civil Participation

In this research we analyze links between happiness and cultural tourism, taking the European Holy Grail Route in Spain as a cultural tourist product. Questions that arise are, among others, can cultural tourism generate understanding and social cohesion? Consequently, can it also mean increasing the happiness of both tourists and the host population? How and what can be learned from cultural tourism as a peaceful social process? Specifically, a qualitative approach was made in which we conducted semi-structured interviews with people belonging to civil society associations linked to the route. An analysis of the narratives (from the interviews) through the grounded theory was carried out. Improved individual reasons for happiness and social cohesion as a result of positive significant experiences are observed in the first step of results, and an exportable Decalogue of social behavior in cultural tourism experiences is presented and evaluated by the interviewees and shown as a research proposal

Finite size corrections to random Boolean networks

Since their introduction, Boolean networks have been traditionally studied in view of their rich dynamical behavior under different update protocols and for their qualitative analogy with cell regulatory networks. More recently, tools borrowed from statistical physics of disordered systems and from computer science have provided a more complete characterization of their equilibrium behavior. However, the largest part of the results have been obtained in the thermodynamic limit, which is often far from being reached when dealing with realistic instances of the problem. The numerical analysis presented here aims at comparing - for a specific family of models - the outcomes given by the heuristic belief propagation algorithm with those given by exhaustive enumeration. In the second part of the paper some analytical considerations on the validity of the annealed approximation are discussed.Comment: Minor correction

Exhaustive enumeration unveils clustering and freezing in random 3-SAT

We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.Comment: 4 pages, 3 figure

On the complexity of strongly connected components in directed hypergraphs

We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure

Mining association rules for label ranking

Lecture Notes in Computer Science Volume 6635, 2011.Recently, a number of learning algorithms have been adapted for label ranking, including instance-based and tree-based methods. In this paper, we continue this line of work by proposing an adaptation of association rules for label ranking based on the APRIORI algorithm. Given that the original APRIORI algorithm does not aim to obtain predictive models, two changes were needed for this achievement. The adaptation essentially consists of using variations of the support and confidence measures based on ranking similarity functions that are suitable for label ranking. Additionally we propose a simple greedy method to select the parameters of the algorithm. We also adapt the method to make a prediction from the possibly con icting consequents of the rules that apply to an example. Despite having made our adaptation from a very simple variant of association rules for classification, partial results clearly show that the method is making valid predictions. Additionally, they show that it competes well with state-of-the-art label ranking algorithms.This work was partially supported by project Rank! (PTDC/EIA/81178/2006) from FCT and Palco AdI project Palco3.0 financed by QREN and Fundo Europeu de Desenvolvimento Regional (FEDER). We thank the anonymous referees for useful comments

La comprensión y la inferencia en el estudio de hipertextos con el apoyo de un agente generador de preguntas

This document summarizes the results of a research project, named “Question generator software agents and the cognitive skill of making inferences: comprehension and inference at different levels, in hypermedia environments”, developed by the TECNICE Group at the Universidad Pedagogica Nacional in Bogotá, Colombia.We analyze the effect of using a question generator agent, during the study stage, on cognitive skill development of making inferences at three levels, by middle school students.An artificial software agent plays the role of making questions and its effect on the natural agent reasoning process is assessed. Question production helps the natural agent to identify what to learn (Ram, 1991). Following this approach, the software agent is able of generating questions on the geography knowledge domain based on three levels of the ontology used in the representation.The effect on the cognitive skill development of making inferences of students which studied a hypertext based on an ontological structure is compared with that of students which studied the same hypertext using a question generator agent in three arrangements: first , second an third level of questions, and user controlled system.This study shows a strong effect of the ontology used in the knowledge representation and the adaptive model, in the development of inference skill, compared with the questions controlled by the computer. Contrary to our expectations, students which tried high level questions did not achieve better than those who tried lower level questions and the data support the hypothesis of a specific effect of each question level on the inference learning.Este documento es una síntesis del proyecto “Agentes de software generadores de preguntas y el desarrollo de la competencia cognitiva de hacer inferencias: la comprensión y la inferencia en diferentes niveles de profundidad en ambientes hipermediales”, desarrollado por el Grupo tecnice de la Universidad Pedagógica Nacional de Colombia.La investigación analiza el efecto del uso de un agente de software generador de preguntas durante la etapa de estudio de un hipertexto en el desarrollo de competencias cognitivas de hacer inferencias a diferentes niveles, por parte de estudiantes de educación media.Hacer preguntas es la función de un agente artificial y se evalúa su efecto en el proceso de razonamiento de un agente natural. La generación de preguntas sirve al agente natural para que identifique lo que necesita aprender (Ram, 1991). En esta lógica se desarrolla un agente artificial que formula preguntas sobre el dominio de conocimiento de la geografía considerando tres niveles jerárquicos de la ontología usada en la representación.Se compara el efecto producido en el desarrollo de la competencia cognitiva de hacer inferencias de sujetos que estudian un hipertexto diseñado con base en una estructura ontológica y otros que estudian el mismo hipertexto con el generador de preguntas que opera en cuatro configuraciones: generación de preguntas de primero, segundo o tercer nivel y configurable a voluntad del usuario.El estudio muestra un efecto muy significativo de la ontología utilizada en la representación de conocimiento y del modelo adaptativo, sobre la capacidad de hacer inferencias, en contraste con la formulación de preguntas controlada por el computador. Contrario a lo esperado, el entrenamiento en preguntas de alto nivel no genera diferencias significativas con respecto al entrenamiento con preguntas de más bajo nivel y los resultados dan pie para sostener la hipótesis de efecto específico por nivel de entrenamiento