• Title/Summary/Keyword: G.I.S

Search Result 5,074, Processing Time 0.034 seconds

A UNIFORM LAW OF LARGE MUNBERS FOR PRODUCT RANDOM MEASURES

  • Kil, Byung-Mun;Kwon, Joong-Sung
    • 대한수학회보
    • /
    • 제32권2호
    • /
    • pp.221-231
    • /
    • 1995
  • Let $Z_1, Z_2, \ldots, Z_l$ be random set functions or intergrals. Then it is possible to discuss their products. In the case of random integrals, $Z_i$ is a random set function indexed y a family, $G_i$ say, of real valued functions g on $S_i$ for which the integrals $Z_i(g) = \smallint gdZ_i$ are well defined. If $g_i = \in g_i (i = 1, 2, \ldots, l) and g_1 \otimes \cdots \otimes g_l$ denotes the tensor product $g(s) = g_1(s_1)g_2(s_2) \cdots g_l(s_l) for s = (s_1, s_2, \ldots, s_l) and s_i \in S_i$, then we can defined $Z(g) = (Z_1 \times Z_2 \times \cdots \times Z_l)(g) = Z_1(g_1)Z_2(g_2) \cdots Z_l(g_l)$.

  • PDF

[r, s, t; f]-COLORING OF GRAPHS

  • Yu, Yong;Liu, Guizhen
    • 대한수학회지
    • /
    • 제48권1호
    • /
    • pp.105-115
    • /
    • 2011
  • Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

$Z_2$-VECTOR BUNDLES OVER $S^1$

  • Kim, Sung-Sook
    • 대한수학회논문집
    • /
    • 제9권4호
    • /
    • pp.927-931
    • /
    • 1994
  • Let G be a cyclic group of order 2 and let $S^1$ denote the unit circle in $R^2$ with the standard metric. We consider smooth G-vector bundles over $S^1$ when G acts on $S^1$ by reflection. Then the fixed point set of G on $S^1$ is two points ${z_0, z_1}$. Let $E$\mid$_{z_0} and E$\mid$_{z_1}$ be the fiber G-representation spaces at $z_0$ and $z_1$ respectively. We associate an orthogonal G-representation $\rho_i : G \to O(n)$ to $E$\mid$_{z_i}, i = 0, 1$. Let det $p\rho_i(g), g \neq 1$, be denoted by det $E$\mid$_{z_i}$ since det $\rho_i(g)$ is independent of choice of $\rho_i$.

  • PDF

A COVERING CONDITION FOR THE PRIME SPECTRUMS

  • Hwang, Chul-Ju
    • East Asian mathematical journal
    • /
    • 제21권1호
    • /
    • pp.61-64
    • /
    • 2005
  • Let R be a commutative ring with identity, and let $f,\;g_i(i=1,\;\ldots,\;n),\;g_{\alpha}(\alpha{\in}S)$ be elements of R. We show that the following statements are equivalent; (i) $X_f{\subseteq}{\cup}_{\alpha{\in}S}X_{g\alpha}$ only if $X_f{\subseteq}X_{g\alpha}$ for some $\alpha{\in}S$, (ii) $V(f){\subseteq}{\cup}_{\alpha{\in}S}V(g_{\alpha})$ only if $V(f){\subseteq}V(g_{\alpha})$ for some $\alpha{\in}S$, (iii) $V(f){\subseteq}{\cup}^n_{i=1}V(g_i)$ only if $V(f){\subseteq}V(g_i)$ for some i, (iv) Spec(R) is linearly ordered under inclusion.

  • PDF

GROUP S3 CORDIAL REMAINDER LABELING OF SUBDIVISION OF GRAPHS

  • LOURDUSAMY, A.;WENCY, S. JENIFER;PATRICK, F.
    • Journal of applied mathematics & informatics
    • /
    • 제38권3_4호
    • /
    • pp.221-238
    • /
    • 2020
  • Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S3 cordial remainder labeling.

한국 울릉도의 너도밤나무(Fagus multinervis Nakai)림 및 섬잣나무(Pinus parviflora S. et Z.)림의 식물사회학적 연구 (Phytosociological Studies on the Beech(Fagus multinervis Nakai) Forest and the Pine (Pinus parviflora S. et Z.) Forest of Ulreung Island, Korea)

  • 김성덕
    • Journal of Plant Biology
    • /
    • 제29권1호
    • /
    • pp.53-65
    • /
    • 1986
  • The montane forests of Ulreung Island, Korea, were investigated by the ZM school method. By comparing the montane forests of this island with those of Korean Peninsula and of Japan, a new order, F a g e t a l i a m u l t i n e r v i s, a new alliance, F a l g i o n m u l t i n e r v i s, a new association, H e p a t i c o-F a g e t u m m u l t i n e r v i s and Rhododendron brachycarpum-Pinus parviflora community were recognized. The H e p a t i c o - F a g e t u m m u l t i n e r v i s was further subdivided into four subassociations; Subass. of Sasa kurilensis, Subass. of Rumohra standishii, Subass. of Rhododendron brachycarpum and Subass. of typicum. Each community was described in terms of floristic, structural and environmental features.

  • PDF

Kinesin-I의 kinesin heavy chains과 직접 결합하는 heterotrimeric G protein의 β subunit의 규명 (The β Subunit of Heterotrimeric G Protein Interacts Directly with Kinesin Heavy Chains, Kinesin-I)

  • 석대현
    • 생명과학회지
    • /
    • 제20권8호
    • /
    • pp.1166-1172
    • /
    • 2010
  • Kinesin-I은 4분자의 단백질로 구성되어 있으며, N-말단의 motor 영역과 C-말단영역을 가지는 장쇄(KHC, 또한 KIF5s로도 통용) 2분자와 KIF5s (KIF5A, KIF5B와 KIF5C)의 줄기영역과 결합하는 단쇄(KLC) 2분자로 구성되어 있다. KIF5A의 결합 단백질을 동정하기 위하여 효모 two-hybrid system을 사용하여 특이적으로 결합하는 heterotrimeric G 단백질의 ${\beta}$ 단위체 단백질($G{\beta}$)을 분리하였다. $G{\beta}$은 KIF5A의 808에서 935아미노산 부위와 결합하며, 다른 KIF5들과도 결합함을 효모 two-hybrid assay로 확인하였다. 또한 $G{\beta}$의 WD40 반복 서열은 KIF5A와의 결합에 필수영역임을 확인하였으며, 이러한 단백질간의 결합은 Glutathione S-transferase (GST) pull-down assay를 통하여 확인하였다. 생쥐의 뇌 파쇄액에 KIF5들의 항체로 면역침강을 행하여 heterotrimeric G 단백질을 확인한 결과, KIF5들은 heterotrimeric G 단백질과 특이적으로 같이 침강하였다. 이러한 결과들은 kinesin-I는 heterotrimeric G 단백질이 포함된 소포를 미세소관을 따라 이동시킴을 시사한다.

GROUP S3 CORDIAL REMAINDER LABELING FOR PATH AND CYCLE RELATED GRAPHS

  • LOURDUSAMY, A.;WENCY, S. JENIFER;PATRICK, F.
    • Journal of applied mathematics & informatics
    • /
    • 제39권1_2호
    • /
    • pp.223-237
    • /
    • 2021
  • Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that square of the path, duplication of a vertex by a new edge in path and cycle graphs, duplication of an edge by a new vertex in path and cycle graphs and total graph of cycle and path graphs admit a group S3 cordial remainder labeling.

EQUIMULTIPLE GOOD IDEALS WITH HEIGHT 1

  • Kim, Mee-Kyoung
    • 대한수학회지
    • /
    • 제39권1호
    • /
    • pp.127-135
    • /
    • 2002
  • Let I be an ideal in a Gorenstein local ring A with the maximal ideal m. Then we say that I is an equimultiple good ideal in A, if I contains a reduction Q = ( $a_1$, $a_2$,ㆍㆍㆍ, $a_{s}$ ) generated by s elements in A and G(I) =(equation omitted)$_{n 0}$ $I^{n}$ / $I^{n+1}$ of I is a Gorenstein ring with a(G(I)) = 1 - s, where s = h $t_{A}$ I and a(G(I)) denotes the a-invariant of G(I). Let $X_{A}$$^{s}$ denote the set of equimultiple good ideals I in A with h $t_{A}$ I = s, R(I) = A [It] be the Rees algebra of I, and $K_{R(I)}$ denote the canonical module of R(I). Let a I such that $I^{n+l}$ = a $I^{n}$ for some n$\geq$0 and $\mu$$_{A}$(I)$\geq$2, where $\mu$$_{A}$(I) denotes the number of elements in a minimal system of generators of I. Assume that A/I is a Cohen-Macaulay ring. We show that the following conditions are equivalent. (1) $K_{R(I)}$(equation omitted)R(I)+as graded R(I)-modules. (2) $I^2$ = aI and aA : I$\in$ $X^1$$_{A}$._{A}$./.

GROUP S3 MEAN CORDIAL LABELING FOR STAR RELATED GRAPHS

  • A. LOURDUSAMY;E. VERONISHA
    • Journal of applied mathematics & informatics
    • /
    • 제41권2호
    • /
    • pp.321-330
    • /
    • 2023
  • Let G = (V, E) be a graph. Consider the group S3. Let g : V (G) → S3 be a function. For each edge xy assign the label 1 if ${\lceil}{\frac{o(g(x))+o(g(y))}{2}}{\rceil}$ is odd or 0 otherwise. g is a group S3 mean cordial labeling if |vg(i) - vg(j)| ≤ 1 and |eg(0) - eg(1)| ≤ 1, where vg(i) and eg(y)denote the number of vertices labeled with an element i and number of edges labeled with y (y = 0, 1). The graph G with group S3 mean cordial labeling is called group S3 mean cordial graph. In this paper, we discuss group S3 mean cordial labeling for star related graphs.