972 research outputs found

    In the beginning was the word: paradigms of language and normativity in law, philosophy and theology

    Get PDF

    Specialized face perception mechanisms extract both part and spacing information: evidence from developmental prosopagnosia

    Get PDF
    It is well established that faces are processed by mechanisms that are not used with other objects. Two prominent hypotheses have been proposed to characterize how information is represented by these special mechanisms. The spacing hypothesis suggests that face-specific mechanisms primarily extract information about spacing among parts rather than information about the shape of the parts. In contrast, the holistic hypothesis suggests that faces are processed as nondecomposable wholes and, therefore, claims that both parts and spacing among them are integral aspects of face representation. Here we examined these hypotheses by testing a group of developmental prosopagnosics (DPs) who suffer from deficits in face recognition. Subjects performed a face discrimination task with faces that differed either in the spacing of the parts but not the parts (spacing task), or in the parts but not the spacing of the parts (part task). Consistent with the holistic hypothesis, DPs showed lower performance than controls on both the spacing and the part tasks, as long as salient contrast differences between the parts were minimized. Furthermore, by presenting similar spacing and part tasks with houses, we tested whether face-processing mechanisms are specific to faces, or whether they are used to process spacing information from any stimulus. DPs' normal performance on the tasks of two houses indicates that their deficit does not result from impairment in a general-purpose spacing mechanism. In summary, our data clearly support face-specific holistic hypothesis by showing that face perception mechanisms extract both part and spacing information

    A unified coding strategy for processing faces and voices

    Get PDF
    Both faces and voices are rich in socially-relevant information, which humans are remarkably adept at extracting, including a person's identity, age, gender, affective state, personality, etc. Here, we review accumulating evidence from behavioral, neuropsychological, electrophysiological, and neuroimaging studies which suggest that the cognitive and neural processing mechanisms engaged by perceiving faces or voices are highly similar, despite the very different nature of their sensory input. The similarity between the two mechanisms likely facilitates the multi-modal integration of facial and vocal information during everyday social interactions. These findings emphasize a parsimonious principle of cerebral organization, where similar computational problems in different modalities are solved using similar solutions

    Uniform unweighted set cover: The power of non-oblivious local search

    Get PDF
    AbstractWe are given n base elements and a finite collection of subsets of them. The size of any subset varies between p to k (p<k). In addition, we assume that the input contains all possible subsets of size p. Our objective is to find a subcollection of minimum-cardinality which covers all the elements. This problem is known to be NP-hard. We provide two approximation algorithms for it, one for the generic case, and an improved one for the special case of (p,k)=(2,4).The algorithm for the generic case is a greedy one, based on packing phases: at each phase we pick a collection of disjoint subsets covering i new elements, starting from i=k down to i=p+1. At a final step we cover the remaining base elements by the subsets of size p. We derive the exact performance guarantee of this algorithm for all values of k and p, which is less than Hk, where Hk is the k’th harmonic number. However, the algorithm exhibits the known improvement methods over the greedy one for the unweighted k-set cover problem (in which subset sizes are only restricted not to exceed k), and hence it serves as a benchmark for our improved algorithm.The improved algorithm for the special case of (p,k)=(2,4) is based on non-oblivious local search: it starts with a feasible cover, and then repeatedly tries to replace sets of size 3 and 4 so as to maximize an objective function which prefers big sets over small ones. For this case, our generic algorithm achieves an asymptotic approximation ratio of 1.5+ϵ, and the local search algorithm achieves a better ratio, which is bounded by 1.458333…+ϵ

    LFA-tuned matrix-free multigrid method for the elastic Helmholtz equation

    Full text link
    We present an efficient matrix-free geometric multigrid method for the elastic Helmholtz equation, and a suitable discretization. Many discretization methods had been considered in the literature for the Helmholtz equations, as well as many solvers and preconditioners, some of which are adapted for the elastic version of the equation. However, there is very little work considering the reciprocity of discretization and a solver. In this work, we aim to bridge this gap. By choosing an appropriate stencil for re-discretization of the equation on the coarse grid, we develop a multigrid method that can be easily implemented as matrix-free, relying on stencils rather than sparse matrices. This is crucial for efficient implementation on modern hardware. Using two-grid local Fourier analysis, we validate the compatibility of our discretization with our solver, and tune a choice of weights for the stencil for which the convergence rate of the multigrid cycle is optimal. It results in a scalable multigrid preconditioner that can tackle large real-world 3D scenarios.Comment: 20 page

    An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs

    Get PDF
    Department of Logistics2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    What can Individual Differences Reveal about Face Processing?

    Get PDF
    Faces are probably the most widely studied visual stimulus. Most research on face processing has used a group-mean approach that averages behavioral or neural responses to faces across individuals and treats variance between individuals as noise. However, individual differences in face processing can provide valuable information that complements and extends findings from group-mean studies. Here we demonstrate that studies employing an individual differences approach—examining associations and dissociations across individuals—can answer fundamental questions about the way face processing operates. In particular these studies allow us to associate and dissociate the mechanisms involved in face processing, tie behavioral face processing mechanisms to neural mechanisms, link face processing to broader capacities and quantify developmental influences on face processing. The individual differences approach we illustrate here is a powerful method that should be further explored within the domain of face processing as well as fruitfully applied across the cognitive sciences

    A functional role of the sky’s polarization pattern for orientation in the greater mouse-eared bat

    Get PDF
    Animals can call on a multitude of sensory information to orient and navigate. One such cue is the pattern of polarized light in the sky, which for example can be used by birds as a geographical reference to calibrate other cues in the compass mechanism. Here we demonstrate that the female greater mouse-eared bat (Myotis myotis) uses polarization cues at sunset to calibrate a magnetic compass, which is subsequently used for orientation during a homing experiment. This renders bats the only mammal known so far to make use of the polarization pattern in the sky. Although there is currently no clear understanding of how this cue is perceived in this taxon, our observation has general implications for the sensory biology of mammalian vision
    corecore