Despido de un trabajador y actuación de la inspección de trabajo

Traballo fin de grao (UDC.DER). Dereito. Curso 2015/201

Functions, responsibility and authorityof human resources in the implementation of asecurity and safety management system at work

[Resumo] Un sistema de xestión da seguridade e a saúde no traballo necesita cumprir cuns requisitos xerais e particulares que permitan promover unha serie de boas prácticas para lograr os obxectivos da política aprobada pola organización. A avaliación e o control dos riscos non son unhas tarefas doadas e precisan duns medios materiais e humanos importantes. Na implementacióne operación do sistema de xestión xogan un papel fundamental os recursos humanos dedicados en exclusiva á seguridade e a saúde no traballo. Cómpre establecer o organigrama destes recursos e definir as funcións e responsabilidades de cada unha das áreas que comporán os ervizo de seguridade e saúde da empresa, que os estándares coñecidos non detallan. Neste artigo, partindo do coñecemento das técnicas preventivas, preténdese describir a estrutura dun servizo de prevención complexo, que poderá tomarse como modelo práctico.[Abstract] A security and safety management system in the workplace must fulfil a number of general and particular requirements that allow promoting good practices in order to achieve the objectives of the policy approved by the organization. Risk assessment and control is not an easy task; it requires significant material and human resources. In the implementation and operation of a management system the human resources devoted exclusively to security and safety in theworkplace play an essential role. It is necessary to establish the organization chart of theseresources and to define the functions and responsibilities of each of the areas composing the Security and Safety Service of the company that are not detailed in the known standards. In this work, based on the knowledge of preventive techniques, the structure of a complex prevention service is described. This structure can be used as a practical model

Dos herramientas para la organización de los laboratorios de prácticas

Este artículo describe dos herramientas informáticas para la organización de laboratorios de prácticas y el acceso a la información de calificaciones, y recoge la experiencia en la aplicación de las mismas. La primera permite usar el correo electrónico para que los alumnos se apunten en los grupos de prácticas y obtengan las notas de sus evaluaciones de forma automatizada. La segunda consiste en el uso de formularios web que permiten ponerse de acuerdo a alumnos a los que no les conviene el horario de prácticas que se les ha asignado por defecto, de forma que puedan intercambiarse. Ambas tienen como ventaja frente a otras herramientas no requerir la instalación y mantenimiento de un portal web y el software que suele conllevar. Comentarios informales, en el caso de la primera herramienta, y una encuesta, en el caso de la segunda, demuestran la valoración positiva de las mismas por parte del alumnado.Peer Reviewe

Easy Dataflow Programming in Clusters with UPC++ DepSpawn

Versión final aceptada de: https://doi.org/10.1109/TPDS.2018.2884716This version of the article has been accepted for publication, after peer review. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The Version of Record is available online at: https://doi.org/10.1109/TPDS.2018.2884716[Abstract]: The Partitioned Global Address Space (PGAS) programming model is one of the most relevant proposals to improve the ability of developers to exploit distributed memory systems. However, despite its important advantages with respect to the traditional message-passing paradigm, PGAS has not been yet widely adopted. We think that PGAS libraries are more promising than languages because they avoid the requirement to (re)write the applications using them, with the implied uncertainties related to portability and interoperability with the vast amount of APIs and libraries that exist for widespread languages. Nevertheless, the need to embed these libraries within a host language can limit their expressiveness and very useful features can be missing. This paper contributes to the advance of PGAS by enabling the simple development of arbitrarily complex task-parallel codes following a dataflow approach on top of the PGAS UPC++ library, implemented in C++. In addition, our proposal, called UPC++ DepSpawn, relies on an optimized multithreaded runtime that provides very competitive performance, as our experimental evaluation shows.This research was supported by the Ministerio de Economía, Industria y Competitividad of Spain and FEDER funds of the EU (TIN2016-75845-P), and by the Xunta de Galicia co-founded by the European Regional Development Fund (ERDF) under the Consolidation Programme of Competitive Reference Groups (ED431C 2017/04) as well as under the Centro Singular de Investigación de Galicia accreditation 2016-2019 (ED431G/01). We also acknowledge the Centro de Supercomputación de Galicia (CESGA) for the use of their computers.Xunta de Galicia; ED431C 2017/04Xunta de Galicia; ED431G/0

A Software Cache Autotuning Strategy for Dataflow Computing with UPC++ DepSpawn

This is the accepted version of the following article: B. B. Fraguela, D. Andrade. A software cache autotuning strategy for dataflow computing with UPC++ DepSpawn. Computational and Mathematical Methods, 3(6), e1148. November 2021, which has been published in final form at http://dx.doi.org/10.1002/cmm4.1148. This article may be used for noncommercial purposes in accordance with the Wiley Self-Archiving Policy [http://www.wileyauthors.com/self-archiving].[Abstract] Dataflow computing allows to start computations as soon as all their dependencies are satisfied. This is particularly useful in applications with irregular or complex patterns of dependencies which would otherwise involve either coarse grain synchronizations which would degrade performance, or high programming costs. A recent proposal for the easy development of performant dataflow algorithms in hybrid shared/distributed memory systems is UPC++ DepSpawn. Among the many techniques it applies to provide good performance is a software cache that minimizes the communications among the processes involved. In this article we provide the details of the implementation and operation of this cache and we present an autotuning strategy that simplifies its usage by freeing the user from having to estimate an adequate size for this cache. Rather, the runtime is now able to define reasonably sized caches that provide near optimal behavior.This research was funded by the Ministry of Science and Innovation of Spain (TIN2016-75845-P and PID2019-104184RB-I00, AEI/FEDER/EU, 10.13039/501100011033), and by the Xunta de Galicia co-funded by the European Regional Development Fund (ERDF) under the Consolidation Programme of Competitive Reference Groups (ED431C 2017/04). The authors acknowledge also the support from the Centro Singular de Investigación de Galicia “CITIC,” funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by grant ED431G 2019/01. They also acknowledge the Centro de Supercomputación de Galicia (CESGA) for the use of its computersXunta de Galicia; ED431C 2017/04Xunta de Galicia; ED431G/0

Kinematical algebras in a non-relativistic expansion of the Lorentz force

Treballs Finals de Grau de Física, Facultat de Física, Universitat de Barcelona, Curs: 2023, Tutors: Joaquim Gomis, Jorge RussoWe consider a non-relativistic expansion of the Lorentz force equation. Both the particle position and the electro-magnetic field are expanded. There are two interesting limits in the case of a constant field, called electric and magnetic, where we show that the resulting equations also follow from considering a non-linear realisation of a certain infinite-dimensional algebra

Accelerating the HyperLogLog Cardinality Estimation Algorithm

[Abstract] In recent years, vast amounts of data of different kinds, from pictures and videos from our cameras to software logs from sensor networks and Internet routers operating day and night, are being generated. This has led to new big data problems, which require new algorithms to handle these large volumes of data and as a result are very computationally demanding because of the volumes to process. In this paper, we parallelize one of these new algorithms, namely, the HyperLogLog algorithm, which estimates the number of different items in a large data set with minimal memory usage, as it lowers the typical memory usage of this type of calculation from () to (1). We have implemented parallelizations based on OpenMP and OpenCL and evaluated them in a standard multicore system, an Intel Xeon Phi, and two GPUs from different vendors. The results obtained in our experiments, in which we reach a speedup of 88.6 with respect to an optimized sequential implementation, are very positive, particularly taking into account the need to run this kind of algorithm on large amounts of data.This research was supported by the Ministry of Economy and Competitiveness of Spain and FEDER funds (80%) of the EU (Projects TIN2013-42148-P and TIN2016-75845-P) as well as by the Xunta de Galicia (Centro Singular de Investigación de Galicia accreditation 2016–2019) and the European Union (European Regional Development Fund, ERDF) under Grant Ref. ED431G/01Xunta de Galicia; ED431G/0

Vector-borne disease risk indexes in spatially structured populations

There are economic and physical limitations when applying prevention and control strategies for urban vector borne diseases. Consequently, there are increasing concerns and interest in designing efficient strategies and regulations that health agencies can follow in order to reduce the imminent impact of viruses like Dengue, Zika and Chikungunya. That includes fumigation, abatization, reducing the hatcheries, picking up trash, information campaigns. A basic question that arise when designing control strategies is about which and where these ones should focus. In other words, one would like to know whether preventing the contagion or decrease vector population, and in which area of the city, is more efficient. In this work, we propose risk indexes based on the idea of secondary cases from patch to patch. Thus, they take into account human mobility and indicate which patch has more chance to be a corridor for the spread of the disease and which is more vulnerable. They can also indicate the neighborhood where hatchery control will reduce more the number of potential cases. In order to illustrate the usefulness of these indexes, we run a set of numerical simulations in a mathematical model that takes into account the urban mobility and the differences in population density among the areas of a city. If i is a particular neighborhood, the transmission risk index TR_i measures the potential secondary cases caused by a host in that neighborhood. The vector transmission risk index VTR_i measures the potential secondary cases caused by a vector. Finally, the vulnerability risk index VR_i measures the potential secondary cases in the neighborhood. Transmission indexes can be used to give geographical priority to some neighborhoods when applying prevention and control measures. On the other hand, the vulnerability index can be useful to implement monitoring campaigns or public health investment.Comment: 16 pages, 5 figure