• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.813-822
• /
• 2001

In this paper we proposed four data migration methods based on time segmented storage structure including past segment, current segment, and future segment. The migration methods proposed in this paper are the Time Granularity migration method, the LST-GET (Least valid Start Time-Greatest valid End Time) migration method, the AST-AET (Average valid Start Time-Average valid End Time) migration method, and the Min-Overlap migration method. In the each data migration method we define the dividing criterion among segments and entity versions to store on each segment. We measured the response time of queries for the proposed migration methods. When there are no LLTs (Long Lived Tuples), the average response time of AST-AET migration method and LST-GET migration method are smaller than that of Time Granularity migration method. In case of existing LLT, the performance of the LST-GET migration method decreased. The AST-AET migration method resulted in better performance for queries than the Time Granularity migration method and the LST-GET migration method. The Min-Overlap migration method resulted in the almost equal performance for queries compared with the AST-AET migration method, in case of storage utilization more efficient than the AST-AET.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• 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.

• Journal of Digital Convergence
• /
• v.11 no.6
• /
• pp.143-149
• /
• 2013

In this paper we present a data migration method for developing GIS-based Fisheries Resources Information Systems after considering standardization of existing methods and analyzing characteristics of such systems. First, a strategy for data migration is defined. Second, a iterative process to build a spatial database is planned. Third, the process is executed to make database transformations and basic data are converted into real GIS data. Finally, developers and users cross-check data correctness. As a result of our research, we suggest a data migration method for GIS data and confirm its usefulness by applying it to real projects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.6
• /
• pp.1599-1618
• /
• 2024

Access control has always been one of the effective methods to protect data security. However, in new computing environments such as big data, data resources have the characteristics of distributed cross-domain sharing, massive and dynamic. Traditional access control mechanisms are difficult to meet the security needs. This paper proposes CACM-MMSR to solve distributed cross-domain access control problem for massive resources. The method uses blockchain and smart contracts as a link between different security domains. A permission decision model migration method based on access control logs is designed. It can realize the migration of historical policy to solve the problems of access control heterogeneity among different security domains and the updating of the old and new policies in the same security domain. Meanwhile, a semantic reasoning-based permission decision method for unstructured text data is designed. It can achieve a flexible permission decision by similarity thresholding. Experimental results show that the proposed method can reduce the decision time cost of distributed access control to less than 28.7% of a single node. The permission decision model migration method has a high decision accuracy of 97.4%. The semantic reasoning-based permission decision method is optimal to other reference methods in vectorization and index time cost.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.4
• /
• pp.205-210
• /
• 2014

Cache based live migration method utilizes a cache, which is accessible to both side (remote and local), to reduce the virtual machine migration time, by transferring only irredundant data. However, address space layout randomization (ASLR) is proved to reduce the memory duplicate ratio between targeted migration memory and the migration cache. In this pager, we analyzed the behavior of ASLR to find out how it changes the physical memory contents of virtual machines. We found that among six virtual memory regions, only the modification to stack influences the page-level memory duplicate ratio. Experiments showed that: (1) the ASLR does not shift the heap region in sub-page level; (2) the stack reduces the duplicate page size among VMs which performed input replay around 40MB, when ASLR was enabled; (3) the size of memory pages, which can be reconstructed from the fresh booted up state, also reduces by about 60MB by ASLR. With those observations, when applying cache-based migration method, we can omit the stack region. While for other five regions, even a coarse page-level redundancy data detecting method can figure out most of the duplicate memory contents.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.543-553
• /
• 2001

In this paper, we proposed management strategy of medical image data in order to solve the problem in traditional medical images migration method. As management strategy of medical image data we proposed EAT(Expanded Average Transaction time) data migration method and data storing method based on temporal interrelation. In EAT data migration strategy, we define the dividing criterion which distinguish entity versions to be stored in each storage and also define entity versions to be stored in each storage. We defined degree of overlap and degree of difference for any two entity versions, and integrated those values and described method which place entity versions to storage. In order to compare the number of cluster references when we change rate of temporal queries, the number of cluster references of proposed method is smaller than that of traditional method.

• Geophysics and Geophysical Exploration
• /
• v.11 no.1
• /
• pp.60-67
• /
• 2008

In this paper we consider an application of the method of electromagnetic (EM) migration to the interpretation of a typical marine controlled-source (MCSEM) survey consisting of a set of sea-bottom receivers and a moving electrical bipole transmitter. Three-dimensional interpretation of MCSEM data is a very challenging problem because of the enormous number of computations required in the case of the multi-transmitter and multi-receiver data acquisition systems used in these surveys. At the same time, we demonstrate that the MCSEM surveys with their dense system of transmitters and receivers are extremely well suited for application of the migration method. In order to speed up the computation of the migration field, we apply a fast form of integral equation (IE) solution based on the multigrid quasi-linear (MGQL) approximation which we have developed. The principles of migration imaging formulated in this paper are tested on a typical model of a sea-bottom petroleum reservoir.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1084-1098
• /
• 2005

In this paper, we propose a migration technique for autonomous mobile agents suitable to dynamic environments. The proposed migration technique dynamically creates the itinerary of agents that considers states of networks and systems. In the migration of the agent, it first sends prefetching message to the next system. The system receives necessary data for migration in advance. Through this, we reduce the amount of the sending data and save the time for creating the instance of the agent. And it improves the execution efficiency by using the checkpoint-based recovery method that does not execute the agent again and recovers the process states even though the errors take place. To show superiority of the proposed technique, we compare the proposed method with the existing methods through various simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1567-1574
• /
• 2012

Since a migration method of the mobile agent is a factor that affects the overall performance of the entire distributed system, it is necessary to find efficient migration methods of the mobile agent within the sensor network and to collect and store data related to various components(server, sink and sensor node) of the sensor network, thereby providing consistent naming services. Accordingly, this paper presents design and implementation of MetaTable that is divided into MetaData where information on the sensor data server is stored and SubMetaData where various types of information on sink nodes and data on sensor nodes connected with the sink nodes is stored. Moreover, the paper also presented the implementation of forward migration of an active rule mobile agent applying the naming method based on RMI that used the meta_table and proposed the possibility of constructing efficient sensor network application environment. In this paper, for registration, release and retrieval methods suitable for new sensor network environment, we designed and implemented the naming agent by applying J2EE model based on RMI-IIOP(Internet Inter-ORB Protocol) technique.

• Advances in concrete construction
• /
• v.1 no.3
• /
• pp.239-252
• /
• 2013

Mortar microstructure is considered as a three-phase composite material, which is cement paste, fine aggregate and interfacial transition zone. Interfacial transition zone is the weakest link between the cement paste and fine aggregate, so it has a significant role to determine the properties of cementitious composites. In this study, specimens (w/c = 0.35, 0.45, 0.55) with various volume fractions of fine aggregate ($V_f$ = 0, 0.1, 0.2, 0.3 and 0.4) were cast and tested. To predict the equivalent migration coefficient ($M_e$) and migration coefficient of interfacial transition zone ($M_{itz}$), double-inclusion method and Mori-Tanaka theory were used to estimate. There are two stages to estimate and calculate the thickness of interfacial transition zone (h) and migration coefficient of interfacial transition zone ($M_{itz}$). The first stage, the data of experimental chloride ion migration coefficient ($M_s$) was used to calculate the equivalent migration coefficient of fine aggregate with interfacial transition zone ($M_e$) by Mori-Tanaka theory. The second stage, the thickness of interfacial transition zone (h) and migration coefficient of interfacial transition zone ($M_{itz}$) was calculated by Hori and Nemat-Nasser's double inclusion model. Between the theoretical and experimental data a comparison was conducted to investigate the behavior of interfacial transition zone in mortar and the effect of interfacial transition zone on the chloride migration coefficient, the results indicated that the numerical simulations is derived to the $M_{itz}/M_m$ ratio is 2.11~8.28. Additionally, thickness of interfacial transition zone is predicted from $10{\mu}m$, 60 to $80{\mu}m$, 70 to $100{\mu}m$ and 90 to $130{\mu}m$ for SM30, M35, M45 and M55, respectively.