Patrones de interacción comunicativa del profesor universitario de matemáticas. Un estudio de caso

El presente trabajo se realizó para analizar los patrones de interacción comunicativa en las clases de algunos profesores de la Licenciatura en Matemáticas de la Universidad Pedagógica y Tecnológica de Colombia (UPTC). La investigación es cualitativa, interpretativa y hermenéutica. Se examinaron clases de un profesor, donde cada sesión se distribuyó en configuraciones didácticas y se analizaron las interacciones de cada configuración. En los resultados es preciso destacar que, entre las interacciones más frecuentes, se encuentran: la pregunta corta por parte del docente, al igual que la respuesta individual corta por parte del estudiante; las aclaraciones y explicaciones cortas del docente; la explicación amplia del docente y la auto respuesta por parte del mismo. De lo anterior, se puede concluir que, la clase del profesor es de tipo tradicional-tecnológico

Fast and Slow solutions in General Relativity: The Initialization Procedure

We apply recent results in the theory of PDE, specifically in problems with two different time scales, on Einstein's equations near their Newtonian limit. The results imply a justification to Postnewtonian approximations when initialization procedures to different orders are made on the initial data. We determine up to what order initialization is needed in order to detect the contribution to the quadrupole moment due to the slow motion of a massive body as distinct from initial data contributions to fast solutions and prove that such initialization is compatible with the constraint equations. Using the results mentioned the first Postnewtonian equations and their solutions in terms of Green functions are presented in order to indicate how to proceed in calculations with this approach.Comment: 14 pages, Late

The ant colony metaphor in continuous spaces using boundary search

This paper presents an application of the ant colony metaphor for continuous space optimization problems. The ant algortihm proposed works following the principle of the ant colony approach, i.e., a population of agents iteratively, cooperatively, and independently search for a solution. Each ant in the distributed algorithm applies a local search operator which explores the neighborhood region of a particular point in the search space (individual search level). The local search operator is designed for exploring the boundary between the feasible and infeasible search space. On the other hand, each ant obtains global information from the colony in order to exploit the more promising regions of the search space (cooperation level). The ant colony based algorithm presented here was successfully applied to two widely studied and interesting constrained numerical optimization test cases.Eje: Agentes y Sistemas Inteligentes (ASI)Red de Universidades con Carreras en Informática (RedUNCI

Current applications of ant systems for subset problems

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesman Problem). In this report we describe an Ant System algorithm, which would be appropriate for solving additional subset problems as was showed for solving the multiple knapsack problem in previous works. The experiments on progress show the potential power of the ACO approach for solving different subset problems.Eje: Sistemas inteligentes. Metaheurísticas.Red de Universidades con Carreras en Informática (RedUNCI

Current applications of ant systems for subset problems

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesman Problem). In this report we describe an Ant System algorithm, which would be appropriate for solving additional subset problems as was showed for solving the multiple knapsack problem in previous works. The experiments on progress show the potential power of the ACO approach for solving different subset problems.Eje: Sistemas inteligentes. Metaheurísticas.Red de Universidades con Carreras en Informática (RedUNCI

The ant colony metaphor in continuous spaces using boundary search

This paper presents an application of the ant colony metaphor for continuous space optimization problems. The ant algortihm proposed works following the principle of the ant colony approach, i.e., a population of agents iteratively, cooperatively, and independently search for a solution. Each ant in the distributed algorithm applies a local search operator which explores the neighborhood region of a particular point in the search space (individual search level). The local search operator is designed for exploring the boundary between the feasible and infeasible search space. On the other hand, each ant obtains global information from the colony in order to exploit the more promising regions of the search space (cooperation level). The ant colony based algorithm presented here was successfully applied to two widely studied and interesting constrained numerical optimization test cases.Eje: Agentes y Sistemas Inteligentes (ASI)Red de Universidades con Carreras en Informática (RedUNCI

Huerta urbana, labranza grande -San Blas-

Trabajo de gradoCon el ánimo de resolver el problema de la escasez de alimentos que tienen algunas familias del barrio san Blas, se propone una huerta urbana de 12.000 m2, que pretende ser distribuida mediante la asignación de parcelas a los núcleos familiares desplazados y a los menos favorecidos. Desde luego está orientada a la formación de alumnos de colegios vecinos o de otras localidades.PregradoArquitect