Information theoretic interpretation of frequency domain connectivity measures

In order to provide adequate multivariate measures of information flow between neural structures, modified expressions of partial directed coherence (PDC) and directed transfer function (DTF), two popular multivariate connectivity measures employed in neuroscience, are introduced and their formal relationship to mutual information rates are proved.

Frequency Domain Connectivity Identification: An Application of Partial Directed Coherence in fMRI

Functional magnetic resonance imaging (fMRI) has become an important tool in Neuroscience due to its noninvasive and high spatial resolution properties compared to other methods like PET or EEG. Characterization of the neural connectivity has been the aim of several cognitive researches, as the interactions among cortical areas lie at the heart of many brain dysfunctions and mental disorders. Several methods like correlation analysis, structural equation modeling, and dynamic causal models have been proposed to quantify connectivity strength. An important concept related to connectivity modeling is Granger causality, which is one of the most popular definitions for the measure of directional dependence between time series. In this article, we propose the application of the partial directed coherence (PDC) for the connectivity analysis of multisubject fMRI data using multivariate bootstrap. PDC is a frequency domain counterpart of Granger causality and has become a very prominent tool in EEG studies. The achieved frequency decomposition of connectivity is useful in separating interactions from neural modules from those originating in scanner noise, breath, and heart beating. Real fMRI dataset of six subjects executing a language processing protocol was used for the analysis of connectivity. Hum Brain Mapp 30:452-461, 2009. (C) 2007 Wiley-Liss, Inc.

Cognitive functioning in subjects with recent-onset psychosis from a low-middle-income environment: Multiple-domain deficits and longitudinal evaluation

Cognitive deficits are a key feature of recent-onset psychosis, but there is no consensus on whether such deficits are generalized or confined to specific domains. Besides, it is unclear whether cognitive deficits: a) are found in psychotic patients in samples from outside high-income countries; and b) whether they progress uniformly over time in schizophrenia and affective psychoses. We applied 12 tests organized into eight cognitive domains, comparing psychosis patients (n = 56, time from initial contact = 677.95+/-183.27 days) versus healthy controls (n = 70) recruited from the same area of Sao Paulo, Brazil. Longitudinal comparisons (digit span and verbal fluency) were conducted between a previous assessment of the subjects carried out at their psychosis onset, and the current follow-up evaluation. Psychosis patients differed significantly from controls on five domains, most prominently on verbal memory. Cognitive deficits remained detectable in separate comparisons of the schizophrenia subgroup and, to a lesser extent, the affective psychosis subjects against controls. Longitudinal comparisons indicated significant improvement in schizophrenia, affective psychoses, and control subjects, with no significant group-by-time interactions. Our results reinforce the view that there are generalized cognitive deficits in association with recent-onset psychoses, particularly of non-affective nature, which persist over time. (C) 2009 Elsevier Ireland Ltd. All rights reserved.

Targeting of EBNA1 for rapid intracellular degradation overrides the inhibitory effects of the Gly-Ala repeat domain and restores CD8+T cell recognition

Epstein-Barr virus (EBV)-encoded nuclear antigen 1 (EBNA1) includes a unique glycine-alanine repeat domain that inhibits the endogenous presentation of cytotoxic T lymphocyte (CTL) epitopes through the class I pathway by blocking proteasome-dependent degradation of this antigen. This immune evasion mechanism has been implicated in the pathogenesis of EBV-associated diseases. Here, we show that cotranslational ubiquitination combined with N-end rule targeting enhances the intracellular degradation of EBNA1, thus resulting in a dramatic reduction in the half-life of the antigen. Using DNA expression vectors encoding different forms of ubiquitinated EBNA1 for in vivo studies revealed that this rapid degradation, remarkably, leads to induction of a very strong CTL response to an EBNA1-specific CTL epitope. Furthermore, this targeting also restored the endogenous processing of HLA class I-restricted CTL epitopes within EBNA1 for immune recognition by human EBV-specific CTLs. These observations provide, for the first time, evidence that the glycine-alanine repeat-mediated proteasomal block on EBNA1 can be reversed by specifically targeting this antigen for rapid degradation resulting in enhanced CD8+ T cell-mediated recognition in vitro and in vivo.

A comparison of low-storage strategies for spectral analysis in dissipative systems: filter diagonalisation in the Lanczos representation and harmonic inversion of the Chebychev-order-domain autocorrelation function

We compare the performance of two different low-storage filter diagonalisation (LSFD) strategies in the calculation of complex resonance energies of the HO2, radical. The first is carried out within a complex-symmetric Lanczos subspace representation [H. Zhang, S.C. Smith, Phys. Chem. Chem. Phys. 3 (2001) 2281]. The second involves harmonic inversion of a real autocorrelation function obtained via a damped Chebychev recursion [V.A. Mandelshtam, H.S. Taylor, J. Chem. Phys. 107 (1997) 6756]. We find that while the Chebychev approach has the advantage of utilizing real algebra in the time-consuming process of generating the vector recursion, the Lanczos, method (using complex vectors) requires fewer iterations, especially for low-energy part of the spectrum. The overall efficiency in calculating resonances for these two methods is comparable for this challenging system. (C) 2001 Elsevier Science B.V. All rights reserved.

The GRIP domain is a specific targeting sequence for a population of trans-Golgi network derived tubulo-vesicular carriers

Vesicular carriers for intracellular transport associate with unique sets of accessory molecules that dictate budding and docking on specific membrane domains. Although many of these accessory molecules are peripheral membrane proteins, in most cases the targeting sequences responsible for their membrane recruitment have yet to be identified. We have previously defined a novel Golgi targeting domain (GRIP) shared by a family of coiled-coil peripheral membrane Golgi proteins implicated in membrane trafficking. We show here that the docking site for the GRIP motif of p230 is a specific domain of Golgi. membranes. By immunoelectron microscopy of HeLa cells stably expressing a green fluorescent protein (GFP)-p230(GRIP) fusion protein, we show binding specifically to a subset of membranes of the trans-Golgi network (TGN). Real-time imaging of live HeLa cells revealed that the GFP-p230(GRIP) was associated with highly dynamic tubular extensions of the TGN, which have the appearance and behaviour of transport carriers. To further define the nature of the GRIP membrane binding site, in vitro budding assays were performed using purified rat liver Golgi membranes and cytosol from GFP-p230(GRIP) transfected cells. Analysis of Golgi-derived vesicles by sucrose gradient fractionation demonstrated that GFP-p230(GRIP) binds to a specific population of vesicles distinct from those labelled for beta -COP or gamma -adaptin. The GFP-p230(GRIP) fusion protein is recruited to the same vesicle population as full-length p230, demonstrating that the GRIP domain is solely proficient as a targeting signal for membrane binding of the native molecule. Therefore, p230 GRIP is a targeting signal for recruitment to a highly selective membrane attachment site on a specific population of trans-Golgi network tubulovesicular carriers.

Decision support system with incomplete and domain incoherent information management

Many of the most common human functions such as temporal and non-monotonic reasoning have not yet been fully mapped in developed systems, even though some theoretical breakthroughs have already been accomplished. This is mainly due to the inherent computational complexity of the theoretical approaches. In the particular area of fault diagnosis in power systems however, some systems which tried to solve the problem, have been deployed using methodologies such as production rule based expert systems, neural networks, recognition of chronicles, fuzzy expert systems, etc. SPARSE (from the Portuguese acronym, which means expert system for incident analysis and restoration support) was one of the developed systems and, in the sequence of its development, came the need to cope with incomplete and/or incorrect information as well as the traditional problems for power systems fault diagnosis based on SCADA (supervisory control and data acquisition) information retrieval, namely real-time operation, huge amounts of information, etc. This paper presents an architecture for a decision support system, which can solve the presented problems, using a symbiosis of the event calculus and the default reasoning rule based system paradigms, insuring soft real-time operation with incomplete, incorrect or domain incoherent information handling ability. A prototype implementation of this system is already at work in the control centre of the Portuguese Transmission Network.

A framework for the development of parallel and distributed real-time embedded systems

Embedded real-time applications increasingly present high computation requirements, which need to be completed within specific deadlines, but that present highly variable patterns, depending on the set of data available in a determined instant. The current trend to provide parallel processing in the embedded domain allows providing higher processing power; however, it does not address the variability in the processing pattern. Dimensioning each device for its worst-case scenario implies lower average utilization, and increased available, but unusable, processing in the overall system. A solution for this problem is to extend the parallel execution of the applications, allowing networked nodes to distribute the workload, on peak situations, to neighbour nodes. In this context, this report proposes a framework to develop parallel and distributed real-time embedded applications, transparently using OpenMP and Message Passing Interface (MPI), within a programming model based on OpenMP. The technical report also devises an integrated timing model, which enables the structured reasoning on the timing behaviour of these hybrid architectures.

Aspect-oriented domain analysis

Dissertação de Mestrado em Engenharia Informática

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

Real-Time Application Mapping for Many-Cores Using a Limited Migrative Model

Many-core platforms are an emerging technology in the real-time embedded domain. These devices offer various options for power savings, cost reductions and contribute to the overall system flexibility, however, issues such as unpredictability, scalability and analysis pessimism are serious challenges to their integration into the aforementioned area. The focus of this work is on many-core platforms using a limited migrative model (LMM). LMM is an approach based on the fundamental concepts of the multi-kernel paradigm, which is a promising step towards scalable and predictable many-cores. In this work, we formulate the problem of real-time application mapping on a many-core platform using LMM, and propose a three-stage method to solve it. An extended version of the existing analysis is used to assure that derived mappings (i) guarantee the fulfilment of timing constraints posed on worst-case communication delays of individual applications, and (ii) provide an environment to perform load balancing for e.g. energy/thermal management, fault tolerance and/or performance reasons.

Response Time Analysis of Slotted WiDOM in Noisy Wireless Channels

International Conference on Emerging Technologies and Factory Automation (ETFA 2015), Industrial Communication Technologies and Systems, Luxembourg, Luxembourg.

A Multi-DAG Model for Real-Time Parallel Applications with Conditional Execution

The 30th ACM/SIGAPP Symposium On Applied Computing (SAC 2015). 13 to 17, Apr, 2015, Embedded Systems. Salamanca, Spain.

Dynamical Analysis and Visualization of Tornadoes Time Series

In this paper we analyze the behavior of tornado time-series in the U.S. from the perspective of dynamical systems. A tornado is a violently rotating column of air extending from a cumulonimbus cloud down to the ground. Such phenomena reveal features that are well described by power law functions and unveil characteristics found in systems with long range memory effects. Tornado time series are viewed as the output of a complex system and are interpreted as a manifestation of its dynamics. Tornadoes are modeled as sequences of Dirac impulses with amplitude proportional to the events size. First, a collection of time series involving 64 years is analyzed in the frequency domain by means of the Fourier transform. The amplitude spectra are approximated by power law functions and their parameters are read as an underlying signature of the system dynamics. Second, it is adopted the concept of circular time and the collective behavior of tornadoes analyzed. Clustering techniques are then adopted to identify and visualize the emerging patterns.

A system model and stack for the parallelization of time-critical applications on many-core architectures

3rd Workshop on High-performance and Real-time Embedded Systems (HIRES 2015). 21, Jan, 2015. Amsterdam, Netherlands.