• Title/Summary/Keyword: upper set

Search Result 881, Processing Time 0.022 seconds

GLOBAL SHAPE OF FREE BOUNDARY SATISFYING BERNOULLI TYPE BOUNDARY CONDITION

  • Lee, June-Yub;Seo, Jin-Keun
    • Journal of the Korean Mathematical Society
    • /
    • v.37 no.1
    • /
    • pp.31-44
    • /
    • 2000
  • We study a free boundary problem satisfying Bernoulli type boundary condition along which the gradient of a piecewise harmonic solution jumps zero to a given constant value. In such problem, the free boundary splits the domain into two regions, the zero set and the harmonic region. Our main interest is to identify the global shape and the location of the zero set. In this paper, we find the lower and the upper bound of the zero set. In a convex domain, easier estimation of the upper bound and faster disk test technique are given to find a rough shape of the zero set. Also a simple proof on the convexity of zero set is given for a connected zero set in a convex domain.

  • PDF

SETS OF WEAK EXPONENTS OF INDECOMPOSABILITY FOR IRREDUCIBLE BOOLEAN MATRICES

  • BO, ZHOU;CHO, HAN-HYUK;KIM, SUH-RYUNG
    • Bulletin of the Korean Mathematical Society
    • /
    • v.42 no.2
    • /
    • pp.415-420
    • /
    • 2005
  • Let $IB_n$ be the set of all irreducible matrices in $B_n$ and let $SIB_n$ be the set of all symmetric matrices in $IB_n$. Finding an upper bound for the set of indices of matrices in $IB_n$ and $SIB_n$ and determining gaps in the set of indices of matrices in $IB_n$ and $SIB_n$ has been studied by many researchers. In this paper, we establish a best upper bound for the set of weak exponents of indecomposability of matrices in $SIB_n\;and\;IB_n$, and show that there does not exist a gap in the set of weak exponents of indecomposability for any of class $SIB_n\;and\;class\;IB_n$.

Pointless Form of Rough Sets

  • FEIZABADI, ABOLGHASEM KARIMI;ESTAJI, ALI AKBAR;ABEDI, MOSTAFA
    • Kyungpook Mathematical Journal
    • /
    • v.55 no.3
    • /
    • pp.549-562
    • /
    • 2015
  • In this paper we introduce the pointfree version of rough sets. For this we consider a lattice L instead of the power set P(X) of a set X. We study the properties of lower and upper pointfree approximation, precise elements, and their relation with prime elements. Also, we study lower and upper pointfree approximation as a Galois connection, and discuss the relations between partitions and Galois connections.

A Study on the Standard Nude Size for Making Men's Casual Wear for the 25~34 Age Group (남성 캐주얼 의류제작을 위한 호칭별 기준 누드사이즈 연구 - 25세~34세를 중심으로 -)

  • Sung, Ok-Jin;Yang, Chung-Eun
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.34 no.4
    • /
    • pp.588-596
    • /
    • 2010
  • This study suggest the size designation and standard nude size in relation to upper and lower garments for casual clothing brands targeting men aged 25 to 34. The nude size designation of upper garments was set at intervals of 5cm based on the bust (97cm). The clothing industry has used different nude size and designations; therefore, the following measurements were established to correspond to each other: bust 87cm- designation 90, bust 92cm- designation 95, bust 97 cm-designation 100, bust 102cm- designation 105, and bust 107cm- designation 110. The nude size designation of lower garments was set at intervals of 2cm based on the waist circumference (omphalion) and the nude size; the clothing designations were used equally. In addition, the standard nude size for upper and lower garments was set at intervals of bust (97cm) and of waist circumference (82cm), respectively, in order to suggest a detailed size.

Improvement of Tubular Shaft Yoke Spline Machining in Both Side IMS Module (양형 IMS 모듈 튜블러 샤프트의 스플라인 가공 개선)

  • Min, Se Hun;Suh, Hyun Kyu
    • Journal of the Korean Society of Mechanical Technology
    • /
    • v.20 no.6
    • /
    • pp.924-928
    • /
    • 2018
  • The objective of this study is to solve a problem that is occurred during the spline machining of tubular shaft yoke in both side IMS module. In order to simulate the problem, the movement direction of upper die was set as standard case and error case. The material of tubular shaft yoke was set to S20C as refer to the analysis library. The movement directions of upper die were separated with standard case and error case. The error case was set to simulate the problem in the spline machining of tubular shaft yoke. In order to solve the problem, the outer radius of upper die were modelled from 9.40mm to 9.44mm. The simulation results were analyzed and compared in terms of effective stress, metal flow line and folding phenomena characteristics. In case of the outer radius of upper die was 9.42mm, it was observed a relatively uniform effective stress distribution and had a straight metal flow line.

On Upper and Lower Z-supercontinuous Multifunctions

  • Akdag, Metin
    • Kyungpook Mathematical Journal
    • /
    • v.45 no.2
    • /
    • pp.221-230
    • /
    • 2005
  • In this paper, we define a multifunction $F:X{\rightarrow}Y$ to be upper (lower) Z -supercontinuous if $F^{+}(V)(F^{-}(V))$ is z-open in X for every open set V of Y. We obtain some characterizations and several properties concerning upper (lower) Z-supercontinuous multifunctions.

  • PDF

A Study on Robust Identification Based on the Validation Evaluation of Model (모델의 타당성 평가에 기초한 로바스트 동정에 관한 연구)

  • Lee, D.C.
    • Journal of Power System Engineering
    • /
    • v.4 no.3
    • /
    • pp.72-80
    • /
    • 2000
  • In order to design a stable robust controller, nominal model, and the upper bound about the uncertainty which is the error of the model are needed. The problem to estimate the nominal model of controlled system and the upper bound of uncertainty at the same time is called robust identification. When the nominal model of controlled system and the upper bound of uncertainty in relation to robust identification are given, the evaluation of the validity of the model and the upper bound makes it possible to distinguish whether there is a model which explains observation data including disturbance among the model set. This paper suggests a method to identity the uncertainty which removes disturbance and expounds observation data by giving a probable postulation and plural data set to disturbance. It also examines the suggested method through a numerical computation simulation and validates its effectiveness.

  • PDF

A Study on Robust Identification Based on the Validation Evaluation of Model (모델의 타당성 평가에 기초한 로바스트 동정에 관한 연구)

  • Lee, Dong-Cheol;Chung, Hyung-Hwan;Bae, Jong-Il
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2690-2692
    • /
    • 2000
  • In order to design a stable robust controller, nominal model, and the upper bound about the uncertainty which is the error of the model are needed. The problem to estimate the nominal model of controlled system and the upper bound of uncertainty at the same time is called robust identifcation. When the nominal model of controlled system and the upper bound of uncertainty in relation to robust identifcation are given, the evaluation of the validity of the model and the upper bound makes it possible to distinguish whether there is a model which explains observation data including disturbance among the model set. This paper suggests a method to identify the uncertainty which removes disturbance and expounds observation data by giving a probable postulation and plural data set to disturbance. It also examines the suggested method through a numerical computation simulation and validates its effectiveness.

  • PDF

Analysis on the characteristics for upper bound of [1,2]-domination in trees (트리의 [1,2]-지배 수 상계에 대한 특성 분석)

  • Lee, Hoon;Sohn, Moo Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2243-2251
    • /
    • 2016
  • In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.