• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.57-64
• /
• 2000

We describe a parallel implementation for the large-eddy simulation(LES) of stratified and rotating turbulence based on MPI. The parallelization strategy is specified by eliminating the tridiagonal solver with explicit method and by domain decompositions for solving the poisson equation. In this simulation we have run on CRAY-T3E under the message passing platform MPI with a various domain decomposition and the scalability of this parallel code of LES are also presented. The result shows that we can gain up to 16 times faster speed up on 64 processors with xyz-directional domain decomposition and scalable up to $128{\times}128{\times}$ which processing time is almost similar to that of $40{\times}40{\times}40$ on a single processor machine with a sequential code.

• Korean Journal of Optics and Photonics
• /
• v.13 no.5
• /
• pp.435-441
• /
• 2002

In this paper, we propose an optimal 2-dimensional construction algorithm of a code family for a high-speed optical code division multiple access network. The optimal 2-D code family generated by search algorithm has better spectrum efficiency than previous codes, having relatively many code sets with short code length and the same or lower BER. Using the optimal 2-D code, OCDMA systems make it possible to utilize the spectrum more efficiently than WDM systems. The probability of bit error for high-speed OCDMA transmissions is calculated as a function of the number of users in the presence of receiver and shot noise(additive white Gaussian noise).

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.1
• /
• pp.86-94
• /
• 2013

In this paper, we propose a network coding scheme that is one of the most promising techniques for overcoming transmission errors in underwater acoustic communications. It is assumed that the proposed scheme operates in a Code Division Multiple Access (CDMA) network where multiple sensor nodes share the underwater acoustic channel in both the frequency and the time domains by means of orthogonal codes. The network topology deploys multi-hop transmission with relaying between multiple source nodes and one destination node via multiple relay nodes. The proposed scheme is evaluated in terms of the successful packet delivery ratio of end-to-end transactions under varying packet loss rates. A computer simulation shows that the successful delivery ratio is maintained at over 95% even when the packet loss rate reaches 50%.

• Journal of KIISE:Software and Applications
• /
• v.34 no.3
• /
• pp.275-302
• /
• 2007

We propose a novel still image compression system which supports a high quality text compression function. The system segments the text from the image and compresses the text with a high quality. The system shows 48:1 high compression ratio using context-based adaptive binary arithmetic coding. The arithmetic coding performs the high compression by the codeblocks in the bitplane. The input of the system consists of a segmentation mode and a ROI(Region Of Interest) mode. In segmentation mode, the input image is segmented into a foreground consisting of text and a background consisting of the remaining region. In ROI mode, the input image is represented by the region of interest window. The high quality text compression function with a high compression ratio shows that the proposed system can be comparable with the JPEG2000 products. This system also uses gray coding to improve the compression ratio.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.11
• /
• pp.377-386
• /
• 2020

Mobile cloud computing involves mobile or embedded devices as clients, and features small devices with constrained resource and low availability. Due to the fast expansion of smart phones and smart peripheral devices, researches on mobile cloud computing attract academia's interest more than ever. Computation offloading, or code offloading, enhances the performance of computation by migrating a part of computation of a mobile system to nearby cloud servers with more computational resources through wired or wireless networks. Code offloading is considered as one of the best approaches overcoming the limited resources of mobile systems. In this paper, we analyze the factors and the performance of code offloading, especially focusing on static program partitioning and data protection. We survey state-of-the-art researches on analyzed topics. We also describe directions for future research.

• Review of KIISC
• /
• v.2 no.2
• /
• pp.87-92
• /
• 1992

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.422-431
• /
• 2000

This paper proposes a new codebook generation method, called a PCA-Based VQ, that incorporates the PCA (Principal Component Analysis) technique into VQ (Vector Quantization) codebook design. The PCA technique reduces the data dimensions by transforming input image vectors into the feature vectors. The cluster of feature vectors in the transformed domain is bisectioned into two subclusters by an optimally chosen partitioning hyperplane. We expedite the searching of the optimal partitioning hyperplane that is the most time consuming process by considering that (1) the optimal partitioning hyperplane is perpendicular to the first principal axis of the feature vectors, (2) it is located on the equilibrium point of the left and right cluster's distortions, and (3) the left and right cluster's distortions can be adjusted incrementally. This principal axis bisectioning is successively performed on the cluster whose difference of distortion between before and after bisection is the maximum among the existing clusters until the total distortion of clusters becomes as small as the desired level. Simulation results show that the proposed PCA-based VQ method is promising because its reconstruction performance is as good as that of the SOFM (Self-Organizing Feature Maps) method and its codebook generation is as fast as that of the K-means method.

• Annual Conference of KIPS
• /
• 2008.05a
• /
• pp.435-438
• /
• 2008

한전에서는 연간 전력 사용량이 높은 고압 고객에 대하여 전자식 전력량계를 설치하여 15분 단위로 전력 사용량을 수집하는 자동검침시스템을 운영하고 있다. 본 연구에서는 자동검침시스템을 통해 수집된 데이터를 이용하여 배전선로에 대한 부하를 분석하기 위해 자동검침 고객의 부하 데이터를 이용하여 클러스터링 기법을 통해 대표 부하패턴을 생성하는 방식을 제안하였다. 기존에는 계약종별 코드가 동일한 고객들의 부하패턴을 이용하여 15분 단위의 평균 사용량을 계산하여 대표 부하패턴을 생성하는 방식을 사용하였으나, 같은 계약종별 코드를 갖는 고객이라 할지라도 부하패턴이 다른 경우가 많아서 부하분석의 정확도를 떨어뜨렸다. 본 연구에서는 동일한 계약종별 코드를 갖는 고객에 대하여 15분 단위 자동검침 데이터를 이용하여 k-means 기법을 통해 고객을 분류하고 각 그룹마다 대표 부하패턴을 생성하는 방식을 제안하였다.

• Annual Conference of KIPS
• /
• 2002.11c
• /
• pp.1991-1994
• /
• 2002

본 논문은 기존에 작성된 자바 프로그램이나 현재 구현 중인 자바 프로그램을 대상으로 메트릭 정보를 측정하는 자동화 도구의 설계 및 구현 결과를 논한다. 이러한 도구의 구현을 위해 필요한 가장 핵심적인 기능은 자바코드에 대한 분석 기능이다. 본 논문의 내용은 한국전자통신연구원의 컴포넌트 공학 연구팀 주관으로 EJB(Enterprise Java Beans) 기술을 기반으로 컴포넌트를 개발하기 위한 환경인 COBALT(Component Based Application devlopment Tool) 시스템의 부 시스템으로 구현된 자바코드 메트릭 측정 도구의 설계 및 구현 결과를 다룬다. 본 논문에서 구현된 자바 코드 메트릭 측정 도구을 통하여 클래스의 적절한 분할, 클래스 멤버 자원의 적절한 배치, 상속 트리의 적절한 조직 등을 이룰 수 있다.

• Annual Conference of KIPS
• /
• 2018.05a
• /
• pp.166-168
• /
• 2018

새롭게 변형되는 대규모 악성코드들을 신속하게 탐지하기 위하여 인공지능 딥러닝을 이용한 악성코드 탐지 기법을 제안한다. 대용량의 고차원 악성코드를 저차원의 이미지로 변환하고, 딥러닝 합성곱신경망(Convolution Neural Network)을 통해 이미지의 악성코드 패턴을 학습하고 분류하였다. 본 논문에서는 악성코드 분류 모델의 성능을 검증하기 위하여 악성코드 종류별 분류 실험과 악성코드와 정상코드 분류 실험을 실시하였고 각각 97.6%, 87%의 정확도로 악성코드를 구별해 내었다. 본 논문에서 제안한 악성코드 탐지 모델은 차원 축소를 통해 10,868개(200GB)의 대규모 데이터에 대하여 10분 이내의 학습시간이 소요되어 새로운 악성코드 학습 및 대용량 악성코드 탐지를 신속하게 처리 가능함을 보였다.