Dynamic vergence telepresence system incorporating active gaze control

Visual Telepresence system which utilize virtual reality style helmet mounted displays have a number of limitations. The geometry of the camera positions and of the display is fixed and is most suitable only for viewing elements of a scene at a particular distance. In such a system, the operator's ability to gaze around without use of head movement is severely limited. A trade off must be made between a poor viewing resolution or a narrow width of viewing field. To address these limitations a prototype system where the geometry of the displays and cameras is dynamically controlled by the eye movement of the operator has been developed. This paper explores the reasons why is necessary to actively adjust both the display system and the cameras and furthermore justifies the use of mechanical adjustment of the displays as an alternative to adjustment by electronic or image processing methods. The electronic and mechanical design is described including optical arrangements and control algorithms, An assessment of the performance of the system against a fixed camera/display system when operators are assigned basic tasks involving depth and distance/size perception. The sensitivity to variations in transient performance of the display and camera vergence is also assessed.

Causal evidence for frontal involvement in memory target maintenance by posterior brain areas during distracter interference of visual working memory

Dorsolateral prefrontal cortex (DLPFC) is recruited during visual working memory (WM) when relevant information must be maintained in the presence of distracting information. The mechanism by which DLPFC might ensure successful maintenance of the contents of WM is, however, unclear; it might enhance neural maintenance of memory targets or suppress processing of distracters. To adjudicate between these possibilities, we applied time-locked transcranial magnetic stimulation (TMS) during functional MRI, an approach that permits causal assessment of a stimulated brain region's influence on connected brain regions, and evaluated how this influence may change under different task conditions. Participants performed a visual WM task requiring retention of visual stimuli (faces or houses) across a delay during which visual distracters could be present or absent. When distracters were present, they were always from the opposite stimulus category, so that targets and distracters were represented in distinct posterior cortical areas. We then measured whether DLPFC-TMS, administered in the delay at the time point when distracters could appear, would modulate posterior regions representing memory targets or distracters. We found that DLPFC-TMS influenced posterior areas only when distracters were present and, critically, that this influence consisted of increased activity in regions representing the current memory targets. DLPFC-TMS did not affect regions representing current distracters. These results provide a new line of causal evidence for a top-down DLPFC-based control mechanism that promotes successful maintenance of relevant information in WM in the presence of distraction.

Fine-grained multi-phase array designs

Hybrid multiprocessor architectures which combine re-configurable computing and multiprocessors on a chip are being proposed to transcend the performance of standard multi-core parallel systems. Both fine-grained and coarse-grained parallel algorithm implementations are feasible in such hybrid frameworks. A compositional strategy for designing fine-grained multi-phase regular processor arrays to target hybrid architectures is presented in this paper. The method is based on deriving component designs using classical regular array techniques and composing the components into a unified global design. Effective designs with phase-changes and data routing at run-time are characteristics of these designs. In order to describe the data transfer between phases, the concept of communication domain is introduced so that the producer–consumer relationship arising from multi-phase computation can be treated in a unified way as a data routing phase. This technique is applied to derive new designs of multi-phase regular arrays with different dataflow between phases of computation.

Molecular insights into aggregates made of amphiphilic Fmoc-tetrapeptides

Pre-assembled aggregates made of Fmoc-conjugated RGDS and GRDS peptides, where Fmoc refers to fluorenylmethoxycarbonyl, have been investigated using atomistic molecular dynamics simulations. The structural characteristics of twelve different models involving two sheets packed with the Fmoc-aligned or with the charged side groups oriented face-to-face, each one containing seven explicit peptide molecules arranged in parallel or antiparallel, have been evaluated for each Fmoc-tetrapeptide. Structural criteria have been used to select the preferred assembly for each Fmoc-tetrapeptide. The two peptides have been found to prefer b-sheet assemblies with a parallel configuration under simulated low concentration conditions. Furthermore, the assembly is dominated by the interactions among Fmoc units. The overall results provide a complete atomistic view of the interactions between Fmoc-peptide molecules comprised within the same sheet or in different sheets that was not achieved experimentally.

Responses of leaf traits to climatic gradients: adaptive variation versus compositional shifts

Dynamic global vegetation models (DGVMs) typically rely on plant functional types (PFTs), which are assigned distinct environmental tolerances and replace one another progressively along environmental gradients. Fixed values of traits are assigned to each PFT; modelled trait variation along gradients is thus driven by PFT replacement. But empirical studies have revealed "universal" scaling relationships (quantitative trait variations with climate that are similar within and between species, PFTs and communities); and continuous, adaptive trait variation has been proposed to replace PFTs as the basis for next-generation DGVMs. Here we analyse quantitative leaf-trait variation on long temperature and moisture gradients in China with a view to understanding the relative importance of PFT replacement vs. continuous adaptive variation within PFTs. Leaf area (LA), specific leaf area (SLA), leaf dry matter content (LDMC) and nitrogen content of dry matter were measured on all species at 80 sites ranging from temperate to tropical climates and from dense forests to deserts. Chlorophyll fluorescence traits and carbon, phosphorus and potassium contents were measured at 47 sites. Generalized linear models were used to relate log-transformed trait values to growing-season temperature and moisture indices, with or without PFT identity as a predictor, and to test for differences in trait responses among PFTs. Continuous trait variation was found to be ubiquitous. Responses to moisture availability were generally similar within and between PFTs, but biophysical traits (LA, SLA and LDMC) of forbs and grasses responded differently from woody plants. SLA and LDMC responses to temperature were dominated by the prevalence of evergreen PFTs with thick, dense leaves at the warm end of the gradient. Nutrient (N, P and K) responses to climate gradients were generally similar within all PFTs. Area-based nutrients generally declined with moisture; Narea and Karea declined with temperature, but Parea increased with temperature. Although the adaptive nature of many of these trait-climate relationships is understood qualitatively, a key challenge for modelling is to predict them quantitatively. Models must take into account that community-level responses to climatic gradients can be influenced by shifts in PFT composition, such as the replacement of deciduous by evergreen trees, which may run either parallel or counter to trait variation within PFTs. The importance of PFT shifts varies among traits, being important for biophysical traits but less so for physiological and chemical traits. Finally, models should take account of the diversity of trait values that is found in all sites and PFTs, representing the "pool" of variation that is locally available for the natural adaptation of ecosystem function to environmental change.

Membrane-initiated actions of estrogens in neuroendocrinology: emerging principles

Hormonal ligands for the nuclear receptor superfamily have at least two interacting mechanisms of action: 1) classical transcriptional regulation of target genes (genomic mechanisms); and 2) nongenomic actions that are initiated at the cell membrane, which could impact transcription. Although transcriptional mechanisms are increasingly well understood, membrane-initiated actions of these ligands are incompletely understood. Historically, this has led to a considerable divergence of thought in the molecular endocrine field. We have attempted to uncover principles of hormone action that are relevant to membrane-initiated actions of estrogens. There is evidence that the membrane-limited actions of hormones, particularly estrogens, involve the rapid activation of kinases and the release of calcium. Membrane actions of estrogens, which activate these rapid signaling cascades, can also potentiate nuclear transcription. These signaling cascades may occur in parallel or in series but subsequently converge at the level of modification of transcriptionally relevant molecules such as nuclear receptors and/or coactivators. In addition, other hormones or neurotransmitters may also activate cascades to crosstalk with estrogen receptor-mediated transcription. The idea of synergistic coupling between membrane-initiated and genomic actions of hormones fundamentally revises the paradigms of cell signaling in neuroendocrinology.

Non-genomic actions of estrogens and their interaction with genomic actions in the brain

Ligands for the nuclear receptor superfamily have at least two mechanisms of action: (a) classical transcriptional regulation of target genes (genomic mechanisms); and (b) non-genomic actions, which are initiated at the cell membrane, which could also impact transcription. Though transcriptional mechanisms are increasingly well understood, membrane-initiated actions of these ligands are incompletely understood. This has led to considerable debate over the physiological relevance of membrane-initiated actions of hormones versus genomic actions of hormones, with genomic actions predominating in the endocrine field. There is good evidence that the membrane-limited actions of hormones, particularly estrogens, involve the rapid activation of kinases and the release of calcium and that these are linked to physiologically relevant scenarios in the brain. We show evidence in this review, that membrane actions of estrogens, which activate these rapid signaling cascades, can also potentiate nuclear transcription in both the central nervous system and in non-neuronal cell lines. We present a theoretical scenario which can be used to understand this phenomenon. These signaling cascades may occur in parallel or in series but subsequently, converge at the modification of transcriptionally relevant molecules such as nuclear receptors and/or coactivators. In addition, other non-cognate hormones or neurotransmitters may also activate cascades to crosstalk with estrogen receptor-mediated transcription, though the relevance of this is less clear. The idea that coupling between membrane-initiated and genomic actions of hormones is a novel idea in neuroendocrinology and provides us with a unified view of hormone action in the central nervous system.

Linear hashtable motion estimation algorithm for distributed video processing

This paper presents a parallel Linear Hashtable Motion Estimation Algorithm (LHMEA). Most parallel video compression algorithms focus on Group of Picture (GOP). Based on LHMEA we proposed earlier [1][2], we developed a parallel motion estimation algorithm focus inside of frame. We divide each reference frames into equally sized regions. These regions are going to be processed in parallel to increase the encoding speed significantly. The theory and practice speed up of parallel LHMEA according to the number of PCs in the cluster are compared and discussed. Motion Vectors (MV) are generated from the first-pass LHMEA and used as predictors for second-pass Hexagonal Search (HEXBS) motion estimation, which only searches a small number of Macroblocks (MBs). We evaluated distributed parallel implementation of LHMEA of TPA for real time video compression.

Scalability of efficient parallel K-Means

Clustering is defined as the grouping of similar items in a set, and is an important process within the field of data mining. As the amount of data for various applications continues to increase, in terms of its size and dimensionality, it is necessary to have efficient clustering methods. A popular clustering algorithm is K-Means, which adopts a greedy approach to produce a set of K-clusters with associated centres of mass, and uses a squared error distortion measure to determine convergence. Methods for improving the efficiency of K-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting a more efficient data structure, notably a multi-dimensional binary search tree (KD-Tree) to store either centroids or data points. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient K-Means techniques in parallel computational environments. In this work, we provide a parallel formulation for the KD-Tree based K-Means algorithm and address its load balancing issues.

Dynamic load balancing in parallel KD-tree k-means

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.

Non-uniform data distribution for communication-efficient parallel clustering

Global communicationrequirements andloadimbalanceof someparalleldataminingalgorithms arethe major obstacles to exploitthe computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication costin parallel data mining algorithms and, in particular, in the k-means algorithm for cluster analysis. In the straightforward parallel formulation of the k-means algorithm, data and computation loads are uniformly distributed over the processing nodes. This approach has excellent load balancing characteristics that may suggest it could scale up to large and extreme-scale parallel computing systems. However, at each iteration step the algorithm requires a global reduction operationwhichhinders thescalabilityoftheapproach.Thisworkstudiesadifferentparallelformulation of the algorithm where the requirement of global communication is removed, while maintaining the same deterministic nature ofthe centralised algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real-world distributed applications or can be induced by means ofmulti-dimensional binary searchtrees. The approachcanalso be extended to accommodate an approximation error which allows a further reduction ofthe communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing element

Dynamic group communication for large-scale parallel data mining

Exascale systems are the next frontier in high-performance computing and are expected to deliver a performance of the order of 10^18 operations per second using massive multicore processors. Very large- and extreme-scale parallel systems pose critical algorithmic challenges, especially related to concurrency, locality and the need to avoid global communication patterns. This work investigates a novel protocol for dynamic group communication that can be used to remove the global communication requirement and to reduce the communication cost in parallel formulations of iterative data mining algorithms. The protocol is used to provide a communication-efficient parallel formulation of the k-means algorithm for cluster analysis. The approach is based on a collective communication operation for dynamic groups of processes and exploits non-uniform data distributions. Non-uniform data distributions can be either found in real-world distributed applications or induced by means of multidimensional binary search trees. The analysis of the proposed dynamic group communication protocol has shown that it does not introduce significant communication overhead. The parallel clustering algorithm has also been extended to accommodate an approximation error, which allows a further reduction of the communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing elements.