2 resultados para Reading strategies

em Universidad Politécnica de Madrid


Relevância:

60.00% 60.00%

Publicador:

Resumo:

Este artículo analiza las funciones de la lectura en la enseñanza-aprendizaje del inglés profesional y académico, desde el marco de la comunicación, considerándola como un proceso interactivo entre lector y texto. El lector, alumno universitario que necesita desarrollar sus habilidades lingüísticas en inglés, como vehículo de transmisión del conocimiento científico. El texto, con la estructura propia de los géneros científicos, constituye para el alumno de habla española, además de un reto para el aprendizaje del IPA, una fuente de información. Para ello, se proponen unas actividades pedagógicas relacionadas con la didáctica de las estrategias lectoras previas, simultáneas y posteriores a la lectura de un texto. Abstract This article analyses the role of reading in the teaching of English for Professional and Academic Purposes from a communicative perspective, considering it as an interactive process between reader and text. The reader is a university student who needs to develop his linguistic abilities in English as a vehicle for the transmission of scientific knowledge. The text, with a structure proper of scientific genres, represents for the Spanish speaking student a stimulus for the learning of Academic English as well as a source of information. Several pedagogical activities, related to the methodology of teaching reading strategies: previous, simultaneous and after the reading process, are proposed.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper outlines the problems found in the parallelization of SPH (Smoothed Particle Hydrodynamics) algorithms using Graphics Processing Units. Different results of some parallel GPU implementations in terms of the speed-up and the scalability compared to the CPU sequential codes are shown. The most problematic stage in the GPU-SPH algorithms is the one responsible for locating neighboring particles and building the vectors where this information is stored, since these specific algorithms raise many dificulties for a data-level parallelization. Because of the fact that the neighbor location using linked lists does not show enough data-level parallelism, two new approaches have been pro- posed to minimize bank conflicts in the writing and subsequent reading of the neighbor lists. The first strategy proposes an efficient coordination between CPU-GPU, using GPU algorithms for those stages that allow a straight forward parallelization, and sequential CPU algorithms for those instructions that involve some kind of vector reduction. This coordination provides a relatively orderly reading of the neighbor lists in the interactions stage, achieving a speed-up factor of x47 in this stage. However, since the construction of the neighbor lists is quite expensive, it is achieved an overall speed-up of x41. The second strategy seeks to maximize the use of the GPU in the neighbor's location process by executing a specific vector sorting algorithm that allows some data-level parallelism. Al- though this strategy has succeeded in improving the speed-up on the stage of neighboring location, the global speed-up on the interactions stage falls, due to inefficient reading of the neighbor vectors. Some changes to these strategies are proposed, aimed at maximizing the computational load of the GPU and using the GPU texture-units, in order to reach the maximum speed-up for such codes. Different practical applications have been added to the mentioned GPU codes. First, the classical dam-break problem is studied. Second, the wave impact of the sloshing fluid contained in LNG vessel tanks is also simulated as a practical example of particle methods