Conventional alphabeta T cell precursors undergo positive selection in the thymic cortex. When this is successful, they migrate to the medulla and are exposed to tissue-specific antigens (TSA) for purposes of central tolerance, and they undergo maturation to become functionally responsive T cells. It is commonly understood that thymocytes spend up to 2 wk in the medulla undergoing these final m...

Mouse CD1.1 is an MHC class I-like, non-MHC-encoded, surface glycoprotein that can be recognized by T cells, in particular NK1.1+ T cells, a subset of alphabeta T cells with semiinvariant TCRs that promptly releases potent cytokines such as IL-4 and IFN-gamma upon stimulation. To gain insight into the function of CD1.1, a panel of nine mAbs was generated and used to biochemically characterize a...

Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative 2-dimensional syntax for multiplicative linear logic derivations. The syntax of string diagrams authorizes the definition of a framework where the sequentializabi...

‎Triangular matrix rings are examples of trivial extensions‎. ‎In this article we determine the structure of derivations and biderivations of the trivial extensions‎, ‎and thereby we describe the derivations and biderivations of the upper triangular matrix rings‎. ‎Some related results are also obtained‎.

How structural adaptability exists alongside HLA-A2 bias in the human alphabeta TCR repertoire" (2016).

A general definition of a linear connection in noncommutative geometry has been recently proposed. Two examples are given of linear connections in noncommutative geometries which are based on matrix algebras. They both possess a unique metric connection. 1 Introduction and Motivation The extension to noncommutative algebras of the notion of a differential calculus has been given both without (C...

In this paper, we investigate related properties of some particular derivations and give some characterizations of additive derivations in MV-algebras. Then, we obtain that the fixed point set of additive derivations is still an MV-algebra. Also, we study Boolean additive derivations and their adjoint derivations. In particular, we get that the fixed point set of Boolean addition derivations an...

‎in this paper‎, ‎using fixed point method‎, ‎we prove the generalized hyers-ulam stability of‎ ‎random homomorphisms in random $c^*$-algebras and random lie $c^*$-algebras‎ ‎and of derivations on non-archimedean random c$^*$-algebras and non-archimedean random lie c$^*$-algebras for‎ ‎the following $m$-variable additive functional equation:‎ ‎$$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...

We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise implementations in Elf, a constraint logic programming language based on the LF logical f...