Variability in encoding precision accounts for visual short-term memory limitations.

It is commonly believed that visual short-term memory (VSTM) consists of a fixed number of "slots" in which items can be stored. An alternative theory in which memory resource is a continuous quantity distributed over all items seems to be refuted by the appearance of guessing in human responses. Here, we introduce a model in which resource is not only continuous but also variable across items and trials, causing random fluctuations in encoding precision. We tested this model against previous models using two VSTM paradigms and two feature dimensions. Our model accurately accounts for all aspects of the data, including apparent guessing, and outperforms slot models in formal model comparison. At the neural level, variability in precision might correspond to variability in neural population gain and doubly stochastic stimulus representation. Our results suggest that VSTM resource is continuous and variable rather than discrete and fixed and might explain why subjective experience of VSTM is not all or none.

Noiseless method for checking the Peres separability criterion by local operations and classical communication

We present a method for checking the Peres separability criterion in an arbitrary bipartite quantum state rho(AB) within local operations and classical communication scenario. The method does not require noise operation which is needed in making the partial transposition map physically implementable. The main task for the two observers, Alice and Bob, is to measure some specific functions of the partial transposed matrix. With these functions, they can determine the eigenvalues of rho(T)(AB)(B), among which the minimum serves as an entanglement witness.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

Two thousand years of missions before Carey, based upon and embodying many of the earliest extant accounts.

http://www.archive.org/details/twothousandyears014145mbp

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.

Safe Compositional Specification of Networking Systems: TRAFFIC The Language and Its Type Checking

This paper formally defines the operational semantic for TRAFFIC, a specification language for flow composition applications proposed in BUCS-TR-2005-014, and presents a type system based on desired safety assurance. We provide proofs on reduction (weak-confluence, strong-normalization and unique normal form), on soundness and completeness of type system with respect to reduction, and on equivalence classes of flow specifications. Finally, we provide a pseudo-code listing of a syntax-directed type checking algorithm implementing rules of the type system capable of inferring the type of a closed flow specification.

Experiences of the foster care process in the Republic of Ireland: retrospective accounts from biological children of foster carers

This thesis examines the experiences of the biological children of foster carers. In particular it explores their experiences in relation to inclusion, consultation and decision-making. The study also examines the support and training needs of birth children in foster families. Using a qualitative methodology in-depth, semi-structured interviews were conducted with fifteen birth children of foster carers aged between 18 and 30 years. The research findings show that for the majority of birth children, fostering was overall a positive experience which helped them develop into individuals who were caring and nonjudgemental. However, from the data collected in this study, it is clear that fostering also brings a range of challenges for birth children in foster families, such as managing feelings of loss, grief, jealousy and guilt when foster children leave. Birth children are reluctant to discuss these issues with their parents and often did not approach fostering social workers as they did not have a meaningful relationship in order to discuss their concerns. The findings also demonstrate that birth children undertake a lot of emotional work in supporting their parents, birth siblings and foster siblings. Despite the important role played by birth children in the fostering process, this contribution often goes unrecognised and unacknowledged by fostering professionals and agencies with birth children not included or consulted about foster care decisions that affect them. It is argued here that birth children are viewed by foster care professionals and agencies from a deficit based perspective. However, this study contends that it is not just foster parents who are involved in the foster care process, but the entire foster family. The findings of this study show that birth children are competent social actors capable of making valuable contributions to foster care decisions that affect their lives and that of their family.

Embodied sexualities: Exploring accounts of Irish women's sexual knowledge and sexual experiences, 1920-1970

This chapter explores the ways in which sexuality has been understood, embodied and negotiated by a cohort of Irish women through their lives. It is based on qualitative data generated as part of an oral history project on Irish women’s experiences of sexuality and reproduction during the period 1920–1970.1 The interviews, which were conducted with 21 Irish women born between 1914 and 1955, illustrate that social and cultural discourses of sexuality as secretive, dangerous, dutiful and sinful were central to these women’s interpretative repertoires around sexuality and gender. However, the data also contains accounts of behaviours, experiences and feelings that challenged or resisted prevailing scripts of sexuality and gender. Drawing on feminist conceptualisations of sexuality and embodiment (Holland et al., 1994; Jackson and Scott, 2010), this chapter demonstrates that the women’s sexual subjectivities were forged in the tensions that existed between normative sexual scripts and their embodied experiences of sexual desires and sexual and reproductive practices. While recollections of sexual desire and pleasure did feature in the accounts of some of the women, it was the difficulties experienced around sexuality and reproduction that were spoken about in greatest detail. What emerges clearly from the data is the confusion, anxiety and pain occasioned by the negotiation of external demands and internal desires and the contested, unstable nature of both cultural power and female resistance.

Cooperation between adsorbates accounts for the activation of atomic layer deposition reactions

Atomic layer deposition (ALD) is a technique for producing conformal layers of nanometre-scale thickness, used commercially in non-planar electronics and increasingly in other high-tech industries. ALD depends on self-limiting surface chemistry but the mechanistic reasons for this are not understood in detail. Here we demonstrate, by first-principle calculations of growth of HfO2 from Hf(N(CH3)2)4–H2O and HfCl4–H2O and growth of Al2O3 from Al(CH3)3–H2O, that, for all these precursors, co-adsorption plays an important role in ALD. By this we mean that previously-inert adsorbed fragments can become reactive once sufficient numbers of molecules adsorb in their neighbourhood during either precursor pulse. Through the calculated activation energies, this ‘cooperative’ mechanism is shown to have a profound influence on proton transfer and ligand desorption, which are crucial steps in the ALD cycle. Depletion of reactive species and increasing coordination cause these reactions to self-limit during one precursor pulse, but to be re-activated via the cooperative effect in the next pulse. This explains the self-limiting nature of ALD.