• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1126-1135
• /
• 2014

In recent years, RDF partitioning schemes have been studied for the effective distributed storage and management of large-scale RDF data. In this paper, we propose an RDF dynamic partitioning scheme to support load balancing in dynamic environments where the RDF data is continuously inserted and updated. The proposed scheme creates clusters and sub-clusters according to the frequency of the RDF data used by queries to set graph partitioning criteria. We partition the created clusters and sub-clusters by considering the workloads and data sizes for the servers. Therefore, we resolve the data concentration of a specific server, resulting from the continuous insertion and update of the RDF data, in such a way that the load is distributed among servers in dynamic environments. It is shown through performance evaluation that the proposed scheme significantly improves the query processing time over the existing scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1365-1368
• /
• 2012

순차 패턴 탐사 기법은 순서를 갖는 패턴들의 집합 중에 빈발하게 발생하는 패턴을 찾아내는 기법이다. 순차 패턴 탐사 분야 중에 동적 가중치 순차 패턴 탐사는 가중치가 시간에 따라 변화하는 컴퓨팅 환경에 적용하는 마이닝 기법으로 동적인 중요도 변화를 마이닝에 적용하여 다양한 환경에서 활용 가능하다. 이 논문에서는 다양한 순차 데이터에서 동적 가중치를 적용하여 순차 패턴을 탐사하는 새로운 시퀀스 데이터 마이닝 기법에 대하여 제안한다. 제안하는 기법은 시간 순서에 의한 상대적인 동적 가중치를 사용하여 탐색해야 하는 후보 패턴을 줄여줄 수 있어 빈발한 시퀀스 패턴을 빠르게 찾을 수 있다. 이 기법을 사용하면 기존 가중치를 적용하는 방식보다 메모리 사용과 처리 시간을 줄여줘 매우 효율적이다.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.217-225
• /
• 2014

Analysis of social media such as Twitter can yield interesting perspectives to understanding human behavior, detecting hot issues, identifying influential people, or discovering a group and community. However, it is difficult to gather the data relevant to specific topics due to the main characteristics of social media data; data is large, noisy, and dynamic. This paper proposes a new algorithm that dynamically selects the seed nodes to efficiently collect tweets relevant to topics. The algorithm utilizes attributes of users to evaluate the user influence, and dynamically selects the seed nodes during the collection process. We evaluate the proposed algorithm with real tweet data, and get satisfactory performance results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.305-308
• /
• 2014

AIS(Automatic Identification System) is a radionavigation equipment for exchanging safety related information between ships as well as ship and shore station, introduced by SOLAS convention and widely used especially in vessel traffic service. The dynamic data of AIS is transmitted at intervals of 2 second to 3 minutes depending on ship's navigational status and speed. However, so often times it happens that some AIS data can not be received due to increasing AIS traffic and it's time slot confliction. In this paper, a revised reporting intervals of AIS dynamic data is proposed in order to decrease AIS data link load.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.435-437
• /
• 2016

Hadoop Distributed File System(HDFS) is a file system for distributed processing of big data by replicating data to distributed data nodes. HDFS cluster shows a great scalability up to thousands of nodes, but it assumes a exclusive node cluster with numerous nodes for the big data processing. Various operational-purpose worker systems used by office are hardly considered as a part of cluster. This paper discusses this problem and proposes a dynamic cluster management technique to increase storage capability and analytic performance of hadoop cluster. The propsed technique can add legacy systems to the cluster and can remove them from the cluster dynamically depending on their availability.

• Journal of KIISE:Software and Applications
• /
• v.37 no.12
• /
• pp.882-891
• /
• 2010

Many automated dynamic test data generation technique have been proposed. The techniques evaluate fitness of test data through executing instrumented Software Under Test (SUT) and then generate new test data based on evaluated fitness values and optimization algorithms. Previous researches and experiments have been showed that these techniques generate effective test data. However, optimization algorithms in these techniques incur much time to generate test data, which results in huge test case generation cost. In this paper, we propose a technique for reducing the time of evaluating a fitness of test data among steps of dynamic test data generation methods. We introduce the concept of Fitness Evaluation Program (FEP), derived from a path constraint of SUT. We suggest a test data generation method based on FEP and implement a test generation tool, named ConGA. We also apply ConGA to generate test cases for C programs, and evaluate efficiency of the FEP-based test case generation technique. The experiments show that the proposed technique reduces 20% of test data generation time on average.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.6
• /
• pp.103-113
• /
• 2014

This study designed and implemented a query model for consecutive analyses of dynamic multivariate graph data. First, the query model consists of two procedures; setting the discriminant function, and determining an alteration method. Second, the query model was implemented as a query system that consists of a query panel, a graph visualization panel, and a property panel. A Node-Link Diagram and the Force-Directed Graph Drawing algorithm were used for the visualization of the graph. The results of the queries are visually presented through the graph visualization panel. Finally, this study used the data of worldwide import & export data of small arms to verify our model. The significance of this research is in the fact that, through the model which is able to conduct consecutive analyses on dynamic graph data, it helps overcome the limitations of previous models which can only perform discrete analysis on dynamic data. This research is expected to contribute to future studies such as online decision making and complex network analysis, that use dynamic graph models.

• The Korean Journal of Applied Statistics
• /
• v.36 no.4
• /
• pp.349-360
• /
• 2023

Dynamic Nelson-Siegel model is widely used in modeling term structure of interest rates for financial products. In this study, we explain dynamic Nelson-Siegel model from the perspective of the state space model and explore Bayesian approaches that can be applied to that model. By applying SOFR term rate data to the Bayesian dynamic Nelson-Siegel model, we confirm the performance and compare it with other competing models such as Vasicek model, dynamic Nelson-Siegel model based on the frequentist approach, and the two-factor Bayesian dynamic Nelson-Siegel model. We also confirm that the Bayesian dynamic Nelson-Siegel model outperformed its competitors on SOFR term rate data based on RMSE.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.716-718
• /
• 2003

최근 들어 데이터가 연속적으로 생성되므로 인해 디스크에 저장된 형태로 모델링되기 어려운 특성을 갖는 데이터 응용환경에 대한 관심이 증대하고 있다. 스트림 데이터를 대상으로 이루어지는 스트림 질의는 저장된 릴레이션 내의 데이터를 대상으로 한번 적용되고 마는 기존의 데이터 응용에서와는 달리, 한번 등록이 되면 계속적으로 입력 데이터 스트림을 감시하다가 질의를 만족시키는 투플이 발생될 때마다 결과를 출력하는 연속성을 갖는다. 이러한 데이터 스트림 처리 시스템에서 성능 향상을 위한 질의 계획 최적화에 대한 연구가 이루어지고 있으며, 이를 위한 하나의 방법으로 현재 사용중인 질의 계획에서 질의 계획의 일부를 재구성하기 위해서 최적화 대상 질의 계획으로의 입력을 중단하고 최적화된 새로운 질의 계획으로 바꾸어 임시 저장된 데이터를 새로운 질의 계획에 입력하는 방법이 이용되고 있다. 그러나 이 방법을 사용하는 경우 입력 데이터 버퍼링을 위한 저장공간에 대한 비용이 증가하고. 부정확한 갑을 산출을 유발할 수 있는 등 몇 가지 문제점을 안고 있다. 본 논문에서는 이러한 문제를 해결하기 위하여 최적화 대상이 되는 질의 계획을 일시적으로 중복시켜 최적화가 진행되고 있는 과정 중에도 기존의 질의 계획이 입력 스트림을 계속 처리하고, 최적화된 새로운 질의 계획으로 입력 스트림을 처리하도록 하는 일시 중복을 이용한 동적 질의 계획 재구성 기법을 제시하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.584-587
• /
• 2009

전통적으로 지리정보시스템은 지형데이터와 속성데이터가 결합된 정적인 공간정보를 처리한다. 기존 지리정보시스템을 발전시켜, 시간에 따라 위치 및 기하데이터가 변화는 동적인 시공간데이터에 연구가 한동안 진행되어 왔다. 최근 들어 유비쿼터스 컴퓨팅 환경에 대한 관심이 집중되면서, 센싱 데이터와 같이 속성데이터가 동적으로 계속 변화는 데이터가 급증하고 있고, 센서노드의 위치가 고정 또는 이동함에 따라 공간정보와 결합하여 관리될 필요성이 급증하고 있다. 이에 본 논문에서는 USN기술와 GIS기술을 융합하여 GeoSensor 정보를 효과적으로 관리할 수 있는 u-GIS 융합데이터 처리 시스템을 제안하고자 한다.