3 resultados para Network of associations
em Dalarna University College Electronic Archive
Resumo:
Video exposure monitoring (VEM) is a group of methods used for occupational hygiene studies. The method is based on a combined use of video recordings with measurements taken with real-time monitoring instruments. A commonly used name for VEM is PIMEX. Since PIMEX initially was invented in the mid 1980’s have the method been implemented and developed in a number of countries. With the aim to give an updated picture of how VEM methods are used and to investigate needs for further development have a number of workshops been organised in Finland, UK, the Netherlands, Germany and Austria. Field studies have also been made with the aim to study to what extent the PIMEX method can improve workers motivation to actively take part in actions aimed at workplace improvements.The results from the workshops illustrates clearly that there is an impressive amount of experiences and ideas for the use of VEM within the network of the groups participating in the workshops. The sharing of these experiences between the groups, as well as dissemination of it to wider groups is, however, limited. The field studies made together with a number of welders indicate that their motivation to take part in workplace improvements is improved after the PIMEX intervention. The results are however not totally conclusive and further studies focusing on motivation are called for.It is recommended that strategies for VEM, for interventions in single workplaces, as well as for exposure categorisation and production of training material are further developed. It is also recommended to conduct a research project with the intention of evaluating the effects of the use of VEM as well as to disseminate knowledge about the potential of VEM to occupational hygiene experts and others who may benefit from its use.
Resumo:
Fan culture is a subculture that has developed explosively on the internet over the last decades. Fans are creating their own films, translations, fiction, fan art, blogs, role play and also various forms that are all based on familiar popular culture creations like TV-series, bestsellers, anime, manga stories and games. In our project, we analyze two of these subculture genres, fan fiction and scanlation. Amateurs, and sometimes professional writers, create new stories by adapting and developing existing storylines and characters from the original. In this way, a "network" of texts occurs, and writers step into an intertextual dialogue with established writers such as JK Rowling (Harry Potter) and Stephanie Meyer (Twilight). Literary reception and creation then merge into a rich reciprocal creative activity which includes comments and feedback from the participators in the community. The critical attitude of the fans regarding quality and the frustration at waiting for the official translation of manga books led to the development of scanlation, which is an amateur translation of manga distributed on the internet. Today, young internet users get involved in conceptual discussions of intertextuality and narrative structures through fan activity. In the case of scanlation, the scanlators practice the skills and techniques of translating in an informal environment. This phenomenon of participatory culture has been observed by scholars and it is concluded that they contribute to the development of a student’s literacy and foreign language skills. Furthermore, there is no doubt that the fandom related to Japanese cultural products such as manga, anime and videogames is one of the strong motives for foreign students to start learning Japanese. This is something to take into pedagogical consideration when we develop web-based courses. Fan fiction and fan culture make it possible to have an intensive transcultural dialogue between participators throughout the world and is of great interest when studying the interaction between formal and informal learning that puts the student in focus
Resumo:
To have good data quality with high complexity is often seen to be important. Intuition says that the higher accuracy and complexity the data have the better the analytic solutions becomes if it is possible to handle the increasing computing time. However, for most of the practical computational problems, high complexity data means that computational times become too long or that heuristics used to solve the problem have difficulties to reach good solutions. This is even further stressed when the size of the combinatorial problem increases. Consequently, we often need a simplified data to deal with complex combinatorial problems. In this study we stress the question of how the complexity and accuracy in a network affect the quality of the heuristic solutions for different sizes of the combinatorial problem. We evaluate this question by applying the commonly used p-median model, which is used to find optimal locations in a network of p supply points that serve n demand points. To evaluate this, we vary both the accuracy (the number of nodes) of the network and the size of the combinatorial problem (p). The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 supply points we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000 (which is aggregated from the 1.5 million nodes). To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limited improvement in the optimal solutions when the accuracy in the road network increase and the combinatorial problem (low p) is simple. When the combinatorial problem is complex (large p) the improvements of increasing the accuracy in the road network are much larger. The results also show that choice of the best accuracy of the network depends on the complexity of the combinatorial (varying p) problem.