• Title/Summary/Keyword: 변형 스타일

Search Result 77, Processing Time 0.027 seconds

Expansion and Connection analysis of FoldedHyperStar FHs(2n,n) Graph (폴디드 하이퍼스타 FHS(2n,n)그래프의 확장성과 연결도 분석)

  • Sim, Hyun;Lee, Kyu-Su;Ki, Woo-Seo;Lee, Hyeong-Ok;Oh, Jae-Cheol
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06a
    • /
    • pp.357-358
    • /
    • 2008
  • 폴디드 하이퍼스타 FHS(2n,n)은 하이퍼큐브와 그의 변형된 그래프보다 망 비용이 개선된 상호연결망이다. 본 논문에서는 폴디드 하이퍼스타 FHS(n-1,k-1)와 FHS(n-1,k) 그래프를 연결하여 폴디드 하이퍼스타 FHS(n,k)를 생성하는 방법을 제시하였다(단, n=2k). 또한, 정규 연결망 형태인 폴디드 하이퍼스타 FHS(2n,n)의 노드연결도는 n+1이고, 최대고장허용도를 가짐을 보인다.

  • PDF

Embedding Algorithm for Star, Bubblesort, Pancake Graphs (스타 그래프, 버블정렬 그래프와 팬케익 그래프 사이의 임베딩(embedding) 알고리즘)

  • Kim, Dong-Wan;Min, Jun-Sik;Lee, Hyeong-Ok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.111-114
    • /
    • 2010
  • 스타 그래프, 버블정렬 그래프, 팬케익 그래프는 노드 대칭성(node symmetric), 최대 고장 허용도(maximum fault tolerance), 계층적 분할 성질을 갖고, 하이퍼큐브보다 망비용이 개선된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타 그래프와 그의 변형된 그래프들 사이의 임베딩 방법을 제안하고, 임베딩 비용을 분석한다. 임베딩 결과는 버블정렬 그래프는 스타 그래프에 연장율(dilation) 3, 스타그래프는 팬케익 그래프에 연장율 4로 각각 임베딩 가능하다.

Hyper-Star Graphs: A New Interconnection Network for Multicomputer (하이퍼-스타 그래프 : 다중 컴퓨터를 위한 새로운 상호 연결망)

  • Lee, Hyeong-Ok;Kim, Byeong-Cheol;Im, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.12
    • /
    • pp.3099-3108
    • /
    • 1998
  • 본 논문에서는 새로운 다중 컴퓨터의 위상으로 하이퍼-스타 그래프를 제안하고, 하이퍼-스타 그래프에 대하여 주요 망 척도인 분지수, 연결도, 확장성, 라우팅, 지름, 임베딩 등의 특징을 분석한다. 하이퍼-스타 그래프 HS(2n,n)에 에지를 한 개 추가한 folded 하이퍼-스타 그래프 FHS(2n,n)은 2nCn개의 노드를 갖고 널리 알려진 상호 연결망인 하이퍼큐브에 비해 상대적으로 분지수와 지름이 작은 값을 갖는 연결망이다. Folded 하이퍼-스타 그래프 FHS(2n,n)가 하이퍼큐브 Qn이 같은 노드 수를 가질 때 분지수$\times$지름에 대한 척도에 있어서 은 n2/2보다 작고, 하이퍼큐브 Qn와 그의 변형들보다 연결망의 망 비용에 있어서 우수함을 의미한다. 또한 하이퍼큐브 Qn과 n$\times$n 토러스를 하이퍼-스타 그래프 HS(2n,n)에 연장비율 2에 임베딩하는 방법을 보인다.

  • PDF

Star-Based Node Aggregation for Hierarchical QoS Routing (계층적 QoS 라우팅을 위한 스타 기반의 노드 집단화)

  • Kwon, So-Ra;Jeon, Chang-Ho
    • The KIPS Transactions:PartC
    • /
    • v.18C no.5
    • /
    • pp.361-368
    • /
    • 2011
  • In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

Node Mapping Algorithm Between Star and Like-Stars (스타 네트워크와 그의 변형 네트워크 사이의 노드 사상 알고리즘)

  • Ki, Woo-Seo;Lee, Hyeong-Ok;Oh, Jae-Cheol
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.597-600
    • /
    • 2008
  • 스타(star) 네트워크는 노드 대칭성, 최대 고장 허용도, 계층적 분할 성질을 갖고, 하이퍼큐브보다 망 비용이 개선 된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타네트워크와 RFM, 버블정렬네트워크 사이의 임베딩 방법을 제안하고, 임베딩의 연장율 비용을 분석한다. 연구 결과로 버블정렬(Bubblesort) 그래프 $B_N$을 RFM 그래프 $R_N$에 연장비율 2, 버블정렬(Bubblesort) 그래프 $B_N$을 스타그래프 $S_N$에 연장율 3에 임베딩 할 수 있다.

A Study on School Uniform and Ornaments Behaviors of High School Girls (여고생의 교복 및 장식 행동에 관한 연구 -경상남도 마산.창원 지역을 중심으로-)

  • 정혜경;김세희
    • The Research Journal of the Costume Culture
    • /
    • v.12 no.1
    • /
    • pp.136-150
    • /
    • 2004
  • The purpose of this study was to examine how high school girl students used their school uniforms and what types of ornaments they preferred, in an effort to identify the image of school uniform. The result of this study were as follow: First, 52.6 percent of the students investigated altered their uniforms, and as fur the major alteration style, revival one to take them in to be well-fitting was dominant. But concerning skirts, hip-hop style was also found. The students viewed ornaments more favorably, as the larger group of the students perceived that it was necessary to restrict the school-uniform alteration yet not to control ornaments. Concerning how much they wore school uniforms, most of them continued to wear them outside school in many cases. Specifically, those who engaged in pastime or went shopping wearing school uniforms enjoyed altering them, and they also enjoyed using ornaments that weren't allowed by the school dress code. Second, as to school-uniform image, elegant image was most preferred, followed by practical, innocent and fashion-conscious ones. They were most preferred with its elegant image. Third, as to ornaments image, they were most preferred with its positive image.

  • PDF

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs (행렬스타 그래프와 하프 팬케익 그래프 사이의 일대일 사상 알고리즘)

  • Kim, Jong-Seok;Yoo, Nam-Hyun;Lee, Hyeong-Ok
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.4
    • /
    • pp.430-436
    • /
    • 2014
  • Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

Performance Assessment of PVA Geotextile/HDPE Geomembrane Composites

  • Jeon, Han-Yong;Hong, Sang-Jin;Lyoo, Won-Seok
    • Journal of the Korean Geosynthetics Society
    • /
    • v.4 no.1
    • /
    • pp.37-46
    • /
    • 2005
  • PVA geotextile/HDPE geomembrane composites were made to examine the waste landfill related properties. Tensile properties, tear and bursting strengths, AOS(apparent opening size) and permittivity of PVA geotextiles were evaluated, respectively. Ultraviolet stability and chemical resistance to the leachate was evaluated also. Friction property and creep deformation were tested at various loading condition. From this, it was seen that PVA geotextile/HDPE geomembrane composites have more excellent properties than the typically used polypropylene and polyester geotextiles in waste landfill. Finally, creep deformation behaviours of PVA geotextile/HDPE geomembrane composites were more stable than polypropylene and polyester geotextiles through the reduction factor analysis.

  • PDF

The Intuitive Change of Virtual Wand Style in Spatial Sketch System (가상 완드 스타일의 직관적인 변형을 지원하는 공간 스케치 시스템)

  • Nam, Sang-Hun;Chai, Young-Ho
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.56-61
    • /
    • 2009
  • According to the target object for designer to sketch, an effective style or shape of input device can be defined differently. The general spatial sketching system that support various types of wand assist sketching effectively as changing suitable wand shape to the part of a target object. We suggest the idea of changing wand style by altering the posture of a 3D wand. This allows a designer to work in an intuitive way without being interrupted by complicated menus. We implement the various wand styles to the spatial sketching system with cubic-based drawing technique.

  • PDF

Embedding algorithm among star graph and pancake graph, bubblesort graph (스타 그래프와 팬케익, 버블정렬 그래프 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • The Journal of Korean Association of Computer Education
    • /
    • v.13 no.5
    • /
    • pp.91-102
    • /
    • 2010
  • Star graph is a well-known interconnection network to further improve the network cost of Hypercube and has good properties such as node symmetry, maximal fault tolerance and strongly hierarchical property. In this study, we will suggest embedding scheme among star graph and pancake graph, bubblesort graph, which are variations of star graph. We will show that bubblesort graph can be embedded into pancake and star graph with dilation 3, expansion 1, respectively and pancake graph can be embedded into bubblesort graph with dilation cost O($n^2$). Additionally, we will show that star graph can be embedded into pancake graph with dilation 4, expansion 1. Also, with dilation cost O(n) we will prove that star graph can be embedded into bubblesort graph and pancake graph can be embedded into star graph.

  • PDF