10 Pages

bls

Course: MAW 962, Fall 2009
School: North-West Uni.
Rating:
 
 
 
 
 

Word Count: 2918

Document Preview

Confusability: Consonant An MEG Study VALENTINE HACQUARD & MARY ANN WALTER Massachusetts Institute of Technology 0. Introduction Numerous behavioral experiments have investigated consonant confusability by evaluating error rates in identification of phonemes masked with noise. These studies have found that the pair of nasals, /m/ and /n/, is more confusable than the corresponding oral pair /b/ and /d/...

Register Now

Unformatted Document Excerpt

Coursehero >> Indiana >> North-West Uni. >> MAW 962

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Confusability: Consonant An MEG Study VALENTINE HACQUARD & MARY ANN WALTER Massachusetts Institute of Technology 0. Introduction Numerous behavioral experiments have investigated consonant confusability by evaluating error rates in identification of phonemes masked with noise. These studies have found that the pair of nasals, /m/ and /n/, is more confusable than the corresponding oral pair /b/ and /d/ (Miller & Nicely 1955, Wang & Bilger 1973). The members of the two pairs differ in precisely the same way in terms of abstract phonological representations both involve a change from labial to coronal place of articulation. Thus the difference in confusability between the two pairs of consonants has been explained in acoustic terms. The nasal pair is acoustically more similar for at least two reasons. First, there is a perseveration or coarticulation effect of the nasal on the following vowel. Second, there is a reduction of acoustic distance (mainly with respect to the second formant) between nasalized vowel transitions compared to oral vowel transitions (Wright 1986). Due to this acoustic similarity, the nasal pair is more confusable and, we assume, perceived to be more similar. In this study, we examine subjects perception of similarity for the same group of contrasts /ma/ and /na/ versus /ba/ and /da/ but with a much finer-grained time-course and level of discrimination than a behavioral judgment. We use magnetoencephalography (MEG) brain-imaging to evaluate variation in two early auditorily-evoked neural components the M100 response and the mismatch field response (MMF). MEG records the magnetic field generated by electrical activity in the brain, and is able to provide a millisecond-by-millisecond picture of brain activity. Our goal is to shed light on the earliest available stage of perception with respect to the relative roles of abstract phonological features and acoustic similarity. If the latter proves relevant at this stage, then brain-imaging data can be used to test proposals for similarity metrics, and answer questions about the basic units of contrast and their relation to each other. We would like to thank Alec Marantz, Diana Sonnenreich, Donca Steriade, Karen Froud, Linnaea Stockall, and Pranav Anand. We are extremely indebted to Ken Stevens for help synthesizing the stimuli. Valentine Hacquard & Mary Ann Walter 1. Two models of similarity 1.1. An acoustic-based model Much current work in phonology motivates phonological processes by appealing to perceptual, acoustic factors. Similarity along acoustic dimensions has been argued to underlie phonological processes such as metathesis, assimilation, and phonotactic constraints. Hume (1998) argues that confusability considerations motivate metathesis processes, so that a segment is positioned in such a way as to maximally enhance its perceptual salience. Steriade (1999) proposes that distance along a perceptually-based similarity metric (the P-map) correlates with assimilation processes. In the context of the confusability studies reported above, the findings of Mohanan (1993) and Jun (1995) that nasals are relatively more susceptible to place assimilation than stops generally is unsurprising. These confusability and assimilation facts, as well as studies of offline similarity judgments (Hura et al. 1992), support a model of similarity based on acoustic, perceptual factors. Such a model is dependent on phonetic context, but independent of the phonological inventory. According to an acoustic-based model, nasal confusability is explained in perceptual terms: although nasality itself is highly salient, persevering nasality alters the F2 transition into the following vowel, which is an important cue for place of articulation. 1.2. A model based on natural classes (Frisch 1996) Frisch et al. (1997) and Frisch (1996) propose an alternative model of similarity, which differs from the acoustic-based model in that it is independent of phonetic context, but dependent on the phonological inventory and its structure. This similarity metric is computed according to natural classes, as illustrated in (1): (1) Similarity = shared natural classes shared + unshared natural classes The similarity measure in (1) computed for English consonants gives the values in (2), where the ranking of similarity contradicts that of the acoustic-based model: nasals are equally (if a .01 difference is insignificant) or less similar to each other than orals. (2) b/d (= .29) > m/n (= .28), where 1 is identity (maximal similarity). In our study, we will thus examine whether a difference in similarity, along any of the metrics discussed above, correlates with a difference in an auditory brain response. If it does, then brain data can be used to substantiate proposals for similarity metrics, such as the two proposed above, and better understand their internal organization. Consonant Confusability: An MEG Study 2. Magnetoencaphalography (MEG) MEG measures the magnetic fields generated by electrical activity in the brain, specifically by potentials in the apical dendrites of pyramidal cells in the cortex. The main component we look at here is the mismatch field response or MMF, an automatic, auditory brain response evoked by a deviant stimulus following a sequence of standards, peaking ~180-250 ms after the difference point between a standard and a deviant. We also look at the M100, an automatic auditorily-evoked response that peaks ~100 ms post-stimulus onset. Figure 1 Magnetic field distributions of the M100 and MMF in response to speech stimuli for one representative subject. The letter P indicates the positive field (emerging from the brain) and the letter N the negative field (entering the brain). Previous MEG studies have identified several properties of the MMF. Sharma & Dorman (1999) and Phillips et al. (2000) show that the same VOT span crossing a phonemic category boundary evokes a far greater MMF than one that doesnt. Ntnen et al. (1997) show that a small acoustic difference crossing a phonemic category boundary evokes a far greater MMF than a large one that does not cross such a boundary. It appears, then, that phonological difference outweighs acoustic difference for the MMF response. However, we would like to know whether similarity distinctions matter when category is kept constant. In our experiment, both the oral pair and the nasal pair involve crossing a phonological category (i.e., place of articulation from labial to coronal and vice-versa). If the gap within one pair differs from the gap of the other pair, then some other factor plays a role. We hypothesize that the factor is perceptual similarity. Valentine Hacquard & Mary Ann Walter 3. Materials and methods 3.1. Participants Seventeen subjects, all students and employees at MIT, all of whom gave informed consent, participated in the experiment. The sample included 9 males and 8 females. All subjects were right-handed and had no history of hearing or neurological disorders. Eleven were native speakers of English. Six were native speakers of languages which also have the relevant contrasts (Czech (2), Spanish, Brazilian Portuguese, Russian, and Persian). They were also fluent in English. One subject was later excluded due to technical problems that arose during the experiment. 3.2. Stimuli Stimuli for the present experiment consisted of four CV syllables /ba/, /da/, /ma/, /na/. The syllables were synthesized using the program KLSyn. The stimuli were correctly identified and discriminated by speakers of languages with the relevant contrasts, thus ensuring that they were good exemplars. 3.3. Procedure Subjects lay supine in a magnetically shielded room while stimuli were presented binaurally over earphones. Evoked magnetic fields were recorded using the MIT/KIT whole-head biomagnetometer array, with 93 axial gradiometers. Before beginning the experiment, subjects listened to a 1kHz tone presented 100 times, for the purpose of identifying and localizing the M100, and helping to select RMS sensors for the analysis (see below). We used a mismatch detection task (oddball paradigm) where a series of four identical precursor stimuli, separated by inter-stimulus intervals of 400 ms, was presented followed by a fifth stimulus, either identical to the previous four (control condition or standard), or different from it with respect to place of articulation of the initial consonant only (deviant condition). The stimuli were arranged into the eight conditions illustrated in Figure 2. The subjects heard each condition 30 times, in random order. Trial presentation was randomized by Psyscope script. Subjects were instructed to press one button when the fifth item of each set was the same as the previous ones, and a second button if it was different. The trials were divided into six blocks of forty trials. Between blocks, the subject was given a break of selfdetermined duration. Data were sampled at 1000 Hz, with acquisition between 1 and 200 Hz. The recording for each participant lasted approximately 25 minutes. The raw data was then subjected to a noise reduction routine to eliminate measured magnetic activity from external sources. Responses to stimuli were averaged by stimulus condition separately, in 700 ms windows keyed to the onset of the stimulus: 100 ms pre-, 600 ms post onset. The averaged signal was subjected to a low-pass filter below 30 Hz and adjusted to baseline using a 100 ms pre-stimulus interval. Consonant Confusability: An MEG Study Figure 2 Conditions (8x30=240 trials) 3.4. Data analysis Both button-press responses and reaction times were recorded. Reaction times were calculated from the onset of the fifth stimulus. Incorrect trials and RTs deviating over 2.5 SD from the mean for particular that participant were excluded from the behavioral analysis. In the analysis of the MEG data, averaged signals were first visually inspected to identify dipolar field distributions that appeared consistently across experimental conditions and across participants. Such distributions were identified in two time windows: the M100 window (150-170 ms) and the MMF window (225-275 ms). As shown in Figure 1, the MMF, being evoked by speech stimuli, was strongly left-lateralized (an MMF response to non-speech stimuli is more evenly distributed across both hemispheres). The amplitudes and latencies of these components were recorded by calculating the root mean square (RMS) field strength from the sensors that covered the field pattern of the MMF/M100 in the left hemisphere. The sensors used for the RMS analysis were selected for each subject by creating a grand average of all 8 conditions and choosing those sensors that showed the clearest dipolar distribution and held constant across conditions within a subject. The number of sensors used varied between 4 and 6. We then compared the RMSs of the selected sensors for the response to the two oral deviant conditions to those of the corresponding standards (e.g., the da response following a series of ba to the da response following a series of da), and likewise for the nasal conditions. 4. Results 4.1. Behavioral responses Analyses of variance (ANOVA) [(Condition1) X (Manner2)] were performed for reaction times and accuracy. Deviants overall received significantly more errors 1 2 Standard or deviant Oral vs. nasal Valentine Hacquard & Mary Ann Walter than standards (p=.0009) (Figure 3). No effect for manner was observed (p=.3538). Therefore, the results of previous behavioral studies, that nasals are more confusable than orals, were not replicated. There are several reasons why this might have been the case. First of all, the stimuli were synthesized so as to be clear and unambiguous tokens of the target syllables, to maximize the desired brain responses. No filtering was done, nor anything else to adversely affect the signal-to-noise ratio, as is typically done in behavioral confusability studies. Therefore, it is unsurprising for error rates to be unrevealing. Second, the relatively small number of trials (30 per condition) may have been a factor. Figure 3 Error rates. Y-axis: number of errors. Reaction time to deviants overall was significantly faster than to standards (p<0001). Reaction time to nasals was significantly faster than to orals (p=.0197) (Figure 4). No [(Condition) X (Manner)] effect was found. Some subjects reported that they took longer to respond to same trials because they were unsure whether or not the stimulus set was complete, which could obscure reaction time patterns. Figure 4 Reaction times. Y-axis: time, in ms. Consonant Confusability: An MEG Study 4.2. Electrophysiological results 4.2.1. M100 response This response proved very difficult to locate when looking at individual subject responses. An ANOVA [(Condition) X (Manner)] was performed for amplitude and latency. No effect was found for [(Condition) X (Manner)] for either latency or amplitude, but there was a main effect for manner: overall, nasals have significantly greater amplitude than orals in the M100 time window (p<.0001). 4.2.2. MMF response An ANOVA [(Condition) X (Manner)] was performed for amplitude and latency. No effect for latency was found. We found a main effect for amplitude for condition: deviants overall have significantly greater amplitude in the MMF time window than standards (p<.0001), as expected. An effect for manner was also found: orals overall have a significantly greater amplitude in the MMF window than nasals (p<.0001) (Figure 5). Finally, the ANOVA yielded an effect for [(Condition) X (Manner)]: as illustrated in Figure 6, the MMF/baseline gap was significantly greater for oral consonant pairs than for nasals (p=.0399). Figure 5 MMF: The following charts show a single subjects averaged response to oral deviants and standards in the top chart, and to nasal deviants and standards in the bottom chart. The MMF window (225 ms 275 ms) shows an MMF for both orals and nasals (Y-axis: magnetic field strength, in arbitrary units proportional to femtoTesla; X-axis: time, in ms). The bar graph on the right shows the differences in peak amplitude between standards and deviants for orals and nasals. Valentine Hacquard & Mary Ann Walter Figure 6 MMF comparison: The following chart shows a single subjects MMF waveline (subtraction of the deviant minus standard) for nasals (thick line) and for orals (thin line). The oral waveline is higher in the MMF time window (Y-axis: magnetic field strength, in arbitrary units proportional to femtoTesla; X-axis: time, in ms). The bar graph illustrates the same subjects MMF subtraction at peak amplitude in the MMF window for nasals and orals. 5. Discussion The predictions made by the different models of similarity discussed earlier were as follows: According to a perceptual similarity framework, the MMF-baseline gap (i.e., deviant minus standard) should be larger for oral consonant pairs than for nasals. According to a natural-class-based one such as the one presented in Frisch (1996), the gaps should be equivalent for oral and nasal pairs, or the nasal gap should be larger. If abstract phonological features were the only relevant factor in perceptibility at this stage, the gaps should be equivalent. We found that the oddball paradigm evoked a stronger MMF response for orals than nasals, and thus that orals are perceived as more different from one another than nasals at this stage, the earliest available. It appears then that phonological category is not the only relevant factor in perception at this stage: acoustic similarity also plays a role. Finally, it...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

SHSU - MATH - 143
Math 143 Spring, 2003 Exam 1 Chapters 4, 5, and 6 Part I - Denitions and Examples 1. (5 points) State the denition of an integrable function. Solution: A function f (x) is integrable on [a, b] if a f (x)dx exists, i.e. for any partition p of [a, b] let th
University of Rochester - PHYS - 107
Lecture 1 February 12, 2002Today: Thursday: Lab: 1 The Nature ofSound 1st 1 The Nature of Sound 2nd Lab 1: Problem Solving &amp; Oscilloscope HW1: 0Materials Pasco Function Generator Oscilloscope Pasco oscillator Speaker Base guitar string &amp; masses &amp; board
SUNY Oswego - CSC - 344
#include &lt;iostream&gt;#include &lt;string&gt;using namespace std;#include &quot;heap.h&quot;struct Datum cfw_ friend ostream&amp; operator&lt;(ostream&amp; os, Datum d) cfw_ return cout &lt; d.val; int val; Datum(void) : val(0) cfw_ Datum(int v) : val(v) cfw_ Datum(const Datum
Alaska Anch - CS - 351
Sample Midterm Exam CS351 100 Points TotalName: _Please write neatly and show your work. The exam is open book, open notes, and you may use any computing devices. You have one hour and 15 minutes. Good luck! 1. Short Answer (12 pts). Provide brief 1-3 s
Seton Hall - CSAS - 3211
CSAS 3211 Practice1. What do the following terms mean: a. IP number: A unique identifier for computer on the internet. Consists of 4 numbers, each between 0 and 255 b. DHCP: An &quot;IP number&quot; server that assigns dynamically IP numbers to hosts on a LAN c. D
Duke - CPS - 100
Test 2 Practice: CPS 100Owen Astrachan November 5, 2004Name: Login: Honor code acknowledgment (signature)Problem 1 Problem 2 Problem 3 Problem 4 TOTAL:value 20 pts. 30 pts. 20 pts. 20 pts. 90 pts.gradeThis test has 14 pages, be sure your test has th
Duke - CPS - 006
What does this position entail?Do you want to build quantitative models millions of people will use, based on data from the world's largest online laboratory? Are you passionate about formulating relevant questions and producing solutions to initially il
Duke - CPS - 006
Recursion and Recursive StructuresDefinition in the dictionary: in mathematics an expression in which a value is calculated by using preceding terms of the expression Pretty worthless, doesnt convey details or power Consider folders and files in a comput
Duke - CPS - 006
What is an IStrand?Why are IStrand objects used instead of Strings? Strings don't have names Strings restrict us to specific methods, or we have to write methods and pass strings to them IStrand objects allow the methods to be in the class, this is part
Duke - CPS - 006
Genome Revolution: COMPSCI 006G14.1From practice to theory and back againIn theory there is no difference between theory and practice, but not in practice How do we search an array or an ArrayList for a value? I'm thinking of a number from 1 to 100 Wh
Duke - CPS - 006
What is Information? http:/dictionary.com1. 2. 3. 4.5. 6. 7.Knowledge derived from study, experience, or instruction. Knowledge of specific events or situations that has been gathered or received by communication; intelligence or news. A collection of
Duke - CPS - 006
Interfaces: improving ShotgunWe don't want to use a String to represent a DNA strand/sequence Probably not efficient for merging two strands Strands can't have annotations: names, features,. Doesn't mirror what's done in BioJava library We want to use a
Duke - CPS - 006
From Interfaces to IteratorsWe want to look at all the elements in an ArrayList We want to look at all the genomic sequences in a FASTA file We want to read all the words in a file We want to read all the lines in a file We want to iterate over a collect
Duke - CPS - 006
What is the Object Concept?Ask not what you can do to an object, ask what an object can do to itself Object has internal state, data Operations on the object affect the internal state Can expose state to client programs Can change state in some waysAn
Duke - CPS - 006
Refactoring, what, when,how?Programs are hard to get right the first time Similar to an essay paper? Rewrite? Code isn't fast enough, but it works Code isn't general enough, but it solves the problem Code passes initial tests, then becomes problematic R
Duke - CPS - 006
FOCUS COMPSCI 006G Genome RevolutionOwen Astrachan http:/www.cs.duke.edu/courses/cps006g/fall04 http:/www.cs.duke.edu/~olaGenome Revolution: COMPSCI 006G1.1Where are we going?What is computer science? What is biology? What is computational biology? W
Duke - CPS - 006
How to design/write programsStart with a small, working program Don't write 10's, 100's, 1000's of lines before compiling Compile, test, implement, repeat Add features to an already working program A program designed to do nothing is a known entity No re
Duke - CPS - 130
Meeting 26December 1, 2004Approximation Algorithms(read Section 35 on Approximation Algorithms in C ORMEN , L EISERSON , R IVEST, S TEIN)98 UQT q8eddD( q 55 63 4(1 Vertex Cover. The rst problem we consider is nding the minimum set of vertices in
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Helvetica Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radi
Duke - CPS - 130
Meeting 25November 29, 2004NP-Complete Problems(read Section 34 on NP-Completeness in C ORMEN , L EISERSON , R IVEST, S TEIN)Step 2. Convert each clause into disjunctive normal form. The most mechanical way uses the truth table for each clause, as ill
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Helvetica Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radi
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Helvetica Times-Bold Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.c
Duke - CPS - 130
Meeting 24November 22, 2004Easy and Hard Problems(read Section 34 on NP-Completeness in C ORMEN , L EISERSON , R IVEST, S TEIN)P92 B5 1 i`@47dX h$#8g7 X `V7A2X 7 B5 1 B 5 1 8 fe@47dX cb7 #Ua`YX B5 1 W2VA7 7 R $#UTSQAs an example consider the shorte
Duke - CPS - 130
Meeting 23November 17, 2004Pattern MatchingThis material is not covered in our textbook but you can read about pattern matching in Chapter I.3 of Algorithms on Strings, Trees, and Sequences by G USFIELD.the sequence starts with a non-empty sequence of
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 23November 15, 2004Searching with StringsThis material is not covered in our textbook but you can read about keyword trees and sufx trees in Chapters I and II of Algorithms on Strings, Trees, and Sequences by G USFIELD.o1p1t a2 3 1 1 2t
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 21November 10, 2004String Matching(read Section 32 on String Matching in C ORMEN , L EISERSON , R IVEST, S TEIN)HOCUSPOCUSABRA BRACADABRA. ABRA ABR AB A CADABRA ACADABRA RACADABRA BRACADABRAThe straightforward approach to solving this problem
Duke - CPS - 130
Meeting 20November 8, 2004Union-Find(read Section 21 on Data Structures for Disjoint Sets in C ORMEN , L EISERSON , R IVEST, S TEIN)This section presents two data structures for the disjoint set system problem we encountered in the implementation of K
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Times-Bold Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 19November 3, 2004Minimum Spanning Trees(read Sections 23 on Minimum Spanning Trees in C ORMEN , L EISERSON , R IVEST, S TEIN)aepdg hi; while is not a spanning tree do find a safe edge ; endwhile. There are safe edges as long as is a p
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 18November 1, 2004Shortest Paths(read Sections 24 and 25 on Shortest Paths in C ORMEN , L EISERSON , R IVEST, S TEIN)One of the most common operations in graphs is nding shortest paths between vertices. This section discusses three algorithms:
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 17October 27, 2004Graph Search(read Section 22 on Elementary Graph Algorithms in C ORMEN , L EISERSON , R IVEST, S TEIN)2 1 0 )( ' % &quot; &amp;$#! which is symmetric. Often the number of edges is quite3 40 1 2 3 4VFigure 83: A sample graph with
Duke - CPS - 130
Meeting 16October 25, 2004Splay Trees, IIThis material is not covered in our textbook. You can read about splay trees in Section 7.3 of Data Structures and Their Algorithms by L EWIS , D ENENBERG and about optimum weighted binary search trees in Sectio
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 15October 20, 2004Splay Trees, IThis material is not covered in our textbook but you can read about splay trees in Section 7.3 of Data Structures and Their Algorithms by L EWIS , D ENENBERG.Node Z IG Z IG Node return Z IG Z IG . 4 3 2 1 1 2
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 14October 18, 2004Fibonacci Heaps, II(read Section 20 on Fibonacci Heaps in C ORMEN , L EISERSON , R IVEST, S TEIN)We still need to discuss the D ECREASE K EY and the D ELETE operations for Fibonacci heaps. Both change the structure of the hea
Duke - CPS - 130
Meeting 13October 13, 2004Fibonacci Heaps, I(read Section 19 on Binomial Heaps and Section 20 on Fibonacci Heaps in C ORMEN , L EISERSON , R IVEST, S TEIN)4 9 10 11 87 95 94 10 11 8 15+15=12 15 13 9Figure 63: Binomial trees of heights 0, 1, 2,
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Midterm ExamOctober 4, 2004Midterm(75 minutes open book exam)(b) There are 14 different parenthesizations, and they are 23723('&amp;$2&amp;$&quot; ) #) # #&quot; #&quot; # 21343('1&amp;'&amp;$&quot; ) #) # #&quot; #&quot; # 213('635$1%$&quot; ) # #&quot; ) # #&quot; # 2110($&amp;'&amp;$%$&quot; ) # #&quot; #&quot; #&quot; #endwhile; unt
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 12October 4, 2004Amortized Analysis(read Section 18 on Amortized Analysis in C ORMEN , L EISERSON , R IVEST, S TEIN)Amortization is an analysis technique that can inuence the design of algorithms in a profound way. Later, we will see a few dat
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier Times-Italic %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 11September 29, 2004Solving Recurrence Relations(read Section 4 on Recurrences in C ORMEN , L EISERSON , R IVEST, S TEIN)Recurrence relations are perhaps the most important tool in the analysis of algorithms. We have encountered several method
Duke - CPS - 130
Meeting 10September 27, 2004Greedy Algorithms(read Section 16 on Greedy Algorithms in C ORMEN , L EISERSON , R IVEST, S TEIN)A scheduling problem. Consider a set of activities, . Activity has start time and nish time . Two activities and overlap if .
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 9September 22, 2004Dynamic Programming(read Section 15 on Dynamic Programming in C ORMEN , L EISERSON , R IVEST, S TEIN)Figure 41: The rst parenthesization takes elementary multiplications. second takes34t xw0 0s ivh0Although the resulting
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Courier %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSComma
Duke - CPS - 130
Meeting 8September 20, 2004Hash Tables(read Section 11 on Hash Tables in C ORMEN , L EISERSON , R IVEST, S TEIN).0T0.x x.m 1Figure 38: Each table element is a pointer to a linked list.Hashing. In hashing we store at a location , where is a fu
Duke - CPS - 130
Meeting 7September 18, 2004Skip ListsThis material is not covered in our textbook but you can read about skip-lists in Section 6.3 of Ordered Lists in Data Structures and Their Algorithms by L EWIS , D ENENBERG.In searching it is important that the da
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Times-Bold %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPS
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Bold Times-Italic Courier %EndComments %DVIPSWebPage: (www.radicaleye.com
Duke - CPS - 130
Meeting 6September 13, 2004Red-Black Trees(read Section 13 on Red-Black Trees in C ORMEN , L EISERSON , R IVEST, S TEIN)Binary search trees are an elegant implementation of the dictionary data type, which requires support for item S EARCH (item), void
Duke - CPS - 130
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: Book.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: Times-Roman Times-Italic Courier Times-Bold %EndComments %DVIPSWebPage: (www.radicaleye.com