Cosmic Gratitude

Classically, gratitude is a tri-polar construal, logically ordering a benefactor, a benefice, and a beneficiary in a favour-giving-receiving situation. Grammatically, the poles are distinguished and bound together by the prepositions ”to’ and ”for’; so I call this classic concept ”to-for’ gratitude. Classic religious gratitude follows this schema, with God as the benefactor. Such gratitude, when felt, is a religious experience, and a reliable readiness or ”habit’ of such construal is a religious virtue. However, atheists have sometimes felt an urge or need for an analogous experience and virtue of gratitude, and theists sometimes feel intellectual discomfort with classical theistic gratitude on consideration of the misfortunes that characterize our life along with its blessings. In response, another conception of religious gratitude has been attempted, a construal that lacks the to-for structure. This paper probes the significance of the benefactor for gratitude, both secular and religious, and, with Søren Kierkegaard’s help, some features of the theology of classical religious gratitude that dissolve the problem of misfortunes

Education in England from 1400-1700

Thesis (Ph.D.)--Boston Universit

A Flow-aware MAC Protocol for a Passive Optical Metropolitan Area Network

The paper introduces an original MAC protocol for a passive optical metropolitan area network using time-domain wavelength interleaved networking (TWIN)% as proposed recently by Bell Labs . Optical channels are shared under the distributed control of destinations using a packet-based polling algorithm. This MAC is inspired more by EPON dynamic bandwidth allocation than the slotted, GPON-like access control generally envisaged for TWIN. Management of source-destination traffic streams is flow-aware with the size of allocated time slices being proportional to the number of active flows. This emulates a network-wide, distributed fair queuing scheduler, bringing the well-known implicit service differentiation and robustness advantages of this mechanism to the metro area network. The paper presents a comprehensive performance evaluation based on analytical modelling supported by simulations. The proposed MAC is shown to have excellent performance in terms of both traffic capacity and packet latency

A versatile and accurate approximation for LRU cache performance

In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite general distributions of object popularity. This paper provides a mathematical explanation for the success of the approximation, notably in configurations where the intuitive arguments of Che, et al clearly do not apply. The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other approaches fail due to the very large populations of cacheable objects to be taken into account and to their complex popularity law, resulting from the mix of different content types and the filtering effect induced by the lower layers in a cache hierarchy

On the stability and ergodicity of adaptive scaling Metropolis algorithms

The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.Comment: 24 pages, 1 figure; major revisio

Impact of traffic mix on caching performance in a content-centric network

For a realistic traffic mix, we evaluate the hit rates attained in a two-layer cache hierarchy designed to reduce Internet bandwidth requirements. The model identifies four main types of content, web, file sharing, user generated content and video on demand, distinguished in terms of their traffic shares, their population and object sizes and their popularity distributions. Results demonstrate that caching VoD in access routers offers a highly favorable bandwidth memory tradeoff but that the other types of content would likely be more efficiently handled in very large capacity storage devices in the core. Evaluations are based on a simple approximation for LRU cache performance that proves highly accurate in relevant configurations

Upstream traffic capacity of a WDM EPON under online GATE-driven scheduling

Passive optical networks are increasingly used for access to the Internet and it is important to understand the performance of future long-reach, multi-channel variants. In this paper we discuss requirements on the dynamic bandwidth allocation (DBA) algorithm used to manage the upstream resource in a WDM EPON and propose a simple novel DBA algorithm that is considerably more efficient than classical approaches. We demonstrate that the algorithm emulates a multi-server polling system and derive capacity formulas that are valid for general traffic processes. We evaluate delay performance by simulation demonstrating the superiority of the proposed scheduler. The proposed scheduler offers considerable flexibility and is particularly efficient in long-reach access networks where propagation times are high