• Journal of International Academy of Physical Therapy Research
• /
• v.12 no.2
• /
• pp.2370-2374
• /
• 2021

Background: Masticating is an activity that is free from temporal or spatial constraints, with an advantage that it can be combined easily with other treatment methods. While several studies have reported a positive effect of the intervention of chewing using the jaw on postural stability, only a few studies were conducted on stroke patients. Objectives: To investigated the effects of masticating chewing gum on the static and dynamic balancing of stroke patients. Design: Randomized cross-over study design. Methods: Nineteen stroke patients were randomly assigned to the chewing group or control group. BT4 was used to measure the static and dynamic balancing abilities. Pre-test measurements were taken before mastication of chewing gum, and post-test measurements were taken after 2 days. The stroke patients in the chewing group were guided to sit on a chair and chew gum for 3 min, and their balancing abilities were simultaneously measured. The balancing abilities of the control group patients were measured while they sat at rest without masticating chewing gum. Results: The chewing group showed significant increases in the measures of static balance (i.e., C90 area, trace length, X mean, and Y mean). In the between-group comparison, the measures of static balance were significantly higher in the chewing group than in the control group. Conclusion: These findings suggest that masticating chewing gum enhanced the static balancing ability of stroke patients. Thus, gum chewing should be considered a viable clinical intervention to control posture in stroke patients.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.72-72
• /
• 1995

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.1
• /
• pp.89-96
• /
• 2005

This paper is concerned with a balancing motion formulation and control of the ZMP (Zero Moment Point) for a biped-walking robot that has a prismatic balancing weight or a revolute balancing weight. The dynamic stability equation of a walking robot which have a prismatic balancing weight is conditionally linear but a walking robot's stability equation with a revolute balancing weight is nonlinear. For a stable gait, stabilization equations of a biped-walking robot are modeled as non-homogeneous second order differential equations for each balancing weight type, and a trajectory of balancing weight can be directly calculated with the FDM (Finite Difference Method) solution of the linearized differential equation. In this paper, the 3dimensional graphic simulator is developed to get and calculate the desired ZMP and the actual ZMP. The operating program is developed for a real biped-walking robot IWRⅢ. Walking of 4 steps will be simulated and experimented with a real biped-walking robot. This balancing system will be applied to a biped humanoid robot, which consist legs and upper body, as a future work.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.1-11
• /
• 2001

This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.414-424
• /
• 2013

We consider a new load balancing routing for delay-guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever-changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load-balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay-guaranteed services.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.117-135
• /
• 2016

Performance enhancement is one of the most important issues in high performance distributed computing systems. In such computing systems, online users submit their jobs anytime and anywhere to a set of dynamic resources. Jobs arrival and processes execution times are stochastic. The performance of a distributed computing system can be improved by using an effective load balancing strategy to redistribute the user tasks among computing resources for efficient utilization. This paper presents a multi-class load balancing strategy that balances different classes of user tasks on multiple heterogeneous computing nodes to minimize the per-class mean response time. For a wide range of system parameters, the performance of the proposed multi-class load balancing strategy is compared with that of the random distribution load balancing, and uniform distribution load balancing strategies using simulation. The results show that, the proposed strategy outperforms the other two studied strategies in terms of average task response time, and average computing nodes utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3394-3408
• /
• 2014

Conventional mobile state (MS) and base station (BS) association based on average signal strength often results in imbalance of cell load which may require more powerful processor at BSs and degrades the perceived transmission rate of MSs. To deal with this problem, a Markov decision process (MDP) for load balancing in a multi-cell system with multi-carriers is formulated. To solve the problem, exploiting Sarsa algorithm of on-line learning type [12], ${\alpha}$-controllable load balancing algorithm is proposed. It is designed to control tradeoff between the cell load deviation of BSs and the perceived transmission rates of MSs. We also propose an ${\varepsilon}$-differential soft greedy policy for on-line learning which is proven to be asymptotically convergent to the optimal greedy policy under some condition. Simulation results verify that the ${\alpha}$-controllable load balancing algorithm controls the behavior of the algorithm depending on the choice of ${\alpha}$. It is shown to be very efficient in balancing cell loads of BSs with low ${\alpha}$.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.315-326
• /
• 2000

As Internet is being widely used as an infra of distributed applications, the most of today's softwares are changing into Internet-based distributed applications. The development methods using the middleware, like CORBA ORB, make the development of the web-based software easy. However, the performance verification method useful for an optimized software distribution is not provided at software development. Additionally, monitoring methods and metrics for dynamic load-balancing are not presented at run-time. This paper presents the method to monitor the message between objects, load metric, and metrics for load-balancing. To calculate a load of a node, we define events occurred between applications, time between the events, then extract the data related to a load. And we derive formula calculating the load from the extracted data. Then using the formula, we present the metrics for dynamic load-balancing. Moreover, we observe the utilization and efficiency of the monitoring algorithm, load metric, and load-balancing metrics.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1047-1054
• /
• 2022

With the advent of SDN, a next-generation network technology that separates the hardware and software areas of network equipment and defines the network using open source-based software, it solves the problems of complexity and scalability of the existing network system. It is now possible to configure a custom network according to the requirements. However, it has a structural disadvantage that a load on the network may occur due to a lot of control communication occurring between the controller and the switch, and many studies on network load distribution to effectively solve this have been preceded. In particular, in previous studies of load balancing techniques related to flow tables, many studies were conducted without consideration of flow entries, and as the number of flows increased, the packet processing speed decreased and the load was increased. To this end, we propose a new network load balancing technique that monitors flows in real time and applies dynamic flow management techniques to control the number of flows to an appropriate level while maintaining high packet processing speed.