• Composites Research
• /
• 제12권4호
• /
• pp.33-41
• /
• 1999

이 논문에서는 첨가질량이 있거나 없는 구조요소에 대한 간편하고 정확한 진동해석 방법이 주어진다. 사용된 방법은 1974년 Kim, D. H.에 의해 개발되었다. 이 방법은 변단면과 다양한 경계조건을 갖는 판에 매우 효과적이다. 이 방법은 양단단순-타단자유를 갖는 특별직교이방성 적층복합판에 대해 적용되었다. 이러한 판은 콘크리트 거더-가로보 시스템을 포함하는 단순 지지된 교량상판의 대부분을 나타낸다. 쉬운 이해를 위해 상세한 실예가 보와판에 대해 주어졌다.

• 한국컴퓨터정보학회논문지
• /
• 제21권4호
• /
• pp.9-15
• /
• 2016

Symmetry is everywhere in the world around us from galaxy to microbes. From ancient times symmetry is considered to be a reflection of the harmony of universe. Symmetry is not only a significant clue for human cognitive process, but also useful information for computer vision such as image understanding system. Application areas include face detection and recognition, indexing of image database, image segmentation and detection, analysis of medical images, and so on. The technique used in this paper extracts edges, and the perpendicular bisector of any two edge points is considered to be a candidate axis of symmetry. The coefficients of candidate axis are accumulated in the coefficient space. Then the axis of symmetry is determined to be the line for which the coefficient histogram has maximum value. In this paper, an improved method is proposed that utilizes the directional information of edges, which is a byproduct of the edge detection process. Experiment on 20 test images shows that the proposed method performs 22.7 times faster than the original method. In another test on 5 images with 4% salt-and-pepper noise, the proposed method detects the symmetry successfully, while the original method fails. This result reveals that the proposed method enhances the speed and accuracy of detection process at the same time.

• 한국컴퓨터정보학회논문지
• /
• 제18권7호
• /
• pp.101-109
• /
• 2013

본 연구는 소셜 네트워크 그래프에서 커뮤니티로 탐색된 2개의 커뮤니티를 하나의 커뮤니티로 통합하는 방법을 연구한다. 모듈래러티는 커뮤니티의 품질을 보여주는 측정치이다. 통합하여야 할 커뮤니티에 에지를 추가함에 따라, 커뮤니티의 품질은 증가하게 된다. 커뮤니티를 통합하기 위해서, 각 커뮤니티의 모듈래러티 값을 이용하여, 추가하여야 할 에지 수를 결정하는 방법들을 제안한다. 단순 그래프를 이용한 실험계산을 통해 통합된 커뮤니티의 모듈래러티 값이 통합하기 전의 각각의 커뮤니티의 모듈래러티 값보다 크게 만드는 방법이 유효한 커뮤니티 통합 방법임을 보이고. 그 방법이 적용될 수 있는 그래프의 조건을 확인한다. 이 결과를 이용하여 실제 소셜 네트워크 예에 대한 실험계산을 통해 본 방법의 유효성을 확인한다.

• Structural Engineering and Mechanics
• /
• 제5권4호
• /
• pp.433-450
• /
• 1997

The objective of this work is to predict the failure loads, associated maximum transverse displacements, locations and the modes of failure, including the onset of delamination, of thin, flat, square symmetric laminates under the action of uni-axial compression. Two progressive failure analyses, one using Hashin criterion and the other using Tensor polynomial criteria, are used in conjunction with the finite element method. First order shear deformation theory and geometric nonlinearity in the von Karman sense have been employed. Five different types of lay-up sequence are considered for laminates with all edges simply supported. In addition, two boundary conditions, one with all edges fixed and other with mixed boundary conditions for $(+45/-45/0/90)_{2s}$ quasi-isotropic laminate have also been considered to study the effect of boundary restraints on the failure loads and the corresponding modes of failure. A comparison of linear and nonlinear results is also made for $({\pm}45/0/90)_{2s}$ quasi-isotropic laminate. It is observed that the maximum difference between the failure loads predicted by various criteria depend strongly on the laminate lay-ups and the flexural boundary restraints. Laminates with clamped edges are found to be more susceptible to failure due to the transverse shear and delamination, while those with the simply supported edges undergo total collapse at a load slightly higher than the fiber failure load.

• 전자공학회논문지S
• /
• 제35S권6호
• /
• pp.72-80
• /
• 1998

웨이브릿 패킷을 이용한 방향성 벡터양자화 기법을 제안하였다. 영상에 대한 웨이브릿 패킷 계수들을 대응되는 방향에 따라 9개의 에지로 분할한 후, 국지적으로 지배적인 에지들을 부호화하여 전송한다. 에지의 방향은 조건부 부호책 교환이 있는 가변길이부호화를 통하여 부호화하며, 에지의 내용은 벡터양자화와 그 인덱스의 가변길이부호화를 이용하여 부호화하였다. 제안된 부호화기법은 기존의 여러 영상압축기법에 비하여 PSNR 성능이 우수하며, 특히 0.1~0.3 bpp의 낮은 부호율의 경우 상대적으로 더욱 우수하다. 제안된 알고리듬은 인간시각특성상 가장 중요한 에지 정보들을 보전함으로써, 낮은 부호율에서도 우수한 주관적 화질을 나타낸다.

• 제어로봇시스템학회논문지
• /
• 제10권1호
• /
• pp.81-86
• /
• 2004

This paper describes self-localization of a mobile robot from the multiple candidates of landmarks in outdoor environment. Our robot uses omnidirectional vision system for efficient self-localization. This vision system acquires the visible information of all direction views. The robot uses feature of landmarks whose size is bigger than that of others in image such as building, sculptures, placard etc. Robot uses vertical edges and those merged regions as the feature. In our previous work, we found the problem that landmark matching is difficult when selected candidates of landmarks belonging to region of repeating the vertical edges in image. To overcome these problems, robot uses the merged region of vertical edges. If interval of vertical edges is short then robot bundles them regarding as the same region. Thus, these features are selected as candidates of landmarks. Therefore, the extracted merged region of vertical edge reduces the ambiguity of landmark matching. Robot compares with the candidates of landmark between previous and current image. Then, robot is able to find the same landmark between image sequences using the proposed feature and method. We achieved the efficient self-localization result using robust landmark matching method through the experiments implemented in our campus.

• 대한수학회보
• /
• 제33권1호
• /
• pp.119-126
• /
• 1996

In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.

• 한국표면공학회지
• /
• 제50권1호
• /
• pp.17-23
• /
• 2017

This work demonstrates arc generation and anodic film formation behaviors on Al1050 alloy during PEO (plasma electrolytic oxidation) treatment under a constant direct current in an alkaline electrolyte containing silicate, carbonate and borate ions. Only one big arc more than 2 mm diameter was generated first at the edges and it was moving on the fresh surface or staying occasionally at the edges, resulting in the local burning due to generation of an extremely big orange colored arc at the edges. Central region of the flat surface was not fully covered with PEO films even after sufficiently long treatment time because of the local burning problem. The anodic oxides formed on the flat surface by arcing once were found to consist of a number of small oxide nodules with spherical shape of $3{\sim}6{\mu}m$ size and irregular shapes of about $5{\sim}10{\mu}m$ width and $10{\sim}20{\mu}m$ length. The anodic oxide nodules showed uniform thickness of about $3{\mu}m$ and rounded edges. These experimental results suggest that one big arc observed on the specimen surface under the application of a constant direct current is composed of a number of small micro-arcs less than $20{\mu}m$ size.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.499-510
• /
• 2007

Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.

• 한국통신학회논문지
• /
• 제34권5C호
• /
• pp.514-520
• /
• 2009

본 논문에서는 디인터레이싱 방법 중에서 에지 기반 공간 필터의 성능 개선을 위한 새로운 알고리즘을 제안한다. 제안하는 알고리즘은 디인터레이싱의 성능을 좌우하는 에지의 정확한 검출을 위하여 이진화된 영상에서 자연스러운 라인을 형성하도록 보간한 후에 이를 근간으로 보간될 영상의 정확한 에지를 검출하였다. 이러한 방법으로 검출된 정확한 에지를 기반으로 적응적인 보간 알고리즘을 적용하여 에지영역에서의 화질 열화를 최소화하였다. 이를 검증하기 위해 다양한 영상에 대해 컴퓨터 모의 실험을 하였고, 그 결과를 기존의 디인터레이싱 알고리즘과 비교하여 에지 영역에서의 성능 향상을 확인하였다.