A comparative study to evaluate the effectiveness of a human relations seminar in a diploma school of nursing

Thesis (M.S.)--Boston Universit

A Compositional Cost Model for the Lambda-calculus

We describe a (time) cost model for the (call-by-value) λ-calculus based on a natural presentation of its game semantics: the cost of computing a finite approximant to the denotation of a term (its evaluation tree) is the size of its smallest derivation in the semantics. This measure has an optimality property enabling compositional reasoning about cost bounds: for any term A, con C[_] and approximants a and c to the trees of A and C[A], the cost of computing c from C[A] is no more than the cost of computing a from A and c from C[a].Although the natural semantics on which it is based is nondeterministic, our cost model is reasonable: we describe a deterministic algorithm for recognizing evaluation tree approximants which satisfies it (up to a constant factor overhead) on a Random Access Machine. This requires an implementation of the λv-calculus on the RAM which is completely lazy: compositionality of costs entails that work done to evaluate any part of a term cannot be duplicated. This is achieved by a novel implementation of graph reduction for nameless explicit substitutions, to which we compile the λv-calculus via a series of linear cost reductions.</p

The Moral Grounds of Reasonably Mistaken Self-Defense

Some, but not all, of the mistakes a person makes when acting in apparently necessary self-defense are reasonable: we take them not to violate the rights of the apparent aggressor. I argue that this is explained by duties grounded in agents' entitlements to a fair distribution of the risk of suffering unjust harm. I suggest that the content of these duties is filled in by a social signaling norm, and offer some moral constraints on the form such a norm can take

A partial evaluation of a seminar in human relations in a diploma school of nursing

Thesis (M.S.)--Boston Universit

On the Implementation of Dynamic Patterns

The evaluation mechanism of pattern matching with dynamic patterns is modelled in the Pure Pattern Calculus by one single meta-rule. This contribution presents a refinement which narrows the gap between the abstract calculus and its implementation. A calculus is designed to allow reasoning on matching algorithms. The new calculus is proved to be confluent, and to simulate the original Pure Pattern Calculus. A family of new, matching-driven, reduction strategies is proposed.Comment: In Proceedings HOR 2010, arXiv:1102.346

Lazy User Theory and Interpersonal Communication Networks

This research examines individual adoption and use of communication technologies through a communication perspective by utilizing concepts from the lazy user theory of solution selection. The user state (individual technology use characteristics) and peer communication are hypothesized to predict switching costs (communication device satisfaction) and laziness. A survey of 687 individuals consisting of college students, Facebook, and Reddit.com users collected data later subjected to exploratory factor analysis and multiple regression. Factor analysis revealed four aspects of user state portable tech-ers, onliners, workers, and relationshipers three types of peer communicators conversationalists, web-referencers, and peer superiors and one type of switching cost, switchers. Three multiple regressions confirmed both hypotheses user state and peer communication account for 14.7 of the variance in switching costs and 11 and 9.9 of the variance in laziness. The study concludes that there are four factors,varying in importance, that an individual considers when adopting a communication device, and three primary strategies for seeking information about communication devices. Switching decisions and laziness are, to some extent, influenced by the user state and peer communication and future research should again examine concepts from the lazy user theory empiricall