Food abuse : Mealtimes, helplines and 'troubled' eating

Feeding children can be one of the most challenging and frustrating aspects of raising a family. This is often exacerbated by conflicting guidelines over what the ‘correct’ amount of food and ‘proper’ eating actually entails. The issue becomes muddier still when parents are accused of mistreating their children by not feeding them properly, or when eating becomes troubled in some way. Yet how are parents to ‘know’ how much food is enough and when their child is ‘full’? How is food negotiated on a daily level? In this chapter, we show how discursive psychology can provide a way of understanding these issues that goes beyond guidelines and measurements. It enables us to examine the practices within which food is negotiated and used to hold others accountable. Like the other chapters in this section of the book, eating practices can also be situations in which an asymmetry of competence is produced; where one party is treated as being a less-than-valid person (in the case of family practices, this is often the child). As we shall see later, the asymmetry can also be reversed, where one person (adult or child) can claim to have greater ‘access’ to concepts such as ‘appetite’ and ‘hunger’. Not only does this help us to understand the complexity of eating practices; it also highlights features of the parent/child relationshipi and the institutionality of families

The Synthesis of Logic Programs from Inductive Proofs

We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the all-ground mode, i.e. when all its arguments are inputs (pred(+,...,+) in Prolog notation). The program is synthesised as a function in this mode and then run in other modes. To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system

Normalizers of Irreducible Subfactors

We consider normalizers of an irreducible inclusion $N\subseteq M$ of $\mathrm{II}_1$ factors. In the infinite index setting an inclusion $uNu^*\subseteq N$ can be strict, forcing us to also investigate the semigroup of one-sided normalizers. We relate these normalizers of $N$ in $M$ to projections in the basic construction and show that every trace one projection in the relative commutant $N'\cap$ is of the form $u^*e_Nu$ for some unitary $u\in M$ with $uNu^*\subseteq N$. This enables us to identify the normalizers and the algebras they generate in several situations. In particular each normalizer of a tensor product of irreducible subfactors is a tensor product of normalizers modulo a unitary. We also examine normalizers of irreducible subfactors arising from subgroup--group inclusions $H\subseteq G$. Here the normalizers are the normalizing group elements modulo a unitary from $L(H)$. We are also able to identify the finite trace $L(H)$-bimodules in $\ell^2(G)$ as double cosets which are also finite unions of left cosets.Comment: 33 Page

Researcher’s Reactions to Compelled Disclosure of Scientific Information

Demands placed on researchers by subpoenas for scientific information are not necessarily any greater than those placed on other third-party recipients of subpoenas