• Title/Summary/Keyword: T subset

검색결과 267건 처리시간 0.025초

T subset정량(定量)을 위한 항우적혈구(抗牛赤血球) IgG항체(抗體)의 분리.정제(分離.精製)(I) (Purification of Anti-ox Red Blood Cell IgG Antibody for T subset Assay)

  • 하윤문;이진용;임수덕
    • 대한미생물학회지
    • /
    • 제15권1호
    • /
    • pp.71-75
    • /
    • 1980
  • 사람에 있어서 면역(免疫)담당세포의 하나인 T세포(細胞)는 몇몇 subpoulation으로 나누어지고 있으며 그중 $T_M$$T_G$를 동정(同定)하는 수단으로 사용되는 우적혈구항체(牛赤血球抗體)중에서 우선 순수(純粹) IgG항체(抗體)를 분리(分離) 정제(精製)하였으며, 이 정제(精製)된 IgG항체(抗體)는 표준제품(標準製品)과의 비교실험(比較實驗)에서 $T_G$세포(細胞)의 일치(一致)되는 성적(成績)을 얻을 수 있었다.

  • PDF

WEAK AND STRONG CONVERGENCE OF MANN'S-TYPE ITERATIONS FOR A COUNTABLE FAMILY OF NONEXPANSIVE MAPPINGS

  • Song, Yisheng;Chen, Rudong
    • 대한수학회지
    • /
    • 제45권5호
    • /
    • pp.1393-1404
    • /
    • 2008
  • Let K be a nonempty closed convex subset of a Banach space E. Suppose $\{T_{n}\}$ (n = 1,2,...) is a uniformly asymptotically regular sequence of nonexpansive mappings from K to K such that ${\cap}_{n=1}^{\infty}$ F$\(T_n){\neq}{\phi}$. For $x_0{\in}K$, define $x_{n+1}={\lambda}_{n+1}x_{n}+(1-{\lambda}_{n+1})T_{n+1}x_{n},n{\geq}0$. If ${\lambda}_n{\subset}[0,1]$ satisfies $lim_{n{\rightarrow}{\infty}}{\lambda}_n=0$, we proved that $\{x_n\}$ weakly converges to some $z{\in}F\;as\;n{\rightarrow}{\infty}$ in the framework of reflexive Banach space E which satisfies the Opial's condition or has $Fr{\acute{e}}chet$ differentiable norm or its dual $E^*$ has the Kadec-Klee property. We also obtain that $\{x_n\}$ strongly converges to some $z{\in}F$ in Banach space E if K is a compact subset of E or there exists one map $T{\in}\{T_{n};n=1,2,...\}$ satisfy some compact conditions such as T is semi compact or satisfy Condition A or $lim_{n{\rightarrow}{\infty}}d(x_{n},F(T))=0$ and so on.

T-cell subset 정량(定量)을 위한 항우적혈구(抗牛赤血球) IgM 항체(抗體)의 분리(分離) 정제(精製)(II) (Purification of Anti-Ox Red Blood Cell IgM Antibody for T-cell Subset Assay)

  • 하윤문;호순태
    • 대한미생물학회지
    • /
    • 제18권1호
    • /
    • pp.67-71
    • /
    • 1983
  • Antisera to ox red blood cells were prepared by injection of ox red blood cell stroma without adjuvant in outbred white rabbits. Purified IgM fraction for T-cell subset assay was obtained from these rabbit anti-ox red blood cell stroma antisera by precipitation with 50% saturated ammonium sulphate followed by DEAE-Cellulose chromatography and Sephadex G-200 gel filtration. The serological identification of purified IgM fraction was achieved by immunoelectrophoresis with guinea pig antiserum against rabbit anti-ox red blood cell IgM antibody.

  • PDF

On the edge independence number of a random (N,N)-tree

  • J. H. Cho;Woo, Moo-Ha
    • 대한수학회보
    • /
    • 제33권1호
    • /
    • pp.119-126
    • /
    • 1996
  • In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.

  • PDF

VIABILITY FOR SEMILINEAR DIFFERENTIAL EQUATIONS OF RETARDED TYPE

  • Dong, Qixiang;Li, Gang
    • 대한수학회보
    • /
    • 제44권4호
    • /
    • pp.731-742
    • /
    • 2007
  • Let X be a Banach space, $A:D(A){\subset}X{\rightarrow}X$ the generator of a compact $C_0-semigroup\;S(t):X{\rightarrow}X,\;t{\geq}0$, D a locally closed subset in X, and $f:(a,b){\times}C([-q,0];X){\rightarrow}X$ a function of Caratheodory type. The main result of this paper is that a necessary and sufficient condition in order that D be a viable domain of the semi linear differential equation of retarded type $$u#(t)=Au(t)+f(t,u_t),\;t{\in}[t_0,\;t_0+T],{u_t}_0={\phi}{\in}C([-q,0];X)$$ is the tangency condition $$\limits_{h{\downarrow}0}^{lim\;inf\;h^{-1}d(S(h)v(0)+hf(t,v);D)=0}$$ for almost every $t{\in}(a,b)$ and every $v{\in}C([-q,0];X)\;with\;v(0){\in}D$.

WEYL TYPE-THEOREMS FOR DIRECT SUMS

  • Berkani, Mohammed;Zariouh, Hassan
    • 대한수학회보
    • /
    • 제49권5호
    • /
    • pp.1027-1040
    • /
    • 2012
  • The aim of this paper is to study the Weyl type-theorems for the orthogonal direct sum $S{\oplus}T$, where S and T are bounded linear operators acting on a Banach space X. Among other results, we prove that if both T and S possesses property ($gb$) and if ${\Pi}(T){\subset}{\sigma}_a(S)$, ${\PI}(S){\subset}{\sigma}_a(T)$, then $S{\oplus}T$ possesses property ($gb$) if and only if ${\sigma}_{SBF^-_+}(S{\oplus}T)={\sigma}_{SBF^-_+}(S){\cup}{\sigma}_{SBF^-_+}(T)$. Moreover, we prove that if T and S both satisfies generalized Browder's theorem, then $S{\oplus}T$ satis es generalized Browder's theorem if and only if ${\sigma}_{BW}(S{\oplus}T)={\sigma}_{BW}(S){\cup}{\sigma}_{BW}(T)$.

CONVERGENCE OF VISCOSITY APPROXIMATIONS TO FIXED POINTS OF NONEXPANSIVE NONSELF-MAPPINGS IN BANACH SPACES

  • Jung, Jong-Soo
    • East Asian mathematical journal
    • /
    • 제24권1호
    • /
    • pp.81-95
    • /
    • 2008
  • Let E be a uniformly convex Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm, C a nonempty closed convex subset of E, and $T\;:\;C\;{\rightarrow}\;E$ a nonexpansive mapping satisfying the weak inwardness condition. Assume that every weakly compact convex subset of E has the fixed point property. For $f\;:\;C\;{\rightarrow}\;C$ a contraction and $t\;{\in}\;(0,\;1)$, let $x_t$ be a unique fixed point of a contraction $T_t\;:\;C\;{\rightarrow}\;E$, defined by $T_tx\;=\;tf(x)\;+\;(1\;-\;t)Tx$, $x\;{\in}\;C$. It is proved that if {$x_t$} is bounded, then $x_t$ converges to a fixed point of T, which is the unique solution of certain variational inequality. Moreover, the strong convergence of other implicit and explicit iterative schemes involving the sunny nonexpansive retraction is also given in a reflexive and strictly convex Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm.

  • PDF

SUBTOURNAMENTS ISOMORPHIC TO W5 OF AN INDECOMPOSABLE TOURNAMENT

  • Belkhechine, Houmem;Boudabbous, Imed;Hzami, Kaouthar
    • 대한수학회지
    • /
    • 제49권6호
    • /
    • pp.1259-1271
    • /
    • 2012
  • We consider a tournament T = (V,A). For each subset X of V is associated the subtournament T(X) = (X,$A{\cap}(X{\times}X)$) of T induced by X. We say that a tournament T' embeds into a tournament T when T' is isomorphic to a subtournament of T. Otherwise, we say that T omits T'. A subset X of V is a clan of T provided that for a, $b{\in}X$ and $x{\in}V{\backslash}X$, $(a,x){\in}A$ if and only if $(b,x){\in}A$. For example, ${\emptyset}$, $\{x\}(x{\in}V)$ and V are clans of T, called trivial clans. A tournament is indecomposable if all its clans are trivial. In 2003, B. J. Latka characterized the class ${\tau}$ of indecomposable tournaments omitting a certain tournament $W_5$ on 5 vertices. In the case of an indecomposable tournament T, we will study the set $W_5$(T) of vertices $x{\in}V$ for which there exists a subset X of V such that $x{\in}X$ and T(X) is isomorphic to $W_5$. We prove the following: for any indecomposable tournament T, if $T{\notin}{\tau}$, then ${\mid}W_5(T){\mid}{\geq}{\mid}V{\mid}$ -2 and ${\mid}W_5(T){\mid}{\geq}{\mid}V{\mid}$ -1 if ${\mid}V{\mid}$ is even. By giving examples, we also verify that this statement is optimal.

부분집합 합 문제의 일반화된 감산 알고리즘 (A Generalized Subtractive Algorithm for Subset Sum Problem)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제22권2호
    • /
    • pp.9-14
    • /
    • 2022
  • 본 논문은 부분집합 합 문제의 해를 수행 복잡도 O(nlogn)으로 얻는 알고리즘을 제안하였다. SSP는 집합 S의 원소가 초증가수열과 랜덤수열로 구성된 경우로 구분된다. 초증가수열 SSP의 해를 구하는 알고리즘은 수행 복잡도 O(nlogn)의 가산 알고리즘 (Additive Algorithm)이 제안되었다. 그러나 랜덤수열 SSP의 해를 구하는 알고리즘은 2n-1의 가능한 모든 경우수를 확인하는 Brute-Force 방법으로 수행 복잡도는 O(n2n)만이 알려져 있다. 결국, SSP는 NP-완전 (NP-Complete) 문제로 알려져 있다. 본 논문은 초증가수열과 랜덤수열 SSP에 대해 수행 복잡도 O(nlogn)으로 해를 구하는 감산 알고리즘 을 제안하였다. 기존 개념은 목표 값 t보다 작은 값으로 구성된 부분집합 S에 대해 부분집합의 합에서 목표값을 뺀 값을 잉여량 (Residual, r)으로 하여 잉여량 보다 작은 값들 중 최대 값을 S에서 제거하는 방법을 적용하였다. 제안된 알고리즘을 다양한 초증가수열과 랜덤수열 SSP에 적용한 결과 S의 원소 개수보다 적은 수행 횟수로 해를 빠르게 얻는데 성공하였다. 결국, 제안된 알고리즘은 SSP의 해를 얻는 일반적인 알고리즘으로 적용할 수 있을 것이다.