• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.657-664
• /
• 2003

Reliable tracking of moving humans is essential to motion estimation, video surveillance and human-computer interface. This paper presents a new approach to human motion tracking that combines appearance-based and model-based techniques. Monocular color video is processed at both pixel level and object level. At the pixel level, a Gaussian mixture model is used to train and classily individual pixel colors. At the object level, a 3D human body model projected on a 2D image plane is used to fit the image data. Our method does not use inverse kinematics due to the singularity problem. While many others use stochastic sampling for model-based motion tracking, our method is purely dependent on nonlinear programming. We convert the human motion tracking problem into a nonlinear programming problem. A cost function for parameter optimization is used to estimate the degree of the overlapping between the foreground input image silhouette and a projected 3D model body silhouette. The overlapping is computed using computational geometry by converting a set of pixels from the image domain to a polygon in the real projection plane domain. Our method is used to recognize various human motions. Motion tracking results from video sequences are very encouraging.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.504-511
• /
• 2015

Recently, the amount of data is rapidly increasing with the popularity of the SNS and the development of mobile technology. So, it has been actively studied for the effective data analysis schemes of the large amounts of data. One of the typical schemes is a Voronoi diagram based on kNN join algorithm (VkNN-join) using MapReduce. For two datasets R and S, VkNN-join can reduce the time of the join query processing involving big data because it selects the corresponding subset Sj for each Ri and processes the query with them. However, VkNN-join requires a high computational cost for constructing the Voronoi diagram. Moreover, the computational overhead of the VkNN-join is high because the number of the candidate cells increases as the value of the k increases. In order to solve these problems, we propose a MapReduce-based kNN-join query processing algorithm for analyzing the large amounts of data. Using the seed-based dynamic partitioning, our algorithm can reduce the overhead for constructing the index structure. Also, it can reduce the computational overhead to find the candidate partitions by selecting corresponding partitions with the average distance between two seeds. We show that our algorithm has better performance than the existing scheme in terms of the query processing time.

• The KIPS Transactions:PartD
• /
• v.14D no.4 s.114
• /
• pp.447-458
• /
• 2007

The objective of this study is to provide faster mobile web service by improving performance of Contents Cache used for mobile web service in the existing Mobile Gate System. It was found that two elements existed in Mark-Up page transcoded by Contents Generator. One of the elements was dependent only on the requested DIDL page and Mark-Up type. The other was dependent on each of the requested DIDL page, Mark-Up type, size of mobile display 모바일 장치 to request service, type of images available and color depth count of the images available. The conventional Contents Cache saved the entire Mark-Up page to hold both of the two elements. This caused the problem where storage space was not effectively used because reusable elements were repetitively saved in cache memory domain due to change in one of the elements even though all the other elements were the same. As a result, a larger number of transcoded Mark-Up pages could not be saved in the same cache memory size. Therefore, in this study, Mark-Up pages transcoded by Contents Generator were divided into two elements and were separately saved. Also, in order to respond to the demand for replacing data in cache with new data, this study applied two algorithms of LFU and LRU. This study proposed the method to implement cache performance of faster speed by enabling to save more number of the transcoded Mark-Up pages in the same cache storage space.

• Journal of Music and Human Behavior
• /
• v.12 no.1
• /
• pp.1-21
• /
• 2015

This study examined the effects of a tablet PC-based music-making program on the executive function of adolescents with intellectual disabilities. Four adolescents with intellectual disabilities participated in this program. Each participant received 45-minute individual sessions twice a week for a total of 16 sessions. The music-making program was designed in the sequence of planning; learning table PC operations; exploring musical elements; making rhythm, melody, and lyrics; composing loop sections; and presentation of the completed music. The Stroop test, Children's Color Trails Test, and Digit Span and Letter-Number sequencing tests were measured at pretest, midtest, and posttest in order to examine changes in executive function. The participants showed increased scores on all three tests. The participants' attention span also increased and their attempts to correct errors during tasks occurred more frequently at posttest. This study supports the effects of the technology-based program on the executive function of adolescents with intellectual disabilities and presents its expanded applicability for adolescents who show low cognitive function and limited motivation for cognitive engagement.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.59-76
• /
• 2015

Recent wide spread of embedded devices and technology growth of broadband communication has led to rapid increase in the volume of created and managed data. As a result, data centers have to increase the storage capacity cost-effectively to store the created data. Data deduplication is one way to save the storage space by removing redundant data. This work propose IO extent based deduplication schemes called CORE-Dedup that exploits content-preserving access locality. We acquire IO traces from block device layer in virtual machine host, and compare the deduplication performance of chunking method between the fixed size and IO extent based. At multiple workload of 10 user's compile in virtual machine environment, the result shows that 4 KB fixed size chunking and IO extent based chunking use chunk index 14500 and 1700, respectively. The deduplication rate account for 60.4% and 57.6% on fixed size and IO extent chunking, respectively.

• 한국지구과학회:학술대회논문집
• /
• 2010.04a
• /
• pp.106-106
• /
• 2010

오일샌드는 비투멘(bitumen), 물, 점토, 모래의 혼합체로 이루어진 비재래형 탄화수소 자원으로 세계적인 고유가 시대에 큰 관심을 받고 있는 석유자원 중 하나이다. 오일샌드는 대부분이 캐나다 앨버타주에 분포하고 있으며 주요 저류층으로는 아스바스카(Athabasca), 콜드레이크(Cold Lake) 지역의 멕머레이층(McMurray Formation), 클리어워터층(Clearwater Formation), 그랜드래피드층(Grand Rapid Formation)과 피스리버(Peace River) 지역의 블루스카이층(Bluesky Formation), 게팅층(Gathing Formation)이 있다. 오일샌드 저류층은 고생대 탄산염 기반암 위에 하성-에스츄어리에 이르는 다양한 퇴적환경에서 형성되어 매우 복잡한 지질특성이 나타난다. 오일샌드 저류층의 효율적인 개발을 위해서는 저류층의 복잡한 지질학적 특성의 이해가 반드시 필요하다. 본 연구에서 캐나다 오일샌드 시추코어 분석 DB, 물리검층 자료, 현장 및 현생 시추코어를 통하여 오일샌드 저류층의 지질특성화 정보의 도출을 시도하였다. 우선 캐나다 앨버타 전역에 분포하는 시추공의 기본 정보(표고, 위경도, 층서별 최상부 심도, 생산광구명, 광구개발업체)를 제공하는 AccuMap DB 프로그램을 이용하여 광역적인 오일샌드 저류층의 분포 특성을 이해하고자 주요층서에 대한 고지형도 및 층후도를 생산광구별로 도면화하여 분석하였다. 또한 캐나다 ENCANA사와 국제공동연구의 일환으로 확보된 크리스티나 레이크(Christina Lake)광구의 현장 시추코어를 이용하여 코어의 상세기재, 비파괴 물성측정, 입도/비투멘 함유량 분석과 같은 다양한 실내 시추코어분석 실험을 수행 중이다. 비파괴 물성측정은 현장 시추코어의 물리적/화학적 특성을 파악하고자 MSCL(Multi sensor core logger)과 XRF 코어 스캐너(X-ray fluorescence core scaner)를 통해 이루어지며, 분석결과로 시추코어의 감마밀도(gamma density), P파 속도(P-wave velocity), 전기비저항(resistivity), 대자율(magnetic susceptibility) 및 색지수의 물성과 정량적 화학조성을 측정한다. 현장 시추코어의 일부는 유기용매를 이용하여 퇴적물 내의 비투멘을 완전히 추출하고 퇴적물 입도와 저류층 비투멘 함유량 측정에 이용되었다. 현장 시료 분석 결과들은 물리검층 자료와 대비를 통하여 저류층의 지질특성을 규명하는 연구에 이용될 예정이다. 마지막으로 오일샌드의 현생 유사 퇴적환경으로 알려진 서해 경기만 조간대에서 시추코어 퇴적물을 획득하여 상세 기재하였으며, 이를 통해 오일샌드 저류층의 퇴적 모델을 제시하고자 퇴적층서 연구를 진행 중이다. 향후 오일샌드 관련 시추코어의 분석 결과들이 종합되면 기존 보다 비투멘 회수효율을 향상시킬 수 있는 정밀한 오일샌드 저류층 지질모델을 수립할 수 있을 것으로 기대된다.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.755-766
• /
• 2008

Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.85-93
• /
• 2011

The Vertex Coloring Problem hasn't been solved in polynomial time, so this problem has been known as NP-complete. This paper suggests linear time algorithm for Vertex Coloring Problem (VCP). The proposed algorithm is based on assumption that we can't know a priori the minimum chromatic number ${\chi}(G)$=k for graph G=(V,E) This algorithm divides Vertices V of graph into two parts as independent sets $\overline{C}$ and cover set C, then assigns the color to $\overline{C}$. The element of independent sets $\overline{C}$ is a vertex ${\upsilon}$ that has minimum degree ${\delta}(G)$ and the elements of cover set C are the vertices ${\upsilon}$ that is adjacent to ${\upsilon}$. The reduced graph is divided into independent sets $\overline{C}$ and cover set C again until no edge is in a cover set C. As a result of experiments, this algorithm finds the ${\chi}(G)$=k perfectly for 26 Graphs that shows the number of selecting ${\upsilon}$ is less than the number of vertices n.