نتایج جستجو برای: نسل 2m

تعداد نتایج: 11327  

Journal: :The Journal of Experimental Medicine 1992
R Glas K Sturmhöfel G J Hämmerling K Kärre H G Ljunggren

It has frequently been suggested that loss of beta 2-microglobulin (beta 2m) in tumor cells may lead to malignant progression due to escape from immunological recognition. Here, we directly tested the role of beta 2m expression in tumorigenicity. A beta 2 m loss mutant (C4.4-25-), selected from the murine lymphoma EL-4, showed a marked reduction in tumorigenicity as compared with EL-4 in normal...

Journal: :Folia morphologica 2001
A Niezgoda J Losy P D Mehta

beta-2 Microglobulin (beta 2M) is a low molecular weight protein located extracellularly and associated with class 1 antigens of the major histocompatibility complex and is considered a marker for disease activity in immune disorders. Cladribine (2-chloro-2-deoxyadenosine, 2-CDA) is a potent lymphocytotoxic agent under investigation in the treatment in MS patients. As beta 2M levels may indicat...

Journal: :The journal of physical chemistry. B 2005
Seishi Shimizu Maria Sabaye Moghaddam Hue Sun Chan

Recently, using the TIP4P water model, Czaplewski et al.1 showed that the three-methane potential of mean force (PMF) in water at 298 K for their 2m+m system (i.e., the trimer case with isosceles-triangle geometry in their Figure 1b) is anticooperative at the contact minimum. Apparently, this conclusion is in qualitative agreement with our previous TIP4P simulation results, which have indicated...

Journal: :JCP 2009
Youyao Liu Jungang Han Huimin Du

With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the performance and area of System-on-Chip(SoC) design. Network-on-Chip(NoC) has been proposed as a promising solution to complex SoC communication problems and has been widely accepted by academe and industry. Focusing on de...

Journal: :The Journal of biological chemistry 1985
J P Quigley P B Armstrong

A high molecular weight protease inhibitor has been purified from the cell-free plasma of the horseshoe crab Limulus polyphemus using high speed centrifugation, polyethylene glycol precipitation, and gel filtration. The inhibitor is sensitive to mild acidification, methylamine treatment, and inhibits the proteolytic activity of a variety of endopeptidases. The molecule does not inhibit trypsin-...

Journal: :Journal of The Mathematical Society of Japan 2021

A rational number $r$ is called a left orderable slope of knot $K \subset S^3$ if the 3-manifold obtained from $S^3$ by $r$-surgery along $K$ has fundamental group. In this paper we consider double twist knots $C(k, l)$ in Conway notation. For any positive integers $m$ and $n$, show that form $C(2m, -2n)$, $C(2m+1, 2n)$ or -2n)$ then there an explicit unbounded interval $I$ such $r \in I$ $K$.

Journal: :Algebras and Representation Theory 2023

Abstract We use the Gauss decomposition of generator matrix in R -matrix presentation Yangian for orthosymplectic Lie superalgebra $$\mathfrak {osp}_{N|2m}$$ osp N | 2 m to produce its Drinfeld-ty...

Journal: :Discrete Mathematics 2009
Hung-Lin Fu Yuan-Hsun Lo

A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m + 1 vertices K2m+1 can be properly edge-colored with 2m+ 1 colors in such a way that the edges of K2m+1 can be partitioned intommulticolored Hamiltonian cycles. © 2009 Published by Elsevier B.V.

Journal: :Discrete Applied Mathematics 2003
Yuri L. Borissov Nikolai L. Manev Svetla Nikova

First, we compute the number of non-minimal codewords of weight 2dmin in the binary Reed-Muller code RM(r,m). Second, we prove that all codewords of weight greater than 2m − 2m−r+1 in binary RM(r,m), are non-minimal.

Journal: :SIAM J. Discrete Math. 2006
Saieed Akbari A. Alipour Hung-Lin Fu Yuan-Hsun Lo

A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m (m = 2) vertices K2m can be properly edge-colored with 2m − 1 colors in such a way that the edges of K2m can be partitioned into m multicolored isomorphic spanning trees.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید