• Journal of the Korean Society for Geothermal and Hydrothermal Energy
• /
• v.12 no.4
• /
• pp.15-20
• /
• 2016

Even though the control device of the heating system works well, insufficient water flow rates can degrade control performance and thermal comfort. The water flow rate should be adjusted appropriately to cope with the heating load of each zone. In order to solve these problems, a new balancing concept 'dynamic balancing' was proposed where a balancing valve opening can be automatically modulated according to the heating condition of the room. This study analyzed the effects of dynamic balancing upon indoor thermal environment and energy consumption in a radiant floor heating system through field measurement. Under part-load conditions, the use of a dynamic balancing is a more effective method to reduce energy consumption and to prevent a cavitation. Dynamic balancing is able to help boost the temperature of a room in the start-up period.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.483-486
• /
• 1998

In parallel system, the execution times of tasks cannot be accurately estimated and tasks may arrive at any time. In case, processors are overweighted with workload, the system utilization deteriorates. To solve this problem, dynamic load balancing that rearranges tasks in overloaded processors is required. We prospose the improved dynamic load balancing algorithm for $\textsc{k}-ary$ n-cubes using the property of ring and MWA which is the dynamic load balancing one for mesh. The proposed algorithm which uses the global load information has less communication cost than GDE, DDE and load difference within 1.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.71-82
• /
• 2009

As a solution to spectrum under-utilization problem, Cognitive radio (CR) introduces a dynamic spectrum access technology. In the area, one of the most important problems is how secondary users (SUs) should choose between the available channels, which means how to achieve load balancing between channels. We consider spectrum load balancing problem for CR system in frequency domain and especially in time domain. Our objective is to balance the load among the channels and balance the occupied time length of slots for a fixed channel dynamically in order to obtain a user-optimal solution. In frequency domain, we refer to Dynamic Noncooperative Scheme with Communication (DNCOOPC) used in distributed system and a distributed Dynamic Spectrum Load Balancing algorithm (DSLB) is formed based on DNCOOPC. In time domain, Spectrum Load Balancing method with QoS support is proposed based on Dynamic Feed Back theory and Hash Table (SLBDH). The performance of DSLB and SLBDH are evaluated. In frequency domain, DSLB is more efficient compared with existing Compare_And_Balance (CAB) algorithm and gets more throughput compared with Spectrum Load Balancing (SLB) algorithm. Also, DSLB is a fair scheme for all devices. In time domain, SLBDH is an efficient and precise solution compared with Spectrum Load Smoothing (SLS) method.

• Physical Therapy Korea
• /
• v.23 no.4
• /
• pp.16-26
• /
• 2016

Background: Deficiencies in the ability to maintain balance are common in elderly. Augmented feedback such as knowledge of results (KR) can accelerate learning and mastering a motor skill in older people. Objects: We designed this study to examine whether one session of Wii-Fit game with self-regulated KR is effective for elderly people, and to compare the effect of two different timings of self-regulated KR conditions. Methods: Thirty-nine community-dwelling elders, not living in hospice care or a nursing home, participated in this study. During acquisition, two groups of volunteers were trained in 10 blocks of a dynamic balancing task under the following 2 conditions, respectively: (a) a pre-trial self-regulated KR ($n_1=18$), or (b) a post-trial self-regulated KR ($n_2=21$). Immediate retention tests and delayed retention tests of balancing performance were administered in 15 minutes and 24 hours following acquisition period, respectively. Results: In both groups, significant improvements of balancing performances scores were observed during the acquisition period. Regardless of the group, mean of balancing performance scores on retention tests were well-maintained from the final session. There were no significant differences between groups in balancing performance scores during the acquisition period (p>.05); however, the post-trial self-regulated KR group exhibited significantly higher balancing performance scores in both the immediate retention test and delayed retention test than that of the pre-trial self-regulated KR group (p<.05). Conclusion: Therefore, subjects who regulated their feedback after a dynamic balancing task, during the acquisition period, experienced more efficient motor learning during the retention period than did subjects who regulated their feedback before a dynamic balancing task. Accordingly, in case of presenting the KR of motor learning in clinical settings to elders who reduced dynamic balance abilities, the requesting time of KR is imperative according to self-estimation processes as well as types of KR and practice.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1210-1216
• /
• 2004

This paper deals with a human-like gait generation of a biped robot with a balancing weight of an inverted pendulum type by using genetic algorithm. The ZMP (Zero Moment Point) is the most important index in a biped robot's dynamic walking stability. To perform a stable walking of a biped robot, a balancing motion is required according to legs' trajectories and a desired ZMP trajectory. A dynamic equation of the balancing motion is nonlinear due to an inverted pendulum type's balancing weight. To solve the nonlinear equation by the FDM (Finite Difference Method), a linearized model of equation is proposed. And GA (Genetic Algorithm) is applied to optimize a human-like balancing motion of a biped robot. By genetic algorithm, the index of the balancing motion is efficiently optimized, and a dynamic walking stability is verified by the ZMP verification equation. These balancing motion are simulated and experimented with a real biped robot IWR-IV. This human-like gait generation will be applied to a humanoid robot, at future work.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1997.10a
• /
• pp.11-19
• /
• 1997

이 글의 내용은 다음과 같다 1.서론 2.Rotor Dynamics에서의 Quotes & Misquotes/역사 바로 세우기 3.Rotor Dynamics는 이대로 좋은가\ulcorner 3.1.Rotor Dynamics와 Balancing 3.2.Balancing은 ultra-precision process 3.3.Unbalance response의 현황과 문제점 3.4.Jeffcott Rotor[Jeffcott 1919] 3.5.National Rotor Dynamics Test Facility의 필요성 4.결론

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.105-108
• /
• 2000

As Internet and WWW grow rapidly, the role of web servers is getting more important, and the number of users in a few popular site is also explosively increasing. Load balancing in clustered web server systems is important task to utilize whole system effectively, so dynamic load balancing is required to overcome the limit of static load balancing. In this paper, we propose two dynamic load balancing schemes, and analyzed load model and Performance improvement and also compare existing load balancing methods and IP filtering method. In case of load balancing with threshold, little extra traffic was required for better performance, but in case of load balancing with load weight, we found that the performance mainly depends on information exchange rate.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.45-52
• /
• 2008

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-Performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.4
• /
• pp.17-24
• /
• 2017

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.147-153
• /
• 2016

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.