• Journal of Power Electronics
• /
• v.3 no.4
• /
• pp.205-214
• /
• 2003

This paper proposes a simple control strategy based on the discontinuous PWM (DPWM) to balance the DC-link voltage of three-level neutral-point-clamped (NPC) inverter at low modulation index. It introduces new DPWM methods in multi-level inverter and one of them is used for balancing the DC-link voltage. The current flowing in the neutral point of the DC-link causes the fluctuation of the DC-link voltage of the NPC inverter. The proposed DPWM method changes the path and duration time of the neutral point current, which makes the overall fluctuation of the DC-link voltage zero during a sampling time of the reference voltage vector. Therefore, by using the proposed strategy, the voltage of the DC-link can be balanced fairly well and the voltage ripple of the DC-link is also reduced significantly. Moreover, comparing with conventional methods which have to perform the complicated calculation, the proposed strategy is very simple. The validity of the proposed DPWM method is verified by the experiment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.273-276
• /
• 2011

최근 소셜 네트워킹, 멀티미디어 서비스의 사용량이 증가됨에 따라 인터넷의 트래픽은 이전보다 빠르게 증가되고 있다. 이에 링크나 노드의 failure 같은 네트워크 failure 발생은 서비스 이용자들에게 큰 영향을 미치게 된다. 이러한 failure로 부터 빠르게 회복하기 위한 다양한 Fast Reroute scheme들이 제안되었다. 하지만 이러한 Fast Reroute의 Back-path는 특정 링크에게 과도한 트래픽을 유발하게 된다. 본 논문에서는 이러한 점을 해결하기 위한 실제적인 Link Cost를 고려한 Load-Balancing기법을 제안한다. 실험결과 평균 degree가 높을수록 대체가능한 경로들이 증가되기 때문에 FIR에 비해 성능이 향상됨을 확인할 수 있었다.

• Proceedings of the KIPE Conference
• /
• 2012.07a
• /
• pp.195-196
• /
• 2012

In recent years, in an effort to improve the efficiency and the power density of the front-end power factor correction(PFC), the interleaving of multiple converter is employed. The conventional interleaved continuous conduction mode(CCM) boost PFC converter requires input and output voltage sensing and three current sensing to obtain current balancing between modules. In this paper, the interleaved CCM PFC converter based on modulated carrier control is proposed. With the proposed method, two phase interleaved PFC can be realized simply without line voltage sensing resistor and can achieve current balancing without additional current sensing resistor on common return path. The simulation studies are carried out to verify the effectiveness of the proposed control scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.46-54
• /
• 2006

We propose an optimization method for PCB assembly lines including multiple surface mounters. To increase the productivity of PCB assembly line, the component allocation, feeder assignment, and assembly sequence of each surface mounter should be optimized. The optimization Problem is formulated as an integer programming problem. We divide the overall problem into two hierarchical sub-problems: forward-path problem and backward-path problem. The clustering algorithm and branch-and-bound algorithm are applied to solve the forward-path problem. The assignment algorithm and connection algorithm are applied to solve the backward-path problem. Simulation results are presented to verify the usefulness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1021-1033
• /
• 2008

In recent years, the growing interest in wireless sensor network has resulted in thousands of publications. Most of this research is concerned with delivering raw data such as temperature, pressure, or humidity. Recently, the focus of sensor network paradigm is changing for delivering multimedia contents. However, most existing routing protocols are not very practical for transmitting multimedia contents in resource constrained sensor networks. In this paper, we propose an optimized node-disjoint multi-path routing protocol for throughput enhancement and load balancing. We focused on how to allocate traffic to independent multiple end-to-end routes. Decentralized transmission using our node-disjoint multi-path routing scheme results in bandwidth aggregation and throughput enhancement. In addition, our scheme provides ways to remove link-joint routes for decreasing routing overhead.

• Journal of the Korea Convergence Society
• /
• v.8 no.10
• /
• pp.385-395
• /
• 2017

This qualitative research is conducted to explore the balancing experience of work and child care of North Korean female defectors. Five of North Korean female defectors from double income family in their 40's were selected and interviewed. The interview data were analyzed by a phenomenological qualitative method. The five categories were derived from the data and included as follows: , , , , . Based on the results of the research the suggestions for practical services, such as parenting education, career path development programs and policies with gender perspective were made. Limitations of the research and further research recommendations were suggested as well.

• Journal of the Korean Society of Physical Medicine
• /
• v.17 no.1
• /
• pp.21-30
• /
• 2022

PURPOSE: This study examined the effects of treadmill training with taping on the affected ankle joint on the gait and balancing ability in patients with sub-acute stroke. METHODS: Nineteen patients with sub-acute hemiplegic stroke in a rehabilitation hospital were assigned randomly to either the experimental group (n = 10), who received treadmill training with taping on the affected ankle joint or the control group (n = 9), who received general treadmill training. All participants performed 60 min of comprehensive rehabilitation therapy (five sessions per week for four weeks). Each group received treadmill training with or without taping on the affected ankle joint for 20 min (three sessions per week for four weeks). The gait and balancing ability were measured before and after the four-week training. RESULTS: Post-training scores of 10-meter walk test (10 MWT), timed up and go (TUG) test, and center of pressure (COP) path length and velocity for the experimental group increased significantly compared to that pre-training (p < .05). The experimental group showed a larger decrease in the 10 MWT and TUG test than the control group (-3.5 s vs. -1.01 s, p < .05; -4.9 s vs. -1.7 s, p < .05; respectively) CONCLUSION: Treadmill training with taping on the affected ankle joint might improve the gait and balancing ability of stroke patients and is considered a more effective method for improving gait and balancing ability than the method of general treadmill training.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.406-416
• /
• 2001

Single path routing schemes using dynamic routing metric amy find out the dynamic network status and recompute paths to keep the traffic from the highly loaded regions of the network. This type of routing approach, however, may lead to a routing oscillation, and further, it cannot exploit multi-paths that may frequently exist in the real network. We propose a multipath routing scheme with dynamic load balancing, called MP-DLB, which is capable of reducing the overhead incurred by the multipath routing with dynamic load balancing approach while taking advantage of the high routing performance provided by the approach. According to the analysis of Internet packet traces which show that a high percentage of network traffic is destined for a small number of networks, MP-DLB applies the multipath routing with dynamic load balancing only to a limited subset of all the destinations in the network. For the rest of the destinations, it applies traditional single path routing scheme. This approach may reduce overall routing overheads by limiting the number of destinations to apply the more complicated routing scheme while it can keep the routing performance high by providing efficient routing for the most significant traffic in the routing performance. A series of simulations are done to analyze the performance of MP-DLB. The simulation results show that MP-DLB may effectively cope with the congestion and achieve high routing performance by distributing traffic streams that are generated from varying sources and heading toward a specific hot destination over multi-paths.