• Proceedings of the KIPE Conference
• /
• 2018.07a
• /
• pp.316-317
• /
• 2018

This paper propse the DC link capacitor voltage balancing control for three level neutral point clamped converter with harmonic component injection method. The injcetion voltage consists of harmonic component and DC link capacitor voltage difference. Theoretical analysis is provided to balance the DC link voltage, and it shows that harmonic component compensates the unbalanced condition between the capacitors. Both simulations and experiments are carried out to show that the voltage unbalance have been decreased by the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.51-65
• /
• 2000

Multiple U-typed producton lines are increasingly accepted in modern marufacturing system for the flexbility to adjust to changes in demand. This paper considers multiple U line balancing with the objective of minimizing cycle time considering the moving time of workforce given the number of workstation. Like the traditional line balancing problem this problem is NP-hard. In this paper, we show how genetic algorithm can be used to solve multiple U line balancing problem. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators are also employed. Extensive computational experiments are carried out to show the performance of the performance of the purposed algorithm. The computational results show that the algorithm is promising in solution quality.

• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.43-53
• /
• 2004

The distributed OCSP (Online Certificate Status Protocol), composed of multiple responders, is a model that enhances the utilization of each responder and reduces the response time. In a multi-user distributed environment, load balancing mechanism must be developed for the improvement of the performance of the whole system. Conservative load balancing algorithms often ignore the communication cost of gathering the information of responders. As the number of request is increased, however, fail to consider the communication cost may cause serious problems since the communication time is too large to disregard. We propose an adaptive load balancing algorithm and evaluate the effectiveness by performing modeling and simulation. The principal advantage of new algorithm is in their simplicity: there is no need to maintain and process system state information. We evaluated the quality of load balancing achieved by the new algorithm by comparing the queue size of responders and analyzing the utilization of these responders. The simulation results show how efficiently load balancing is done with the new algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.1037-1043
• /
• 2011

Two-wheeled balancing mobile robots are currently controlled in terms of linear control methods without considering the nonlinear dynamical characteristics. However, in the high maneuvering situations such as fast turn and abrupt start and stop, such neglected terms become dominant and greatly influence the overall driving performance. This paper addresses the SDRE nonlinear optimal control method to take advantage of the exact nonlinear dynamics of the balancing robot. Simulation results indicate that the SDRE control outperforms LQR in the respect of transient performance and required wheel torques. A design example is suggested for the state matrix that provides design flexibility in the SDRE control. It is shown that a well-planned state matrix by reflecting the physics of a balancing robot greatly contributes to the driving performance and stability.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2017

This research develops dispatching rule for a wafer FABs with dedication constraints. Dedication, mostly considered in a photolithography step, is a feature in a modern FABs in order to increase the yield of machines and achieve the advance of manufacturing technology. However, the dedication has the critical problem because it causes dedication load of machines to unbalance. In this paper, we proposes the dedication load based dispatching rule for load balancing in order to resolve the problem. The objective of this paper is to balance dedication load of photo machines in wafer FABs with dedication constraint. Simulation experiments show that the proposed rule improves the performance of wafer FABs as well as load balance for dedication machines compared to open-loop control based conventional dispatching rule.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.154-157
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffice concentration and bottlenecks near the lore routers since traffice from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.211-212
• /
• 2007

최근 자가 구성이 가능한 모바일 애드 혹 네트워크상에서 통신을 지원하기 위하여 DSR, AODV등 많은 On Demand 라우팅 프로토콜들이 제안되었다. 이들 라우팅 프로토콜들은 경로탐색과정에서 Route Request(RREQ) 패킷을 브로드캐스트하여 목적 노드로부터 Route Reply(RREP) 패킷을 받음으로써 라우팅 경로를 설정한다. 이때 경로탐색의 지연을 최소로 줄이고자 과거 경로탐색 정보 및 라우팅 정보를 경로캐쉬에 저장하여, 중간노드에서 RREP를 대신 보낼 수 있다. 이러한 캐쉬 기법은 간단하면서 매우 효율적인 방법이지만, 캐쉬 정보가 잘못된 경우 불필요한 지연을 일으킨다. 더욱이 캐쉬 정보를 이용할 경우, 특정 노드에게 보내는 데이터가 집중되는 문제가 발생하여 혼잡의 원인이 된다. 본 논문에서는 이러한 혼잡을 해결하고자 캐쉬 정보를 동적으로 관리하여, 혼잡의 원인이 되는 RREP를 억제하고자 한다. 이를 위하여 혼잡 임계값 및 파라미터를 정의한다. 마지막으로 실험을 통하여 네트워크 트래픽이 많을 경우 제안된 기법을 적용했을 때, 더 우수한 성능을 가짐을 보인다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.51-61
• /
• 1991

This paper presents a heuristic method for the Assembly Line Balancing(ALB) of the large-sized product. In the ALB problem of the large-sized product such as bus and truck, the assignments of the Related Task Groups(RTG), the same side tasks, and team tasks should be considered. In this paper, a new concept of the RTG and two kinds of assignment rules are proposed to resolve the above considerations. The first assignment rule allots the RTG with the constraint of the same side tasks to the station while the second allots the RTG to the station, relaxing the above constraint to increase the applicability of the method. An assignment rule for team tasks is also presented. The benefits of the method are to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines.

• IE interfaces
• /
• v.12 no.1
• /
• pp.132-142
• /
• 1999

Two-sided (left- and right-sided) assembly lines in practice can provide several advantages over one-sided lines in terms of the required line length, throughput time, cost of tools and fixtures, and so on. This paper considers two-sided assembly line balancing with the objective of minimizing line length. The balancing problem is more complicated than that of one-sided lines due to sequence-dependency of tasks assigned to a pair of directly facing workstations. This paper shows how genetic algorithm can be used to solve two-sided assembly line balancing. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators and an evalutation function are also employed. Extensive computational experiments are carried out to show the efficacy of the proposed algorithm. The results show that the algorithm is viable and promising in solution quality and computation time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.376-377
• /
• 2016

Performance of Hadoop, which is a distributed data processing framework for big data analysis, is affected by several characteristics of each node in distributed cluster such as processing power and network bandwidth. This paper analyzes previous approaches for heterogeneous hadoop clusters, and presents several requirements for distributed node clustering in small-and-medium sized hospitals by considering computing environments of the hospitals.