• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.82-84
• /
• 2004

인터넷을 이용한 전자 상거래 잎 관리 시스템 등의 실시간 처리를 요구하는 응용분야가 점차 증가함으로 인해 고성능 실시간 트랜잭션 처리 시스템 개발이 요구되고 있다. 그러나 기존에 제안된 대부분의 실시간 시스템은 다중 처리기나 분산 처리 방식을 이용하였으며, 클러스터 기술을 이용한 실시간 트랜잭션처리 시스템은 아직 제안된 바 없다 클러스터를 이용한 실시간 트랜잭션 처리 시스템은 저렴한 가격으로 높은 가용성과 병렬 처리를 이용한 고성능 트랜잭션 처리를 지원할 수 있다는 장점을 갖는다 이러한 관점에서 본 논문에서는 공유 디tm크(shared disks： SD) 클러스터 기반의 실시간 트랜잭션 처리 시스템을 개발하기 위하여 캐쉬 일관성 제어 기법이나 트랜잭션 라우팅 기법과 같은 전통적인 SD 클러스터 알고리즘과 실시간 트랜잭션을 위찬 동시성 제어 기법을 연동한 실험 모형을 개발하였다. 다양한 환경에서의 모의실험을 통하여 알고리즘간의 상호 관계와 실시간 환경에서 SD 클러스터의 성능을 평가 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.935-936
• /
• 2009

본 논문에서는 과학기술문서에 존재하는 기술용어와 이들 간의 연관관계를 설명하는 디스크립터를 찾아서 [subject predicate object] 형태의 트리플을 생성하는 애플리케이션을 개발할 때 발생하는 단어 의미 애매성 해소 문제를 다룬다. 기술용어가 가지고 있는 연관관계를 결정하기 위해서 워드넷의 신셋 정보를 사용하는데 이 방법은 동사를 워드넷에 매핑할 때와 상위어 관계로 전이할 때 여러 개의 의미에 매핑되는 문제점이 발생한다. 이것을 해결하기 위해서 상위어 시퀀스 클러스터링을 이용한 단어의 의미 애매성 해결 방안을 제시한다. 이 방법을 사용함으로써 워드넷 매핑과 상위어 전이 시에 발생하는 다중 매핑 문제를 동시에 해결할 수 있다.

• Korean Journal of Optics and Photonics
• /
• v.14 no.6
• /
• pp.663-668
• /
• 2003

We studied a localized hologram recording method that can be used in a disk-shaped medium. In this method, the reference beam is focused by use of a cylindrical lens to get a thin spot in the medium, and then a hologram is recorded in that spot by illuminating the signal beam. Many localized holograms are multiplexed by shifting the medium by a distance more than the thin spot size of the reference beam. This method does not need recording-time scheduling for uniform diffraction efficiencies. We show that a minimal required thickness of the recording medium exists for a given spot size of the signal beam. We performed experiments for data storage and retrieval, and obtained a storage density of 20 bits/${\mu}{\textrm}{m}$$^2$ and a raw-bit error rate (RBER) of 2.5${\times}$10$^{-3}$ , when a 2 mm-thick Fe-doped LiNbO$_3$ crystal was used.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.639-649
• /
• 2000

In the relational database systems, the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed to reduce the execution time. Multiple hash join algorithm using allocation tree is one of most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. In this paper, to solve the performance degrading problem by the delay, we develop a join algorithm using the concept of 'synchronization of page execution time' for multiple hash joins. We reduce the processing time of each nodes in the allocation tree and improve the total system performance. In addition, we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.1-10
• /
• 2015

NAND flash systems require deletion operation and do not support in-place update, so the storage systems should use Flash Translation Layer (FTL). However, there are a lot of memory consumptions using mapping table in the FTL, so recently, many studies have been proposed to resolve mapping table overhead. These studies try to solve update propagation problem in the nand flash system which does not use mapping table. In this paper, we present a novel index structure, called CL-Tree(Cache List Tree), to solve the update propagation problem. The proposed index structure reduces write operations which occur for an update propagation, and it has a good performance for search operation because it uses multi-list structure. In experimental evaluation, we show that our scheme yields about 173% and 179% improvement in insertion speed and search speed, respectively, compared to traditional B+tree and other works.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.30-43
• /
• 2009

Broadcast in the wireless environment has drawn much attention because it is capable of sending data to clients regardless of the number of clients. Most previous researches have aimed at obtaining an independent data item in a minimum time. But, they have not been researched on simultaneously receiving dependent data items in a query. In addition, these papers have only researched allocation problem that have not been came out data items in a query in same time and different channels. The access probability of each data item based on query request probability have not been reflected. This paper proposes a new method of allocating data items and simultaneously minimizing average response time required in receiving all the dependent data items in a query. Our performance analysis shows that our proposed method gives better average response time over the existing methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2251-2259
• /
• 2009

We propose an algorithm and system which generates 3D stereo image by composition of 2D image from 4 multiple clusters which 1 cluster was composed of 4 multiple cameras based on network. Proposed Schemes have a network-based client-server architecture for load balancing of system caused to process a large amounts of data with real-time as well as multiple cluster environments. In addition, we make use of JPEG compression and RAM disk method for better performance. Our scheme first converts input images from 4 channel, 16 cameras to binary image. And then we generate 3D stereo images after applying edge detection algorithm such as Sobel algorithm and Prewiit algorithm used to get disparities from images of 16 multiple cameras. With respect of performance results, the proposed scheme takes about 0.05 sec. to transfer image from client to server as well as 0.84 to generate 3D stereo images after composing 2D images from 16 multiple cameras. We finally confirm that our scheme is efficient to generate 3D stereo images in multiple view and multiple clusters environments with real-time.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.1
• /
• pp.45.2-45.2
• /
• 2015

우리는 최근 현대천문학의 가장 오래된 난제로 우리은하 헤일로의 형성과 깊은 관련이 있는 구상성단계의 오스터호프 이분법이 다중항성종족 패러다임 하에서 76년 만에 완벽히 규명되는 것을 발견하였다. 또한 이 연구의 기본 개념을 우리은하 벌지에 적용한 결과, 기존 국제학계의 이론과 완전히 다른 벌지의 형성기원에 대한 새로운 해석에 도달하였다. 우리은하의 벌지에 대한 대규모 측광 서베이 분석으로부터 double red clumps가 있다는 것이 2010년에 발견되었고, 이는 디스크와 바 불안정에 기인하는 은하중심부 X-shape 구조의 증거로 널리 받아들여지고 있다. 그러나 우리는 이와 같은 국제학계의 해석이 수평계열성의 항성진화이론을 간과한데서 비롯된 허구일 가능성을 제시하고자 한다. 우리의 모델에 의하면 관측된 double red clumps는 Omega Cen을 포함하는 대다수의 구상성단에서 발견되는 것과 동일한 헬륨함량이 증가된 2세대 별들(G2)에 의한 효과이다. 우리은하 벌지에 위치한 Terzan 5 구상성단처럼, 중원소함량이 높은 벌지에서는 G2에 해당하는 수평계열성들이 광도가 약 0.5등급 더 밝은 red clump 위치에 놓이게 되어 자연스럽게 double red clumps를 형성하게 된다. 앞으로 우리의 새로운 해석이 Gaia에 의한 삼각시차 거리결정으로 확인된다면, 이는 우리은하 벌지를 이루는 대부분의 별들이 Terzan 5와 같은 윈시 빌딩블럭들의 합병과 붕괴에 의해 형성되었다는 것을 암시하여, 우리은하는 물론, 조기형은하의 형성기원 연구에 큰 전환점이 될 것으로 기대한다.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.04a
• /
• pp.266-271
• /
• 2009

A modeling method for the modal analysis of a multi-packet blade system having a crack undergoing rotational motion is presented in this paper. Each blade is assumed as a slender cantilever beam. The stiffness coupling effects between blades due to the flexibilities of the disc and the shroud are modeled with discrete springs. Hybrid deformation variables are employed to derive the equations of motion. The flexibility due to crack, which is assumed to be open during the vibration, is calculated basing on a fracture mechanics theory. To obtain more general information, the equations of motion are transformed into dimensionless forms in which dimensionless parameters are identified. The effects of the dimensionless parameters related to the angular speed, the depth and location of a crack on the modal characteristics of the system are investigated with some numerical examples.