• Proceedings of the Korean Vacuum Society Conference
• /
• 1999.07a
• /
• pp.170-170
• /
• 1999

We studied Nb growth mode on Cu(100) surface by scanning tunneling microscopy (STM) at room temperature. Nb/Cu is immiscible at room temperature and thus is an ideal system for studying surface alloy formation. Initially deposited Nb atoms are incorporated subsurface on Cu(100). After annealing, they are preferentially found at step edges and appear as bright dots surrounded by dark rings. Ordering emerges from step edges as annealed. Ordered ({{{{ SQRT { 5} }$\times${{{{ SQRT { 5} }}}})R 26.6$^{\circ}$phase Nb structure is formed at $\theta$<0.2ML after annealing to 50$0^{\circ}C$. At higher coverage, $\theta$>0.25, annealing leads to p(2$\times$2) phase. due to large mismatch in lattice parameters, the domain is limited to a few tens of nm2. Growth kinetics of the system will be discussed.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.1
• /
• pp.60-73
• /
• 1991

This paper presents an efficient algorithm for incremental and hierarchical design rule checking of VLSI layouts, and describes the implementation of a layout editor using the proposed algorithm. Tracing the sliced edges divided by the intersection of the edges either ina polygon or in two polygons (Sliced-Edge Trace), the algorithm performs VLSI pattern operations like resizing and other Boolean operations. The algorithm is not only fast enough to check the layouts of full-custom designs in real-time, but is general enough to be used for arbitrarily shaped polygons. The proposed algorithm was employed in developingt a layout editor on engineering workstations running UNIX. The editor has been successfully used for checking, generating and resizing of VLSI layouts.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.60-66
• /
• 1994

The scattering problem by E-polarized plane wave with oblique incidence on a tapered resistive strip grating with infinite resistivity at strip-edges is analyzed by the method of moments in the spectral domain. Then the induced surface current density is expanded in a series of Ultraspherical polynomials of the zeroth order. The expansion coefficients are calculated numerically in the spectral domain, the numerical results of the geometricoptical reflection coefficient for the tapered resistivity in this paper are compared with those for the existing uniform resistivity. And the position of sharp variation points in the magnitude of the geometric-optical reflection coefficient can be moved by varying the incident angle and the strip spacing. It is found out that these sharp variation points are due to the transition of higher modes between the propagation mode and the evanescent mode.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.675-683
• /
• 2001

In this paper, we propose the edge compensation algorithm which connects the adjacent edges without losing the information of the skeletons on the edge image. The proposed edge compensation algorithm is composed of succeeding two steps. In the first step, the uplifted image is obtained by uplifting the edge image repeatedly. The next step is to extract the edge image from the uplifted image using the skeleton extraction algorithm. Experimental results show that the proposed method connects the adjacent edges without the distortion of the original edge information compared to the traditional method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.7 s.94
• /
• pp.1686-1699
• /
• 1993

In this paper, the thermal buckling of thick composite angle-ply laminates subject to uniform temperature distribution is studied. For the plates of 4-edges simply supported condition and those of 4-edges clamped condition, the critical buckling temperatue is derived, using tile finite element method based on the shear deformation theory. The effects of lamination angle, layer number, laminate thickness, plate aspect ratio and boundary constraints upon the critical buckling temperature are presented.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.652-657
• /
• 2008

A stress distribution of composite laminates patches is obtained by using the Kantorovich method when the substrate is under uniaxial load. The analysis is based on the stress function approach and uses the complementary virtual work principle. The three-dimensional stresses satisfy the traction free conditions at the free edges and the top surfaces of the patch. The stress of the bottom surfaces of the patch is obtained from equilibrium equation of patch and substrate. To demonstrate the efficiency and validity of the proposed analysis, numerical examples for cross-ply and quasi-isotropic laminates are included. The present method provides accurate stresses in the interior and near the free edges of composite laminate patches.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.403-414
• /
• 2012

A voltage assignment on a graph was used to enumerate all possible 2-cell embeddings of a graph onto surfaces. The boundary of the surface which is obtained from 0 voltage on every edges of a very special diagram of a complete bipartite graph $K_{m,n}$ is surprisingly the ($m,n$) torus link. In the present article, we prove that every link is the boundary of a complete bipartite multi-graph $K_{m,n}$ for which voltage assignments are either -1 or 1 and that every link is the boundary of a complete bipartite graph $K_{2,n}$ for which voltage assignments are either -1, 0 or 1 where edges in the diagram of graphs may be linked but not knotted.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.21-29
• /
• 2003

Let G be a graph with n vertices and n edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n -1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/ log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.115-123
• /
• 2004

A recursive tree is constructed by starting with a root node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree can represent, for example, the heirarchy of a workforce of a company that grows via recruiting. At times of economic depression, the company may decide to layoff participants, and in some cases it is a fair policy to relieve the last senior worker (most recent entry in the tree). If we remove an edge from such a tree then it falls into two subtrees one of which contains the most recent entry. If we continue to remove edges from the successively smaller subtrees that contain the most recent entry, we eventually isolate the most recent entry. We consider how many randomly selected edges must be removed in average before isolating the most recent entry by this procedure.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.69-72
• /
• 1991

This paper proposes an efficient algorithm that constructs 3 dimensional solid object from orthographic views. The 3D object construction algorithm inputs vertices and edges information of 3 orthogonal views, generates 2 dimensional surfaces of input views, 3 dimensional possible vertices, possible edges and possible surfaces, compares 2 dimensional projections of 3 dimensional possible surface with two dimensional surfaces from orthogonal views and then determines the solution. This algorithm has been proved to be efficient in reducing the time taken and is useful for CAD system, 3 dimensional scene analysis system and object modellings for 3D graphics. The algorithm has been implemented in C language on the IBM PC/AT.