Does binding of synesthetic color to the evoking grapheme require attention?

The official published version can be accessed from the link below.The neural mechanisms involved in binding features such as shape and color are a matter of some debate. Does accurate binding rely on spatial attention functions of the parietal lobe or can it occur without attentional input? One extraordinary phenomenon that may shed light on this question is that of chromatic-graphemic synesthesia, a rare condition in which letter shapes evoke color perceptions. A popular suggestion is that synesthesia results from cross-activation between different functional regions (e.g., between shape and color areas of the ventral pathway). Under such conditions binding may not require parietal involvement and could occur preattentively. We tested this hypothesis in two synesthetes who perceived grayscale letters and digits in color. We found no evidence for preattentive binding using a visual search paradigm in which the target was a synesthetic inducer. In another experiment involving color judgments, we show that the congruency of target color and the synesthetic color of irrelevant digits modulates performance more when the digits are included within the attended region of space. We propose that the mechanisms giving rise to this type of synesthesia appear to follow at least some principles of normal binding, and even synesthetic binding seems to require attention.This work has been supported by a Veterans Administration Senior Research Career Scientist Award and NINDS grant #MH62331 to LCR and the Elizabeth Roboz Einstein fellowship in Neuroscience and Human Development to NS

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

Eliminating Recursion from Monadic Datalog Programs on Trees

We study the problem of eliminating recursion from monadic datalog programs on trees with an infinite set of labels. We show that the boundedness problem, i.e., determining whether a datalog program is equivalent to some nonrecursive one is undecidable but the decidability is regained if the descendant relation is disallowed. Under similar restrictions we obtain decidability of the problem of equivalence to a given nonrecursive program. We investigate the connection between these two problems in more detail

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

Plasma concentrations of per- and polyfluoroalkyl substances and body composition from mid-childhood to early adolescence

BACKGROUND • Per- and polyfluoroalkyl substances (PFAS) may alter body composition by lowering anabolic hormones and increasing inflammation. Prior studies have found positive, inverse, and null associations of PFAS concentrations with adiposity among children and adolescents. Few studies have examined associations of PFAS concentrations with changes in body composition longitudinally. No study has examined the association of PFAS plasma concentrations with lean mass.https://knowledgeconnection.mainehealth.org/lambrew-retreat-2021/1038/thumbnail.jp

Surface Grafting of Poly(L-glutamates). 2. Helix Orientation

In this paper the average helix orientation of surface-grafted poly(γ-benzyl L-glutamate) (PBLG), poly(γ-methyl L-glutamate) (PMLG), and poly(γ-methyl L-glutamate)-co-(γ-n-stearyl L-glutamate) (PMLGSLG 70/30) was investigated by means of FT-IR transmission spectroscopy. The theoretical relation between the average tilt angle (θ) and the absorption peak areas of three different backbone amide bands could be calculated because their transition dipole moment directions with respect to the helix axis were known. From the normalized absorptions, the average tilt angles of grafted helices of PBLG, PMLG, and PMLGSLG 70/30 were determined. The somewhat larger average angle of PMLG helices of 35 ± 5° with respect to the substrate compared to the value of 32 ± 5° of PBLG was due to the higher grafting density of PMLG. Because of the smaller helix diameter as a result of the smaller size of the methyl side group, more PMLG helices grew on the same surface area. Sterical hindrance and unfavorable polar interactions between unidirectional aligned helices forced the PMLG helices in a more upright arrangement. The even more perpendicular orientation of PMLGSLG 70/30 (48 ± 6°) could be the result of incorporation of mainly γ-methyl L-glutamate N-carboxyanhydride (MLG-NCA) monomers during the initiation step. Incorporation of the much larger γ-n-stearyl L-glutamate N-carboxyanhydride (SLG-NCA) monomers afterward lead to enlarged angles with respect to the substrate. Due to swelling, a pronounced change in helix orientation of grafted PMLGSLG 70/30 in n-hexadecane was observed, resulting in an almost perpendicular helix orientation.

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

Interprocedural shape analysis for effectively cutpoint-free programs

Abstract. We present a framework for local interprocedural shape analysis that computes procedure summaries as transformers of procedure-local heaps (the parts of the heap that the procedure may reach). A main challenge in procedurelocal shape analysis is the handling of cutpoints, objects that separate the input heap of an invoked procedure from the rest of the heap, which-from the viewpoint of that invocation-is non-accessible and immutable. In this paper, we limit our attention to effectively cutpoint-free programsprograms in which the only objects that separate the callee's heap from the rest of the heap, when considering live reference fields, are the ones pointed to by the actual parameters of the invocation. This limitation (and certain variations of it, which we also describe) simplifies the local-reasoning about procedure calls because the analysis needs not track cutpoints. Furthermore, our analysis (conservatively) verifies that a program is effectively cutpoint-free

Strong Ultraviolet Pulse From a Newborn Type Ia Supernova

Type Ia supernovae are destructive explosions of carbon oxygen white dwarfs. Although they are used empirically to measure cosmological distances, the nature of their progenitors remains mysterious, One of the leading progenitor models, called the single degenerate channel, hypothesizes that a white dwarf accretes matter from a companion star and the resulting increase in its central pressure and temperature ignites thermonuclear explosion. Here we report observations of strong but declining ultraviolet emission from a Type Ia supernova within four days of its explosion. This emission is consistent with theoretical expectations of collision between material ejected by the supernova and a companion star, and therefore provides evidence that some Type Ia supernovae arise from the single degenerate channel.Comment: Accepted for publication on the 21 May 2015 issue of Natur