Transport is the primary determinant of glycine content in retinal neurons

This study demonstrates that in mammalian and nonmammalian species it is possible to deplete selectively and reversibly retinal glycinergic neurons of their content of glycine by exposure to sarcosine, a competitive inhibitor of glycine transporter 1 (glyt-1). This observation was used as a tool to test the hypothesis that uptake of glycine rather than de novo synthesis is the main determinant of glycine content in retinal neurons. Isolated retinae were depleted of immunocytochemically detectable pools of glycine. Thereafter retinae were exposed either to physiological medium containing glycine or to medium lacking glycine but containing precursors for the synthesis of glycine. Retinae exposed to glycine-containing medium rapidly recovered their content of glycine, whereas retinae exposed to medium lacking glycine but containing serine, a substrate for synthesis of glycine, showed only a slow recovery of immunoreactivity for glycine in a few amacrine cells. These data indicate that uptake of glycine is the primary determinant of glycine content in most retinal glycinergic neurons. The origins of the extracellular pools of glycine remain to be identified; however, it is suggested that such glycine may be derived from the vitreous humor and that in turn this glycine may be derived from the peripheral circulation.     

B lymphocytes are critical antigen-presenting cells for the initiation of T cell-mediated autoimmune diabetes in nonobese diabetic mice

Nonobese diabetic (NOD) mice genetically deficient in B lymphocytes (NODJg mu(null)) are resistant to T cell-mediated autoimmune insulin-dependent diabetes mellitus (IDDM). Ig infusions from diabetic NOD donors did not abrogate IDDM resistance in NODJg mu(null) mice. However, T cell responses to the candidate pancreatic beta cell autoantigen glutamic acid decarboxylase (GAD), but not the control Ag keyhole limpet hemocyanin, were eliminated in NODJg mu(null) mice. To initially test whether they contribute to IDDM as APC, NOD B lymphocytes were transferred into NODJg mu(null) recipients. B lymphocytes transferred into unmanipulated NODJg mu(null) recipients were rejected by MHC class I-restricted T cells. Stable T and B lymphocyte repopulation was achieved in irradiated NODJg mu(null) mice reconstituted with syngeneic bone marrow admixed with NOD B lymphocytes. IDDM susceptibility was restored in NODJg mu(null) mice reconstituted with syngeneic marrow plus B lymphocytes, but not with syngeneic marrow only. T cell responses to GAD were restored only in NODJg mu(null) mice reconstituted with syngeneic marrow plus B lymphocytes. Hence, B lymphocytes appear to contribute to IDDM in NOD mice as APC with a preferential ability to present certain beta cell Ags such as GAD to autoreactive T cells.     

A generalized framework for interactive dynamic simulation for multirigid bodies

This paper presents a generalized framework for dynamic simulation realized in a prototype simulator called the Interactive Generalized Motion Simulator (I-GMS), which can simulate motions of multirigid-body systems with contact interaction in virtual environments. I-GMS is designed to meet two important goals: generality and interactivity. By generality, we mean a dynamic simulator which can easily support various systems of rigid bodies, ranging from a single free-flying rigid object to complex linkages such as those needed for robotic systems or human body simulation. To provide this generality, we have developed I-GMS in an object-oriented framework. The user interactivity is supported through a haptic interface for articulated bodies, introducing interactive dynamic simulation schemes. This user-interaction is achieved by performing push and pull operations via the PHANToM haptic device, which runs as an integrated part of I-GMS. Also, a hybrid scheme was used for simulating internal contacts (between bodies in the multirigid-body system) in the presence of friction, which could avoid the nonexistent solution problem often faced when solving contact problems with Coulomb friction. In our hybrid scheme, two impulse-based methods are exploited so that different methods are applied adaptively, depending on whether the current contact situation is characterized as "bouncing" or "steady." We demonstrate the user-interaction capability of I-GMS through on-line editing of trajectories of a 6-degree of freedom (dof) articulated structure.     

A CPU–GPU framework for optimizing the quality of large meshes

The automatic generation of 3D finite element meshes (FEM) is still a bottleneck for the simulation of large fluid dynamic problems. Although today there are several algorithms that can generate good meshes without user intervention, in cases where the geometry changes during the calculation and thousands of meshes must be constructed, the computational cost of this process can exceed the cost of the FEM. There has been a lot of work in FEM parallelization and the algorithms work well in different parallel architectures, but at present there has not been much success in the parallelization of mesh generation methods. This paper will present a massive parallelization scheme for re-meshing with tetrahedral elements using the local modification algorithm. This method is frequently used to improve the quality of elements once the mesh has been generated, but we will show it can also be applied as a regeneration process, starting with the distorted and invalid mesh of the previous step. The parallelization is carried out using OpenCL and OpenMP in order to test the method in a multiple CPU architecture and also in Graphics Processing Units (GPUs). Finally we present the speedup and quality results obtained in meshes with hundreds of thousands of elements and different parallel APIs.     

LFTB: An Efficient Algorithm to Bound Linear Fractional Transformations

This work presents an efficient algorithm to solve a structured semidefinite program (SDP) with important applications in the analysis of uncertain linear systems. The solution to this particular SDP gives an upper bound for the maximum singular value of a multidimensional rational matrix function, or linear fractional transformation, over a box of n real parameters. The proposed algorithm is based on a known method for solving semidefinite programs. The key features of the algorithm are low memory requirements, low cost per iteration, and efficient adaptive rules to update algorithm parameters. Proper utilization of the structure of the semidefinite program under consideration leads to an algorithm that reduced the cost per iteration and memory requirements of existing general-purpose SDP solvers by a factor of O(n). Thus, the algorithm in this paper achieves substantial savings in computing resources for problems with a large number of parameters. Additional savings are obtained when the problem data includes block-circulant matrices as is the case in the analysis of uncertain mechanical structures with spatial symmetry.     

Finite-time control of discrete-time linear systems: Analysis and design conditions

In this paper we deal with some finite-time control problems for discrete-time, time-varying linear systems. First we provide necessary and sufficient conditions for finite-time stability; these conditions require either the computation of the state transition matrix of the system or the solution of a certain difference Lyapunov inequality. Then we address the design problem. The proposed conditions allow us to find output feedback controllers which stabilize the closed loop system in the finite-time sense; all these conditions can be expressed in terms of LMIs and therefore are numerically tractable, as shown in the example included in the paper.