Dual role of the beta(2)-adrenergic receptor C terminus for the binding of beta-arrestin and receptor internalization

Homologous desensitization of beta(2)-adrenergic and other G-protein-coupled receptors is a two-step process. After phosphorylation of agonist-occupied receptors by G-protein-coupled receptor kinases, they bind beta-arrestins, which triggers desensitization and internalization of the receptors. Because it is not known which regions of the receptor are recognized by beta-arrestins, we have investigated beta-arrestin interaction and internalization of a set of mutants of the human beta(2)-adrenergic receptor. Mutation of the four serine/threonine residues between residues 355 and 364 led to the loss of agonist-induced receptor-beta-arrestin2 interaction as revealed by fluorescence resonance energy transfer (FRET), translocation of beta-arrestin2 to the plasma membrane, and receptor internalization. Mutation of all seven serine/threonine residues distal to residue 381 did not affect agonist-induced receptor internalization and beta-arrestin2 translocation. A beta(2)-adrenergic receptor truncated distal to residue 381 interacted normally with beta-arrestin2, whereas its ability to internalize in an agonist-dependent manner was compromised. A similar impairment of internalization was observed when only the last eight residues of the C terminus were deleted. Our experiments show that the C terminus distal to residue 381 does not affect the initial interaction between receptor and beta-arrestin, but its last eight amino acids facilitate receptor internalization in concert with beta-arrestin2.

A demonstration of attentional bias, using a novel dual task paradigm, towards clinically salient material in recovering alcohol abuse patients?

Background. This study examined whether alcohol abuse patients are characterized either by enhanced schematic processing of alcohol related cues or by an attentional bias towards the processing of alcohol cues. Method. Abstinent alcohol abusers (N = 25) and non-clinical control participants (N = 24) performed a dual task paradigm in which they had to make an odd/even decision to a centrally presented number while performing a peripherally presented lexical decision task. Stimuli on the lexical decision task comprised alcohol words, neutral words and non-words. In addition, participants completed an incidental recall task for the words presented in the lexical decision task. Results. It was found that, in the presence of alcohol related words, the performance of patients on the odd/even decision task was poorer than in the presence of other stimului. In addition, patients displayed slower lexical decision times for alcohol related words. Both groups displayed better recall for alcohol words than for other stimuli. Conclusions. These results are interpreted as supporting neither model of drug cravings. Rather, it is proposed that, in the presence of alcohol stimuli, alcohol abuse patients display a breakdown in the ability to focus attention.

The parallel programming of voluntary and reflexive saccades

A novel two-step paradigm was used to investigate the parallel programming of consecutive, stimulus-elicited ('reflexive') and endogenous ('voluntary') saccades. The mean latency of voluntary saccades, made following the first reflexive saccades in two-step conditions, was significantly reduced compared to that of voluntary saccades made in the single-step control trials. The latency of the first reflexive saccades was modulated by the requirement to make a second saccade: first saccade latency increased when a second voluntary saccade was required in the opposite direction to the first saccade, and decreased when a second saccade was required in the same direction as the first reflexive saccade. A second experiment confirmed the basic effect and also showed that a second reflexive saccade may be programmed in parallel with a first voluntary saccade. The results support the view that voluntary and reflexive saccades can be programmed in parallel on a common motor map. (c) 2006 Elsevier Ltd. All rights reserved.

A behavioral comparison between motorcyclists and a matched group of non-motorcycling car drivers: factors influencing accident risk

Motorcyclists and a matched group of non-motorcycling car drivers were assessed on behavioral measures known to relate to accident involvement. Using a range of laboratory measures, we found that motorcyclists chose faster speeds than the car drivers, overtook more, and pulled into smaller gaps in traffic, though they did not travel any closer to the vehicle in front. The speed and following distance findings were replicated by two further studies involving unobtrusive roadside observation. We suggest that the increased risk-taking behavior of motorcyclists was only likely to account for a small proportion of the difference in accident risk between motorcyclists and car drivers. A second group of motorcyclists was asked to complete the simulator tests as if driving a car. They did not differ from the non-motorcycling car drivers on the risk-taking measures but were better at hazard perception. There were also no differences for sensation seeking, mild social deviance, and attitudes to riding/driving, indicating that the risk-taking tendencies of motorcyclists did not transfer beyond motorcycling, while their hazard perception skill did. (C) 2002 Elsevier Science Ltd. All rights reserved.

The effect of a perceptual cognitive task on exercise performance: the dual-task condition after brain injury

Objective: To examine the effect of additional cognitive demand on cycling performance in individuals with acquired brain injury (ABI). Design: Prospective observational study. Setting: Rivermead Rehabilitation Centre. Participants: Ten individuals with ABI ( 7 men, 3 women) ( traumatic brain injury 7, tumour 1, stroke 2) and 10 healthy controls ( 6 men, 4 women). Intervention: Individuals were asked to maintain a set cadence during a three-stage incremental cycling test in both single-task ( no additional task) and dual-task ( whilst performing an additional cognitive task) conditions. Results: The ABI group showed a slight slowing in cadence in stages 1 and 3 of the graded exercise test from the single-to the dual-task condition, although this was not significant ( p less than or equal to 0.05). The control group showed no slowing of cadence at any incremental stage. When directly comparing the ABI with the control group, the change in cadence observed in dual-task conditions was only significantly different in stage 3 ( p less than or equal to 0.05). Conclusions: Clinicians should be aware of the possibility that giving additional cognitive tasks ( such as monitoring exercise intensity) while individuals with acquired brain injury are performing exercises may detrimentally affect performance. The effect may be more marked when the individuals are performing exercise at higher intensities.

Integrative views on dual-task costs

In this paper, we introduce a special issue about unique and shared mechanisms underlying the performance limitations observed in dual tasks. In particular, the relationship between task-switching costs, the attentional-blink effect, and the psychological refractory period effect is reviewed. These costs are traditionally attributed to fixed and unique capacity limitations for task set reconfiguration, target identification, and response selection, respectively However, we argue that more global attentional processes play a role that cuts across these paradigms. This is reason for a more paradigm-independent approach to processing limitations in dual tasks.

Parallel and distributed computing with Java

The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based.simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications.

Hierarchical composite regular parallel architecture

The design space of emerging heterogenous multi-core architectures with re-configurability element makes it feasible to design mixed fine-grained and coarse-grained parallel architectures. This paper presents a hierarchical composite array design which extends the curret design space of regular array design by combining a sequence of transformations. This technique is applied to derive a new design of a pipelined parallel regular array with different dataflow between phases of computation.

Linear predicted two-pass hexagonal algorithm with parallel implementation for motion estimation

This paper presents a paralleled Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA., Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We introduced hashtable into video processing and completed parallel implementation. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. It discusses how parallel video coding on load balanced multiprocessor systems can help, especially on motion estimation. The effect of load balancing for improved performance is discussed. The performance or the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Two-pass hexagonal algorithm with parallel implementation for video coding

This paper presents a paralleled Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA, Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We introduced hashtable into video processing and completed parallel implementation. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. It discusses how parallel video coding on load balanced multiprocessor systems can help, especially on motion estimation. The effect of load balancing for improved performance is discussed. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Improved two-pass hexagonal algorithm with parallel implementation for video coding - art. no. 60630J

This paper presents an improved parallel Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. Motion Vectors (MV) are generated from the first-pass LHMEA and used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We used bashtable into video processing and completed parallel implementation. The hashtable structure of LHMEA is improved compared to the original TPA and LHMEA. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. The implementation contains spatial and temporal approaches. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Parallel Monte Carlo approach for integration of the rendering equation

This paper is addressed to the numerical solving of the rendering equation in realistic image creation. The rendering equation is integral equation describing the light propagation in a scene accordingly to a given illumination model. The used illumination model determines the kernel of the equation under consideration. Nowadays, widely used are the Monte Carlo methods for solving the rendering equation in order to create photorealistic images. In this work we consider the Monte Carlo solving of the rendering equation in the context of the parallel sampling scheme for hemisphere. Our aim is to apply this sampling scheme to stratified Monte Carlo integration method for parallel solving of the rendering equation. The domain for integration of the rendering equation is a hemisphere. We divide the hemispherical domain into a number of equal sub-domains of orthogonal spherical triangles. This domain partitioning allows to solve the rendering equation in parallel. It is known that the Neumann series represent the solution of the integral equation as a infinity sum of integrals. We approximate this sum with a desired truncation error (systematic error) receiving the fixed number of iteration. Then the rendering equation is solved iteratively using Monte Carlo approach. At each iteration we solve multi-dimensional integrals using uniform hemisphere partitioning scheme. An estimate of the rate of convergence is obtained using the stratified Monte Carlo method. This domain partitioning allows easy parallel realization and leads to convergence improvement of the Monte Carlo method. The high performance and Grid computing of the corresponding Monte Carlo scheme are discussed.

Parallel Monte Carlo sampling scheme for sphere and hemisphere

The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation. In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Our aim is to construct and study the parallel sampling scheme for hemisphere and sphere. First we apply the symmetry property for partitioning of hemisphere and sphere. The domain of solid angle subtended by a hemisphere is divided into a number of equal sub-domains. Each sub-domain represents solid angle subtended by orthogonal spherical triangle with fixed vertices and computable parameters. Then we introduce two new algorithms for sampling of orthogonal spherical triangles. Both algorithms are based on a transformation of the unit square. Similarly to the Arvo's algorithm for sampling of arbitrary spherical triangle the suggested algorithms accommodate the stratified sampling. We derive the necessary transformations for the algorithms. The first sampling algorithm generates a sample by mapping of the unit square onto orthogonal spherical triangle. The second algorithm directly compute the unit radius vector of a sampling point inside to the orthogonal spherical triangle. The sampling of total hemisphere and sphere is performed in parallel for all sub-domains simultaneously by using the symmetry property of partitioning. The applicability of the corresponding parallel sampling scheme for Monte Carlo and Quasi-D/lonte Carlo solving of rendering equation is discussed.

Parallel performance and scalability experiments with the Danish Eulerian Model on the EPCC supercomputers

The Danish Eulerian Model (DEM) is a powerful air pollution model, designed to calculate the concentrations of various dangerous species over a large geographical region (e.g. Europe). It takes into account the main physical and chemical processes between these species, the actual meteorological conditions, emissions, etc.. This is a huge computational task and requires significant resources of storage and CPU time. Parallel computing is essential for the efficient practical use of the model. Some efficient parallel versions of the model were created over the past several years. A suitable parallel version of DEM by using the Message Passing Interface library (AIPI) was implemented on two powerful supercomputers of the EPCC - Edinburgh, available via the HPC-Europa programme for transnational access to research infrastructures in EC: a Sun Fire E15K and an IBM HPCx cluster. Although the implementation is in principal, the same for both supercomputers, few modifications had to be done for successful porting of the code on the IBM HPCx cluster. Performance analysis and parallel optimization was done next. Results from bench marking experiments will be presented in this paper. Another set of experiments was carried out in order to investigate the sensitivity of the model to variation of some chemical rate constants in the chemical submodel. Certain modifications of the code were necessary to be done in accordance with this task. The obtained results will be used for further sensitivity analysis Studies by using Monte Carlo simulation.