148 research outputs found
The functions of empathy in Anglo-Saxon England
No full textThis dissertation contributes to the fledgling field of medieval empathy studies by tracing the articulation of fellow-feeling in the literature and culture of Anglo-Saxon England across a broad corpus of anonymous homilies, saints’ lives, elegies, and heroic poems including Beowulf. The first three chapters identify cultural concepts and literary strategies that enabled Anglo-Saxon writers and readers to express and experience narrative empathy as well as cognitive linguistic strategies that enable modern critics to discern when texts invite shared emotions. These three chapters delineate cultural functions of literary fellow-feeling in relation to a wide range of Old English genres; the final two chapters develop these insights in detailed case studies. This project contributes to Anglo-Saxon and medieval studies by enlarging our understanding of narrative empathy and reading mentalities in Old English literature. Further, it contributes to empathy studies by highlighting culturally-specific functions of empathy not encompassed by contemporary theories.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2021-08-01The student, Katherine Norcross, accepted the attached license on 2019-05-29 at 15:34.The student, Katherine Norcross, submitted this Dissertation for approval on 2019-05-29 at 15:52.This Dissertation was approved for publication on 2019-05-31 at 13:50.DSpace SAF Submission Ingestion Package generated from Vireo submission #14003 on 2019-11-26 at 13:01:05Made available in DSpace on 2019-11-26T20:49:01Z (GMT). No. of bitstreams: 3
NORCROSS-DISSERTATION-2019.pdf: 1857979 bytes, checksum: a6417a1b5833574e0a0f6cffbbb92554 (MD5)
LICENSE.txt: 4215 bytes, checksum: 70869072b4e4fd278d9790060db78c1f (MD5)
SignedPQAgreementNorcross.pdf: 41420 bytes, checksum: 0c85e1aeec565f0778532f79f4ce67af (MD5)
Previous issue date: 2019-05-31Embargo set by: Seth Robbins for item 112892
Lift date: 2021-11-26T20:49:41Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 112892 on 2021-11-27T10:15:33Z
Design of the distributed ProcessBase architecture
No full textProcessBase is an environment designed to support process modelling languages. This environment consists of a language, its interpreter and a persistent object store. Currently this environment supports concurrency through a multi-threading library, however, only a single interpreter instantiation exists as a supported architecture. ProcessBase is a simple language that provides many sophisticated features, including first-class procedures, strong typing, extension through library interfaces, hyper-programming and linguistic reflection, multi-threaded execution and compliance. This document describes the design of distributed ProcessBase architecture. The motivations behind the creation of this architecture are an exploration of compliance in a distributed setting, experimentation with distribution models and distributed garbage collection mechanisms.William Brodie-Tyrrell, Henry Detmold, Katrina Falkner, Matt Lowry, Ron Morrison, Dave Munro, Stuart Norcross, Travis Olds, Zengping Tian,
Francis Vaugha
Promoting component reuse by separating transmission policy from implementation
No full textSubmitted to ICDCS 2005In this paper we present a methodology and set of tools which assist the construction of applications from components, by separating the issues of transmission policy from component definition and implementation. This promotes a greater degree of software reuse than is possible using traditional middleware environments. Whilst component technologies are usually presented as a mechanism for promoting reuse, reuse is often limited due to design choices that permeate component implementation. The programmer has no direct control over inter-address-space parameter passing semantics: it is fixed by the distributed application's structure, based on the remote accessibility of the components. Using traditional middleware tools and environments, the application designer may be forced to use an unnatural encoding of application level semantics since application parameter passing semantics are tightly coupled with the component deployment topology. This paper describes how inter-address-space parameter passing semantics may be decided independently of component implementation. Transmission policy may be dynamically defined on a per-class, per-method or per-parameter basis
A peer-to-peer middleware framework for resilient persistent programming
No full textSubmitted to EuroSys 2006 This work is funded partially by Nuffield grant URB/01597/GThe persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be engineered without requiring the programmer to write translation code to manage the transfer of data to and from non-volatile storage. More importantly, it simplified the programmer's conceptual model of an application, and avoided the many coherency problems that result from multiple cached copies of the same information. Although technically innovative, persistent languages were not widely adopted, perhaps due in part to their closed-world model. Each persistent store was located on a single host, and there were no flexible mechanisms for communication or transfer of data between separate stores. Here we re-open the work on persistence and combine it with modern peer-to-peer techniques in order to provide support for orthogonal persistence in resilient and potentially long-running distributed applications. Our vision is of an infrastructure within which an application can be developed and distributed with minimal modification, whereupon the application becomes resilient to certain failure modes. If a node, or the connection to it, fails during execution of the application, the objects are re-instantiated from distributed replicas, without their reference holders being aware of the failure. Furthermore, we believe that this can be achieved within a spectrum of application programmer intervention, ranging from minimal to totally prescriptive, as desired. The same mechanisms encompass an orthogonally persistent programming model. We outline our approach to implementing this vision, and describe current progress
Distributed ProcessBase: Report on initial experiments
No full textProcessBase is a programming environment designed to support flexible and compliant application development. The Distributed ProcessBase system is a variant on this environment, designed for a distributed context. The initial design of this system defines a range of experiments designed to explore suitable addressing schemes, coherency and distribution models. This document describes the results of our initial experiments in the implementation of this system and further insight into appropriate protocol selection gained during this work.Katrina Falkner, Ron Morrison, Dave Munro, Stuart Norcros
Design, implementation and deployment of state machines using a generative approach
No full textWe describe an approach to designing and implementing a distributed system as a family of related finite state machines, generated from a single abstract model. Various artefacts are generated from each state machine, including diagrams, source-level protocol implementations and documentation. The state machine family formalises the interactions between the components of the distributed system, allowing increased confidence in correctness. Our methodology facilitates the application of state machines to problems for which they would not otherwise be suitable. We illustrate the technique with the example of a Byzantine-fault-tolerant commit protocol used in a distributed storage system, showing how an abstract model can be defined in terms of an abstract state space and various categories of state transitions. We describe how such an abstract model can be deployed in a concrete system, and propose a general methodology for developing systems in this style
An object cache for the distributed ProcessBase interpreter
No full textProcessBase is a programming environment designed to support flexible and compliant application development. The Distributed ProcessBase system is a variant on this environment, designed for a distributed context. The three distributed object cache implementations that are described in this document form the basis for experimentation into DMOS-based distributed garbage collectors. The three implementations differ in their approach to coherency maintenance over objects in the cache. Analysis includes the messaging cost, dereference costs and addressing complexity for each implementation.Stuart Norcross, Katrina Falkner, Dharini Balasubramaniam, Graham Kirby, Ron Morrison, Dave Munr
Implementing a family of distributed garbage collectors
No full textCopyright© 2005, Australian Computer SocietyThis paper discusses implementations of distributed garbage collectors derived using a previously developed methodology which involves mappings of distributed termination detection algorithms (DTAs) to local garbage collection schemes. Implementations produced by such mappings preserve the safety and completeness properties of the original local collectors. Through our collector implementations we have come to understand that the derivation technique extends to distributed collection schemes with heterogeneous local collector behaviour. Our contribution, reported here, is the construction of an experimental platform, implementations of the Task Balancing DTA, an extension to the derivation methodology that minimises constraints on local collectors, together with three new mappings and their implementations.Stuart Norcross, Ron Morrison, Dave Munro, Henry Detmold and Katrina Falkne
Recommended from our members
Varsity Men's Track team, 1997
No full textFront- Brian Burwick, Dan Nashold, Keith Levesque, Peter Manolakos (Capt), Tim Caldwell (Capt), Brian Hagglund, Don Wallace, Stuart Clemons, Nathan Smith; Back- Merl Norcross (Asst Coach), Brian Kennedy, Peter Connolly, Carleton Jillson, Matt Linnemann, Bill Freed, Aaron Korthas, Dave Hawes, Ted Manley, Charles Senosk (Head Coach
- …
