El Palacio Nacional de Cultura.

Título anterior de la publicación : Boletín de la Comisión Española de la UNESCO

IV Jornadas de Formación del Profesorado de Español : 8 - 9 de septiembre de 2011

Resumen basado en el de la publicación.

“La juventud prefiere ser estimulada que instruida” : estrategias y particularidades de la enseñanza de ELE para adolescentes

Resumen basado en el de la publicación.

Lo que en la juventud se aprende, toda la vida dura : los adolescentes y su aprendizaje en la clase de ELE

Resumen basado en el de la publicación.

¡Es hora de trabajar en equipo! : propuestas para un aprendizaje cooperativo en la clase de ELE

Se presenta un resumen general de las diferentes formas de aprendizaje con el fin de reflexionar acerca de las limitaciones y posibilidades de cada una de ellas. Su descripción llevará a establecer ciertas conclusiones teóricas que posteriormente se pondrán en práctica con actividades. Más concretamente, se pretende hacer un breve recorrido por las diferentes teorías del aprendizaje, centrándose especialmente en el aprendizaje cooperativo. Para ello, en primer lugar, se realiza una presentación de los tipos de aprendizaje más destacados, haciendo referencia a la aportación de las teorías y su aplicación en la enseñanza del español para luego enfrentarlas al llamado aprendizaje cooperativo, a través del cual se ponen en práctica actividades que ayudarán a percibir los fines de esta modalidad de aprendizaje, sus ventajas y sus inconvenientes, las habilidades necesarias del docente para manejar y transformar las prácticas docentes.

Las dificultades de los alumnos búlgaros en el aprendizaje del español

Resumen basado en el de la publicación.

Aprendemos haciendo

Se presenta un proyecto en el que participa el claustro del CEIP Rodr??guez Galv??n basado en la importancia del aprendizaje competencial del alumnado. A trav??s de este proyecto se puede participar y trabajar en contextos reales cuyos aprendizajes permiten el desarrollo de las competencias b??sicas. Se toma como eje tem??tico el voluntariado y se dise??a al amparo de la convocatoria Comenius, en colaboraci??n con centros de Ruman??a, Turqu??a, Italia, Portugal, Bulgaria y Polonia. Conjuntamente con los aprendizajes competenciales, se prioriza el trabajo de la educaci??n en valores, en concreto con la preparaci??n y desarrollo mensual de una acci??n de voluntariado orientada a la adquisici??n de pr??cticas solidarias.

Exact error estimates and optimal randomized algorithms for integration

Exact error estimates for evaluating multi-dimensional integrals are considered. An estimate is called exact if the rates of convergence for the low- and upper-bound estimate coincide. The algorithm with such an exact rate is called optimal. Such an algorithm has an unimprovable rate of convergence. The problem of existing exact estimates and optimal algorithms is discussed for some functional spaces that define the regularity of the integrand. Important for practical computations data classes are considered: classes of functions with bounded derivatives and Holder type conditions. The aim of the paper is to analyze the performance of two optimal classes of algorithms: deterministic and randomized for computing multidimensional integrals. It is also shown how the smoothness of the integrand can be exploited to construct better randomized algorithms.

Parallel Monte Carlo approach for integration of the rendering equation

This paper is addressed to the numerical solving of the rendering equation in realistic image creation. The rendering equation is integral equation describing the light propagation in a scene accordingly to a given illumination model. The used illumination model determines the kernel of the equation under consideration. Nowadays, widely used are the Monte Carlo methods for solving the rendering equation in order to create photorealistic images. In this work we consider the Monte Carlo solving of the rendering equation in the context of the parallel sampling scheme for hemisphere. Our aim is to apply this sampling scheme to stratified Monte Carlo integration method for parallel solving of the rendering equation. The domain for integration of the rendering equation is a hemisphere. We divide the hemispherical domain into a number of equal sub-domains of orthogonal spherical triangles. This domain partitioning allows to solve the rendering equation in parallel. It is known that the Neumann series represent the solution of the integral equation as a infinity sum of integrals. We approximate this sum with a desired truncation error (systematic error) receiving the fixed number of iteration. Then the rendering equation is solved iteratively using Monte Carlo approach. At each iteration we solve multi-dimensional integrals using uniform hemisphere partitioning scheme. An estimate of the rate of convergence is obtained using the stratified Monte Carlo method. This domain partitioning allows easy parallel realization and leads to convergence improvement of the Monte Carlo method. The high performance and Grid computing of the corresponding Monte Carlo scheme are discussed.

Parallel Monte Carlo sampling scheme for sphere and hemisphere

The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation. In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Our aim is to construct and study the parallel sampling scheme for hemisphere and sphere. First we apply the symmetry property for partitioning of hemisphere and sphere. The domain of solid angle subtended by a hemisphere is divided into a number of equal sub-domains. Each sub-domain represents solid angle subtended by orthogonal spherical triangle with fixed vertices and computable parameters. Then we introduce two new algorithms for sampling of orthogonal spherical triangles. Both algorithms are based on a transformation of the unit square. Similarly to the Arvo's algorithm for sampling of arbitrary spherical triangle the suggested algorithms accommodate the stratified sampling. We derive the necessary transformations for the algorithms. The first sampling algorithm generates a sample by mapping of the unit square onto orthogonal spherical triangle. The second algorithm directly compute the unit radius vector of a sampling point inside to the orthogonal spherical triangle. The sampling of total hemisphere and sphere is performed in parallel for all sub-domains simultaneously by using the symmetry property of partitioning. The applicability of the corresponding parallel sampling scheme for Monte Carlo and Quasi-D/lonte Carlo solving of rendering equation is discussed.

Parallel performance and scalability experiments with the Danish Eulerian Model on the EPCC supercomputers

The Danish Eulerian Model (DEM) is a powerful air pollution model, designed to calculate the concentrations of various dangerous species over a large geographical region (e.g. Europe). It takes into account the main physical and chemical processes between these species, the actual meteorological conditions, emissions, etc.. This is a huge computational task and requires significant resources of storage and CPU time. Parallel computing is essential for the efficient practical use of the model. Some efficient parallel versions of the model were created over the past several years. A suitable parallel version of DEM by using the Message Passing Interface library (AIPI) was implemented on two powerful supercomputers of the EPCC - Edinburgh, available via the HPC-Europa programme for transnational access to research infrastructures in EC: a Sun Fire E15K and an IBM HPCx cluster. Although the implementation is in principal, the same for both supercomputers, few modifications had to be done for successful porting of the code on the IBM HPCx cluster. Performance analysis and parallel optimization was done next. Results from bench marking experiments will be presented in this paper. Another set of experiments was carried out in order to investigate the sensitivity of the model to variation of some chemical rate constants in the chemical submodel. Certain modifications of the code were necessary to be done in accordance with this task. The obtained results will be used for further sensitivity analysis Studies by using Monte Carlo simulation.