• Tunnel and Underground Space
• /
• v.29 no.4
• /
• pp.262-279
• /
• 2019

In the engineering barriers of high-level radioactive waste disposal, gases could be generated through a number of processes. If the gas production rate exceeds the gas diffusion rate, the pressure of the gas increases and gases could migrate through the bentonite buffer. Because people and the environment can be exposed to radioactivity, it is very important to clarify gas migration in terms of long-term integrity of the engineered barrier system. In particular, it is necessary to identify the hydro-mechanical mechanism for the dilation flow, which is a very important gas flow phenomenon only in medium containing large amounts of clay materials such as bentonite buffer, and to develop and validate new numerical approach for the quantitative evaluation of the gas migration phenomenon. Therefore, in this study, we developed a two-phase flow model considering the mechanical damage model in order to simulate the gas migration in the engineered barrier system, and validated with 1D gas flow modelling through saturated bentonite under constant volume boundary conditions. As a result of numerical analysis, the rapid increase in pore water pressure, stress, and gas outflow could be simulated when the dilation flow was occurred.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• Journal of Internet Computing and Services
• /
• v.24 no.2
• /
• pp.1-10
• /
• 2023

The Multi-access Edge Computing (MEC) paradigm equips network edge telecommunication infrastructure with cloud computing resources. It seeks to transform the edge into an IT services platform for hosting resource-intensive and delay-stringent services for mobile users, thereby significantly enhancing perceived service quality of experience. However, erratic user mobility impedes seamless service continuity as well as satisfying delay-stringent service requirements, especially as users roam farther away from the serving MEC resource, which deteriorates quality of experience. This work proposes a deep reinforcement learning based service mobility management approach for ensuring seamless migration of service instances along user mobility. The proposed approach focuses on the problem of selecting the optimal MEC resource to host services for high mobility users, thereby reducing service migration rejection rate and enhancing service availability. Efficacy of the proposed approach is confirmed through simulation experiments, where results show that on average, the proposed scheme reduces service delay by 8%, task computing time by 36%, and migration rejection rate by more than 90%, when comparing to a baseline scheme.

• Physical Therapy Rehabilitation Science
• /
• v.5 no.4
• /
• pp.193-197
• /
• 2016

Objective: In the present study, the effects of visual restriction and unstable base dual-task training (VUDT), stable base dual-task training (SDT), and on stroke patients' balance and concentration abilities were examined. Design: Two-group pretest-posttest design. Methods: Dual-task training was conducted for thirty persons with chronic stroke who were hospitalized or receiving physical therapy and were randomly assigned to either the VUDT group (n=15) or the SDT group (n=15). The subjects were divided into two groups of 15 participants each, the VUDT group and the SDT group. Dual-task training was administered for 30 minutes per session, three times a week for 8 weeks. The participants' balance was measured via the center of pressure migration distances, functional reach test (FRT), Berg Balance Scale (BBS), and attention was measured using the trail-making test and the Stroop test. Results: In comparisons within each group, the two groups showed significant differences before and after the training (p<0.05). In the comparisons between the groups, the VUDT group showed significant improvements in center of pressure (COP), FRT, and BBS, and TMT compared to the SDT group (p<0.05). Conclusions: It would be more effective to conduct dual-task training as a rehabilitation training program under vision restriction and unstable supporting surface conditions than to conduct the test under unstable supporting plane conditions to improve balance and attention in chronic stroke patients.

• ETRI Journal
• /
• v.20 no.4
• /
• pp.346-360
• /
• 1998

It is challenging to parallelize problems with irregular computation and communication. In this paper, we propose an asynchronous algorithm for balancing unpredictable workload on distributed-memory machines. By using an initial workload estimate, we first partition the computations such that the workload is distributed evenly across the processors. In addition, we perform task migrations dynamically for adapting to the evolving workload. To demonstrate the usefulness of our load balancing strategy, we conducted experiments on an IBM SP2 and a Cray T3D. Experimental results show that our task migration strategy can balance unpredictable workload with little overhead. Our code using C and MPI is portable onto other distributed-memory machines.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.176-179
• /
• 2002

In recent years, an increasing amount of computer network research has focused on the problem of cluster system in order to achieve higher performance and lower cost. The load unbalance is the major defect that reduces performance of a cluster system that uses parallel program in a form of SPMD (Single Program Multiple Data). Also, the load unbalance is a problem of MPP (Massive Parallel Processors), and distributed system. The cluster system is a loosely-coupled distributed system, therefore, it has higher communication overhead than MPP. Dynamic load balancing can solve the load unbalance problem of cluster system and reduce its communication cost. The cluster systems considered in this paper consist of P heterogeneous nodes connected by a switch-based network. The master node can predict the average execution time of tasks for each slave node based on the information from the corresponding slave node. Then, the master node redistributes remaining tasks to each node considering the predicted execution time and the communication overhead for task migration. The proposed dynamic load balancing uses execution time prediction to optimize the task redistribution. The various performance factors such as node number, task number, and communication cost are considered to improve the performance of cluster system. From the simulation results, we verified the effectiveness of the proposed dynamic load balancing algorithm.

• The Journal of the Korean dental association
• /
• v.48 no.10
• /
• pp.738-753
• /
• 2010

Objectives: To deter job migration and to facilitate a more efficient personnel management system, a personality type analysis tool, such as MBTI and Enneagram, may be considered. These tools can facilitate better recognition of talent among prospective employees, as well as more efficient allocation of tasks for greater job satisfaction. Methods: This study conducted direct interviews with dental hygienists currently employed at two major dental organizations, which operate the largest networks of clinics across the greater metropolitan area. Results : First, in terms of number of turnover experiences, the Head Type showed lower task satisfaction, whereas the Body Type exhibited greater task satisfaction. Second, the Head Type showed greater job satisfaction compared to the other types. Third, the SJ Type, often considered the traditionalist in terms of long-term employments, exhibited greater tendencies toward long-term commitment with one employer. Fourth, dental hygienists, in terms of long-term employment, are negatively affected by task satisfaction, and positively affected by job satisfaction. Conclusions: It is thought to be considerable to use personality type analysis tools in clinical human resource management.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.165-175
• /
• 2007

The mobile agent executes a given task by which the agent code moves to the server directly. Therefore, node migration method becomes an important factor which impact on the whole performance of distributed system. In this paper, we propose an adaptive migration path technique of mobile agent using the metadata of naming agent. In this proposed technique, node selection for migration depends on the content of referenced metadata, and the reliability of migrated information is determined by the metadata updating method and cooperative operations of individual agents in multi-agents system. For these, we design the metadata using by the number of hit documents, hit ratio, node processing time and network delay time, and describe the methods for creating, using and updating metadata for which determine the adaptive node migration path of mobile agent according to the cooperation of individual agents and number of hit documents using by designed metadata. And results of evaluated performance for proposed adaptive migration path technique through the proper experiment and analysis gain rate of high effective information earning, because of high hit ratio(72%) about of fathered documents by case of applying metadata move to the 13 nodes. But, in case of non-applying metadata is hit ratio(46%) of gathered documents and rate of effective information earning about of 26 nodes is 36.8%.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.333-342
• /
• 2004

This paper presents a framework for the self-organization of swarm systems based on coupled nonlinear oscillators (CNOs). In this scheme, multiple agents in a swarm self-organize to flock and arrange themselves as a group using CNOs, which are able to keep a certain distance by the attractive and repulsive forces among different agents. A theoretical approach of flocking behavior by CNOs and a design guideline of CNO parameters are proposed. Finally, the formation scenario for cooperative multi-agent groups is investigated to demonstrate group behaviors such as aggregation, migration, homing and so on. The task for each group in this scenario is to perform a series of processes such as gathering into a whole group or splitting into two groups, and then to return to the base while avoiding collision with agents in different groups and maintaining the formation of each group.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.100-103
• /
• 2021

5G 의 발전과 함께 차량과 IT 통신 기술을 융합한 어플리케이션들이 급증하면서 멀티 액세스 엣지 컴퓨팅(MEC)이 차세대 기술로 등장했다. 낮은 지연시간 안에 계산 집약적인 서비스들을 제공하기 위해 단독적인 MECS 서버(MECS)에서의 수행이 아닌 다수의 MECS 에서 동시에 연산을 수행할 수 있도록 태스크를 파티셔닝하는 기법이 주목받고 있다. 특히 차량이 다수의 MECS 로 태스크를 파티셔닝하여 오프로딩하는 기법과 하나의 MECS 로 오프로딩한 후 다른 MECS 들로 파티셔닝하여 마이그레이션하는 기법들이 연구되고 있다. 본 논문에서는 오프로딩과 마이그레이션을 이용한 파티셔닝 기법들을 서비스 지연시간과 차량의 에너지 소비량 측면에서 성능을 비교 분석을 하였다.