• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.329-332
• /
• 2000

Research interests on temporal data have been almost focused on data models. There has been relatively less research in the area of temporal data management. In this paper, we propose two data migration strategies based on time-segmented storage structure: the migration strategy by Time Granularity, the migration strategy by LST-GET. We describe the criterion for data migration and moving process. We simulated the performance of the migration strategy by Time Granularity in order to compare it with non-segmentation method. We compared and analyzed two data migration strategies for temporal data.

• 한국농공학회:학술대회논문집
• /
• 한국농공학회 2005년도 학술발표논문집
• /
• pp.456-460
• /
• 2005

The purpose of this study is to develop a estimation model of migration with only population data using the cohort-survival model which has been used for forecasting future population. The fluctuation of population can be bisected to the natural change which can be occurred by birth and death and the social change which means migration. The factors of the social change are usually very important for establishing rural policies. However, researches using migration data has limitations because the usage of them are restricted. For verifying a estimation model of migration, comparing estimated population in 2000 year and migration quantity between 1996 and 2000 of 25 gu with real values, using population data and death ratio from 1995 to 2000 of the 25 gu in Seoul. Result shows a reliable data that R-square of forecating population model is 0.9755 and migration is 0.9180. So these model are worth to estimate a population and migration quantity to restricted migration data.

• 한국정보처리학회논문지
• /
• 제6권4호
• /
• pp.851-867
• /
• 1999

Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.

• 정보처리학회논문지D
• /
• 제8D권6호
• /
• pp.813-822
• /
• 2001

본 논문에서는 시간지원 데이터를 과거 세그먼트, 현재 세그먼트, 그리고 미래 세그먼트로 분리한 저장 구조를 기반으로 하는 네 가지 데이터 이동 방법을 제안하였다. 제안한 데이터 이동 방법은 시간단위에 의한 이동 방법, LST-GET(Least valid Start Time-Greatest valid End Time)에 의한 이동 방법, AST-AET(Average valid Start Time-Average valid End Time)에 의한 이동 방법, 그리고 Min-Overlap에 의한 이동 방법이 있다. 각각의 이동 방법에서는 세그먼트의 경계값, 각 세그먼트에 저장되는 개체 버전 등을 정의하였다. 제안한 이동 방법에 대해서 사용자 질의에 대한 평균 응답 시간을 측정하였다. 실험결과, LLT(Long Lived Tuples)가 없는 경우에는 LST-GET에 의한 이동 방법, 그리고 AST-AET에 의한 이동 방법이 시간단위에 의한 이동 방법보다 성능이 우수하였다. LLT가 있는 경우에는 LST-GET에 의한 이동 방법의 성능이 저하되었다. AST-AET에 의한 이동 방법은 시간단위에 의한 이동 방법과 LST-GET에 의한 이동 방법보다 질의에 대한 성능이 우수하였다. Min-Overlap에 의한 이동 방법은 질의에 대한 평균 응답 시간에서 AST-AET에 의한 이동 방법과 비슷한 결과를 보였고, 공간 이용율 측면에서는 AST-AET에 의한 이동 방법보다 효율적이었다.

• Journal of Information Processing Systems
• /
• 제11권1호
• /
• pp.148-164
• /
• 2015

The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

• 한국지역지리학회지
• /
• 제16권5호
• /
• pp.590-609
• /
• 2010

본 연구의 목적은 연령별 인구이동의 구조와 공간적 패턴에 대한 이해를 향상시킬 수 있는 다양한 탐색적 공간 데이터 분석(Exploratory Spatial Data Analysis: ESDA) 기법들을 제시하는데 있다. ESDA 기법의 하나로 지역의 연령별 이동성향과 이동구조를 파악하기 위한 도구로 인구이동 피라미드를 고안하였다. 인구이동 피라미드는 연령별 전입, 전출, 순이동 정보를 이용하여 작성되는 그래픽 도구이다. 또한 연령별 인구이동의 공간적 패턴을 파악하기 위하여 다양한 국지적 연관성 측정 지표인 Local Moran's $I_i$, Getis-Ord's ${G_i}^*$와 이를 응용한 AMOEBA 기법을 이용하였다. 사례 분석 결과, 제시한 ESDA 기법들을 이용하여 연령별 인구이동 구조, 연령별 이동의 연관성, 연령별 순이동률의 공간 군집 패턴 등을 확인할 수 있었으며, 연령별 공간 군집 사이의 상응관계를 탐색할 수 있었다. 이러한 정보는 인구이동 현상에 대한 상세한 이해뿐만 아니라 인구이동을 유발하는 지역의 특성을 유추하는데 도움을 준다.

• 농촌계획
• /
• 제23권2호
• /
• pp.43-54
• /
• 2017

When an age of low growth and population decline, population migration plays an important role in spatial structure of region. There have been many researches on migration and regional spatial structure. The purpose of this study is to examine the changes of Gwangju and Jeonnam region's spatial structure and central area using social network analysis methods. For analysis it was used that population and migration data and passenger OD(Origin and Destination) travel data released by Statistics Korea and Korea Transport Database(KTDB). Using Gephi 0.8.2, migration and passenger OD networks were visualized, and this describe network flow and density. The results of the network centrality analysis show that the most populated village is not always network center though population mass is an important factor of central places. The average eigenvector centrality of 2010 migration is the lowest during 2005-2015, and it means few regions have high centralities. When comparing migration and travel networks, travel data is more effective than migration data in determining the central location considering spatial functions.

• 한국정보과학회논문지:데이타베이스
• /
• 제28권3호
• /
• pp.384-394
• /
• 2001

본 논문에서는 시간지원 데이터를 과거 세그먼트, 현재 세그먼트, 그리고 미래 세그먼트로 분리한 저장 구조를 기반으로 하는 AST-AET(Average valid Start Time-Average valid End Time) 데이터 이동 방법을 제안한다. 제안한 AST-AET를 계산하는 방법과 이동 대상 이 되는 개체 버전을 정의한다. AST와 AET를 계산하는 방법과 이동 대상이 되는 개체 버 전을 검색하고 이동하는 과정을 보인다. 도한, 제안하는 AST-AET 데이터 이동방법과 기존 의 LST-GET(Least valid Start Time-Greatest valid End Time) 데이터 이동 방법의 사용 자 질의에 대한 평균 응답시간을 비교한다. 실험 결과에 의하면, LLT(Long Lived Tuples)가 없윽 때는 현재 세그먼트의 크기가 비슷 하기 때문에 두 이동 방법의 평균 응답 시간이 비슷하였다. 그러나 LLT가 있을 때에는 LST-GET 데이터 이동방법의 현재 세그먼트 크기가 커지기 때문에, AST-AET 데이터 이 동 방법의 평균 응답 시간이 LST-GET 데이터 이동 방법보다 작았다. 또한, 시간지원 질의 의 평균 응답 시간이 LST-GET 데이터 이동 방법보다 전반적으로 작았다.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.476-490
• /
• 2017

In the centralized cloud controlled environment, the decision-making and monitoring play crucial role where in the host controller (HC) manages the resources across hosts in data center (DC). HC does virtual machine (VM) and physical hosts management. The VM management includes VM creation, monitoring, and migration. If HC down, the services hosted by various hosts in DC can't be accessed outside the DC. Decentralized VM management avoids centralized failure by considering one of the hosts from DC as HC that helps in maintaining DC in running state. Each host in DC has many VM's with the threshold limit beyond which it can't provide service. To maintain threshold, the host's in DC does VM migration across various hosts. The data in migration is in the form of plaintext, the intruder can analyze packet movement and can control hosts traffic. The incorporation of security mechanism on hosts in DC helps protecting data in migration. This paper discusses an approach for dynamic HC selection, VM selection and secure VM migration over cloud environment.

• 한국신재생에너지학회:학술대회논문집
• /
• 한국신재생에너지학회 2007년도 춘계학술대회
• /
• pp.493-496
• /
• 2007

Korean Institute of Geosciences and Mineral Resources (KIGAM) has studied on gas hydrate in the Ulleung Basin, East sea of Korea since 1997. Most of all, a evidence for existence of gas hydrate, possible new energy resources, in seismic reflection data is bottom simulating reflection (BSR) which parallel to the sea bottom. Here we conducted the conventional data processing for gas hydrate data and Kirchhoff prestack depth migration. Kirchhoff migration is widely used for pre- and post-stack migration might be helpful to better image as well as to get the geological information. The processed stack image by GEOBIT showed some geological structures such as faults and shallow gas hydrate seeping area indicated by strong BSR. The BSR in the stack image showed at TWT 3.07s between shot gather No 3940 to No 4120. The estimated gas seeping area occurred at the shot point No 4187 to No 4203 and it seems to have some minor faults at shot point No 3735, 3791, 3947 and 4120. According to the result of depth migration, the BSR showed as 2.3km below the sea bottom.