74 resultados para collective memory work
Resumo:
Complex problems of globalized society challenge its adaptive capacity. However, it is precisely the nature of these human induced problems that provide enough evidence to show that adaptability may not be on a resilient path. This thesis explores the ambiguity of the idea of adaptation (and its practice) and illustrates the ways in which adaptability contributes to resilience of social ecological systems. The thesis combines a case study and grounded theory approach and develops an analytical framework to study adaptability in resource users’ organizations: from what it depends on and what the key challenges are for resource management and system resilience. It does so for the specific case of fish producers’ organizations (POs) in Portugal. The findings suggest that while ecological and market context, including the type of crisis, may influence the character of fishers’ adaptation within POs (i.e. anticipatory, maladaptive and reactively adaptive), it does not determine it. Instead, it makes agency even more crucial (i.e. leadership, trust and agent’s perceptions in terms of their impact on fishers’ motivation to learn from each other). In sum, it was found that internal adaptation can improve POs’ contribution to fishery management and resilience, but it is not a panacea and may, in some cases, increase system vulnerability to change. Continuous maladaptation of some Portuguese POs points at a basic institutional problem (fish market regime), which clearly reduces fisheries resilience as it promotes overfishing. However, structural change may not be sufficient to address other barriers to Portuguese fishers’ (PO members) adaptability, such as history (collective memory) and associated problematic self-perceptions. The agency (people involved in structures and practices) also needs to change. What and how institutional change and agency change build on one another (e.g. comparison of fisheries governance in Portugal and other EU countries) is a topic to be explored in further research.
Resumo:
This paper presents an embryo of a literary guide on the Carnation Revolution to be explored for educational historical excursions other than leisure and tourism. We propose a historical trail through the centre of Lisbon, city of the Carnation Revolution, called Walk through the Revolution. The trail aims to reinforce collective memory about the major events that occurred in the early moments leading to the coup. The trail is made up by nine places of rememberance, for which literary excerpts are suggested and which are supported by a digital research procedure. A set of seven fixed and observer-independent categories are used to analyse the literary contents of 23 literary works published up to 2013. These literary works refer to events that happened between the eve of April 25 and May 1, 1974. At the same time, literary descriptions are explored using a spatial approach in order to define the literary geography of the most iconic military actions and popular demonstrations that occurred in Lisbon and the surroundings. The literary geography and the cartography of the historical events are then compared. Data analysis and visualization benefit from the use of standardised and quantitative methods, including basic statistics and geographic information systems.
Resumo:
This paper provides a longitudinal, empirical view of the multifaceted and reciprocal processes of organizational learning in a context of self-managed teams. Organizational learning is seen as a social construction between people and actions in a work setting. The notion of learning as situated (Brown & Duguid 1989, Lave& Wenger 1991, Gherardi & al. 1998, Easterby-Smith & Araujo 1999, Abma 2003) opens up the possibility for placing the focus of research on learning in the community rather than in individual learning processes. Further, in studying processes in their social context, we cannot avoid taking power relations into consideration (Contu & Willmott 2003). The study is based on an action research with a methodology close to the ‘democratic dialogue’ presented by Gustavsen (2001). This gives a ground for research into how the learning discourse developed in the case study organization over a period of 5 years, during which time the company abandoned a middle management level of hierarchy and the teams had to figure out how to work as self-managed units. This paper discusses the (re)construction of power relations and its role in organizational learning. Power relations are discussed both in vertical and horizontal work relations. A special emphasis is placed on the dialectic between managerial aims and the space for reflection on the side of employees. I argue that learning is crucial in the search for the limits for empowerment and that these limits are negotiated both in actions and speech. This study unfolds a purpose-oriented learning process, constructing an open dialogue, and describes a favourable context for creative, knowledge building communities.
Resumo:
Applied Physics Letters, Vol.93, issue 20
Resumo:
Software transactional memory is a promising programming model that adapts many concepts borrowed from the databases world to control concurrent accesses to main memory (RAM) locations. This paper discusses how to support apparently irreversible operations, such as memory allocation and deallocation, within software libraries that will be used in (software memory) transactional contexts, and propose a generic and elegant approach based on a handler system, which provide the means to create and execute compensation actions at key moments during the life-time of a transaction.
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Química e Bioquímica
Resumo:
We present a qualitative analysis of organizational improvisation and provide a preliminary insight into the following question: how is improvisation present in tightly controlled work environments? We conducted in situ observations of, and interviews with, several emergency medical teams and complemented this information with statistical and media data. Using grounded theory, we developed four propositions that were arranged into a model that allowed the identification of two use levels of established routines: (1) the visible side that accommodates contextual requirements, and (2) the improvisational side that provides a response to activity characteristics. This dual process is related to the existence of pressures that operate at the institutional level with practical needs emerging from the operational domain. In contrast with most of the literature, this study reveals that the presence of a broad procedural organizational memory does not restrict improvisation but enables a bureaucratic system to produce flexible improvised performance.
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Química e Bioquímica
Resumo:
Mutable state can be useful in certain algorithms, to structure programs, or for efficiency purposes. However, when shared mutable state is used in non-local or nonobvious ways, the interactions that can occur via aliases to that shared memory can be a source of program errors. Undisciplined uses of shared state may unsafely interfere with local reasoning as other aliases may interleave their changes to the shared state in unexpected ways. We propose a novel technique, rely-guarantee protocols, that structures the interactions between aliases and ensures that only safe interference is possible. We present a linear type system outfitted with our novel sharing mechanism that enables controlled interference over shared mutable resources. Each alias is assigned separate, local roles encoded in a protocol abstraction that constrains how an alias can legally use that shared state. By following the spirit of rely-guarantee reasoning, our rely-guarantee protocols ensure that only safe interference can occur but still allow many interesting uses of shared state, such as going beyond invariant and monotonic usages. This thesis describes the three core mechanisms that enable our type-based technique to work: 1) we show how a protocol models an alias’s perspective on how the shared state evolves and constrains that alias’s interactions with the shared state; 2) we show how protocols can be used while enforcing the agreed interference contract; and finally, 3) we show how to check that all local protocols to some shared state can be safely composed to ensure globally safe interference over that shared memory. The interference caused by shared state is rooted at how the uses of di↵erent aliases to that state may be interleaved (perhaps even in non-deterministic ways) at run-time. Therefore, our technique is mostly agnostic as to whether this interference was the result of alias interleaving caused by sequential or concurrent semantics. We show implementations of our technique in both settings, and highlight their di↵erences. Because sharing is “first-class” (and not tied to a module), we show a polymorphic procedure that enables abstract compositions of protocols. Thus, protocols can be specialized or extended without requiring specific knowledge of the interference produce by other protocols to that state. We show that protocol composition can ensure safety even when considering abstracted protocols. We show that this core composition mechanism is sound, decidable (without the need for manual intervention), and provide an algorithm implementation.
Resumo:
This work will discuss the use of different paper membranes as both the substrate and dielectric for field-effect memory transistors. Three different nanofibrillated cellulose membranes (NFC) were used as the dielectric layer of the memory transistors (NFC), one with no additives, one with an added polymer PAE and one with added HCl. Gallium indium zinc oxide (GIZO) was used as the device’s semiconductor and gallium aluminium zinc oxide (GAZO) was used as the gate electrode. Fourier transform infrared spectroscopy (FTIR) was used to access the water content of the paper membranes before and after vacuum. It was found that the devices recovered their water too quickly for a difference to be noticeable in FTIR. The transistor’s electrical performance tests yielded a maximum ION/IOFF ratio of around 3,52x105 and a maximum subthreshold swing of 0,804 V/decade. The retention time of the dielectric charge that grants the transistor its memory capabilities was accessed by the measurement of the drain current periodically during 144 days. During this period the mean drain current did not lower, leaving the retention time of the device indeterminate. These results were compared with similar devices revealing these devices to be at the top tier of the state-of-the-art.
Resumo:
Current computer systems have evolved from featuring only a single processing unit and limited RAM, in the order of kilobytes or few megabytes, to include several multicore processors, o↵ering in the order of several tens of concurrent execution contexts, and have main memory in the order of several tens to hundreds of gigabytes. This allows to keep all data of many applications in the main memory, leading to the development of inmemory databases. Compared to disk-backed databases, in-memory databases (IMDBs) are expected to provide better performance by incurring in less I/O overhead. In this dissertation, we present a scalability study of two general purpose IMDBs on multicore systems. The results show that current general purpose IMDBs do not scale on multicores, due to contention among threads running concurrent transactions. In this work, we explore di↵erent direction to overcome the scalability issues of IMDBs in multicores, while enforcing strong isolation semantics. First, we present a solution that requires no modification to either database systems or to the applications, called MacroDB. MacroDB replicates the database among several engines, using a master-slave replication scheme, where update transactions execute on the master, while read-only transactions execute on slaves. This reduces contention, allowing MacroDB to o↵er scalable performance under read-only workloads, while updateintensive workloads su↵er from performance loss, when compared to the standalone engine. Second, we delve into the database engine and identify the concurrency control mechanism used by the storage sub-component as a scalability bottleneck. We then propose a new locking scheme that allows the removal of such mechanisms from the storage sub-component. This modification o↵ers performance improvement under all workloads, when compared to the standalone engine, while scalability is limited to read-only workloads. Next we addressed the scalability limitations for update-intensive workloads, and propose the reduction of locking granularity from the table level to the attribute level. This further improved performance for intensive and moderate update workloads, at a slight cost for read-only workloads. Scalability is limited to intensive-read and read-only workloads. Finally, we investigate the impact applications have on the performance of database systems, by studying how operation order inside transactions influences the database performance. We then propose a Read before Write (RbW) interaction pattern, under which transaction perform all read operations before executing write operations. The RbW pattern allowed TPC-C to achieve scalable performance on our modified engine for all workloads. Additionally, the RbW pattern allowed our modified engine to achieve scalable performance on multicores, almost up to the total number of cores, while enforcing strong isolation.
Resumo:
In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.
Resumo:
In this article I focus on women workers’ experiences of transformation from line work to teamworking in Finnish clothing companies in the 1990s and also show what happened after this transformation in the clothing branch. The undertone of it is rather melancholic. Following an initial period of intensive and successful development, clothing work was moved from Finland to countries of cheap labour, such as Estonia, Latvia, Lithuania and Russia, and even China. In this type of network manufacturing, the development of modern information and communication technologies played a central role. My aim is to present the standpoint of women clothing workers in this process. The main body of the empirical data of my study consists of dialogues with clothing workers, union representatives, supervisors and managers. I also make use of my fieldwork notes, memos and research diaries from three companies over a period of five years. Furthermore, in the background lie the action research material from Scandinavian type work conferences and the survey material of an extensive mail inquiry that covered the whole branch in Finland. My own research started in 1991 as a mail inquiry and then continued as a case study in companies from 1992 to 2000, by employing action research and ethnographic methodologies.