• Title/Summary/Keyword: Balancing selection

Search Result 137, Processing Time 0.023 seconds

Transformer Design Methodology to Improve Transfer Efficiency of Balancing Current in Active Cell Balancing Circuit using Multi-Winding Transformer (다중권선 변압기를 이용한 능동형 셀 밸런싱 회로에서 밸런싱 전류 전달 효율을 높이기 위한 변압기 설계 방안)

  • Lee, Sang-Jung;Kim, Myoung-Ho;Baek, Ju-Won;Jung, Jee-Hoon
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.23 no.4
    • /
    • pp.247-255
    • /
    • 2018
  • This paper proposes a transformer design of a direct cell-to-cell active cell balancing circuit with a multi-winding transformer for battery management system (BMS) applications. The coupling coefficient of the multi-winding transformer and the output capacitance of MOSFETs significantly affect the balancing current transfer efficiency of the cell balancing operation. During the operation, the multi-winding transformer stores the energy charged in a specific source cell and subsequently transfers this energy to the target cell. However, the leakage inductance of the multi-winding transformer and the output capacitance of the MOSFET induce an abnormal energy transfer to the non-target cells, thereby degrading the transfer efficiency of the balancing current in each cell balancing operation. The impacts of the balancing current transfer efficiency deterioration are analyzed and a transformer design methodology that considers the coupling coefficient is proposed to enhance the transfer efficiency of the balancing current. The efficiency improvements resulting from the selection of an appropriate coupling coefficient are verified by conducting a simulation and experiment with a 1 W prototype cell balancing circuit.

End-to-end Reliable Message Transmission Considering Load Balancing in Wireless Networks

  • Tran, Anh Tai;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3094-3109
    • /
    • 2014
  • This paper proposes a load balanced reliable routing protocol called LBR (Load Balanced Reliable routing) in wireless networks. The LBR protocol transmits messages through a reliable path considering the balancing of the traffic load. Recently, the authors have proposed a multipath-based reliable routing protocol called MRFR, which is an appealing protocol for fault tolerant reliable data transmission. However, However, MRFR has no concern with the problem of load balancing, which results in increasing congestion and consuming high energy at some network nodes. As a result, the problem affects negatively the performance of the network. Taking account of load balancing as a route selection criteria can avoid routing through the congested nodes and allows to find better routes. In this paper, we extend MRFR by considering load balancing in the route discovery process of reliable communication. The simulation results showed that the proposed protocol outperforms AODV in terms of end-to-end delay, packet delivery radio, and average jitter. Compared to MRFR, the LBR protocol has the same packet delivery ratio, and obtains a better efficiency of load balancing.

A Neighbor Selection Technique for Improving Efficiency of Local Search in Load Balancing Problems (부하평준화 문제에서 국지적 탐색의 효율향상을 위한 이웃해 선정 기법)

  • 강병호;조민숙;류광렬
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.2
    • /
    • pp.164-172
    • /
    • 2004
  • For a local search algorithm to find a bettor quality solution it is required to generate and evaluate a sufficiently large number of candidate solutions as neighbors at each iteration, demanding quite an amount of CPU time. This paper presents a method of selectively generating only good-looking candidate neighbors, so that the number of neighbors can be kept low to improve the efficiency of search. In our method, a newly generated candidate solution is probabilistically selected to become a neighbor based on the quality estimation determined heuristically by a very simple evaluation of the generated candidate. Experimental results on the problem of load balancing for production scheduling have shown that our candidate selection method outperforms other random or greedy selection methods in terms of solution quality given the same amount of CPU time.

Optimum Field Balancing of Ratating Machinery Using Genetic Algorithm (유전 알고리즘을 이용한 회전기계의 최적 현장평형잡이)

  • Choi, Won-Ho;Yang, Bo-Suk;Joo, Ho-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.6
    • /
    • pp.1819-1826
    • /
    • 1996
  • This paper present the claculating method of optimum correction mass within permissible vibration linits for ratating machinery in two-plane field balancing. Basic technique of this method is based on influence coefficient method, and grphic vector composition that the resultant of two influence vectors obtained by trial mass have to be equilibrium with initial vibration vector in the each correction plane. Genetic algorithm which is a search algorithm based on the mechanism of natural selection and natural genetics is sued for vector composition, and SUMT method is used to objective function which seeks optimum correction mass for balancing a rotor.

DCAR: Dynamic Congestion Aware Routing Protocol in Mobile Ad Hoc Networks

  • Kim, Young-Duk;Lee, Sang-Heon;Lee, Dong-Ha
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.1
    • /
    • pp.8-13
    • /
    • 2006
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

  • PDF

Balancing of a Rigid Rotor using Genetic Algorithms (유전 알고리즘을 이용한 강성회전체의 평형잡이)

  • Yang, Bo Seok;Ju, Ho Jin
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.20 no.2
    • /
    • pp.108-108
    • /
    • 1996
  • This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

Balancing of a Rigid Rotor using Genetic Algorithms (유전 알고리즘을 이용한 강성회전체의 평형잡이)

  • 양보석;주호진
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.20 no.2
    • /
    • pp.40-47
    • /
    • 1996
  • This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

  • PDF

Optimum Balancing of Rotating Machinery Using Genetic Algorithm (유전 알고리즘을 이용한 회전기계의 최적 평형잡이)

  • 주호진;최원호;양보석
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1995.10b
    • /
    • pp.195-202
    • /
    • 1995
  • This paper presents the calculating method of optimum correction mass within permissible vibration limits for rotating machinery in two-plane field balancing. Basic technique of this method based on influence coefficient method, is graphic vector composition that the resultant of two influence vectors obtained by trial mass have to be equilibrium with initial vibration vector in the each correction plane. Genetic algorithm which is a search algorithm based on the mechanics of natural selection and natural genetics is used for vector composition, and SUMT method is used to objective function which seeks optimum correction mass for balancing a rotor.

  • PDF

Enhanced and applicable algorithm for Big-Data by Combining Sparse Auto-Encoder and Load-Balancing, ProGReGA-KF

  • Kim, Hyunah;Kim, Chayoung
    • International Journal of Advanced Culture Technology
    • /
    • v.9 no.1
    • /
    • pp.218-223
    • /
    • 2021
  • Pervasive enhancement and required enforcement of the Internet of Things (IoTs) in a distributed massively multiplayer online architecture have effected in massive growth of Big-Data in terms of server over-load. There have been some previous works to overcome the overloading of server works. However, there are lack of considered methods, which is commonly applicable. Therefore, we propose a combing Sparse Auto-Encoder and Load-Balancing, which is ProGReGA for Big-Data of server loads. In the process of Sparse Auto-Encoder, when it comes to selection of the feature-pattern, the less relevant feature-pattern could be eliminated from Big-Data. In relation to Load-Balancing, the alleviated degradation of ProGReGA can take advantage of the less redundant feature-pattern. That means the most relevant of Big-Data representation can work. In the performance evaluation, we can find that the proposed method have become more approachable and stable.

Soft Tissue Balancing on Total Ankle Replacement Surgery (발목 관절 전치환술에서의 연부조직 재정렬술)

  • Sungwook Choi;Dae Whan Kim;Hyunseong Kang
    • Journal of Korean Foot and Ankle Society
    • /
    • v.28 no.1
    • /
    • pp.1-7
    • /
    • 2024
  • Despite the advances in total ankle replacement (TAR), TAR has emerged as a promising alternative to ankle arthrodesis, particularly in severe ankle arthritis. Restoring ankle stability and alignment is the most important technical consideration and the goal of TAR. Hence, additional procedures, such as soft tissue balancing and osteotomies, are often critical parts of surgical planning. This article reviews the basics of joint balancing, offering suggestions on procedure selection for ligamentous balancing and varus and valgus malalignment in TARs.