True Greatness: A Discourse on the character of Rev. Wilbur Fisk

Memorial discourse

Christian Witness on the Plateau Vivarais-Lignon: Narrative, Nonviolence, and the Formation of Character

This dissertation analyzes the theological and ethical convictions that led the people of the Plateau Vivarais-Lignon to shelter thousands of refugees between 1939 and 1945. It does so by examining the themes of narrative identity, hospitality, character formation, nonviolence, and the contextual witness of church tradition. Though a number of studies have been published about the rescue activity in this region of France during World War II, none have thoroughly analyzed the theological nature of this activity. Using the Plateau Vivarais-Lignon as a case study in theological ethics, the dissertation draws on historical sources as well as the work of contemporary theologians and ethicists to understand, interpret, and analyze the witness of this community. After situating its rescue and resistance work within the Huguenot narrative of persecution and exile, I examine the theological convictions of the Reformed pastor of Le Chambon-sur-Lignon, André Trocmé, who played a key role in making the Plateau a place of refuge during the Holocaust. The study highlights the importance of narrative in the actions of this community and discusses the relationship between narrative, character, and ethics. It then examines the nonviolent commitments of key leaders of the rescue effort, using this analysis as a springboard to engage in broader theological reflection about the ethics of nonviolence. After examining the radical hospitality practiced on the Plateau in light of biblical narratives and Reformed history, I investigate the counter-cultural nature of Christian hospitality. The study concludes by analyzing the nature and witness of the church in light of the legacy of the Plateau Vivarais-Lignon. The dissertation suggests that increased academic and ecclesial attention be given to the relationship between narrative and character, the counter-cultural shape of Christian hospitality, and the active nature of nonviolence. It presents an in-depth analysis of the theological and ethical convictions of the people of the Plateau Vivarais-Lignon, arguing that their witness has ongoing significance for communities of faith as they grapple with how to form disciples, relate to the wider society, welcome strangers, and communicate God's shalom in a world of violence.

A Virtual Deadline Scheduler for Window-Constrained Service Guarantees

This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), that attempts to guarantee no more than x out of y deadlines are missed for real-time jobs such as periodic CPU tasks, or delay-constrained packet streams. While DWCS is capable of generating a feasible window-constrained schedule that utilizes 100% of resources, it requires all jobs to have the same request periods (or intervals between successive service requests). We describe a new algorithm called Virtual Deadline Scheduling (VDS), that provides window-constrained service guarantees to jobs with potentially different request periods, while still maximizing resource utilization. VDS attempts to service m out of k job instances by their virtual deadlines, that may be some finite time after the corresponding real-time deadlines. Notwithstanding, VDS is capable of outperforming DWCS and similar algorithms, when servicing jobs with potentially different request periods. Additionally, VDS is able to limit the extent to which a fraction of all job instances are serviced late. Results from simulations show that VDS can provide better window-constrained service guarantees than other related algorithms, while still having as good or better delay bounds for all scheduled jobs. Finally, an implementation of VDS in the Linux kernel compares favorably against DWCS for a range of scheduling loads.

Friendly Virtual Machine: Leveraging a Feedback-Control Model for Application Adaptation

With the increased use of "Virtual Machines" (VMs) as vehicles that isolate applications running on the same host, it is necessary to devise techniques that enable multiple VMs to share underlying resources both fairly and efficiently. To that end, one common approach is to deploy complex resource management techniques in the hosting infrastructure. Alternately, in this paper, we advocate the use of self-adaptation in the VMs themselves based on feedback about resource usage and availability. Consequently, we define a "Friendly" VM (FVM) to be a virtual machine that adjusts its demand for system resources, so that they are both efficiently and fairly allocated to competing FVMs. Such properties are ensured using one of many provably convergent control rules, such as AIMD. By adopting this distributed application-based approach to resource management, it is not necessary to make assumptions about the underlying resources nor about the requirements of FVMs competing for these resources. To demonstrate the elegance and simplicity of our approach, we present a prototype implementation of our FVM framework in User-Mode Linux (UML)-an implementation that consists of less than 500 lines of code changes to UML. We present an analytic, control-theoretic model of FVM adaptation, which establishes convergence and fairness properties. These properties are also backed up with experimental results using our prototype FVM implementation.

Lightweight Modeling of Java Virtual Machine Security Constraints using Alloy

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the component known as the Bytecode Verifier. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of a real-world malicious applet is given to demonstrate the efficacy of the approach.

Online and Offline Character Recognition Using Alignment to Prototypes

Nearest neighbor classifiers are simple to implement, yet they can model complex non-parametric distributions, and provide state-of-the-art recognition accuracy in OCR databases. At the same time, they may be too slow for practical character recognition, especially when they rely on similarity measures that require computationally expensive pairwise alignments between characters. This paper proposes an efficient method for computing an approximate similarity score between two characters based on their exact alignment to a small number of prototypes. The proposed method is applied to both online and offline character recognition, where similarity is based on widely used and computationally expensive alignment methods, i.e., Dynamic Time Warping and the Hungarian method respectively. In both cases significant recognition speedup is obtained at the expense of only a minor increase in recognition error.

Comparative Performance Measures of Fuzzy ARTMAP, Learned Vector Quantization, and Back Propagation for Handwritten Character Recognition

This article compares the performance of Fuzzy ARTMAP with that of Learned Vector Quantization and Back Propagation on a handwritten character recognition task. Training with Fuzzy ARTMAP to a fixed criterion used many fewer epochs. Voting with Fuzzy ARTMAP yielded the highest recognition rates.