Phonological priming between spoken words was examined using CVCVC bisyllabic pseudoword primes and word or pseudoword targets. The influence of different types of overlap was compared, prime and target sharing the coda, the rime or the final syllable. The task was target shadowing. Two priming conditions were used, the auditory targets being preceded by auditory primes in unimodal and by visua...

1. Introductjon 2 General consjderatjons on tjrne-scaling and pjtch-scaling 2.1. Asjrnplemodelforvojcedspeech 2 Tjrne-scalernodificatjon 3 Pjtchl r ifi tj 4 ossjble approaches to prosodic modificatjon 3. The short tjrne Fourjer transforrn and overlap-add synthesjs 3.1. naly js 2 Modifi tjo . 3 Sy th sjs 4. im -scalingtechniques 4 OLAt m -scaling 4.2. y chroniz dOLA rne-scaling 3 WSOLA: An overl...

which, again, we can solve using a Cauchy integral and (31). The problem of finding K± is more delicate. At first sight, we could take the logarithm of (33), giving logK+− logK− = logG. This looks similar to (31), but it usually happens that logG(t) is not continuous for all t ∈ C , which means that we cannot use (30). However, this difficulty can be overcome. The problem of finding K± such tha...

It is difficult to identify the spikes to different classifications especially when the neurons have many similar spike waveforms or lots of overlapped spikes. Our previous study proposed the window-slope representation (WSR), and it improved the classification accuracy of high similar spike waveforms. The classification accuracy of the method, however, will be affected by lots of overlapped sp...

Abstract Studying the effect of leading-edge parameters 30P30N on aerodynamic characteristic was carried out. Effect changing gap and overlap slat airfoil were mainly investigated. Numerical simulation applied to obtain characteristics, results show that: lift coefficient in linear segment basically does not change with gap, drag decreases gap. The have obvious lift-to-drag ratio. smaller betwe...

We present an algorithm to compute an approximate overlap of two convex polytopes P1 and P2 in R3 under rigid motion. Given any ε ∈ (0, 1/2], our algorithm runs in O(ε−3n log3.5 n) time with probability 1− n−O(1) and returns a (1− ε)-approximate maximum overlap, provided that the maximum overlap is at least λ ·max{|P1|, |P2|} for some given constant λ ∈ (0, 1]. 1998 ACM Subject Classification F...