• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.806-808
• /
• 2003

이차원 평면에 주어진 n 개의 점을 연결하는 신장 트리(spanning tree) 중에서, 지름이 최소가 되는 최소지름 신장 트리는 특정 점에서의 분지수가 n-1 까지 증가할 수 있다. 본 논문에서는 트리의 분지수(degree)를 입력으로 받아 그 분지수를 넘지 않는 신장 트리를 구성하면서 트리의 지름은 최소 지름의 상수 배를 넘지 않도록 하는 구성 방법을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.176-186
• /
• 2007

An interconnection network can be represented as a graph where a vertex corresponds to a node and an edge corresponds to a link. The diameter of an interconnection network is the maximum length of the shortest paths between all pairs of vertices. The fault diameter of an interconnection network G is the maximum length of the shortest paths between all two fault-free vertices when there are $_k(G)-1$ or less faulty vertices, where $_k(G)$ is the connectivity of G. The fault diameter of an R-regular graph G with diameter of 3 or more and connectivity ${\tau}$ is at least diam(G)+1 where diam(G) is the diameter of G. We show that the fault diameter of a 2-dimensional $m{\times}n$ torus with $m,n{\geq}3$ is max(m,n) if m=3 or n=3; otherwise, the fault diameter is equal to its diameter plus 1. We also show that in $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ torus with each $k_i{\geq}3$, there are 2d mutually disjoint paths joining any two vertices such that the lengths of all these paths are at most diameter+1. The paths joining two vertices u and v are called to be mutually disjoint if the common vertices on these paths are u and v. Using these mutually disjoint paths, we show that the fault diameter of $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ totus with each $k_i{\geq}3$ is equal to its diameter plus 1.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.665-679
• /
• 2002

The fault diameter of a graph G is the maximum of lengths of the shortest paths between all two vertices when there are $\chi$(G) - 1 or less faulty vertices, where $\chi$(G) is connectivity of G. In this paper, we analyze the fault diameter of recursive circulant $G(2^m,2^k)$ with $k{\geq}3$. Let $ dia_{m.k}$ denote the diameter of $G(2^m,2^k)$. We show that if $2{\leq}m,2{\leq}k, the fault diameter of $G(2{\leq}m,2{\leq}k)$ is equal to $2^m-2$, and if m=k+1, it is equal to $2^k-1$. It is also shown that for m>k+1, the fault diameter is equal to di a_$m{\neq}1$(mod 2k); otherwise, it is less than or equal to$dia_{m.k+2}$.

• Proceedings of the Korea Crystallographic Association Conference
• /
• 2002.11a
• /
• pp.57-57
• /
• 2002

100 nm 이하의 입자의 크기와 모양을 정확하게 측정할 수 있는 기술개발을 위하여 투과형 전자현미경(TEM)으로 100 nm 지름의 폴리스티렌구의 평균지름을 측정하였다. 기기 표시 배율과 엣지결정불확도에 의한 크기측정오차를 최소화하기 위하여, 지름이 정확히 알려진 300 nm 입자를 내부 기준자로 쓰기 위하여 100 nm 입자와 섞었다. 100 nm 입자들의 지름은 동일한 TEM 필름상의 300 nm 입자와의 비교를 통하여 얻어졌다. 전자빔에 의한 입자축소효과의 보정을 위하여, 가속전압, 빔세기, 그리고 노출시간이 축소량에 미치는 정량적 관계를 조사하고 분석하였다. 그러한 분석과 몇가지 데이터 처리과정에 기초하여, 100 nm 폴리스티렌구의 평균지름을 95 ％ 신뢰수준에서 확장불확도 2 ％로 결정하였다. 측정값은 동일한 쌤플에 대하여, 다른 방법을 사용하는 다른 실험실들과의 결과와도 일치하고 있다.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.1-8
• /
• 2010

The fault diameter is one of the important measures for transmission rate and reliability of interconnection network. H.-O. Lee et al.[Parallel paths in folded hyper-star graph, Journal of KIPS, Vol.6, No.7, pp.1756-1769, 1999] suggested the node-disjoint paths of FHS (2n,n), and proved that the fault diameter of FHS(2n,n) is less than 2n-1. In this paper, we suggest an advanced node-disjoint paths of FHS(2n,n). We also prove that the wide diameter of FHS(2n,n) is dist(U,V)+4, and the fault diameter of FHS(2n,n) is less than n+2.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.1930-1939
• /
• 1997

In this paper, we analyze the fault diameter and fault tolerance of Gray cube proposed recently in [12]. fault diameter of an interconnection network is one of the important network measures concerning the distance between nodes when some nodes fail. It is showed that fault diameter of n-dimensional Gray cube having $2^n$ nodes is [(n+1)/2]+2, ($n{\ge}3$). It means the increment of the longest distance between nodes under node-failure is only constant factor. Comparing the result with the fault diameter of well-known hypercube, the longest routing distance of a message in a Gray cube under node-failure is about the half of that hypercube.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.349-355
• /
• 2017

Bending work using press dies involves bending a flat blank to a desired angle. The bending produces a flange (the bent part) and a web (the unbent part). The bending line will have a bending angle, and there is an inner and outer bending radius. The minimum inner radius size is determined by the material used. When the inner radius size is too small, there will be excess metal welding, which will cause a crack in the outer radius part. The outer bending radius size cannot be controlled by a bending punch and die block. Types of bending include V-bending, U-bending, O-bending, edge bending, twist bending, and crimping. Z-bending involves two bending lines, which are set on the upper side and under surface of the blank, respectively, and upward or downward bending is used. Z-bending is also called crank bending. Z-bending using this type of die structure will produce a standard inner bending radius. The standard size is the minimum bending radius that represents the angle radius of the bending punch. In industry, there is a need for a sharp edge shape with a very small size (R=0.2mm), but that is not possible when using bending punch and die block. The purpose of this research is to meet the need by development.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.319-323
• /
• 2003

Let P be a set of n points in the plane. A minimum spanning tree(MST) is a spanning tree connecting n points of P such that the sum of lengths of edges of the tree is minimized. A diameter of a tree is the maximum length of paths connecting two points of a spanning tree of P. The problem considered in this paper is to compute the spanning tree whose diameter is minimized over all spanning trees of P. We call such tree a minimum-diameter spanning tree(MDST). The best known previous algorithm[3] finds MDST in $O(n^2)$ time. In this paper, we suggest an approximation algorithm to compute a spanning tree whose diameter is no more than 5/4 times that of MDST, running in O(n$^2$log$^2$n) time. This is the first approximation algorithm on the MDST problem.

• Korean Journal of Optics and Photonics
• /
• v.9 no.4
• /
• pp.258-263
• /
• 1998

Quasi-elastic light scattering is utilized to measure the mean diameter of the 0.3 $\mu\textrm{m}$-dimeter polystyrene sphere. The mean diameter of the polystyrene sphere is required to be known within the uncertainty of a few per centages. The systematic error has been considerably reduced by improving the system for the angle alignment and temperature measurement of cell. NIST SRM 1691 (0.269$\pm$0.007 $\mu\textrm{m}$: TEM; 0.275$\pm$0.007 $\mu\textrm{m}$: QELS) is measured to be 0.273 $\mu\textrm{m}$$\pm$0.006 $\mu\textrm{m}$ in mean diameter. Detailed description is given of the improved method and the resultant uncertainty, and the comparison of results with NIST is followed.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.499-506
• /
• 2005

Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum (2n-2,n-1). Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v)+4, and the fault diameter is less than D(HS(2n,n))+2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.