In two experiments, while event-related potentials (ERPs) were recorded, participants named picture targets that were preceded by masked word primes that corresponded either to the name of the picture target or to an unrelated picture name. Experiment 1 showed significant priming effects in the ERP waveforms, free from articulator artifact, starting as early as 200 msec post target onset. Possi...

In four experiments, we investigated whether masked stimuli in priming experiments are subjected to early or to late selection. In Experiment 1, participants classified four target-pictures as being small or large. In line with early selection accounts, prime-pictures with a different perceptual appearance as the experienced targets did not elicit congruency effect. In Experiment 2, 40 targets ...

Our approach is based on a tri-partite method of integrating psychodynamic hypotheses, cognitive subliminal processes, and psychophysiological alpha power measures. We present ten social phobic subjects with three individually selected groups of words representing unconscious conflict, conscious symptom experience, and Osgood Semantic negative valence words used as a control word group. The unc...

Clinical observation (Cleckley, 1976) and experimental research (Hare, 1998) suggest psychopaths have difficulty processing the semantic aspects of stimuli, especially in situations requiring significant semantic processing (Hare & Jutai, 1988). Interpreting this semantic deficit as a problem processing a word s secondary connotations, we predicted that the performance of psychopathic individua...

We propose that speech comprehension involves the activation of token representations of the phonological forms of current lexical hypotheses, separately from the ongoing construction of a conceptual interpretation of the current utterance. In a series of cross-modal priming experiments, facilitation of lexical decision responses to visual target words (e.g., time) was found for targets that we...

The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation [4]; for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors [2, 3]. ...

Previous studies have shown that different spatial frequency information processing streams interact during the recognition of visual stimuli. However, it is a matter of debate as to the contributions of high and low spatial frequency (HSF and LSF) information for visual word recognition. This study examined the role of different spatial frequencies in visual word recognition using event-relate...

A prime number sieve is an algorithm that nds the primes up to a bound n. We present four new prime number sieves. Each of these sieves gives new space complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only O(p n=(log log n) 2) bits of space, an O l (n= log log n) time sieve that uses O(n=((log n) l log log n)) bits of space, where l > 1...

An algorithm due to Bengalloun that continuously enumerates the primes is adapted to give the rst prime number sieve that is simultaneously sublinear, additive, and smoothly incremental: { it employs only (n= log log n) additions of numbers of size O(n) to enumerate the primes up to n, equalling the performance of the fastest known algorithms for xed n; { the transition from n to n + 1 takes on...