DOCSLIB.ORG

Neural Oscillatory Dynamics of Spoken Word Recognition

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Neural Oscillatory Dynamics of Spoken Word Recognition Antje Strauß: Neural oscillatory dynamics of spoken word recognition. Leipzig: Max Planck Institute for Human Cognitive and Brain Sciences, 2015 (MPI Series in Human Cognitive and Brain Sciences; 163) Neural oscillatory dynamics of spoken word recognition Impressum Max Planck Institute for Human Cognitive and Brain Sciences, 2015 Diese Arbeit ist unter folgender Creative Commons-Lizenz lizenziert: http://creativecommons.org/licenses/by-nc/3.0 Druck: Sächsisches Druck- und Verlagshaus Direct World, Dresden Titelbild: ©Antje Strauß, 2015 ISBN 978-3-941504-47-9 Neural oscillatory dynamics of spoken word recognition Der Fakult¨atf¨ur Biowissenschaften, Pharmazie und Psychologie der Universit¨atLeipzig eingereichte Dissertation zur Erlangung des akademischen Grades doctor rerum naturalium Dr. rer. nat. vorgelegt von Magistra Artium, Antje Strauß geboren am 08. Juni 1985 in Blankenburg / Harz Leipzig, den 01. Oktober 2014 Bibliographic details Antje Strauß Neural oscillatory dynamics of spoken word recognition Fakult¨atf¨ur Biowissenschaften, Pharmazie und Psychologie Universit¨atLeipzig Dissertation 163 pages, 359 references, 22 figures This thesis investigated slow oscillatory signatures of spoken word recognition. In par- ticular, we aimed to dissociate alpha ( 10 Hz) and theta ( 4 Hz) band oscillations to ⇠ ⇠ understand the underlying neural mechanisms of lexico-semantic processing. Three exper- iments were conducted while recording the electroencephalogram (EEG): i) an auditory lexical decision task in quiet, ii) an auditory lexical decision task in white noise, and iii) an intelligibility rating of cloze probability sentences in di↵erent level of noise-vocoding (spectrally degraded speech). The results show that alpha oscillations play a role during spoken word recognition in three possible ways: First, induced alpha power scaled with lexicality, that is, with the difficulty to map the phonological representation onto meaning. Post-lexical alpha power was suppressed for words indicating processing of lexico-semantic information. In turn, alpha power was enhanced for pseudowords indicating the inhibition of lexico-semantic processing. Second, induced alpha power was found to be enhanced at the beginning of words embedded in noise compared to clear speech in line with the presumed inhibitory function of alpha. We propose a framework to further assess the role of alpha in selectively inhibiting task-irrelevant auditory objects. Third, pre-stimulus alpha phase was found to modulate lexical decision accuracy in noise. We interpreted this finding to reflect selective inhibition in the sense that stimuli coinciding with the excita- tory phase were more likely to be thoroughly processed than when coinciding with the inhibitory phase and were thus ultimately judged correctly. Furthermore, we were able to associate theta oscillations with lexico-semantic processing. First, induced theta power was found to be post-lexically enhanced selectively for ambiguous pseudowords that di↵ered only in one vowel from their real-word neighbours. We interpreted this finding in terms of ambiguity resolution of the response conflict induced by their proximity to real words. We suggest that phonemic information needed to be “replayed” in order to re-compare it with long-term memory representations and thus to resolve ambiguity. Second, in high cloze probability sentences theta power was found to be enhanced just before the onset of the sentence-final word, thus indicating the anticipatory activation of lexico-semantics in long-term memory. The results provide novel evidence on the temporal mechanisms in spoken word recognition. These findings are discussed with regard to their implications of the nonlinearity of speech processing and the reassessment of event-related potentials. Acknowledgements First of all, I am much obliged to my supervisor Jonas Obleser who converted me to a natural scientist. I owe him most of my knowledge about signal processing, data analysis and the art of typography. He founded the incredible ”Auditory Cognition” group with inspiring and challenging methodological discussions that became almost a family. Mathias Scharinger sitting to my left and Molly Henry sitting to my right became my scientific foster parents. I would like to thank them for discussing crazy brain measures, playing word games, listening to Bach and Metal simultaneously and their moral support throughout the time. I would like to thank Malte W¨ostmann, Anna Wilsch, Bj¨orn Herrmann, Julia Erb, Alex Brandmeyer and Sung-Joo Lim for the constant critical exchange preferably with a cup of espresso or coke in their hand. I am grateful to Dunja Kunke and a crew of student assistants amongst which were Sergej Schwigon, David Stoppel, Christina Otto, Christoph Daube, Steven Kalinke and Leo Waschke who helped acquiring and preprocessing the data. They created a wonderful working environment. Furthermore, I would like to thank Sonja Kotz for her initializing ideas and encourage- ments at di↵erent stages of the PhD period. I appreciated a lot the discussions with Hellmuth Obrig about the implications of my results for aphasic patients. Finally, I thank J¨org Jescheniak for accepting and assessing my work. This work is dedicated to my loving grandfathers Wolfgang Witt and Otto Strauß. It was not granted to both of them to be there to experience the completion of the dissertation with me. Contents 1 General Introduction 1 1.1 Spoken word recognition and its cognitive e↵orts . 2 1.1.1 Psycholinguistic models of spoken word recognition . 2 1.1.2 Recognition of spoken word in noise . 3 1.2 Spoken word recognition and its neural basis . 4 1.2.1 Alpha oscillations and attention . 7 1.2.2 Theta oscillations and semantic memory . 8 1.3 General Hypotheses . 9 2 General Methods 11 2.1 The auditory lexical decision task . 11 2.2 Adaptive tracking procedures . 15 2.3 Electroencephalography . 16 2.3.1 The neurophysiological basis of EEG . 17 2.3.2 Preprocessing and artefact rejection . 17 2.3.3 Event-related potentials . 18 2.3.4 Time–frequency analysis . 18 2.3.5 Source localization . 20 3 Alpha and theta power dissociate in spoken word recognition 23 3.1 Introduction.................................... 23 3.2 Methods...................................... 25 3.2.1 Participants . 25 3.2.2 Stimuli .................................. 25 3.2.3 Experimental procedure . 26 3.2.4 Electroencephalogram acquisition . 27 3.2.5 Data analysis: event-related potentials . 28 3.2.6 Data analysis: time–frequency representations . 28 3.2.7 Source localisation of time–frequency e↵ects . 29 3.3 Results . 30 i ii CONTENTS 3.3.1 Highly accurate performance . 30 3.3.2 Sequential e↵ects of word-pseudoword discrimination in ERPs . 30 3.3.3 Di↵erential signatures of wordness in time–frequency data . 31 3.3.4 Source localization of alpha and theta power changes . 31 3.3.5 Two separate networks disclosed by an alpha–theta index. 33 3.4 Discussion . 34 3.4.1 Wordness e↵ect in the alpha band . 34 3.4.2 Ambiguity e↵ect in the theta band . 35 3.4.3 Relationship of evoked potentials and induced oscillations . 37 3.4.4 Conclusion . 37 4 Alpha oscillations as a tool for auditory selective inhibition 39 4.1 Introduction.................................... 39 4.2 A framework to test auditory alpha inhibition . 39 4.3 A short review of auditory alpha inhibition . 41 4.4 Conclusion . 43 5 Alpha phase determines successful lexical decision in noise 45 5.1 Introduction.................................... 45 5.2 Methods...................................... 46 5.2.1 Participants . 46 5.2.2 Stimuli .................................. 46 5.2.3 Experimental procedure . 47 5.2.4 Data acquisition and preprocessing . 47 5.2.5 Data analysis: the phase bifurcation index . 48 5.3 Results . 50 5.3.1 Accuracy of lexical decisions. 50 5.3.2 Alpha phase predicts lexical-decision accuracy . 50 5.3.3 Accuracy is not predicted by other measures . 51 5.3.4 Phase e↵ects in the theta band. 52 5.4 Discussion . 53 5.4.1 Fluctuations in the probability of attentional selection . 53 5.4.2 Alpha phase reflects decision weighting . 54 5.4.3 Accuracy is not predicted by other measures . 55 5.4.4 Theta vs alpha phase e↵ects on lexical decision . 56 5.4.5 Conclusion . 56 5.5 Supplement Behaviour . 57 5.5.1 Introduction . 57 5.5.2 Methods.................................. 57 5.5.3 Results . 58 CONTENTS iii 5.5.4 Discussion . 60 5.6 Supplement Bifurcation Index . 63 5.6.1 Introduction . 63 5.6.2 Methods and Results . 63 5.6.3 Discussion . 66 6 Narrowed expectancies in degraded speech 67 6.1 Introduction.................................... 67 6.1.1 Semantic context . 68 6.1.2 Neural signatures of context in language comprehension . 68 6.1.3 Semantic benefits in adverse listening . 69 6.2 Methods...................................... 71 6.2.1 Participants . 71 6.2.2 Stimuli and design . 71 6.2.3 Pilot study . 73 6.2.4 Electroencephalogram acquisition . 74 6.2.5 Data analysis . 75 6.3 Results . 76 6.3.1 Intelligibility rating and reaction time . 76 6.3.2 Event related potentials to sentence onset: N100–P200 . 77 6.3.3 Event related potentials to sentence-final word: N400 . 77 6.4 Discussion . 79 6.4.1 N400 and behavioural responses: fast vs. delayed processes . 81 6.4.2 Prediction capacities and other cognitive resources . 83 6.4.3 Conclusion . 85 6.5 Supplement Theta power and phase . 86 6.5.1 Introduction . 86 6.5.2 Methods.................................. 86 6.5.3 Results . 86 6.5.4 Discussion . 88 7 General Discussion 91 7.1 Summary of experimental findings . 91 7.2 The dissociation of alpha and theta activity . 93 7.3 Spoken word recognition as a nonlinear process . 94 7.4 N400 and inter-trial phase coherence . 95 7.5 Alpha activity along the auditory pathway . 97 7.6 Theta oscillations and speech processing . 98 References 101 iv CONTENTS List of Figures 125 List of words and pseudowords 127 List of cloze probability sentences 131 Summary 137 Zusammenfassung 143 Was das Geh¨or betre↵e, so schreibe, und zwar nur auf das Oberfl¨achlichste, soll Konrad zum Baurat gesagt haben, sagt Wieser, entweder ein Arzt, was g¨anzlich falsch sei, oder ein Philosoph dar¨uber, was g¨anzlich falsch sei.
Load more

Recommended publications
  • The Bulletin of the American Society of Papyrologists 44 (2007)
    THE BULLETIN OF THE AMERICAN SOCIETY OF PapYROLOGIsts Volume 44 2007 ISSN 0003-1186 The current editorial address for the Bulletin of the American Society of Papyrologists is: Peter van Minnen Department of Classics University of Cincinnati 410 Blegen Library Cincinnati, OH 45221-0226 USA [email protected] The editors invite submissions not only fromN orth-American and other members of the Society but also from non-members throughout the world; contributions may be written in English, French, German, or Italian. Manu- scripts submitted for publication should be sent to the editor at the address above. Submissions can be sent as an e-mail attachment (.doc and .pdf) with little or no formatting. A double-spaced paper version should also be sent to make sure “we see what you see.” We also ask contributors to provide a brief abstract of their article for inclusion in L’ Année philologique, and to secure permission for any illustration they submit for publication. The editors ask contributors to observe the following guidelines: • Abbreviations for editions of papyri, ostraca, and tablets should follow the Checklist of Editions of Greek, Latin, Demotic and Coptic Papyri, Ostraca and Tablets (http://scriptorium.lib.duke.edu/papyrus/texts/clist.html). The volume number of the edition should be included in Arabic numerals: e.g., P.Oxy. 41.2943.1-3; 2968.5; P.Lond. 2.293.9-10 (p.187). • Other abbreviations should follow those of the American Journal of Ar- chaeology and the Transactions of the American Philological Association. • For ancient and Byzantine authors, contributors should consult the third edition of the Oxford Classical Dictionary, xxix-liv, and A Patristic Greek Lexi- con, xi-xiv.
    [Show full text]
  • Tcu-Smu Series
    FROG HISTORY 2008 TCU FOOTBALL TCU FOOTBALL THROUGH THE AGES 4General TCU is ready to embark upon its 112th year of Horned Frog football. Through all the years, with the ex cep tion of 1900, Purple ballclubs have com pet ed on an or ga nized basis. Even during the war years, as well as through the Great Depres sion, each fall Horned Frog football squads have done bat tle on the gridiron each fall. 4BEGINNINGS The newfangled game of foot ball, created in the East, made a quiet and un of­fcial ap pear ance on the TCU campus (AddRan College as it was then known and lo­ cat ed in Waco, Tex as, or nearby Thorp Spring) in the fall of 1896. It was then that sev er al of the col lege’s more ro bust stu dents, along with the en thu si as tic sup port of a cou ple of young “profs,” Addison Clark, Jr., and A.C. Easley, band ed to gether to form a team. Three games were ac tu al ly played that season ... all af ter Thanks giv ing. The first con test was an 8­6 vic to ry over Toby’s Busi ness College of Waco and the other two games were with the Houston Heavy weights, a town team. By 1897 the new sport had progressed and AddRan enlisted its first coach, Joe J. Field, to direct the team. Field’s ballclub won three games that autumn, including a first victory over Texas A&M. The only loss was to the Univer si ty of Tex as, 18­10.
    [Show full text]
  • Download Booklet
    preMieRe Recording jonathan dove SiReNSONG CHAN 10472 siren ensemble henk guittart 81 CHAN 10472 Booklet.indd 80-81 7/4/08 09:12:19 CHAN 10472 Booklet.indd 2-3 7/4/08 09:11:49 Jonathan Dove (b. 199) Dylan Collard premiere recording SiReNSong An Opera in One Act Libretto by Nick Dear Based on the book by Gordon Honeycombe Commissioned by Almeida Opera with assistance from the London Arts Board First performed on 14 July 1994 at the Almeida Theatre Recorded live at the Grachtenfestival on 14 and 1 August 007 Davey Palmer .......................................... Brad Cooper tenor Jonathan Reed ....................................... Mattijs van de Woerd baritone Diana Reed ............................................. Amaryllis Dieltiens soprano Regulator ................................................. Mark Omvlee tenor Captain .................................................... Marijn Zwitserlood bass-baritone with Wireless Operator .................................... John Edward Serrano speaker Siren Ensemble Henk Guittart Jonathan Dove CHAN 10472 Booklet.indd 4-5 7/4/08 09:11:49 Siren Ensemble piccolo/flute Time Page Romana Goumare Scene 1 oboe 1 Davey: ‘Dear Diana, dear Diana, my name is Davey Palmer’ – 4:32 48 Christopher Bouwman Davey 2 Diana: ‘Davey… Davey…’ – :1 48 clarinet/bass clarinet Diana, Davey Michael Hesselink 3 Diana: ‘You mention you’re a sailor’ – 1:1 49 horn Diana, Davey Okke Westdorp Scene 2 violin 4 Diana: ‘i like chocolate, i like shopping’ – :52 49 Sanne Hunfeld Diana, Davey cello Scene 3 Pepijn Meeuws 5
    [Show full text]
  • A Survey of Monte Carlo Tree Search Methods
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL. 4, NO. 1, MARCH 2012 1 A Survey of Monte Carlo Tree Search Methods Cameron Browne, Member, IEEE, Edward Powley, Member, IEEE, Daniel Whitehouse, Member, IEEE, Simon Lucas, Senior Member, IEEE, Peter I. Cowling, Member, IEEE, Philipp Rohlfshagen, Stephen Tavener, Diego Perez, Spyridon Samothrakis and Simon Colton Abstract—Monte Carlo Tree Search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm’s derivation, impart some structure on the many variations and enhancements that have been proposed, and summarise the results from the key game and non-game domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work. Index Terms—Monte Carlo Tree Search (MCTS), Upper Confidence Bounds (UCB), Upper Confidence Bounds for Trees (UCT), Bandit-based methods, Artificial Intelligence (AI), Game search, Computer Go. F 1 INTRODUCTION ONTE Carlo Tree Search (MCTS) is a method for M finding optimal decisions in a given domain by taking random samples in the decision space and build- ing a search tree according to the results. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be represented as trees of sequential decisions, particularly games and planning problems.
    [Show full text]
  • Racing Flow-TM FLOW + BIAS REPORT: 2009
    Racing Flow-TM FLOW + BIAS REPORT: 2009 CIRCUIT=1-NYRA date=12/31/09 track=Dot race surface dist winner BL12 BIAS RACEFLOW 1 DIRT 5.50 Hollywood Hills 0.0 -19 13 2 DIRT 6.00 Successful friend 5.0 -19 -19 3 DIRT 6.00 Brilliant Son 5.2 -19 47 4 DIRT 6.00 Raynick's Jet 10.6 -19 -61 5 DIRT 6.00 Yes It's the Truth 2.7 -19 65 6 DIRT 8.00 Keep Thinking 0.0 -19 -112 7 DIRT 8.32 Storm's Majesty 4.0 -19 6 8 DIRT 13.00 Tiger's Rock 9.4 -19 6 9 DIRT 8.50 Mel's Gold 2.5 -19 69 CIRCUIT=1-NYRA date=12/30/09 track=Dot race surface dist winner BL12 BIAS RACEFLOW 1 DIRT 8.00 Spring Elusion 4.4 71 -68 2 DIRT 8.32 Sharp Instinct 0.0 71 -74 3 DIRT 6.00 O'Sotopretty 4.0 71 -61 4 DIRT 6.00 Indy's Forum 4.7 71 -46 5 DIRT 6.00 Ten Carrot Nikki 0.0 71 -18 6 DIRT 8.00 Sawtooth Moutain 12.1 71 9 7 DIRT 6.00 Cleric 0.6 71 -73 8 DIRT 6.00 Mt. Glittermore 4.0 71 -119 9 DIRT 6.00 Of All Times 0.0 71 0 CIRCUIT=1-NYRA date=12/27/09 track=Dot race surface dist winner BL12 BIAS RACEFLOW 1 DIRT 8.50 Quip 4.5 -38 49 2 DIRT 6.00 E Z Passer 4.2 -38 255 3 DIRT 8.32 Dancing Daisy 7.9 -38 14 4 DIRT 6.00 Risky Rachel 0.0 -38 8 5 DIRT 6.00 Kaffiend 0.0 -38 150 6 DIRT 6.00 Capridge 6.2 -38 187 7 DIRT 8.50 Stargleam 14.5 -38 76 8 DIRT 8.50 Wishful Tomcat 0.0 -38 -203 9 DIRT 8.50 Midwatch 0.0 -38 -59 CIRCUIT=1-NYRA date=12/26/09 track=Dot race surface dist winner BL12 BIAS RACEFLOW 1 DIRT 6.00 Papaleo 7.0 108 129 2 DIRT 6.00 Overcommunication 1.0 108 -72 3 DIRT 6.00 Digger 0.0 108 -211 4 DIRT 6.00 Bryan Kicks 0.0 108 136 5 DIRT 6.00 We Get It 16.8 108 129 6 DIRT 6.00 Yawanna Trust 4.5 108 -21 7 DIRT 6.00 Smarty Karakorum 6.5 108 83 8 DIRT 8.32 Almighty Silver 18.7 108 133 9 DIRT 8.32 Offlee Cool 0.0 108 -60 CIRCUIT=1-NYRA date=12/13/09 track=Dot race surface dist winner BL12 BIAS RACEFLOW 1 DIRT 8.32 Crafty Bear 3.0 -158 -139 2 DIRT 6.00 Cheers Darling 0.5 -158 61 3 DIRT 6.00 Iberian Gate 3.0 -158 154 4 DIRT 6.00 Pewter 0.5 -158 8 5 DIRT 6.00 Wolfson 6.2 -158 86 6 DIRT 6.00 Mr.
    [Show full text]
  • \0-9\0 and X ... \0-9\0 Grad Nord ... \0-9\0013 ... \0-9\007 Car Chase ... \0-9\1 X 1 Kampf ... \0-9\1, 2, 3
    ... \0-9\0 and X ... \0-9\0 Grad Nord ... \0-9\0013 ... \0-9\007 Car Chase ... \0-9\1 x 1 Kampf ... \0-9\1, 2, 3 ... \0-9\1,000,000 ... \0-9\10 Pin ... \0-9\10... Knockout! ... \0-9\100 Meter Dash ... \0-9\100 Mile Race ... \0-9\100,000 Pyramid, The ... \0-9\1000 Miglia Volume I - 1927-1933 ... \0-9\1000 Miler ... \0-9\1000 Miler v2.0 ... \0-9\1000 Miles ... \0-9\10000 Meters ... \0-9\10-Pin Bowling ... \0-9\10th Frame_001 ... \0-9\10th Frame_002 ... \0-9\1-3-5-7 ... \0-9\14-15 Puzzle, The ... \0-9\15 Pietnastka ... \0-9\15 Solitaire ... \0-9\15-Puzzle, The ... \0-9\17 und 04 ... \0-9\17 und 4 ... \0-9\17+4_001 ... \0-9\17+4_002 ... \0-9\17+4_003 ... \0-9\17+4_004 ... \0-9\1789 ... \0-9\18 Uhren ... \0-9\180 ... \0-9\19 Part One - Boot Camp ... \0-9\1942_001 ... \0-9\1942_002 ... \0-9\1942_003 ... \0-9\1943 - One Year After ... \0-9\1943 - The Battle of Midway ... \0-9\1944 ... \0-9\1948 ... \0-9\1985 ... \0-9\1985 - The Day After ... \0-9\1991 World Cup Knockout, The ... \0-9\1994 - Ten Years After ... \0-9\1st Division Manager ... \0-9\2 Worms War ... \0-9\20 Tons ... \0-9\20.000 Meilen unter dem Meer ... \0-9\2001 ... \0-9\2010 ... \0-9\21 ... \0-9\2112 - The Battle for Planet Earth ... \0-9\221B Baker Street ... \0-9\23 Matches ..
    [Show full text]
  • Chief Herman's Holiday Fun Pack Book
    Chief Herman’s Holiday Fun Pack Instruction Booklet and Guide to Better Living Hello. I’m Chief Herman. I’ve spent my life traversing the globe in search of cheap entertainment. My vast collection of paraphernalia includes several rare and won- derful games, many of which were originally published as “free” by a tiny Seattle game company called Cheapass Games. I have, with the permission of the publisher, gathered more than two dozen of these extraordinary games into this inexpensive book- let for your enjoyment and, perhaps, the betterment of your life. Chief Robert Wadlow Herman (Ret.) 01 Nov. 2000 Contents: Dice and Coin Games Bogart ............................................................................................................................ 1 Crash .............................................................................................................................. 1 Flip ................................................................................................................................ 2 Dogfight ......................................................................................................................... 2 Pennywise ...................................................................................................................... 3 Road Trip ........................................................................................................................ 4 Card Games Spots .............................................................................................................................
    [Show full text]
  • Name of Game Date of Approval Comments Nevada Gaming Commission Approved Gambling Games Effective August 1, 2021
    NEVADA GAMING COMMISSION APPROVED GAMBLING GAMES EFFECTIVE AUGUST 1, 2021 NAME OF GAME DATE OF APPROVAL COMMENTS 1 – 2 PAI GOW POKER 11/27/2007 (V OF PAI GOW POKER) 1 BET THREAT TEXAS HOLD'EM 9/25/2014 NEW GAME 1 OFF TIE BACCARAT 10/9/2018 2 – 5 – 7 POKER 4/7/2009 (V OF 3 – 5 – 7 POKER) 2 CARD POKER 11/19/2015 NEW GAME 2 CARD POKER - VERSION 2 2/2/2016 2 FACE BLACKJACK 10/18/2012 NEW GAME 2 FISTED POKER 21 5/1/2009 (V OF BLACKJACK) 2 TIGERS SUPER BONUS TIE BET 4/10/2012 (V OF BACCARAT) 2 WAY WINNER 1/27/2011 NEW GAME 2 WAY WINNER - COMMUNITY BONUS 6/6/2011 21 + 3 CLASSIC 9/27/2000 21 + 3 CLASSIC - VERSION 2 8/1/2014 21 + 3 CLASSIC - VERSION 3 8/5/2014 21 + 3 CLASSIC - VERSION 4 1/15/2019 21 + 3 PROGRESSIVE 1/24/2018 21 + 3 PROGRESSIVE - VERSION 2 11/13/2020 21 + 3 XTREME 1/19/1999 (V OF BLACKJACK) 21 + 3 XTREME - (PAYTABLE C) 2/23/2001 21 + 3 XTREME - (PAYTABLES D, E) 4/14/2004 21 + 3 XTREME - VERSION 3 1/13/2012 21 + 3 XTREME - VERSION 4 2/9/2012 21 + 3 XTREME - VERSION 5 3/6/2012 21 MADNESS 9/19/1996 21 MADNESS SIDE BET 4/1/1998 (V OF 21 MADNESS) 21 MAGIC 9/12/2011 (V OF BLACKJACK) 21 PAYS MORE 7/3/2012 (V OF BLACKJACK) 21 STUD 8/21/1997 NEW GAME 21 SUPERBUCKS 9/20/1994 (V OF 21) 211 POKER 7/3/2008 (V OF POKER) 24-7 BLACKJACK 4/15/2004 2G'$ 12/11/2019 2ND CHANCE BLACKJACK 6/19/2008 NEW GAME 2ND CHANCE BLACKJACK – VERSION 2 9/24/2008 2ND CHANCE BLACKJACK – VERSION 3 4/8/2010 3 CARD 6/24/2021 NEW GAME NAME OF GAME DATE OF APPROVAL COMMENTS 3 CARD BLITZ 8/22/2019 NEW GAME 3 CARD HOLD’EM 11/21/2008 NEW GAME 3 CARD HOLD’EM - VERSION 2 1/9/2009
    [Show full text]
  • Adventuring with Books: a Booklist for Pre-K-Grade 6. the NCTE Booklist
    DOCUMENT RESUME ED 311 453 CS 212 097 AUTHOR Jett-Simpson, Mary, Ed. TITLE Adventuring with Books: A Booklist for Pre-K-Grade 6. Ninth Edition. The NCTE Booklist Series. INSTITUTION National Council of Teachers of English, Urbana, Ill. REPORT NO ISBN-0-8141-0078-3 PUB DATE 89 NOTE 570p.; Prepared by the Committee on the Elementary School Booklist of the National Council of Teachers of English. For earlier edition, see ED 264 588. AVAILABLE FROMNational Council of Teachers of English, 1111 Kenyon Rd., Urbana, IL 61801 (Stock No. 00783-3020; $12.95 member, $16.50 nonmember). PUB TYPE Books (010) -- Reference Materials - Bibliographies (131) EDRS PRICE MF02/PC23 Plus Postage. DESCRIPTORS Annotated Bibliographies; Art; Athletics; Biographies; *Books; *Childress Literature; Elementary Education; Fantasy; Fiction; Nonfiction; Poetry; Preschool Education; *Reading Materials; Recreational Reading; Sciences; Social Studies IDENTIFIERS Historical Fiction; *Trade Books ABSTRACT Intended to provide teachers with a list of recently published books recommended for children, this annotated booklist cites titles of children's trade books selected for their literary and artistic quality. The annotations in the booklist include a critical statement about each book as well as a brief description of the content, and--where appropriate--information about quality and composition of illustrations. Some 1,800 titles are included in this publication; they were selected from approximately 8,000 children's books published in the United States between 1985 and 1989 and are divided into the following categories: (1) books for babies and toddlers, (2) basic concept books, (3) wordless picture books, (4) language and reading, (5) poetry. (6) classics, (7) traditional literature, (8) fantasy,(9) science fiction, (10) contemporary realistic fiction, (11) historical fiction, (12) biography, (13) social studies, (14) science and mathematics, (15) fine arts, (16) crafts and hobbies, (17) sports and games, and (18) holidays.
    [Show full text]
  • Campus News Completely Covered by -Department. of Journalism Students
    <*mr .-••/ ~& CAMPUS NEWS COMPLETELY COVERED BY -DEPARTMENT. OF JOURNALISM STUDENTS WELCOME :i-' ) SMEAR ALUMNI S. M. U. Official Student Body Publication of Texas Christian University VOLUME 34 FORT WORTH, TEXAS, NOVEMBER 29, 1935; —*£ NUMKEK 11 TCU Horned Frog Memorial to Randolph Clark Coy Poe to Lead A dimming Used I Homecoming Activities Will Begin Popularity Revue Being Erected in Main Hall, T. C. tL ICU.Band I For All Purposes With Ex-Lettermen's Stag Banquet In Good Ole Days Set for Dec. 14 A memorial to the Rev. Randolph i who had had to leave school fed fight, At S. JL U. Game University Cafeteria Friday Night ; Clark to be placed on the bulletin ! the two young men, on returning from <■ Time and tide wait for no mail/ bo rd in the h of th the the WHll Be Held at 7:30l » *" e «uditoriumj *""■• «»>ceived '<*« of found- and time brings changes. T. C U. irig'a college. Hollywood Song "Writer, deception, Luncheon, T.C. U.-S..M. U. Football buildin,f vilh the Rev cl k would hardly, be recognizable for the ; p. M. in Basketball l ' " '» *■**■'' They established Add-Ran College Author Is Former same school that it was about twenty Game, Annual Homecoming Ball to Furnish on a blaTk velcvet background as the for the first time on a vacant lot in Gymnasium. years ago. • ; center is being made by Johnnie FortWorth in 1869rin 1872 the Clark President. Activities for Exes Saturday. Once the Administration Building) I Hughes. brothers moved thetr school to the Th DlCtatOr$ Will Play] « Pl<*"»-*ffl be encircled by a.
    [Show full text]
  • Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search Jack Reinhardt [email protected] University of Minnesota Minneapolis, Minnesota
    Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search Jack Reinhardt [email protected] University of Minnesota Minneapolis, Minnesota ABSTRACT separate imperfect information domains – hidden role and card Advances in intelligent game playing agents have led to successes in deck mechanics. The combination of hidden roles and randomness perfect information games like Go and imperfect information games of a card deck gives the game a more complex information model like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) than previously studied games like The Resistance or Werewolf. The family of algorithms outperforms previous algorithms using Monte added complexity provides a challenging test for available imperfect Carlo methods in imperfect information games. In this paper, Single information agents: opponents’ moves might be driven by ulterior Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) is motives stemming from their hidden role, or simply forced by the applied to Secret Hitler, a popular social deduction board game that random card deck. combines traditional hidden role mechanics with the randomness of There are many existing algorithms for imperfect information a card deck. This combination leads to a more complex information domains. Examples include Counterfactual Regret Minimization model than the hidden role and card deck mechanics alone. It is [13], Epistemic Belief Logic [6], and Information Set Monte Carlo shown in 10108 simulated games that SO-ISMCTS plays as well Tree Search [3, 4]. Due to its ability to handle large state spaces and as simpler rule based agents, and demonstrates the potential of produce results in a variable amount of computation time [3], Single ISMCTS algorithms in complicated information set domains.
    [Show full text]
  • Solitaire: Man Versus Machine
    Solitaire: Man Versus Machine Xiang Yan∗ Persi Diaconis∗ Paat Rusmevichientong† Benjamin Van Roy∗ ∗Stanford University {xyan,persi.diaconis,bvr}@stanford.edu †Cornell University [email protected] Abstract In this paper, we use the rollout method for policy improvement to an- alyze a version of Klondike solitaire. This version, sometimes called thoughtful solitaire, has all cards revealed to the player, but then follows the usual Klondike rules. A strategy that we establish, using iterated roll- outs, wins about twice as many games on average as an expert human player does. 1 Introduction Though proposed more than fifty years ago [1, 7], the effectiveness of the policy improve- ment algorithm remains a mystery. For discounted or average reward Markov decision problems with n states and two possible actions per state, the tightest known worst-case upper bound in terms of n on the number of iterations taken to find an optimal policy is O(2n/n) [9]. This is also the tightest known upper bound for deterministic Markov de- cision problems. It is surprising, however, that there are no known examples of Markov decision problems with two possible actions per state for which more than n + 2 iterations are required. A more intriguing fact is that even for problems with a large number of states – say, in the millions – an optimal policy is often delivered after only half a dozen or so iterations. In problems where n is enormous – say, a googol – this may appear to be a moot point because each iteration requires Ω(n) compute time. In particular, a policy is represented by a table with one action per state and each iteration improves the policy by updating each entry of this table.
    [Show full text]