86,139 research outputs found

    Feature integration and task switching: diminished switch costs after controlling for stimulus, response, and cue repetitions

    Get PDF
    This report presents data from two versions of the task switching procedure in which the separate influence of stimulus repetitions, response key repetitions, conceptual response repetitions, cue repetitions, task repetitions, and congruency are considered. Experiment 1 used a simple alternating runs procedure with parity judgments of digits and consonant/ vowel decisions of letters as the two tasks. Results revealed sizable effects of stimulus and response repetitions, and controlling for these effects reduced the switch cost. Experiment 2 was a cued version of the task switch paradigm with parity and magnitude judgments of digits as the two tasks. Results again revealed large effects of stimulus and response repetitions, in addition to cue repetition effects. Controlling for these effects again reduced the switch cost. Congruency did not interact with our novel "unbiased" measure of switch costs. We discuss how the task switch paradigm might be thought of as a more complex version of the feature integration paradigm and propose an episodic learning account of the effect. We further consider to what extent appeals to higher-order control processes might be unnecessary and propose that controls for feature integration biases should be standard practice in task switching experiments

    Planetary Candidates Observed by Kepler. VIII. A Fully Automated Catalog With Measured Completeness and Reliability Based on Data Release 25

    Get PDF
    We present the Kepler Object of Interest (KOI) catalog of transiting exoplanets based on searching four years of Kepler time series photometry (Data Release 25, Q1-Q17). The catalog contains 8054 KOIs of which 4034 are planet candidates with periods between 0.25 and 632 days. Of these candidates, 219 are new and include two in multi-planet systems (KOI-82.06 and KOI-2926.05), and ten high-reliability, terrestrial-size, habitable zone candidates. This catalog was created using a tool called the Robovetter which automatically vets the DR25 Threshold Crossing Events (TCEs, Twicken et al. 2016). The Robovetter also vetted simulated data sets and measured how well it was able to separate TCEs caused by noise from those caused by low signal-to-noise transits. We discusses the Robovetter and the metrics it uses to sort TCEs. For orbital periods less than 100 days the Robovetter completeness (the fraction of simulated transits that are determined to be planet candidates) across all observed stars is greater than 85%. For the same period range, the catalog reliability (the fraction of candidates that are not due to instrumental or stellar noise) is greater than 98%. However, for low signal-to-noise candidates between 200 and 500 days around FGK dwarf stars, the Robovetter is 76.7% complete and the catalog is 50.5% reliable. The KOI catalog, the transit fits and all of the simulated data used to characterize this catalog are available at the NASA Exoplanet Archive.Comment: 61 pages, 23 Figures, 9 Tables, Accepted to The Astrophysical Journal Supplement Serie

    Planetary Candidates Observed by Kepler. VIII. A Fully Automated Catalog with Measured Completeness and Reliability Based on Data Release 25

    Full text link
    We present the Kepler Object of Interest (KOI) catalog of transiting exoplanets based on searching 4 yr of Kepler time series photometry (Data Release 25, Q1–Q17). The catalog contains 8054 KOIs, of which 4034 are planet candidates with periods between 0.25 and 632 days. Of these candidates, 219 are new, including two in multiplanet systems (KOI-82.06 and KOI-2926.05) and 10 high-reliability, terrestrial-size, habitable zone candidates. This catalog was created using a tool called the Robovetter, which automatically vets the DR25 threshold crossing events (TCEs). The Robovetter also vetted simulated data sets and measured how well it was able to separate TCEs caused by noise from those caused by low signal-to-noise transits. We discuss the Robovetter and the metrics it uses to sort TCEs. For orbital periods less than 100 days the Robovetter completeness (the fraction of simulated transits that are determined to be planet candidates) across all observed stars is greater than 85%. For the same period range, the catalog reliability (the fraction of candidates that are not due to instrumental or stellar noise) is greater than 98%. However, for low signal-to-noise candidates between 200 and 500 days around FGK-dwarf stars, the Robovetter is 76.7% complete and the catalog is 50.5% reliable. The KOI catalog, the transit fits, and all of the simulated data used to characterize this catalog are available at the NASA Exoplanet Archive

    Individual and Domain Adaptation in Sentence Planning for Dialogue

    Full text link
    One of the biggest challenges in the development and deployment of spoken dialogue systems is the design of the spoken language generation module. This challenge arises from the need for the generator to adapt to many features of the dialogue domain, user population, and dialogue context. A promising approach is trainable generation, which uses general-purpose linguistic knowledge that is automatically adapted to the features of interest, such as the application domain, individual user, or user group. In this paper we present and evaluate a trainable sentence planner for providing restaurant information in the MATCH dialogue system. We show that trainable sentence planning can produce complex information presentations whose quality is comparable to the output of a template-based generator tuned to this domain. We also show that our method easily supports adapting the sentence planner to individuals, and that the individualized sentence planners generally perform better than models trained and tested on a population of individuals. Previous work has documented and utilized individual preferences for content selection, but to our knowledge, these results provide the first demonstration of individual preferences for sentence planning operations, affecting the content order, discourse structure and sentence structure of system responses. Finally, we evaluate the contribution of different feature sets, and show that, in our application, n-gram features often do as well as features based on higher-level linguistic representations

    Distance-regular Cayley graphs with small valency

    Full text link
    We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most 44, the Cayley graphs among the distance-regular graphs with known putative intersection arrays for valency 55, and the Cayley graphs among all distance-regular graphs with girth 33 and valency 66 or 77. We obtain that the incidence graphs of Desarguesian affine planes minus a parallel class of lines are Cayley graphs. We show that the incidence graphs of the known generalized hexagons are not Cayley graphs, and neither are some other distance-regular graphs that come from small generalized quadrangles or hexagons. Among some ``exceptional'' distance-regular graphs with small valency, we find that the Armanios-Wells graph and the Klein graph are Cayley graphs.Comment: 19 pages, 4 table

    Probabilistic Matching of Planar Regions

    Get PDF
    We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes AA and BB, the algorithm computes a transformation tt such that with high probability the area of overlap of t(A)t(A) and BB is close to maximal. In the case of polygons, we give a time bound that does not depend significantly on the number of vertices

    System size and centrality dependence of the balance function in A+A collisions at sqrt[sNN]=17.2 GeV

    Get PDF
    Electric charge correlations were studied for p+p, C+C, Si+Si, and centrality selected Pb+Pb collisions at sqrt[sNN]=17.2 GeV with the NA49 large acceptance detector at the CERN SPS. In particular, long-range pseudorapidity correlations of oppositely charged particles were measured using the balance function method. The width of the balance function decreases with increasing system size and centrality of the reactions. This decrease could be related to an increasing delay of hadronization in central Pb+Pb collisions
    corecore