• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2020

In order to reach Ultra-Reliable Low-Latency communication, one of 5G aims, Multi-access Edge Computing paradigm was born. The idea of this paradigm is to bring cloud computing technologies closer to the network edge. User services are hosted in multiple Edge Clouds, deployed at the edge of the network distributedly, to reduce the service latency. For mobile users, migrating their services to the most proper Edge Clouds for maintaining a Quality of Service is a non-convex problem. The service migration problem becomes more complex in high mobility scenarios. The goal of the study is to observe how user mobility affects the selection of Edge Cloud during a fixed mobility path. Mobility-Aware Service Migration (MASM) is proposed to optimize service migration based on two main parameters: routing cost and service migration cost, during a high mobility scenario. The performance of the proposed algorithm is compared with an existing greedy algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.8
• /
• pp.1453-1463
• /
• 1994

Recently many robot manipulators are used for various areas of industriesand factories. It has been frequently observed that the robot manipulator fails to complete the function when the object changes its original position, Due to the unexpected impacts and vibrations the center and direction of the object would be shifted in many real application. In this study, a visual sensing algorithm for the robot manipulator is proposed. The algorithm consists of two parts : Detection of the object migration and adjustments of the orobot manipulators Tool Coordinate System. The image filtering technique with visual sensor is applied for the first part of the algorithm. The change of illumination intensity indicates the object migration. Once the object migration is detected, the second part of the algorithm calculates the current position of the object. Then it adjusts the robot manipulators Tool Coordinate System. The robot manipulator and the Visual sensor communicate each other using interrupt technique via proposed algorithm. It has been observed that the proposed algorithm reduces the malfunction of a robot manipulator significantly. Thus it can provide better line balance-up of the manufacturing processes and prevent industrial accidents efficiently.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.953-961
• /
• 2000

In this paper, we propose the algorithm which solve synchronization problem happened migrating service objects. Load imbalance is occurred due to allocate different amount of load to be proposed to each node in distribute system. To solve this problem, the service objects have to be migrated from heavily loaded node to lightly loaded node. And in such a process, the synchronization problem may occur when client request a service object migrated incompletely. Therefore, we describe the environment of executing service objects, the importer/exporter/trader model compatible with migration of service objects, and appropriate migration algorithm, Finally, we analyze the conditions of problems, and propose the solution of each situations. Also, the performance advantages of using proposed algorithms are quantified through a simulation study.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.157-162
• /
• 2010

We present a new distributed genetic algorithm that can be used to extract useful information from distributed, large data over the network. The main idea of the proposed algorithms is to determine how many and which individuals move between subpopulations at each site adaptively. In addition, we present a method to help individuals from other subpopulations not be weeded out but adapt to the new subpopulation. We used six data sets from UCI Machine Learning Repository to compare the performance of our approach with that of the single, centralized genetic algorithm. As a result, the proposed algorithm produced better performance than the single genetic algorithm in terms of the classification accuracy with the feature subsets.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.5
• /
• pp.91-98
• /
• 2020

The mobile agent, which handles a given task while migrating between the sensor nodes, moves including the execution commands and task processing results. This increases the size of the mobile agent, causing the network to load, leading to the migration time delay and the loss of migration reliability. This paper presents the method of lightening the mobile agent using distributed object technology and the algorithm for exploring and providing the optimal migration path that is actively performed in the event of network traffic, and it proposes a method to ensure the reliability of the mobile agent migration by applying them. In addition, through the comparative analysis experiments based on agent size and network traffic for the migration time of mobile agent equipped with active rules in sensor network-based mobile agent middleware environment, applying the proposed methods proves to ensure the autonomy and migration reliability of the mobile agent.

• Geophysics and Geophysical Exploration
• /
• v.10 no.2
• /
• pp.111-123
• /
• 2007

Unlike the conventional reverse time migration method which is implemented by simply extrapolating wavefield in reverse time, this paper presents a derivation of another reverse time migration operator as the exact adjoint of the presumed forward wavefield extrapolation operator. The adjoint operator is obtained by formulating the forward time extrapolation operator in an explicit matrix equation form and then taking the adjoint to this matrix equation followed by determining the corresponding operator. The reverse time migration operator as the exact adjoint to the implied forward operator can be used not only as a migration algorithm but also as an adjoint operator which is required in the imaging through an inversion such as least-squares migration.

• The Korean Journal of Applied Statistics
• /
• v.29 no.3
• /
• pp.487-503
• /
• 2016

Urban-to-rural migration for farming has recently emerged as a new way to vitalize rural economies in a fast-aging rural Korea. In this paper, we analyze the 2013 data of returning farmers with statistical network methods. We identify urban to rural migration hubs with centrality measures and find migration trends based on regional clusters with similar features via statistical network models. We also fit a latent distance model to investigate the role of distance in migration.

• Journal of Navigation and Port Research
• /
• v.28 no.6
• /
• pp.517-523
• /
• 2004

The container load planning is one of key factors for efficient operations of handling equipments at container ports. When the number of containers are large, finding a good solution using the conventional genetic algorithm is very time consuming. To obtain a good solution with considerably small effort, in this paper a pseudo-parallel genetic algorithm(PPGA) based on both the migration model and the ring topology is developed The performance of the PPGA is demonstrated through a test problem of determining the optimal loading sequence of the containers.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.7
• /
• pp.952-965
• /
• 1995

In the hypercube multiprocessor system. repeated allocations and deallocations of subcubes generate a fragmented hypercube from which. even if sufficient free processors are available, a subcube that is large enough to accomodate a new task cannot be formed. To eliminate the fragmentation, we need a processor relocation to move a task-occupied subcube to a free subcube, and gather dispersed small subcubes. In this paper, we propose a routing algorithm for task migration in circuit- switched hypercube to relocate processors. In the circuit-switched hypercube, we have to find a set of dedicated link-disjoint routing paths for each node to move a task from a busy subcube to a free subcube in fragmentation. The proposed algorithm is based on the PGC(packed Gray code) which detects all kinds of subcubes.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.1-11
• /
• 2013

Various computing systems are used in naval ships. Since each system has a single purpose and its applications are tightly coupled with the physical machine, applications cannot share physical resources with each other. It is hard to utilize resources efficiently in conventional naval shipboard computing environment. In this paper, we present an integration architecture for virtualized naval shipboard computing systems based on open architecture. Our proposed architecture integrates individual computing resources into one single integrated hardware pool so that the OS and applications are encapsulated as a VM. We consider the issue of varying needs of all applications in a naval ship that have different purposes, priorities and requirements. We also present parallel VM migration algorithm that improves the process time of resource reallocation of given architecture. The evaluation results with the prototype system show that our algorithm performs better than conventional resource reallocation algorithm in process time.