Roger Johansson

Insertion of CO2 into a palladium allyl bond and a Pd(II) catalysed carboxylation of allyl stannanes

The complex 2,6-bis[(di-t-butylphosphino)methyl]phenyl allyl palladium (PCP(tBu)Pd-allyl, 3) reacts with CO(2) in a very fast insertion reaction to give the corresponding butenoate complex. The reaction is thought to occur via a cyclic six-membered transition state (7), where the gamma-carbon of the allyl group is linked up with the CO(2)-carbon. A group of related PCP complexes were investigated as catalysts for the carboxylation of tributyl(allyl)stannane. A catalytic cycle is proposed for this reaction where the rate determining step is the transmetallation between tin and palladium. The carboxylation reaction is faster using less sterically crowded catalysts whereas the electron richness of the palladium complexes seems less important for reactivity. Thus, there was no apparent difference in reactivity between 2,6-bis[(di-phenylphosphino)methyl]phenyl palladium triflouroacetate (13) and resorcinolbis(diphenyl)phosphinite palladium triflouroacetate (10). Both of these complexes give high turnovers for the carboxylation of tributyl(allyl)stannane (80% in 16 h using a ca. 5% catalyst loading and 4 atm CO(2) pressure). On the other hand complex 3 was inactive in the catalytic carboxylation reaction.

Pictures and spoken descriptions elicit similar eye movements during mental imagery, both in light and in complete darkness

This study provides evidence that eye movements reflect the positions of objects while participants listen to a spoken description, retell a previously heard spoken description, and describe a previously seen picture. This effect is equally strong in retelling from memory, irrespective of whether the original elicitation was spoken or visual. In addition, this effect occurs both while watching a blank white board and while sitting in complete darkness. This study includes 4 experiments. The first 2 experiments measured eye movements of participants looking at a blank white board. Experiment 1 monitors eye movements of participants on 2 occasions: first, when participants listened to a prerecorded spoken scene description; second, when participants were later retelling it from memory. Experiment 2 first monitored eye movements of participants as they studied a complex picture visually, and then later as they described it from memory. The second pair of experiments (Experiments 3 and 4) replicated Experiments 1 and 2 with the only difference being that they were executed in complete darkness. This method of analysis differentiated between eye movements that are categorically correct relative to the positions of the whole eye gaze pattern (global correspondence) and eye movements that are only locally correct (local correspondence). The discussion relates the findings to the current debate on mental imagery.

Look Here, Eye Movements Play a Functional Role in Memory Retrieval

Research on episodic memory has established that spontaneous eye movements occur to spaces associated with retrieved information even if those spaces are blank at the time of retrieval. Although it has been claimed that such looks to “nothing” can function as facilitatory retrieval cues, there is currently no conclusive evidence for such an effect. In the present study, we addressed this fundamental issue using four direct eye manipulations in the retrieval phase of an episodic memory task: (a) free viewing on a blank screen, (b) maintaining central fixation, (c) looking inside a square congruent with the location of the to-be-recalled objects, and (d) looking inside a square incongruent with the location of the to-be-recalled objects. Our results provide novel evidence of an active and facilitatory role of gaze position during memory retrieval and demonstrate that memory for the spatial relationship between objects is more readily affected than memory for intrinsic object features.

It depends on how you look at it: Scanpath comparison in multiple dimensions with MultiMatch, a vector-based approach

Eye movement sequences—or scanpaths—vary depending on the stimulus characteristics and the task (Foulsham & Underwood Journal of Vision, 8(2), 6:1–17, 2008; Land, Mennie, & Rusted, Perception, 28, 1311–1328, 1999). Common methods for comparing scanpaths, however, are limited in their ability to capture both the spatial and temporal properties of which a scanpath consists. Here, we validated a new method for scanpath comparison based on geometric vectors, which compares scanpaths over multiple dimensions while retaining positional and sequential information (Jarodzka, Holmqvist, & Nyström, Symposium on Eye-Tracking Research and Applications (pp. 211–218), 2010). “MultiMatch” was tested in two experiments and pitted against ScanMatch (Cristino, Mathôt, Theeuwes, & Gilchrist, Behavior Research Methods, 42, 692–700, 2010), the most comprehensive adaptation of the popular Levenshtein method. In Experiment 1, we used synthetic data, demonstrating the greater sensitivity of MultiMatch to variations in spatial position. In Experiment 2, real eye movement recordings were taken from participants viewing sequences of dots, designed to elicit scanpath pairs with commonalities known to be problematic for algorithms (e.g., when one scanpath is shifted in locus or when fixations fall on either side of an AOI boundary). The results illustrate the advantages of a multidimensional approach, revealing how two scanpaths differ. For instance, if one scanpath is the reverse copy of another, the difference is in the direction but not the positions of fixations; or if a scanpath is scaled down, the difference is in the length of the saccadic vectors but not in the overall shape. As well as having enormous potential for any task in which consistency in eye movements is important (e.g., learning), MultiMatch is particularly relevant for “eye movements to nothing” in mental imagery and embodiment-of-cognition research, where satisfactory scanpath comparison algorithms are lacking.

Combined eyetracking and keystroke-logging methods for studying cognitive processes in text production

Writers typically spend a certain proportion of time looking back over the text that they have written. This is likely to serve a number of different functions, which are currently poorly understood. In this article, we present two systems, ScriptLog+TimeLine and EyeWrite, that adopt different and complementary approaches to exploring this activity by collecting and analyzing combined eye movement and keystroke data from writers composing extended texts. ScriptLog+TimeLine is a system that is based on an existing keystroke-logging program and uses heuristic, pattern-matching methods to identify reading episodes within eye movement data. EyeWrite is an integrated editor and analysis system that permits identification of the words that the writer fixates and their location within the developing text. We demonstrate how the methods instantiated within these systems can be used to make sense of the large amount of data generated by eyetracking and keystroke logging in order to inform understanding of the cognitive processes that underlie written text production.

A Study of the Impact of Single Bit-Flip and Double Bit-Flip Errors on Program Execution

This paper presents the results of an extensive experimental study of bit-flip errors in instruction set architecture registers and main memory locations. Comprising more than two million fault injection experiments conducted with thirteen benchmark programs, the study provides insights on whether it is necessary to consider double bit-flip errors in dependability benchmarking experiments. The results show that the proportion of silent data corruptions in the program output, is almost the same for single and double bit errors. In addition, we present detailed statistics about the error sensitivity of different target registers and memory locations, including bit positions within registers and memory words. These show that the error sensitivity varies significantly between different bit positions and registers. An important observation is that injections in certain bit positions always have the same impact regardless of when the error is injected.

Eye movements and reading comprehension while listening to preferred and non-preferred study music

In the present study 24 university students read four different texts in four conditions: (1) while listening to music they preferred to listen to while studying; (2) while listening to music they did not prefer to listen to while studying; (3) while listening to a recording of noise from a café; and finally (4) in silence. After each text they took a reading-comprehension test. Eye movement data were recorded for all participants in all conditions. A main effect for the reading-comprehension scores revealed that the participants scored significantly lower after they had been listening to the non-preferred music while reading, compared with reading in silence. No significant effects were found between the other conditions. No significant differences between conditions were found for the traditional eye movement measures in reading (fixation duration, saccadic amplitude, regressions, and first-pass and second-pass reading time). It is suggested that this result is a consequence of participants not being aware that their reading processes are disrupted by a non-preferred musical background. They do not make the necessary changes to the processes involved in reading required to compensate for increased cognitive load. The results are discussed in relation to study/reading habits, extraversion, arousal and working memory capacity.

RedCAN/sup TM/: simulations of two fault recovery algorithms for CAN

We present the RedCAN concept to achieve fault tolerance against node and link failures in a CAN-bus system by means of configurable switches. The basic idea in RedCAN is to isolate faulty nodes or bus segments by configuring switches that will evade a faulty node or segment and exclude it from bus access. We propose changes to the original centralized protocol, vulnerable to single point failures, and show that with a new distributed algorithm considerable more efficiency can be achieved also when network size is growing. The distributed algorithm introduces redundancy and hereby increases robustness of the system. Furthermore, the new algorithm has logarithmic complexity, as opposed to the centralized algorithms linear complexity, as the number of nodes increase. The results were gathered through a new simulator, the RedCAN Simulation Manager, also presented. Simulations allow assessing the break-even point between centralized and distributed algorithms reconfiguration latencies as well as give ideas for further research.

A Study of the Impact of Bit-Flip Errors on Programs Compiled with Different Optimization Levels

In this paper we study the impact of compiler optimizations on the error sensitivity of twelve benchmark programs. We conducted extensive fault injection experiments where bit-flip errors were injected in instruction set architecture registers and main memory locations. The results show that the percentage of silent data corruptions (SDCs) in the output of the optimized programs is only marginally higher compare to that observed for the non-optimized programs. This suggests that compiler optimizations can be used in safety- and mission-critical systems without increasing the risk that the system produces undetected erroneous outputs. In addition, we investigate to what extent the source code implementation of a program affects the error sensitivity of a program. To this end, we perform experiments with five implementations of a bit count algorithm. In this investigation, we consider the impact of the implementation as well as compiler optimizations. The results of these experiments give valuable insights into how compiler optimizations can be used to reduce error sensitive of registers and main memory sections. They also show how sensitive locations requiring additional protection, e.g., by the use of software-based fault tolerance techniques, can be identified.

On the impact of hardware faults --- an investigation of the relationship between workload inputs and failure mode distributions

Technology scaling of integrated circuits is making transistors increasingly sensitive to process variations, wear-out effects and ionizing particles. This may lead to an increasing rate of transient and intermittent errors in future microprocessors. In order to assess the risk such errors pose to safety critical systems, it is essential to investigate how temporary errors in the instruction set architecture (ISA) registers and main memory locations influence the behaviour of executing programs. To this end, we investigate --- by means of extensive fault injection experiments --- how such errors affect the execution of four target programs. The paper makes three contributions. First, we investigate how the failure modes of the target programs vary for different input sets. Second, we evaluate the error coverage of a software-implemented hardware fault tolerant technique that relies on triple-time redundant execution, majority voting and forward recovery. Third, we propose an approach based on assembly language metrics which can be used to correlate the dynamic fault-free behaviour of a program with its failure mode distribution obtained by fault injection.