• Title/Summary/Keyword: optimization scheme

Search Result 1,157, Processing Time 0.029 seconds

Modelling Voltage Variation at DC Railway Traction Substation using Recursive Least Square Estimation (순환최소자승법을 이용한 직류도시철도 변전소의 가선전압변동 모델링)

  • Bae, Chang-Han
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.20 no.6
    • /
    • pp.534-539
    • /
    • 2015
  • The DC overhead line voltage of an electric railway substation swings depending on the accelerating and regenerative-braking energy of trains, and it deteriorates the energy quality of the electric facility in the DC railway substation and restricts the powering and braking performance of subway trains. Recently, an energy storage system or a regenerative inverter has been introduced into railway traction substations to diminish both the variance of the overhead line voltage and the peak power consumption. In this study, the variance of the overhead line voltage in a DC railway substation is modelled by RC parallel circuits in each feeder, and the RC parameters are estimated using the recursive least mean square (RLMS) scheme. The forgetting factor values for the RLMS are selected using simulated annealing optimization, and the modelling scheme of the overhead line voltage variation is evaluated through raw data measured in a downtown railway substation.

Cluster Analysis Algorithms Based on the Gradient Descent Procedure of a Fuzzy Objective Function

  • Rhee, Hyun-Sook;Oh, Kyung-Whan
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.191-196
    • /
    • 1997
  • Fuzzy clustering has been playing an important role in solving many problems. Fuzzy c-Means(FCM) algorithm is most frequently used for fuzzy clustering. But some fixed point of FCM algorithm, know as Tucker's counter example, is not a reasonable solution. Moreover, FCM algorithm is impossible to perform the on-line learning since it is basically a batch learning scheme. This paper presents unsupervised learning networks as an attempt to improve shortcomings of the conventional clustering algorithm. This model integrates optimization function of FCM algorithm into unsupervised learning networks. The learning rule of the proposed scheme is a result of formal derivation based on the gradient descent procedure of a fuzzy objective function. Using the result of formal derivation, two algorithms of fuzzy cluster analysis, the batch learning version and on-line learning version, are devised. They are tested on several data sets and compared with FCM. The experimental results show that the proposed algorithms find out the reasonable solution on Tucker's counter example.

  • PDF

Low-Power Design of the Surface Gradient Coil for Magnetic Resonance Imaging (자기공명영상촬영을 위한 표면경사자계코일의 저전력 설계)

  • Oh, Chang-Hyun;Lee, Jong-Kwon;Yi, Yun;Kim, Min-Gi
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1993 no.11
    • /
    • pp.33-35
    • /
    • 1993
  • A new low-power, high-order optimization scheme to design surface gradient coils (SGC) is proposed for magnetic resonance imaging (MRI). Although previous SGCs have been designed and constructed just to get strong linear gradients, this paper proposes more systematic ways of SGC design by minimizing electrical power consumption in the gradient coil and by removing unnecessary high-order field distortions in the imaging region. By assuming continuous current flow on the coil surface which may be or may not be planar, power consumption in the coil is minimized. According to the simulation results, the SGC designed by using the proposed scheme seems to produce much more uniform linear gradient field using less electrical power compared to the previously proposed SGCs.

  • PDF

Optimization and Thrust force Calculation of Linear Generator in Starting Mode for Free-Piston Engine Applications

  • Lee, Hyun-Woo;Eid Ahmad M.;Sugimura Hisayuki;Choi, Kwang-Ju;Nakaoka Mutsuo
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2006.05a
    • /
    • pp.395-398
    • /
    • 2006
  • this paper provides a novel method to start the linear engine coupled linear generator from dead stop to its final steady state operation. This method depends mainly to use the linear generator mounted on the shaft of the linear engine to provide the required thrust force to move and oscillate the linear engine from bottom to top dead centers. It is a cost effective approach to start the internal linear combustion engine using its coupled tubular permanent magnet linear generator proposed here. This linear generator operates in this case in motoring mode, providing the required thrust force by feeding this linear generator phases with currents by using a three phase PWM inverter controlled by position feedback scheme. In order to provide the desired thrust force with specific value and direction, a position feedback is required to control the free piston engine motion through controlling the inverter switches using PWM control scheme.

  • PDF

Border Guard/Reconnaissance Communication Terminal for Providing Variable Frame Structure and Method for Altering the Frame Structure (가변 프레임 구조를 지원하는 국경 감시/정찰용 통신 단말 및 프레임 구조 가변 방법)

  • Kim, Janghun;Han, Chulhee;Seo, Bongyong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.19 no.1
    • /
    • pp.50-56
    • /
    • 2016
  • This paper is about the implementation of the OFDM-based border guard/reconnaissance communication terminal systems. We have implemented Real-time Dynamic DL/UL symbol rate control function using the DL-MAP message, and proposed error detection method caused by malfunctioning and timing optimization method. The proposed scheme detects the variable rate symbol decoding timing without increasing additional physical layer logic, and also provides a wide variety of DL/UL data transfer rate. Furthermore, the proposed scheme applies to the current border guard/reconnaissance equipment and confirms a operation performance through field tests and demonstration at home and abroad.

Optimal Checkpoint Placement for Real-Time Systems with Multi-Tasks Having Deadlines Longer Than Periods (데드라인이 주기보다 긴 멀티 태스크를 가진 실시간 시스템을 위한 최적 체크포인트 배치)

  • Kwak, Seong-Woo;Yang, Jung-Min
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.1
    • /
    • pp.148-154
    • /
    • 2012
  • For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.

A Study for an Optimization of Prepass Code Scheduling (선코드 스케줄링의 최적화를 위한 연구)

  • 최준기
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.3
    • /
    • pp.1-8
    • /
    • 2000
  • Prepass code scheduling(code scheduling before register allocation), the register lifetimes may be lengthened, which may increase the amount of data dependence relations. So, it makes difficult to allocate the registers because of complex interference graph. In this paper, to improve that defect, propose an 2-phase coloring method. At first phase-1 assign the registers to variables which have long live ranges. Secondly, phase-2 allocate the registers to remained variables to minimize the register allocation cost. Experimental results shown that proposed method is more efficient scheme than Chaitin's scheme when prepass code scheduling.

  • PDF

Optimal Allocation Method of Hybrid Active Power Filters in Active Distribution Networks Based on Differential Evolution Algorithm

  • Chen, Yougen;Chen, Weiwei;Yang, Renli;Li, Zhiyong
    • Journal of Power Electronics
    • /
    • v.19 no.5
    • /
    • pp.1289-1302
    • /
    • 2019
  • In this paper, an optimal allocation method of a hybrid active power filter in an active distribution network is designed based on the differential evolution algorithm to resolve the harmonic generation problem when a distributed generation system is connected to the grid. A distributed generation system model in the calculation of power flow is established. An improved back/forward sweep algorithm and a decoupling algorithm are proposed for fundamental power flow and harmonic power flow. On this basis, a multi-objective optimization allocation model of the location and capacity of a hybrid filter in an active distribution network is built, and an optimal allocation scheme of the hybrid active power filter based on the differential evolution algorithm is proposed. To verify the effect of the harmonic suppression of the designed scheme, simulation analysis in an IEEE-33 nodes model and an experimental analysis on a test platform of a microgrid are adopted.

Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem

  • Ji, Jun;Huang, Dun-hua;Xing, Fei-fei;Cui, Yao-dong
    • Journal of Information Processing Systems
    • /
    • v.17 no.2
    • /
    • pp.271-283
    • /
    • 2021
  • When generating layout schemes, both the material usage and practicality of the cutting process should be considered. This paper presents a two-section algorithm for generating guillotine-cutting schemes of rectangular blanks. It simplifies the cutting process by allowing only one size of blanks to appear in any rectangular block. The algorithm uses an implicit enumeration and a linear programming optimal cutting scheme to maximize the material usage. The algorithm was tested on some benchmark problems in the literature, and compared with the three types of layout scheme algorithm. The experimental results show that the algorithm is effective both in computation time and in material usage.

IMPROVED GENERALIZED M-ITERATION FOR QUASI-NONEXPANSIVE MULTIVALUED MAPPINGS WITH APPLICATION IN REAL HILBERT SPACES

  • Akutsah, Francis;Narain, Ojen Kumar;Kim, Jong Kyu
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.1
    • /
    • pp.59-82
    • /
    • 2022
  • In this paper, we present a modified (improved) generalized M-iteration with the inertial technique for three quasi-nonexpansive multivalued mappings in a real Hilbert space. In addition, we obtain a weak convergence result under suitable conditions and the strong convergence result is achieved using the hybrid projection method with our modified generalized M-iteration. Finally, we apply our convergence results to certain optimization problem, and present some numerical experiments to show the efficiency and applicability of the proposed method in comparison with other improved iterative methods (modified SP-iterative scheme) in the literature. The results obtained in this paper extend, generalize and improve several results in this direction.