Memoria Maestr@: la construcción de un archivo documental en el sindicato de los trabajadores de la educación de Rosario

La presente ponencia se desarrolla sobre dos ejes. En primer lugar, se expone el relato sobre la experiencia de construcción de un archivo documental sobre los trabajadores realizado por los mismos trabajadores, en el marco de la organización sindical que los representa. A su vez se presentan las problemáticas y los desafíos que una investigación de esta naturaleza, llevada adelante por militantes, es decir, en forma voluntaria y fuera del campo académico específico, ha provocado desde el punto de vista de la metodología de la investigación histórica. En segundo lugar, los avances de las investigaciones iniciadas, centradas en los años setenta, en el marco del proceso de alza de las luchas populares, período en el cual se produjo un cambio sustancial en la forma en que los integrantes de este grupo social, los docentes de Rosario, decidieron participar y organizarse asumiendo como identidad colectiva la de “sindicato de trabajadores” en lugar de otras denominaciones alternativas.Facultad de Humanidades y Ciencias de la Educació

El pueblo que amaba la paz : Una aproximación a algunas representaciones sociales presentes durante la Guerra de Malvinas, a partir de las cartas de lectores del diario <i>La Capital</i> de Rosario

Nos proponemos indagar en la Guerra de Malvinas, episodio de nuestra historia reciente que aún espera un análisis de similar importancia al de otros aspectos de la última dictadura militar. Tal como lo mencionan los más reconocidos especialistas en el tema, el conflicto del Atlántico Sur ha sido reducido a explicaciones simplistas que no aportan mucho al intento de dar respuesta a aquel interrogante esencial de los estudios sociales: “¿Por qué pasó lo que pasó?”. Si la guerra fue un absurdo, un sinsentido, una aventura o la locura de un militar beodo, no existirían mayores responsabilidades por parte de la sociedad civil, en aquella carnicería a la que se envió a miles de jóvenes que se encontraron, de un momento a otro, “desnudos frente a los cañones”, en unas frías y lejanas islas. En este trabajo nos aproximaremos a algunas de las representaciones sociales presentes durante el transcurso del conflicto, para tratar de entender qué pensaba la gente sobre la guerra y cuáles eran las razones que esgrimían para fundamentar el apoyo a la criminal iniciativa de la Junta Militar. Para este análisis hemos recurrido a una fuente poco frecuentada por los historiadores, pero muy rica en función del objetivo que nos hemos propuesto: las cartas de lectores. Con tal fin, elaboramos un corpus de textos formado por 76 cartas, publicadas entre abril y junio de 1982, en el diario “La Capital” de Rosario.Facultad de Humanidades y Ciencias de la Educació

Semi‐automatic porting of a large‐scale Fortran CFD code to GPUs

The development of automatic techniques to port a substantial portion of FEFLO, a general‐purpose legacy CFD code operating on unstructured grids, to run on GPUs is described. FEFLO is a typical adaptive, edge‐based finite element code for the solution of compressible and incompressible flows, which is primarily written in Fortran 77 and has previously been ported to vector, shared memory parallel and distributed memory parallel machines. Owing to the large size of FEFLO and the likelihood of human error in porting, as well as the desire for continued development within a single codebase, a specialized Python script, based on FParser (Int. J. Comput. Sci. Eng.&nbsp;2009;&nbsp;4&nbsp;:296&ndash;305), was written to perform automated translation from the OpenMP‐parallelized edge and point loops to GPU kernels implemented in CUDA, along with GPU memory management. The results of verification benchmarks and performance indicate that performances achieved by such a translator can rival those of codes rewritten by specialists. The approach should be of general interest, as how best to run on GPUs is being presently considered for many so‐called legacy codes

Ultra Wide-Band Localization and SLAM: A Comparative Study for Mobile Robot Navigation

In this work, a comparative study between an Ultra Wide-Band (UWB) localization system and a Simultaneous Localization and Mapping (SLAM) algorithm is presented. Due to its high bandwidth and short pulses length, UWB potentially allows great accuracy in range measurements based on Time of Arrival (TOA) estimation. SLAM algorithms recursively estimates the map of an environment and the pose (position and orientation) of a mobile robot within that environment. The comparative study presented here involves the performance analysis of implementing in parallel an UWB localization based system and a SLAM algorithm on a mobile robot navigating within an environment. Real time results as well as error analysis are also shown in this work

Deflated preconditioned conjugate gradient solvers for linear elasticity

Extensions of deflation techniques previously developed for the Poisson equation to static elasticity are presented. Compared to the (scalar) Poisson equation (J. Comput. Phys.&nbsp;2008;&nbsp;227&nbsp;(24):10196&ndash;10208;&nbsp;Int. J. Numer. Meth. Engng&nbsp;2010; DOI:&nbsp;10.1002/nme.2932;&nbsp;Int. J. Numer. Meth. Biomed. Engng&nbsp;2010;&nbsp;26&nbsp;(1):73&ndash;85), the elasticity equations represent a system of equations, giving rise to more complex low‐frequency modes (Multigrid&nbsp;. Elsevier: Amsterdam, 2000). In particular, the straightforward extension from the scalar case does not provide generally satisfactory convergence. However, a simple modification allows to recover the remarkable acceleration in convergence and CPU time reached in the scalar case. Numerous examples and timings are provided in a serial and a parallel context and show the dramatic improvements of up to two orders of magnitude in CPU time for grids with moderate graph depths compared to the non‐deflated version. Furthermore, a monotonic decrease of iterations with increasing subdomains, as well as a remarkable acceleration for very few subdomains are also observed if all the rigid body modes are included

Deflated preconditioned conjugate gradient solvers for the Pressure–Poisson equation

A deflated preconditioned&nbsp;conjugate gradient&nbsp;technique has been developed for the solution of the Pressure&ndash;Poisson equation within an&nbsp;incompressible flow&nbsp;solver. The deflation is done using a region-based decomposition of the unknowns, making it extremely simple to implement. The procedure has shown a considerable reduction in the number of iterations. For grids with large graph-depth the savings exceed an order of magnitude. Furthermore, the technique has shown a remarkable insensitivity to the number of groups/regions chosen, and to the way the groups are formed

Fast numerical solutions of patient‐specific blood flows in 3D arterial systems

The study of hemodynamics in arterial models constructed from patient‐specific medical images requires the solution of the incompressible flow equations in geometries characterized by complex branching tubular structures. The main challenge with this kind of geometries is that the convergence rate of the pressure Poisson solver is dominated by the graph depth of the computational grid. This paper presents a deflated preconditioned conjugate gradients (DPCG) algorithm for accelerating the pressure Poisson solver. A subspace deflation technique is used to approximate the lowest eigenvalues along the tubular domains. This methodology was tested with an idealized cylindrical model and three patient‐specific models of cerebral arteries and aneurysms constructed from medical images. For these cases, the number of iterations decreased by up to a factor of 16, while the total CPU time was reduced by up to 4 times when compared with the standard PCG solver

Deflated preconditioned conjugate gradient solvers for the pressure‐Poisson equation: Extensions and improvements

Extensions and improvements to a deflated preconditioned conjugate gradient technique for the solution of the pressure‐Poisson equation within an incompressible flow solver are described. In particular, the use of the technique for embedded grids, for cases where volume of fluid or level set schemes are required and its implementation on parallel machines are considered. Several examples are included that demonstrate a considerable reduction in the number of iterations and a remarkable insensitivity to the number of groups/ regions chosen and/or to the way the groups are formed

Simulation of intracranial aneurysm stenting: Techniques and challenges

Recently, there has been considerable interest in the use of stents as endovascular flow diverters for the treatment of intracranial aneurysms. Simulating this novel method of treatment is essential for understanding the intra-aneurysmal hemodynamics in order to design better stents and to personalize and optimize the endovascular stenting procedures. This paper describes a methodology based on unstructured embedded grids for patient-specific modeling of stented cerebral aneurysms, demonstrates how the methodology can be used to address specific clinical questions, and discusses remaining technical issues. In particular, simulations are presented on a number of patient-specific models constructed from medical images and using different stent designs and treatment alternatives. Preliminary sensitivity analyses with respect to stent positioning and truncation of the stent model are presented. The results show that these simulations provide useful and valuable information that can be used during the planning phase of endovascular stenting interventions for the treatment of intracranial aneurysms