Target similarity effects: Support for the parallel distributed processing assumptions

Recent research has begun to provide support for the assumptions that memories are stored as a composite and are accessed in parallel (Tehan & Humphreys, 1998). New predictions derived from these assumptions and from the Chappell and Humphreys (1994) implementation of these assumptions were tested. In three experiments, subjects studied relatively short lists of words. Some of the Lists contained two similar targets (thief and theft) or two dissimilar targets (thief and steal) associated with the same cue (ROBBERY). AS predicted, target similarity affected performance in cued recall but not free association. Contrary to predictions, two spaced presentations of a target did not improve performance in free association. Two additional experiments confirmed and extended this finding. Several alternative explanations for the target similarity effect, which incorporate assumptions about separate representations and sequential search, are rejected. The importance of the finding that, in at least one implicit memory paradigm, repetition does not improve performance is also discussed.

Dual processes in recognition: Does a focus on measurement operations provide a sufficient foundation?

Current theoretical thinking about dual processes in recognition relies heavily on the measurement operations embodied within the process dissociation procedure. We critically evaluate the ability of this procedure to support this theoretical enterprise. We show that there are alternative processes that would produce a rough invariance in familiarity (a key prediction of the dual-processing approach) and that the process dissociation procedure does not have the power to differentiate between these alternative possibilities. We also show that attempts to relate parameters estimated by the process dissociation procedure to subjective reports (remember-know judgments) cannot differentiate between alternative dual-processing models and that there are problems with some of the historical evidence and with obtaining converging evidence. Our conclusion is that more specific theories incorporating ideas about representation and process are required.

A dual catalyst bed system for the elimination of hydrogen from CO2 feed gas in urea synthesis

A dual catalyst bed system (Au/Fe2O3 + Pt-Pd/Al2O3) for eliminating hydrogen from the CO2 feed gas in urea synthesis is found to be far superior to commercially available and patented catalysts in catalytic activity. At relatively low temperatures, hydrogen is eliminated and coexistent CO is also oxidized completely to useful CO2. This can avoid effectively the accidental explosion of hydrogen-oxygen-ammonia mixed gases, thus ensuring the safety of urea synthesis.

Parallel processing and image analysis in the eyes of mantis shrimps

The compound eyes of mantis shrimps, a group of tropical marine crustaceans, incorporate principles of serial and parallel processing of visual information that may be applicable to artificial imaging systems. Their eyes include numerous specializations for analysis of the spectral and polarizational properties of light, and include more photoreceptor classes for analysis of ultraviolet light, color, and polarization than occur in any other known visual system. This is possible because receptors in different regions of the eye are anatomically diverse and incorporate unusual structural features, such as spectral filters, not seen in other compound eyes. Unlike eyes of most other animals, eyes of mantis shrimps must move to acquire some types of visual information and to integrate color and polarization with spatial vision. Information leaving the retina appears to be processed into numerous parallel data streams leading into the central nervous system, greatly reducing the analytical requirements at higher levels. Many of these unusual features of mantis shrimp vision may inspire new sensor designs for machine vision

Dual C3a/C5a receptor agonism by a C5a C-terminal analogue decapeptide

No abstract

Extinction of affective learning: No evidence for dual process accounts of human learning

The acquisition and extinction of affective valence to neutral geometrical shape conditional stimuli was investigated in three experiments. Experiment 1 employed a differential conditioning procedure with aversive shock USs. Differential electrodermal responding was evident during acquisition and lost during extinction. As indexed by verbal ratings, the CS1 acquired negative valence during acquisition,which was reduced after extinction. Affective priming, a reaction time based demand free measure of stimulus valence, failed to provide evidence for affective learning. Experiment 2 employed pictures of happy and angry faces as USs.Valence ratings after acquisitionweremore positive for theCS paired with happy faces (CS-H) and less positive for the CS paired with angry faces (CS-A) than during baseline. Extinction training reduced the extent of acquired valence significantly for both CSs, however, ratings of the CS-A remained different from baseline. Affective priming confirmed these results yielding differences between CS-A and CS-H after acquisition for pleasant and unpleasant targets, but for pleasant targets only after extinction. Experiment 3 replicated the design of Experiment 2, but presented the US pictures backwardly masked. Neither rating nor affective priming measures yielded any evidence for affective learning. The present results confirm across two different experimental procedures that, contrary to predictions from dual process accounts of human learning, affective learning is subject to extinction.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.