Gradual Decline in Malaria-Specific Memory T Cell Responses Leads to Failure to Maintain Long-Term Protective Immunity to Plasmodium chabaudi AS Despite Persistence of B Cell Memory and Circulating Antibody

The mechanisms responsible for the generation and maintenance of immunological memory to Plasmodium are poorly understood and the reasons why protective immunity in humans is so difficult to achieve and rapidly lost remain a matter for debate. A possible explanation for the difficulty in building up an efficient immune response against this parasite is the massive T cell apoptosis resulting from exposure to high-dose parasite Ag. To determine the immunological mechanisms required for long-term protection against P. chabaudi malaria and the consequences of high and low acute phase parasite loads for acquisition of protective immunity, we performed a detailed analysis of T and B cell compartments over a period of 200 days following untreated and drug-treated infections in female C57BL/6 mice. By comparing several immunological parameters with the capacity to control a secondary parasite challenge, we concluded that loss of full protective immunity is not determined by acute phase parasite load nor by serum levels of specific IgG2a and IgG1. Abs, but appears to be a consequence of the progressive decline in memory T cell response to parasites, which occurs similarly in untreated and drug-treated mice with time after infection. Furthermore, by analyzing adoptive transfer experiments, we confirmed the major role of CD4(+) T cells for guaranteeing long-term full protection against P. chabaudi malaria. The Journal of Immunology, 2008, 181: 8344-8355.

Transcriptional memory and switching in the Plasmodium falciparum rif gene family

The human malaria parasite Plasmodium falciparum expresses erythrocyte-surface directed variant antigens which are important virulence factors Many are transcribed from multigene families and presumably their mode of expression is strictly controlled to guarantee immune evasion in the human host. In order to elucidate the dynamics of rif transcription and to investigate if rif switching is comparable to var switching we monitored rif variant gene expression in parasites with different cytoadhesive properties as well as after a number of reinvasions. We found identical transcripts in parasite lines with different adhesive phenotypes suggesting that rif genes do not have a critical role in determining the cytoadhesion specificity of infected erythrocytes. We show for the first time that rif genes may show a conserved mode of transcription, maintaining the previously dominant rif transcript in subsequent reinvasions, but also observed rapid switching at rates up to 45% per generation, much higher than for the var gene family. (C) 2009 Elsevier B.V. All rights reserved.

Circadian phase and intertrial interval interfere with social recognition memory

A modified version of the social habituation/dis-habituation paradigm was employed to examine social recognition memory in Wistar rats during two opposing (active and inactive) circadian phases, using different intertrial intervals (30 and 60 min). Wheel-running activity was monitored continuously to identify circadian phase. To avoid possible masking effects of the light-dark cycle, the rats were synchronized to a skeleton photoperiod, which allowed testing during different circadian phases under identical lighting conditions. In each trial, an infantile intruder was introduced into an adult`s home-cage for a 5-minute interaction session, and social behaviors were registered. Rats were exposed to 5 trials per day for 4 consecutive days: oil days I and 2, each resident was exposed to the same intruder; on days 3 and 4, each resident was exposed to a different intruder in each trial. I he resident`s social investigatory behavior was more intense when different intruders were presented compared to repeated presentation of the same intruder, suggesting social recognition memory. This effect was stronger when the rats were tested during the inactive phase and when the intertrial interval was 60 min, These findings Suggest that social recognition memory, as evaluated in this modified habituation/dis-habituation paradigm, is influenced by the circadian rhythm phase during which testing is performed, and by intertrial interval. (C) 2008 Elsevier Inc. All rights reserved.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

A thermoelastic system of memory type in noncylindrical domains

In this paper, we consider a hyperbolic thermoelastic system of memory type in domains with moving boundary. The problem models vibrations of an elastic bar under thermal effects according to the heat conduction law of Gurtin and Pipkin. Global existence is proved by using the penalty method of Lions. (c) 2007 Elsevier Inc. All rights reserved.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.