• Title/Summary/Keyword: Minimal

Search Result 6,274, Processing Time 0.027 seconds

An Efficient Method on Constructing $ extsc{k}$-Minimal Path Sets for Flow Network Reliability

  • Lee, Seung-Min;Park, Dong-Ho
    • Journal of the Korean Statistical Society
    • /
    • 제29권3호
    • /
    • pp.297-306
    • /
    • 2000
  • An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

  • PDF

현대패션에 나타난 최소표현기법에 관한 연구 (A Study on Minimal Expression Techniques Depicted in Modern Fashion Design)

  • 김은덕;김민자
    • 복식
    • /
    • 제24권
    • /
    • pp.157-176
    • /
    • 1995
  • The purpose of this treatise is to study external form and internal meaning of minimal expression fashion which appeared as a major stream in modern fashion trends to understand one aspect of modernism in fashion and also to gain insight into internal value of human beings through fashion. The results can be summarized as follows : Firstly , minimalism is a trend in art attempting to seek essence of the object by presenting simple and disciplined expressions by minimal formative means and minimal production process. Secondly, minimal expression in fashion means seeking simplicity an dpurity by using minimum design elements and minimal productive process. Thirdly, external from of minimal expression fashion can be created through application of following minimal expression techniques. 1. Minimal expression techniques in terms of line mean smooth curve flowing along body contours, straight lines of diagonal lines into desciplined silhouette or rendering internal contour lines. 2. Minimum expression techniques in terms of forms mean forms of smooth curves flowing along boyd or forms with simple geometric forms from qualitative aspects, In terms of volume it means quest for essence of pure body itself by revealing body as it is by minimizing the size of dress or its area and herein is contained using simple geometric pattern or utilizing textiles without any patterns.3. Minimal expression techniques by colors mean simple colors such as primary colors, colors without clear distinctions or natural colors and in terms of quantity it means quest for one color within one item of dress or combination of each items when getting dressed. 4. Minimal expression techniques in terms of fabrics mean fabrics with simple surfaced. In terms of quantity it means quest for essence of tight fitting thin textiles to human body or using transparent materials to human body thus exposing body contours as it is. 5. Minimal expression techniques in terms of productive process mean minimizing process of tailoring , sewing or ornamenting and seeking for simplicity and purity. 6. Minimal expression techniques in terms of manufacturing process mean selection of technique conveying simple image with disciplined simple image. Fourthly, minimal expression fashion with external expression as mentioned in the above lay body-priority style and its internal meaning can be asummed as quest for essence and purity of human body.

  • PDF

TORQUES AND RIEMANN'S MINIMAL SURFACES

  • Jin, Sun Sook
    • 충청수학회지
    • /
    • 제19권3호
    • /
    • pp.219-224
    • /
    • 2006
  • In this article, we prove that a properly embedded minimal surface in $R^3$ of genus zero must be one of Riemann's minimal examples if outside of a solid cylinder it is the union of planar ends with the same torques at all integer heights.

  • PDF

POLYTOPES OF MINIMAL NULL DESIGNS

  • Cho, Soo-Jin
    • 대한수학회논문집
    • /
    • 제17권1호
    • /
    • pp.143-153
    • /
    • 2002
  • Null designs form a vector space and there are only finite number of minimal null designs(up to scalar multiple), hence it is natural to look at the convex polytopes of minimal null designs. For example, when t = 0, k = 1, the convex polytope of minimal null designs is the polytope of roofs of type An. In this article, we look at the convex polytopes of minimal null designs and find many general properties on the vertices, edges, dimension, and some structural properties that might help to understand the structure of polytopes for big n, t through the structure of smaller n, t.

SINGLY-PERIODIC MINIMAL SURFACES IN ℍ2×ℝ

  • Pyo, Jun-Cheol
    • 대한수학회보
    • /
    • 제49권5호
    • /
    • pp.1089-1099
    • /
    • 2012
  • We construct three kinds of complete embedded singly-periodic minimal surfaces in $\mathbb{H}^2{\times}\mathbb{R}$. The first one is a 1-parameter family of minimal surfaces which is asymptotic to a horizontal plane and a vertical plane; the second one is a 2-parameter family of minimal surfaces which has a fundamental piece of finite total curvature and is asymptotic to a finite number of vertical planes; the last one is a 2-parameter family of minimal surfaces which fill $\mathbb{H}^2{\times}\mathbb{R}$ by finite Scherk's towers.

AN ALGORITHM FOR GENERATING MINIMAL CUTSETS OF UNDIRECTED GRAPHS

  • Shin, Yong-Yeonp;Koh, Jai-Sang
    • Journal of applied mathematics & informatics
    • /
    • 제5권3호
    • /
    • pp.771-784
    • /
    • 1998
  • In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

INTUITIONISTIC FUZZY MINIMAL SPACES

  • Min, Won-Keun
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제16권3호
    • /
    • pp.259-269
    • /
    • 2009
  • We introduce the concept of intuitionistic fuzzy minimal structure which is an extension of the intuitionistic fuzzy topological space. And we introduce and study the concepts of intuitionistic fuzzy M -continuity, intuitionistic fuzzy Mopen mappings and several types of intuitionistic fuzzy minimal compactness on intuitionistic fuzzy minimal spaces.

  • PDF

FUZZY COMPACTNESS, FUZZY REGULARITY VIA FUZZY MAXIMAL OPEN AND FUZZY MINIMAL CLOSED SETS

  • SWAMINATHAN, A.;SIVARAJA, S.
    • Journal of applied mathematics & informatics
    • /
    • 제40권1_2호
    • /
    • pp.185-190
    • /
    • 2022
  • The aim of this article is to define fuzzy maximal open cover and discuss its few properties. we also defined and study fuzzy m-compact space and discussed its properties. Also we obtain few more results on fuzzy minimal c-regular and fuzzy minimal c-normal spaces. We have proved that a fuzzy Haussdorff m-compact space is fuzzy minimal c-normal.

MINIMAL SURFACE SYSTEM IN EUCLIDEAN FOUR-SPACE

  • Hojoo Lee
    • 대한수학회지
    • /
    • 제60권1호
    • /
    • pp.71-90
    • /
    • 2023
  • We construct generalized Cauchy-Riemann equations of the first order for a pair of two ℝ-valued functions to deform a minimal graph in ℝ3 to the one parameter family of the two dimensional minimal graphs in ℝ4. We construct the two parameter family of minimal graphs in ℝ4, which include catenoids, helicoids, planes in ℝ3, and complex logarithmic graphs in ℂ2. We present higher codimensional generalizations of Scherk's periodic minimal surfaces.