V: Rewriting and reclaiming history : an analysis of the emergence of restorative justice in western criminal justice systems

During the last three decades, restorative justice has emerged in numerous localities around the world as an accepted approach to responding to crime. This article, which stems from a doctoral study on the history of restorative justice, provides a critical analysis of accepted histories of restorative practices. It revisits the celebrated historical texts of the restorative justice movement, and re-evaluates their contribution to the emergence of restorative justice measures. It traces the emergence of the term 'restorative justice', and reveals that it emerged in much earlier writings than is commonly thought to be the case by scholars in the restorative justice field. It also briefly considers some 'power struggles' in relation to producing an accepted version of the history of restorative justice, and scholars' attempts to 'rewrite history' to align with current views on restorative justice. Finally, this article argues that some histories of restorative justice selectively and inaccurately portray key figures from the history of criminology as restorative justice supporters. This, it is argued, gives restorative justice a false lineage and operates to legitimise the widespread adoption of restorative justice around the globe.

Rewriting the future? Biomedical advances and legal dilemmas

Developments in medical science have sparked public debate about the legal and ethical implications of new technologies. Within these debates a number of distinct discourses are evident, including discourses about the positive and negative implications of technological advances, the influence of globalisation on regulatory choice, and the challenges of articulating common values in a pluralistic society. This article argues that an understanding of these discourses is an essential part of understanding the nature of contemporary regulatory dilemmas.

From “somatic scandals” to “a constant potential for violence”? The culture of dissection, brain-based learning, and the rewriting/rewiring of “the child”

This article analyzes the “messy and numberless beginnings” of the hope placed upon neurological foundationalism to provide a solution to the “problem” of differences between students and to the achievement of educational goals. Rather than arguing for or against educational neuroscience, the article moves through five levels to examine the conditions of possibility for subscribing to the brain as a causal organological locus of learning.

Parallel Flow-Sensitive Pointer Analysis by Graph-Rewriting

Precise pointer analysis is a problem of interest to both the compiler and the program verification community. Flow-sensitivity is an important dimension of pointer analysis that affects the precision of the final result computed. Scaling flow-sensitive pointer analysis to millions of lines of code is a major challenge. Recently, staged flow-sensitive pointer analysis has been proposed, which exploits a sparse representation of program code created by staged analysis. In this paper we formulate the staged flow-sensitive pointer analysis as a graph-rewriting problem. Graph-rewriting has already been used for flow-insensitive analysis. However, formulating flow-sensitive pointer analysis as a graph-rewriting problem adds additional challenges due to the nature of flow-sensitivity. We implement our parallel algorithm using Intel Threading Building Blocks and demonstrate considerable scaling (upto 2.6x) for 8 threads on a set of 10 benchmarks. Compared to the sequential implementation of staged flow-sensitive analysis, a single threaded execution of our implementation performs better in 8 of the benchmarks.

Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation

We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked to the power of the given abstract lattice. We address pointers in a first-class manner, including when they are used within loops to traverse and update recursive data structures. Finally, we illustrate the comparative precision of our slices over those of previous approaches using representative examples.

Rewriting Schemes for Flash Memory

Flash memory is a leading storage media with excellent features such as random access and high storage density. However, it also faces significant reliability and endurance challenges. In flash memory, the charge level in the cells can be easily increased, but removing charge requires an expensive erasure operation. In this thesis we study rewriting schemes that enable the data stored in a set of cells to be rewritten by only increasing the charge level in the cells. We consider two types of modulation scheme; a convectional modulation based on the absolute levels of the cells, and a recently-proposed scheme based on the relative cell levels, called rank modulation. The contributions of this thesis to the study of rewriting schemes for rank modulation include the following: we

•propose a new method of rewriting in rank modulation, beyond the previously proposed method of “push-to-the-top”;

•study the limits of rewriting with the newly proposed method, and derive a tight upper bound of 1 bit per cell;

•extend the rank-modulation scheme to support rankings with repetitions, in order to improve the storage density;

•derive a tight upper bound of 2 bits per cell for rewriting in rank modulation with repetitions;

•construct an efficient rewriting scheme that asymptotically approaches the upper bound of 2 bit per cell.

The next part of this thesis studies rewriting schemes for a conventional absolute-levels modulation. The considered model is called “write-once memory” (WOM). We focus on WOM schemes that achieve the capacity of the model. In recent years several capacity-achieving WOM schemes were proposed, based on polar codes and randomness extractors. The contributions of this thesis to the study of WOM scheme include the following: we

•propose a new capacity-achievingWOM scheme based on sparse-graph codes, and show its attractive properties for practical implementation;

•improve the design of polarWOMschemes to remove the reliance on shared randomness and include an error-correction capability.

The last part of the thesis studies the local rank-modulation (LRM) scheme, in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The LRM scheme is used to simulate a single conventional multi-level flash cell. The simulated cell is realized by a Gray code traversing all the relative-value states where, physically, the transition between two adjacent states in the Gray code is achieved by using a single “push-to-the-top” operation. The main results of the last part of the thesis are two constructions of Gray codes with asymptotically-optimal rate.

Tipperary, by Frank Delaney: a reading of the rewriting of history of Ireland

O objetivo da presente pesquisa é o de discutir a reescrita da história da Irlanda, mais especificamente aspectos relacionados à construção da identidade nacional e de marcas da tradição, a partir da leitura do romance Tipperary, de Frank Delaney. Publicada em 2007, essa obra aborda de forma singular as querelas sobre identidade nacional, nacionalismo, passado, memória, e seus personagens principais e a trama estão significativamente ligados ao contexto político-social da história da Irlanda. Nessa reconstrução da história, o passado é revisitado através de diferentes pontos de vista. Nossa atenção estará voltada para a seleção de elementos/momentos da história do país que ganham foco na narrativa, e as possíveis repercussões deste processo. Além disso, nos concentraremos na questão das tênues fronteiras entre história e ficção, ou seja, as fronteiras pouco delimitadas entre o discurso histórico e o discurso ficcional. Na escrita da história em Tipperary, Delaney aborda questões relativas a mitos, lendas e tradições como importantes fatores de identidade nacional em uma Irlanda que emerge como uma nação independente. No romance em questão, podemos observar como história e memória se unem na jornada do protagonista, em sua empreitada de narrar a história de sua vida e de seu país

Can the dead speak? appropriation and rewriting of the canon in Angela Carters Nights at the circus and in Margaret Atwoods The Penelopiad

Esta dissertação visa estudar como autoras pós-modernas se apropriam e reescrevem textos canônicos em uma tentativa de trazer à tona e desconstruir as metanarrativas patriarcais, que informam tais textos. Tal objetivo pretende ser alcançado através de um estudo sobre a formação do cânone literário, dos conceitos de mito e principalmente das estratégias narrativas utilizadas por essas autoras em seu processo criativo. Para tal, um estudo sobre intertextualidade, a paródia e a intertextualidade paródica é levado a cabo nesta dissertação. Dois romances figuram como objeto de investigação neste trabalho. O romance Nights at the Circus, da escritora inglesa Angela Carter, é o primeiro a ser analisado. Nesse romance, as estratégias de apagamento das fronteiras entre os gêneros e a intertextualidade paródica entre textos e mitos clássicos como formas de apropriação e subversão do cânone, são privilegiadas. O outro romance que se faz presente nesta dissertação é a obra da autora canadense Margaret Atwood intitulada The Penelopiad. Nesse romance, personagens que antes eram marginalizados ou não tinham voz figuram como personagens principais, como é o caso de Penélope e de suas doze criadas. Esta dissertação visa, assim, mostrar como essas apropriações de textos canônicos exercem um papel fundamental no questionamento da artificialidade de discursos que são naturalizados e dos valores propagados pelos mesmos

Distributed Packet Rewriting and its Application to Scalable Server Architectures

To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in distributed Web servers is the need to direct incoming connections to individual hosts. Previous methods for connection routing have employed a centralized node which handles all incoming requests. In contrast, we propose a distributed approach, called Distributed Packet Rewriting (DPR), in which all hosts of the distributed system participate in connection routing. We argue that this approach promises better scalability and fault-tolerance than the centralized approach. We describe our implementation of four variants of DPR and compare their performance. We show that DPR provides performance comparable to centralized alternatives, measured in terms of throughput and delay under the SPECweb96 benchmark. Finally, we argue that DPR is particularly attractive both for small scale systems and for systems following the emerging trend toward increasingly intelligent I/O subsystems.

Load Balancing a Cluster of Web Servers using Distributed Packet Rewriting

In this paper, we propose and evaluate an implementation of a prototype scalable web server. The prototype consists of a load-balanced cluster of hosts that collectively accept and service TCP connections. The host IP addresses are advertised using the Round Robin DNS technique, allowing any host to receive requests from any client. Once a client attempts to establish a TCP connection with one of the hosts, a decision is made as to whether or not the connection should be redirected to a different host---namely, the host with the lowest number of established connections. We use the low-overhead Distributed Packet Rewriting (DPR) technique to redirect TCP connections. In our prototype, each host keeps information about connections in hash tables and linked lists. Every time a packet arrives, it is examined to see if it has to be redirected or not. Load information is maintained using periodic broadcasts amongst the cluster hosts.