Sökning: "Distributed Work"
Visar resultat 1 - 5 av 791 avhandlingar innehållade orden Distributed Work.
1. Getting Work Done : The Significance of the Human in Complex Socio-Technical Systems
Sammanfattning : This thesis aims to deepen the understanding of the role and relevance of the worker in the functioning of complex socio-technical systems. The perspective adopted is profoundly human-centred and the worker is considered as a resource. LÄS MER
2. Getting engaged in cooperation : Design, distance, and distributed work
Sammanfattning : Cooperative work differs depending on contexts and tasks, whether co-located, synchronous, or distributed in time and space. New technology allows new opportunities to support cooperation. A central aspect of cooperation is the relation to individual work; when co-located, people enter and exit cooperation seamlessly. LÄS MER
3. Computer use @ work : Psychosocial work environment and attitudes toward computers from a work content perspective
Sammanfattning : This thesis aims at investigating computer use at work from a more holistic work content perspective by also studying non-computer work content, in contrast to the previous approach in occupational health research that focused almost solely on computer work content. It was argued here that non-computer work content has also become significant to the overall work situation for computer users. LÄS MER
4. Distributed engineering : tools and methods for collaborative product development
Sammanfattning : Engineering design is fundamentally social, requiring much interaction and communication between the people involved. Additionally, good design often relies upon the ability of a cross-functional team to create a shared understanding of the task, the process, and the respective roles of its members. LÄS MER
5. Distributed k-ary System: Algorithms for Distributed Hash Tables
Sammanfattning : This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. LÄS MER