• Title/Summary/Keyword: M-algorithm

Search Result 3,994, Processing Time 0.111 seconds

The Fuzzy Modeling by Virus-messy Genetic Algorithm (바이러스-메시 유전 알고리즘에 의한 퍼지 모델링)

  • 최종일;이연우;주영훈;박진배
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.157-160
    • /
    • 2000
  • This paper deals with the fuzzy modeling for the complex and uncertain system in which conventional and mathematical models may fail to give satisfactory results. mGA(messy Genetic Algorithm) has more effective and adaptive structure than sGA with respect to using changeable-length string and VEGA(Virus Evolution Genetic) Algorithm) can search the global and local optimal solution simultaneously with reverse transcription operator and transduction operator. Therefore in this paper, the optimal fuzzy model is obtained using Virus-messy Genetic Algorithm(Virus-mGA). In this method local information is exchanged in population so that population may sustain genetic divergence. To prove the surperioty of the proposed approach, we provide the numerical example.

  • PDF

On a sign-pattern matrix and it's related algorithms for L-matrix

  • Seol, Han-Guk;Kim, Yu-Hyuk;Lee, Sang-Gu
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.1
    • /
    • pp.43-53
    • /
    • 1999
  • A real $m{\times}n$ matrix A is called an L-matrix if every matrix in its qualitative class has linearly independent rows. Since the number of the sign pattern matrices of the given size is finite, we can list all patterns lexicographically. In [2], a necessary and sufficient condition for a matrix to be an L-matrix was given. We presented an algorithm which decides whether the given matrix is an L-matrix or not. In this paper, we develope an algorithm and C-program which will determine whether a given matrix is an L-matrix or not, or an SNS-matrix or not. In addition, we have extended our algorithm to be able to classify sign-pattern matrices, and to find barely L-matrices from a given matrix and to list all $m{\times}n$ L-matrices.

  • PDF

Optimization of Process Parameters Using a Genetic Algorithm for Process Automation in Aluminum Laser Welding with Filler Wire (용가 와이어를 적용한 알루미늄 레이저 용접에서 공정 자동화를 위한 유전 알고리즘을 이용한 공정변수 최적화)

  • Park, Young-Whan
    • Journal of Welding and Joining
    • /
    • v.24 no.5
    • /
    • pp.67-73
    • /
    • 2006
  • Laser welding is suitable for welding to the aluminum alloy sheet. In order to apply the aluminum laser welding to production line, parameters should be optimized. In this study, the optimal welding condition was searched through the genetic algorithm in laser welding of AA5182 sheet with AA5356 filler wire. Second-order polynomial regression model to estimate the tensile strength model was developed using the laser power, welding speed and wire feed rate. Fitness function for showing the performance index was defined using the tensile strength, wire feed rate and welding speed which represent the weldability, product cost and productivity, respectively. The genetic algorithm searched the optimal welding condition that the wire feed rate was 2.7 m/min, the laser power was 4 kW and the welding speed was 7.95 m/min. At this welding condition, fitness function value was 137.1 and the estimated tensile strength was 282.2 $N/mm^2$.

A Design of Diakoptic Method based on Sparse Vector Method for the Power System (스파스 벡터 기법을 이용한 전력계통 분할 알고리즘의 개발)

  • Lee, C.M.;Cho, I.S.;Shin, M.C.
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.426-431
    • /
    • 1991
  • Diakoptic method applied to analyze large power system, always require the efficient tearing algorithm. But conventional tearing methods is not suitable to apply practical power system. This paper presents new tearing algorithm based on factorization path concept of sparse vector method, and applied MPRLD, a kind of optimal ordering algorithm, in ordering step to improve the efficiency of tearing algorithm. Test result of model systems shows that new proposed method in this paper is enable to tear power systems not to be teared by heuristic cluster method, reduces computing time and memory size.

  • PDF

Implementation of low power algorithm for near distance wireless communication and RFID/USN systems

  • Kim, Song-Ju;Hwang, Moon-Soo;Kim, Young-Min
    • International Journal of Contents
    • /
    • v.7 no.1
    • /
    • pp.1-7
    • /
    • 2011
  • A new power control algorithm for wireless communication which can be applied to various near distance communications and USN/RFID systems is proposed. This technique has been applied and tested to lithium coin battery operated UHF/microwave transceiver systems to show extremely long communication life time without battery exchange. The power control algorithm is based on the dynamic prediction method of arrival time for incoming packet at the receiver. We obtain 16mA current consumption in the TX module and 20mA current consumption in the RX module. The advantage provided by this method compared to others is that both master transceiver and slave transceiver can be low power consumption system.

A design of the Fast Measuring Instrument for Harmonic Signal using New Fast Walsh Transform (새로운 고속월쉬 변환을 이용한 고속의 고조파 신호 측정기 설계)

  • Lim, Yun-Sik;Yoo, Young-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2007.11c
    • /
    • pp.141-145
    • /
    • 2007
  • Using the New Fast Walsh Transform algorithm, we present a new algorithm which reduces the computational amount, and it can consequently calculate the real and imaginary components for current and voltage signals of power system in sampling intervals. The calculation amount is reduced to 2X(m-1) at m samples to measure full harmonics using developed algorithm. When in single harmonic measuring, it needs only 2(log2N-1)+1 additions and subtractions. We developed hardware device for testing, and tested the developed algorithm by measuring real and imaginary components.

  • PDF

The Expectation and Sparse Maximization Algorithm

  • Barembruch, Steffen;Scaglione, Anna;Moulines, Eric
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.317-329
    • /
    • 2010
  • In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However, most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method-the expectation-sparse-maximization (ESpaM) algorithm-for models where the measurement matrix is the product of one unknown and one known matrix. This method is a variant of the expectation-maximization algorithm to deal with the resulting problem that the maximization step is no longer unique. The ESpaM algorithm is justified theoretically. We present as well numerical results for two concrete examples of blind channel identification in digital communications, a doubly-selective channel model and linear time invariant sparse channel model.

A New Algorithm for Resolving Narrowband Coherent Signals Incident on a General Array (임의 배열 안테나로 입사하는 협대역 코히어런트 신호의 분리를 위한 새로운 알고리즘)

  • 박형래;김영수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.7
    • /
    • pp.989-1002
    • /
    • 1995
  • In this paper, we propose a new algorithm, so called the Signal Decorrelation via Virtual Translation of Array (SDVTA) algorithm, for estimating the directions of arrival(DOA's) of narrowband coherent signals incident on a general array. An effective procedure is composed of transforming the steering matrix of the original array into that of the virtually translated sensor array and taking the average of the transformed covariance matrices in order to decorrelate the coherent signals. The advantage of this approach is in that 1) it can estimate the DOA's of m-1 coherent signals(M : the number of array sensors) since the effective aperture size is never reduced. 2) a geometry of array is unrestricted for solving the narrowband coherency problem. 3) the efficiency of signal decorrelation does not depend on the phase differences between coherent signals unlike the Coherent Signal Subspace Method (CSM). Simulation results are illustrated to demonstrate the superior performance of this new algorithm in comparison with the normal MUSIC and examine the comparative performance with the various choices of the optimal transformation matrix under coherent signal environments.

  • PDF

Development of Green-Sheet Measurement Algorithm by Image Processing Technique (영상처리기법을 이용한 그린시트 측정알고리즘 개발)

  • Pyo, C.R.;Yang, S.M.;Kang, S.H.;Yoon, S.M.
    • Transactions of Materials Processing
    • /
    • v.16 no.4 s.94
    • /
    • pp.313-316
    • /
    • 2007
  • The purpose of this paper is the development of measurement algorithm for green-sheet based on the digital image processing technique. The Low Temperature Co-fired Ceramic(LTCC) technology can be employed to produce multilayer circuits with the help of single tapes, which are used to apply conductive, dielectric and/or resistive pastes on. These single green-sheets must be laminated together and fired at the same time. Main function of the green-sheet film measurement algorithm is to measure the position and size of the punching hole in each single layer. The line scan camera coupled with motorized X-Y stage is used. In order to measure the entire film area using several scanning steps, an overlapping method is used.

Generation Planning Algorithm Considering Environmental Constraints Near Thermal Power Plants (화력발전소 주변환경제약을 고려한 발전계획 알고리즘에 관한 연구)

  • Lee, B.;Kim, Y.H.;Cha, J.M.;Roh, K.M.;Oh, K.H.;NamKung, J.Y.;Song, K.Y.
    • Proceedings of the KIEE Conference
    • /
    • 1997.07c
    • /
    • pp.1060-1063
    • /
    • 1997
  • A new generation planning algorithm considering environmental constraint by using fuzzy technique is developed. This algorithm has a new formula which can consider environmental constraints and an effective solving method which has newly developed fuzzy dual procedure. By using this algorithm, economic generation planning considering environmental constraints can be scheduled. The usefulness of this method is verified by applying it to the test system.

  • PDF