The Man Who Mistook His Neuropsychologist For a Popstar: When Configural Processing Fails in Acquired Prosopagnosia

We report the case of an individual with acquired prosopagnosia who experiences extreme difficulties in recognizing familiar faces in everyday life despite excellent object recognition skills. Formal testing indicates that he is also severely impaired at remembering pre-experimentally unfamiliar faces and that he takes an extremely long time to identify famous faces and to match unfamiliar faces. Nevertheless, he performs as accurately and quickly as controls at identifying inverted familiar and unfamiliar faces and can recognize famous faces from their external features. He also performs as accurately as controls at recognizing famous faces when fracturing conceals the configural information in the face. He shows evidence of impaired global processing but normal local processing of Navon figures. This case appears to reflect the clearest example yet of an acquired prosopagnosic patient whose familiar face recognition deficit is caused by a severe configural processing deficit in the absence of any problems in featural processing. These preserved featural skills together with apparently intact visual imagery for faces allow him to identify a surprisingly large number of famous faces when unlimited time is available. The theoretical implications of this pattern of performance for understanding the nature of acquired prosopagnosia are discussed.DY, Avery Braun, Jacob Waite, and Nadine Wanke, Bruno Rossion, Thomas Busigny and the grant awarded by AJ by the Experimental Psychology Society (EPS

iCub visual memory inspector: Visualising the iCub’s thoughts

This paper describes the integration of multiple sensory recognition models created by a Synthetic Autobiographical Memory into a structured system. This structured system provides high level control of the overall architecture and interfaces with an iCub simulator based in Unity which provides a virtual space for the display of recollected events

Faster Algorithms for Weighted Recursive State Machines

Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the best-known complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project

A Time Series Analysis of Air Pollution and Preterm Birth in Pennsylvania, 1997–2001

Preterm delivery can lead to serious infant health outcomes, including death and lifelong disability. Small increases in preterm delivery risk in relation to spatial gradients of air pollution have been reported, but previous studies may have controlled inadequately for individual factors. Using a time-series analysis, which eliminates potential confounding by individual risk factors that do not change over short periods of time, we investigated the effect of ambient outdoor particulate matter with diameter ≤10 μm (PM(10)) and sulfur dioxide on risk for preterm delivery. Daily counts of preterm births were obtained from birth records in four Pennsylvania counties from 1997 through 2001. We observed increased risk for preterm delivery with exposure to average PM(10) and SO(2) in the 6 weeks before birth [respectively, relative risk (RR) = 1.07; 95% confidence interval (CI), 0.98–1.18 per 50 μg/m(3) increase; RR = 1.15; 95% CI, 1.00–1. 32 per 15 ppb increase], adjusting for long-term preterm delivery trends, co-pollutants, and offsetting by the number of gestations at risk. We also examined lags up to 7 days before the birth and found an acute effect of exposure to PM(10) 2 days and 5 days before birth (respectively, RR = 1.10; 95% CI, 1.00–1.21; RR = 1.07; 95% CI, 0.98–1.18) and SO(2) 3 days before birth (RR = 1.07; 95% CI, 0.99–1.15), adjusting for covariates, including temperature, dew point temperature, and day of the week. The results from this time-series analysis, which provides evidence of an increase in preterm birth risk with exposure to PM(10) and SO(2), are consistent with prior investigations of spatial contrasts

Neuropsychological Measures of Attention and Impulse Control among 8-Year-Old Children Exposed Prenatally to Organochlorines

Background: We previously reported associations between organochlorines and behaviors related to attention deficit hyperactivity disorder among boys and girls at 8 years of age using a teacher’s rating scale for a birth cohort in New Bedford, Massachusetts (USA)

Beyond reachability: Shape abstraction in the presence of pointer arithmetic

Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discrete nodes that can be accessed only via access paths built from variables and field names, an assumption that is violated by pointer arithmetic. In this paper we show how this assumption can be removed, and pointer arithmetic embraced, by using an analysis based on separation logic. We describe an abstract domain whose elements are certain separation logic formulae, and an abstraction mechanism that automatically transits between a low-level RAM view of memory and a higher, fictional, view that abstracts from the representation of nodes and multiword linked-lists as certain configurations of the RAM. A widening operator is used to accelerate the analysis. We report experimental results obtained from running our analysis on a number of classic algorithms for dynamic memory management.

Residential Proximity to Major Roadways at Birth, DNA Methylation at Birth and Midchildhood, and Childhood Cognitive Test Scores: Project Viva(Massachusetts, USA).

BackgroundEpigenetic variability is hypothesized as a regulatory pathway through which prenatal exposures may influence child development and health.ObjectiveWe sought to examine the associations of residential proximity to roadways at birth and epigenome-wide DNA methylation. We also assessed associations of differential methylation with child cognitive outcomes.MethodsWe estimated residential proximity to roadways at birth using a geographic information system (GIS) and cord blood methylation using Illumina's HumanMethylation450-array in 482 mother-child pairs in Project Viva. We identified individual CpGs associated with residential-proximity-to-roadways at birth using robust linear regression [[Formula: see text]]. We also estimated association between proximity-to-roadways at birth and methylation of the same sites in blood samples collected at age 7-11 y ([Formula: see text]). We ran the same analyses in the Generation R Study for replication ([Formula: see text]). In Project Viva, we investigated associations of differential methylation at birth with midchildhood cognition using linear regression.ResultsLiving closer to major roadways at birth was associated with higher cord blood (and-more weakly-midchildhood blood) methylation of four sites in LAMB2. For each halving of residential-proximity-to-major-roadways, we observed a 0.82% increase in DNA methylation at cg05654765 [95% confidence interval (CI): (0.54%, 1.10%)], 0.88% at cg14099457 [95% CI: (0.56%, 1.19%)], 0.19% at cg03732535 [95% CI: (0.11%, 0.28)], and 1.08% at cg02954987 [95% CI: (0.65%, 1.51%)]. Higher cord blood methylation of these sites was associated with lower midchildhood nonverbal cognitive scores. Our results did not replicate in the Generation R Study.ConclusionsOur discovery results must be interpreted with caution, given that they were not replicated in a separate cohort. However, living close to major roadways at birth was associated with cord blood methylation of sites in LAMB2-a gene known to be linked to axonal development-in our U.S. cohort. Higher methylation of these sites associated with lower nonverbal cognitive scores at age 7-11 y in the same children. https://doi.org/10.1289/EHP2034

On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem where the focus is either on finding one solution, or on enumerating all solutions, possibly projected to some given set of output variables. The paper investigates the structural tractability of the problem of enumerating (possibly projected) solutions, where tractability means here computable with polynomial delay (WPD), since in general exponentially many solutions may be computed. A general framework based on the notion of tree projection of hypergraphs is considered, which generalizes all known decomposition methods. Tractability results have been obtained both for classes of structures where output variables are part of their specification, and for classes of structures where computability WPD must be ensured for any possible set of output variables. These results are shown to be tight, by exhibiting dichotomies for classes of structures having bounded arity and where the tree decomposition method is considered