• Title/Summary/Keyword: Simulated Algorithm

Search Result 1,795, Processing Time 0.024 seconds

Implementation of an Efficient Algorithm for a Single Phase Matrix Converter

  • Gola, Ajay Kumar;Agarwal, Vineeta
    • Journal of Power Electronics
    • /
    • v.9 no.2
    • /
    • pp.198-206
    • /
    • 2009
  • An algorithm is developed that enables a single-phase matrix converter (SPMC) to perform functions of a generalized single phase power electronics converter such as acting as a frequency changer, rectifier, inverter, and chopper. This reduces the need for new converter hardware. The algorithm is implemented first on computer simulation software Orcad Capture CIS version 9.1. Simulation results are presented for five types of converters with a control input variable that decides the 1) type of converter and 2) type of output waveform. The simulated results verify the working and operation of a generalized converter based on SPMC. Simulated results are verified with experimental results. Hardware design is obtained using readily available ICs and other components. The trigger circuit has been tested qualitatively by observing waveforms on CRO. The operation of the proposed system has been found to be satisfactory.

An Analysis of the Partition Algorithm for Digital System Design (디지털 시스템 설계를 위한 분할 알고리즘의 분석)

  • 최정필;한강룡;황인재;송기용
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.69-72
    • /
    • 2001
  • High-level synthesis generates a structural design that implements the given behavior and satisfies design constraints for area, performance, power consumption, packaging, testing and other criteria. Thus, high-level synthesis generates that register-transfer(RT) level structure from algorithm level description. High-level syntehsis consist of compiling, partitioning, scheduling This paper we study the partitioning process, and analysis the min-cut algorithm and simulated annealing algorithm.

  • PDF

Finding the Number of Clusters and Various Experiments Based on ASA Clustering Method (ASA 군집화를 이용한 군집수 결정 및 다양한 실험)

  • Yoon Bok-Sik
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.87-98
    • /
    • 2006
  • In many cases of cluster analysis we are forced to perform clustering without any prior knowledge on the number of clusters. But in some clustering methods such as k-means algorithm it is required to provide the number of clusters beforehand. In this study, we focus on the problem to determine the number of clusters in the given data. We follow the 2 stage approach of ASA clustering algorithm and mainly try to improve the performance of the first stage of the algorithm. We verify the usefulness of the method by applying it for various kinds of simulated data. Also, we apply the method for clustering two kinds of real life qualitative data.

A SIMULATION/OPTIMIZATION ALGORITHM FOR AN FMS DISPATCHING PRIORITY PROBLEM

  • Lee, Keun-Hyung;Morito, Susumu
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1993.10a
    • /
    • pp.16-16
    • /
    • 1993
  • The efficient use of capital intensive FMS requires determination of effective dispatching priority with which the parts of the selected part types are to be inputed into the system. This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS, Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness, Computational performance of the algorithm shows that good solutions can be obtained within a reasonable amount of computations. The paper also compares the performance of the "optimal" or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules such as SPT, EDD and SLACK.

  • PDF

A PID Genetic Controller Design Combined Simulated Annealing (시뮬레이티드 어닐링과 조합한 PID 유전 제어기 설계)

  • Hong, Young-Joon;Kim, Lark-Kyo;Nam, Moon-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2655-2657
    • /
    • 2000
  • this paper suggests a genetic algorithms combining simulated annealing for PID factor tunning. This paper made Off-Line control parameter tuning of the DC servo motor for the speed, In this paper new method to design PID controller through proposed genetic algorithm. Two experiments compared both the PID controller using genetic algorithms and PID controller using proposed genetic algorithm for a DC-servo motor. The result of two experiments was safty higher PID controller using proposed genetic algorithm than PID controller using genetic algorithm.

  • PDF

New accuracy indicator to quantify the true and false modes for eigensystem realization algorithm

  • Wang, Shuqing;Liu, Fushun
    • Structural Engineering and Mechanics
    • /
    • v.34 no.5
    • /
    • pp.625-634
    • /
    • 2010
  • The objective of this paper is to apply a new proposed accuracy indicator to quantify the true and false modes for Eigensystem Realization Algorithm using output-based responses. First, a discrete mass-spring system and a simply supported continuous beam were modelled using finite element method. Then responses are simulated under random excitation. Natural Excitation Technique using only response measurements is applied to compute the impulse responses. Eigensystem Realization Algorithm is employed to identify the modal parameters on the simulated responses. A new accuracy indicator, Normalized Occurrence Number-NON, is developed to quantitatively partition the realized modes into true and false modes so that the false portions can be disregarded. Numerical simulation demonstrates that the new accuracy indicator can determine the true system modes accurately.

Hypergraph Partitioning By Using Reodered Simulated-anealing (정련법을 이용한 하이퍼그래프 분할)

  • Kim, Sang Jin;Ryoo, Myung Chun;Jung, Young Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.4
    • /
    • pp.11-19
    • /
    • 2013
  • In this paper we present a reodered simulated-anealing algorithm which is capable of applying odering based k-way partitioned clusters. This method is used for improvement of the objectives of partitioning which are k-way partitioned by using odering algorithm. It changes the positions of the clusters and the vertices in each clusters. Reodered vertices are splitted by using DP-RP method and this process has an opportunity to improve the objective functions. This algorithm has advantages to improve the quality of the solutions for various purposes. Experimental results on several graphs demonstrate that proposed algorithm provides substantial enhancement.

Stochastic Radar Beam Scheduling Using Simulated Annealing (Simulated Annealing을 이용한 추계적 레이더 빔 스케줄링 알고리즘)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo;Jang, Dae-Sung;Choi, Han-Lim
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.2
    • /
    • pp.196-206
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

A Study on Mobile Wireless Communication Network Optimization Using Global Search Algorithm (전역 탐색 알고리듬을 이용한 이동 무선통신 네트워크의 최적화에 대한 연구)

  • 김성곤
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.1
    • /
    • pp.87-93
    • /
    • 2004
  • In the design of mobile wireless communication network, BSC(Base Station Location), BSC(Base Station Controller) and MSC(Mobile Switching Center) are the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this Problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively for global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

  • PDF

Study on the optimal design for Planetary Gear Train using simulated annealing (시뮬레이티드 어닐링을 이용한 유성치차열의 최적설계에 관한 연구)

  • 최용혁;정태형;이근호
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2004.04a
    • /
    • pp.172-177
    • /
    • 2004
  • A planetary gear trains has characteristics in compactness, power transformation ability and constant meshing. Usability is increased in applications of auto transmission and industrial gearbox. Study on optimum design of planetary gear train has been progressed on minimization of weight, miniaturization of planetary gear train and improvement of high strength. There are demands of study for the planetary gear train required long lift estimation In this wort being considered life, strength, intereference, contact ratio and aspect ratio, the optimum design algorithm is proposed to reduce the volume of planetary gear train with transferring the same amount of power. In the design of algorithm for planetary gear train, the determination of teeth number is separated to achieve simplicity and the simulated annealing method as a global optimal technique is used for optimal design method.

  • PDF