• 제목/요약/키워드: M/G Set

검색결과 539건 처리시간 0.028초

SOLVABILITY AND BOUNDEDNESS FOR GENERAL VARIATIONAL INEQUALITY PROBLEMS

  • Luo, Gui-Mei
    • 대한수학회보
    • /
    • 제50권2호
    • /
    • pp.589-599
    • /
    • 2013
  • In this paper, we propose a sufficient condition for the existence of solutions to general variational inequality problems (GVI(K, F, $g$)). The condition is also necessary when F is a $g-P^M_*$ function. We also investigate the boundedness of the solution set of (GVI(K, F, $g$)). Furthermore, we show that when F is norm-coercive, the general complementarity problems (GCP(K, F, $g$)) has a nonempty compact solution set. Finally, we establish some existence theorems for (GNCP(K, F, $g$)).

PC/Monitior 구성 화학부품 및 제품에서 방출되는 휘발성 유기화합물의 분석 (Analysis of Volatile Organic Compounds Emitted from Chemical Parts and Monitor Set of PC/Monitor)

  • 최종우;백규원;이창섭
    • 대한화학회지
    • /
    • 제44권5호
    • /
    • pp.415-421
    • /
    • 2000
  • PC/Monitor 제품 및 구성 화학부품들로부터 방출되는 휘발성 유기화합물(volatile organic compounds, VOCs)의 종류와 시간에 따른 방출경향을 분석하였다. 잔류가스 분석기(residual gas analyzer, RGA)와 GC-MS를 이용하여 monitor제품 및 화학부품들로부터 방출되 는 VOCs를 정성분석 하였으며, 정성분석된 VOCs중 toluene,cylclohexanone, benzofuran 및 xylene에 대하여 GC-MS로 정량분석을 수행하였다. 분석결과, 고무제품인 wedge rubber은 60 $^{\circ}C$에서 80$^{\circ}C$로 상승할 때 xylene의 발생율(%)이 2.5배 가량 증가하였지만, 나머지 화학부품들은 VOCs의 방출이 온도의 영향을 별로 받지 않는 것으로 평가되었다. RGA와 GC-MS의 화학부품들에 대한 정성분석 결과는 다소 다르게 나타났으나, 정량분석결과는 cabine의 xylene 농도가 6029.3${\mu}g/m^3$(1.3ppm)으로 최고치를 나타내었고, monitor 제품에서 방출된 toluene,xylene 및 benzofuran의 농도 또한 각각 10.25${\mu}g/m^3$, 690${\mu}g/m^3$, 180${\mu}g/m^3$으로 건강상의 장해를 일으킬 수 있는 수준인 비교적 높은 수치로 나타났다.

  • PDF

DECOMPOSITION OF CONTINUITY AND COMPLETE CONTINUITY IN SMOOTH FUZZY TOPOLOGICAL SPACES

  • Amudhambigai, B.;Uma, M.K.;Roja, E.
    • East Asian mathematical journal
    • /
    • 제27권3호
    • /
    • pp.261-271
    • /
    • 2011
  • In this paper, fuzzy ${\alpha}^*$-set, fuzzy C-set, fuzzy AB-set, fuzzy t-set, fuzzy B-set, etc., are introduced in the sense of Sostak [12] and Ramadan [9]. By using these sets, a decomposition of fuzzy continuity and complete fuzzy continuity are provided. Characterization of smooth fuzzy extremally disconnected spaces is also obtained in this connection.

Design of a set of One-to-Many Node-Disjoint and Nearly Shortest Paths on Recursive Circulant Networks

  • Chung, Ilyong
    • 한국멀티미디어학회논문지
    • /
    • 제16권7호
    • /
    • pp.897-904
    • /
    • 2013
  • The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

NIJENHUIS TENSOR FUNCTIONAL ON A SUBSPACE OF METRICS

  • Kang, Bong-Koo
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제1권1호
    • /
    • pp.13-18
    • /
    • 1994
  • The study of the integral of the scalar curvature, $A(g)\;=\;{\int}_M\;RdV_9$ as a functional on the set M of all Riemannian metrics of the same total volume on a compact orient able manifold M is now classical, dating back to Hilbert [6] (see also Nagano [8]). Riemannian metric g is a critical point of A(g) if and only if g is an Einstein metric.(omitted)

  • PDF

Optimal(m,N)-policy for M/G/1 queue with set-up time

  • 박정옥;이순석;이호우
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
    • /
    • pp.57-57
    • /
    • 1993
  • PDF

TANGENTIAL REPRESENTATIONS AT ISOLATED FIXED POINTS OF ODD-DIMENSIONAL G-MANIFOLDS

  • Komiya, Katsuhiro
    • 대한수학회보
    • /
    • 제45권1호
    • /
    • pp.33-37
    • /
    • 2008
  • Let G be a compact abelian Lie group, and M an odd-dimensional closed smooth G-manifold. If the fixed point set $M^G\neq\emptyset$ and dim $M^G=0$, then G has a subgroup H with $G/H{\cong}\mathbb{Z}_2$, the cyclic group of order 2. The tangential representation $\tau_x$(M) of G at $x{\in}M^G$ is also regarded as a representation of H by restricted action. We show that the number of fixed points is even, and that the tangential representations at fixed points are pairwise isomorphic as representations of H.

On the fixed-point theorems on the infrasolvmanifolds

  • Chun, Dae-Shik;Jang, Chan-Gyu;Lee, Sik
    • 대한수학회논문집
    • /
    • 제10권3호
    • /
    • pp.681-688
    • /
    • 1995
  • Fixed-point theory has an extension to coincidences. For a pair of maps $f,g:X_1 \to X_2$, a coincidence of f and g is a point $x \in X_1$ such that $f(x) = g(x)$, and $Coin(f,g) = {x \in X_1 $\mid$ f(x) = g(x)}$ is the coincidence set of f and g. The Nielsen coincidence number N(f,g) and the Lefschetz coincidence number L(f,g) are used to estimate the cardinality of Coin(f,g). The aspherical manifolds whose fundamental group has a normal solvable subgroup of finite index is called infrasolvmanifolds. We show that if $M_1,M_2$ are compact connected orientable infrasolvmanifolds, then $N(f,g) \geq $\mid$L(f,g)$\mid$$ for every $f,g : M_1 \to M_2$.

  • PDF

이중 루프 네트워크의 다대다 서로소인 경로 커버 (Many-to-Many Disjoint Path Covers in Double Loop Networks)

  • 박정흠
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제32권8호
    • /
    • pp.426-431
    • /
    • 2005
  • 그래프 G의 다대다 k-서로소인 경로 커버(k-DPC)는 k개의 서로 다른 소스 정점과 싱크 정점 쌍을 연결하며 그래프에 있는 모든 정점을 지나는 k개의 서로소인 경로 집합을 말한다. 이 논문에서는 이중 루프 네트워크 G(mn;1,m)에서 다대다 2-DPC를 고찰하여, 이분 그래프가 아닌 모든 G(mn;l,m), $m{\geq}3$은 임의의 두 소스-싱크 쌍을 연결하는 다대다 2-DPC가 존재하고 이분 그래프인 G(mn;1,m)은 두 흰색-검정 소스-싱크 쌍이거나 혹은 검정-검정, 흰색-흰색 쌍을 연결하는 2-DPC가 존재함을 보인다. G(mn;1,m)은 m이 홀수이고 n이 짝수일 경우에만 이분 그래프이다.