• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.23-23
• /
• 2020

하구 관측은 조사 방법 및 주기에 따라 크게 두 가지로 구분되는데, 첫째는 현장에서 직접 주기적으로 자료를 수집하는 정기 현장관측과 다른 하나는 고정된 지점에 관측소를 설치하여 실시간으로 연속된 자료를 수집하는 실시간 관측으로 분류된다. 본 연구는 하구 관측망 체계를 확립하기 위한 기초 연구로서 금강하구역을 대상으로 모의된 수치 모델 자료를 이용하여 관측망을 설계하기 위한 대표 모니터링 지표를 선정하고, 이를 기반으로 관측 지점을 설계하기 위한 전략을 제시하였다. 대표 모니터링 지표는 실제 현장에서 일반적으로 취득할 수 있는 6가지 항목(수온, 염분, 용존산소, 클로로필a, 총질소, 총인)을 대상으로 EOF 분석을 실시하여 해역의 시공간 분포를 대표할 수 있다고 판단되는 2개의 항목을 선정하였다. 대표 모니터링 지점은 2개의 대표 모니터링 지표에 대한 고유 벡터 사이의 각도를 벡터의 내적으로 계산하고 이를 설계변수로 활용하여 도식최적화 기법을 통해 각 모니터링 항목들에 대한 공간 분포를 가장 잘 재현해 낼 수 있는 지점의 개수와 위치를 선정하였다. 선정된 모니터링 지점들을 이용하여 재구성된 공간 분포를 참값(수치모델)과 비교하여 통계적 적정성 여부를 평가하였으며, 이를 통해 금강하구의 대표 모니터링 지점들을 도출 해 내었다. 금강하구의 정기 현장 관측에 대한 대표 모니터링 지점은 7개로 선정되었으며, 이들은 6가지 관측 항목들에 대해서 매우 높은 공간분포 재현율을 확보할 수 있음을 확인하였다. 또한, 담수가 비정기적으로 방류되는 금강하구 시스템의 지역적 특성에 대한 시계열 정보를 연속적으로 가장 잘 취득할 수 있는 실시간 관측소 설치 영역을 결정하기 위하여, 7개의 대표 모니터링 지점에서의 시계열 정보를 금강하구둑 전면과 외해의 시계열 정보와 비교분석하여 설치가능 지점을 영역으로 제언하였다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.1 no.1
• /
• pp.128-144
• /
• 1998

The BEM for linear elastic stress analysis is applied to the highly rotating axisymmetric body problem which also involves the thermoelastic effects due to steady-state thermal conduction. The axisymmetric BEM formulation is briefly summarized and an alternative approach for transforming the volume integrals associated with such body force kernels into equivalent boundary integrals is described in a way of using the concept of inner product and vector identity. A discretization scheme for higher order BE is outlined for numerical treatment of the resulting boundary integral equations, and it is consequently illustrated by determining the stress distributions of the turbine rotor disk of the small turbojet engine(ADD 500) for which a FEM stress solution has been furnished by author.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.8
• /
• pp.340-348
• /
• 2003

In this paper, we propose a novel formulation to solve a time-domain combined field integral equation (CFIE) for analyzing the transient electromagnetic scattering response from closed conducting bodies. Instead of the conventional marching-on in time (MOT) technique, tile solution method in this paper is based on the moment method that involves separate spatial and temporal testing procedures. Triangular patch vector functions are used for spatial expansion and testing functions for three-dimensional arbitrarily shaped closed structures. The time-domain unknown coefficient is approximated as a basis function set that is derived from tile Laguerre functions with exponentially decaying functions. These basis functions are also used as the temporal testing. Numerical results computed by the proposed method arc stable without late-time oscillations and agree well with the frequency-domain CFIE solutions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.191-194
• /
• 2011

문서를 이루는 단어들의 빈도수가 지수법칙(power law)를 따른다는 지프의 법칩(Zipf's law)이 있다. 이러한 단어분포를 고려하여 문서의 토픽을 찾아내는 기계학습법이 디리쉴레 프로세스(Dirichlet process) 이다. 이를 발전시켜서 데이터의 잠재 요인(latent factor)들을 베이즈 확률모델에 기반한 샘플링 바탕으로 찾는 방법이 인디언 뷔페 과정(Indian buffet process) 이다. 우리는 25가지의 특징(feature)들에 대한 점수(rating)들이 볼드(blood oxygen dependent level) 신호와 함께 주어지는 PBAIC 2007 데이터에 주성분 분석법(principal component analysis)를 적용했다. PBAIC 2007 데이터는 비디오 게임을 수행하며 기능적뇌영상(functional magnetic resonance imaging, fMRI) 촬영을 하여 얻어진 공개데이터이다. 우리의 연구에서는 주성분 분석법을 이용하여 10개의 독립 성분(independent component)들을 찾았다. 그리고 1.75초 마다 촬영된 BOLD 신호와 10개의 고유벡터(eigenvector)들간의 내적을 취하여 가중치(weight)를 구하였다. 성분들의 가중치를 낮은 순서로 정렬함으로써 각 시간마다 주도적으로 영향을 미치는 성분들을 알아낼 수 있었다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.1
• /
• pp.1-8
• /
• 2018

It is not easy to learn simple expressions of moving picture data since it contains noise and a lot of information in addition to time-based information. In this study, we propose a similarity representation method and a deep learning method between sequential data which can express such video data abstractly and simpler. This is to learn and obtain a function that allow them to have maximum information when interpreting the degree of similarity between image data vectors constituting a moving picture. Through the actual data, it is confirmed that the proposed method shows better classification performance than the existing moving image classification methods.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1337-1344
• /
• 2016

As the visual effect frequently used in movies or animations, special effects are well suited for the creation of buildings or materials' destruction and collapse scenes. With the relevant programs developing technologically, the adoption of a real-time physically based-system makes it possible to realistically express dynamic simulations. In the large scale, the visual expression of such effects of destroying is satisfying enough, but most common programs of those effects fail to maximize visual effect generated with the cutting of small materials. Besides, to perform a heavy simulation process needs high-performance hardware and programs, where high costs would become a serious issue. For this reason, this paper suggests a solution optimized for the effect of small materials-cutting. The progress of each step shows technologies which trace movement with the state of the completion of the character's motions and then cut the material in real-time, finally led to the very realistic visual effect. Besides, using vector inner calculation to follow the motions of object and to realize cutting effect, this study provides an experiment that constructs visual effect for visualization from the basis of mathematical algorithm and it would be certainly as an educational material used for further researches.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.40 no.9
• /
• pp.597-604
• /
• 2016

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

• Journal of Cadastre & Land InformatiX
• /
• v.46 no.2
• /
• pp.239-251
• /
• 2016

Hyperspectral image is widely used for land cover classification because it has a number of narrow bands and allow each pixel to include much more information in comparison with previous multi-spectral image. However, Higher spectral resolution of hyperspectral image results in an increase in data volumes and a decrease in noise efficiency. SAM(Spectral Angle Mapping), a method based on vector inner product to compare spectrum distribution, is a highly valuable and popular way to analyze continuous spectrum of hyperspectral image. SAM is shown to be less accurate when it is used to analyze hyperspectral image for land cover classification using spectral library. this inaccuracy is due to the effects of atmosphere. We suggest a decision tree based method to compensate the defect and show that the method improved accuracy of land cover classification.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.3
• /
• pp.72-77
• /
• 2017

This paper focuses on the development of a supporting S/W tool for the automated design of an automotive press trim die. To define the die design process based on automation, we analyze the press die design process of the current industry and group repetitive works in the 3D modeling process. The proposed system consists of two modules, namely the template models of the trim steel parts and UI function for their auto-positioning. Four kinds of template models are developed to adapt to various situations and the rules of the interaction formula which are used for checking and correcting the directions of the datum point, datum curve, datum plane are implemented to eliminate errors. The system was developed using CATIA Knowledgeware, CAA(CATIA SDK) and Visual C++, in order for it to function as a plug-in module of CATIA V5, which is one of the major 3D CAD systems in the manufacturing industry. The developed system was tested by applying it to various panels of current automobiles and the results showed that it reduces the time-cost by 74% compared to the traditional method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.2
• /
• pp.55-64
• /
• 2000

In this paper, we propose an efficient datapath placement algorithm to minimize track density. Here, we consider each datapath element as a cluster, and merge the most strongly connected two clusters to a new cluster until only one cluster remains. As nodes in the two clusters to be merged are already linearly ordered respectively, we can merge two clusters with connecting them. The proposed algorithm produces circular linear ordering by connecting starting point and end point of the final cluster, and n different linear ordering by cutting between two contiguous elements of the circular linear ordering. Among the n different linear ordering, the linear ordering to minimize track density is final solution. In this paper, we show and utilize that if two clusters are strongly connected in a graph, the inner product of the corresponding vectors mapped in d-dimensional space using spectral method is maximum. Compared with previous datapath placement algorithm GA/S $A^{［2］}$, the proposed algorithm gives similar results with much less computation time.