Transport of animals between rooms: A little-noted aspect of laboratory procedure that may interfere with memory

This study investigated the effects of transporting animals from the experimental room to the animal facility in between experimental sessions, a procedure routinely employed in experimental research, on long-term social recognition memory. By using the intruder-resident paradigm, independent groups of Wistar rats exposed to a 2-h encounter with an adult intruder were transported from the experimental room to the animal facility either 0.5 or 6h after the encounter. The following day, residents were exposed to a second encounter with either the same or a different (unfamiliar) intruder. Resident`s social and non-social behaviors were carefully scored and subjected to Principal Component Analysis, thus allowing to parcel out variance and relatedness among these behaviors. Resident rats transported 6h after the first encounter exhibited reduced amount of social investigation towards familiar intruders, but an increase of social investigation when exposed to a different intruder as compared to the first encounter. These effects revealed a consistent long-lasting (24h) social recognition memory in rats. In contrast, resident rats transported 0.5 h after the first encounter did not exhibit social recognition memory. These results indicate that this common, little-noted, laboratory procedure disturbs long-term social recognition memory. (C) 2011 Elsevier B.V. All rights reserved.

Iterative strong coupling of dimensionally heterogeneous models

In this article we address decomposition strategies especially tailored to perform strong coupling of dimensionally heterogeneous models, under the hypothesis that one wants to solve each submodel separately and implement the interaction between subdomains by boundary conditions alone. The novel methodology takes full advantage of the small number of interface unknowns in this kind of problems. Existing algorithms can be viewed as variants of the `natural` staggered algorithm in which each domain transfers function values to the other, and receives fluxes (or forces), and vice versa. This natural algorithm is known as Dirichlet-to-Neumann in the Domain Decomposition literature. Essentially, we propose a framework in which this algorithm is equivalent to applying Gauss-Seidel iterations to a suitably defined (linear or nonlinear) system of equations. It is then immediate to switch to other iterative solvers such as GMRES or other Krylov-based method. which we assess through numerical experiments showing the significant gain that can be achieved. indeed. the benefit is that an extremely flexible, automatic coupling strategy can be developed, which in addition leads to iterative procedures that are parameter-free and rapidly converging. Further, in linear problems they have the finite termination property. Copyright (C) 2009 John Wiley & Sons, Ltd.

NeXSPheRIO results on elliptic-flow fluctuations at RHIC

By using the NeXSPheRIO code, we study the elliptic-flow fluctuations in Au + Au collisions at 200 A GeV. It is shown that, by fixing the parameters of the model to correctly reproduce the charged pseudorapidity and the transverse-momentum distributions, reasonable agreement of < v(2)> with data is obtained, both as function of pseudorapidity as well as of transverse momentum, for charged particles. Our results on elliptic-flow fluctuations are in good agreement with the recently measured data on experiments.