• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.180.5-180
• /
• 2001

This paper presents A Design of WMR Controller that being composed of cooperative relation between PID controller and optimized neural network algorithm, it operate a variable control by velocity. Some proposed algorithm in the past just depended on PID controller for the control of position of WMR but for more efficient control we design a variable controller that operate control by PD controller using neural network if it is satisfied with any given condition. it adjust gain of PD controller for real time control using a fast feedforward algorithm which is different with Form of the standard backpropagation algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.450-453
• /
• 1997

There are many studies about optimization using genetic algorithm and desirability function. It's very important to find the optimal value of something like response surface or regression model. In this study I ind~cate the problem using the old type desirability function, and suggest the new type desirabhty functton that can fix the problem better, and simulate the model. Then I'll suggest the form of desirability function to find the optimum value of response surfaces which are made by mean and standard deviation using genetic algorithm and new type desirability function.

• Journal of Advanced Marine Engineering and Technology
• /
• v.33 no.3
• /
• pp.403-410
• /
• 2009

The aim of this research is to develop the Bees Algorithm named 'the dynamic allocated Bees Algorithm' for multi-objective problem, especially in order to be suit for Pareto optimality. In addition two new neighbourhood search methods have been developed to produce enhanced solutions for a multi-objective problem named 'random selection neighbourhood search' and 'weighted sum neighbourhood search' and they were compared with the basic neighbourhood search in the dynamic allocated Bees Algorithm. They were successfully applied to an Environmental/Economic (electric power) dispatch (EED) problem and simulation results presented for the standard IEEE 30-bus system and they were compared to those obtained using other approaches. The comparison shows the superiority of the proposed dynamic allocated Bees Algorithms and confirms its suitability for solving the multi-objective EED problem.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.7
• /
• pp.1025-1035
• /
• 1995

In this paper, we realize a real time digital FM synthesizer based on genetic algorithm using a general purpose digital signal processor. Especially, we synthesize diverse music sounds nicely using a synthesis model consisting of a single modulator and multiple carriers. Also we present genetic algorithm-based technique which determines optimal parameters for reconstruction through FM synthesis of a sound after analyzing the spectrum of PCM data as a standard music sound using FFT. Using the suggested parameter extractiuon algorithm, we extract parameters of several instruments and then synthesize digital FM sounds. To verify the validity of the parameter extraction algorithm as well as realization of a real time digital music synthesizer, the evaluation is first done by listening the sound directly as subjective test. Secondly, to evaluate the synthesized sound objectively with an engineering sense, we compare the synthesized sound with an original one in a time domain and a frequency domain.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.372-375
• /
• 1999

This paper proposes a bit allocation algorithm using adaptive bandwidth for ADSL that uses the DMT technology. In certain cases for high attenuation loops the conventional algorithms are unable to assign data bits to the higher frequency tones, due to the power spectrum mask limitation recommended by ANSI Standard, even if the total power budget is not expended. In the proposed bit allocation algorithm, adjacent empty tones that would not be used merge into single tone, then additional bits is assigned to the merged empty tones. Because additional bits is allocated, most of the available power is used. The proposed algorithm show that total bit increase in about 2~9% bits more than about conventional "water-filling" and "bit removal" algorithms and that is able to use about 93% of the available budget Power

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.1
• /
• pp.46-51
• /
• 2007

In this paper, we propose a new data clustering method using local probability and hypothesis theory. To cluster the test data set we analyze the local area of the test data set using local probability distribution and decide the candidate class of the data set using mean standard deviation and variance etc. To decide each class of the test data, statistical hypothesis theory is applied to the decided candidate class of the test data set. For evaluating, the proposed classification method is compared to the conventional fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm. The simulation results show more accuracy than results of fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.9-12
• /
• 2002

This paper proposes a dynamic moment algorithm to control oscillaion before the convergence of the KR(Kernel Relaxation). The proposed dynamic moment algorithm can be controlled to convergence speed and performance according to the change of the dynamic moment by teaming training. we used SONAR data that is a neural network classifier standard evaluation data in order to do impartial performance evaluation. The proposed algorithm has been applied to the KP (kernel perceptron), KPM(kernel perceptron with margin) and KLMS(kernel lms) as the kernel method presented recently. The simulation results of proposed algorithm have better the convergence performance than those using none and static moment.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2471-2474
• /
• 2003

The modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) are employed in subband/transform coding schemes as the analysis/synthesis filter bank based on time domain aliasing cancellation (TDAC). And they are the most computational intensive operations in layer III of the MPEG audio coding standard. In this paper, we propose a new efficient algorithm for the MDCT/IMDCT computation. It is based on the MDCT/IMDCT computation algorithm using the discrete cosine transforms (DCTs), and it employs two discrete cosine transform of type II(DCT-II) to compute the MDCT/IMDCT. In addition to, it takes advantage of ability in calculating the MDCT/IMDCT computation, where the length of a data block is divisible by 4. The proposed algorithm in this paper requires less calculation complexity than the existing methods. Also, it can be implemented by the parallel structure,, and its structure is particularly suitable for VLSI realization.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.91-98
• /
• 1997

In this paper, a new pixel decimation algorithm for the estimation of motion vector is proposed. In traditional methods, the computational cost can be reduced since only part of the pixels are used for motion vector calculation. But these methods limits the accuracy ofmotion vector because of the same reason. We derive a selection criteria of subsampled pixels that can reduce the probablity of false motion vector detection based on stochastic point of view. By using this criteria, a new pixel decimation algorithm that can reduce the prediction error with similar computational cost is presented. The simulation results applied to standard images haveshown that the proposed algorithm has less mean absolute prediction error than conventional pixel decimation algorithm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.2
• /
• pp.103-110
• /
• 2010

Due to the increasing amount of electronic control system in a vehicle, the automotive software is increasingly sophisticated and complicated. Therefore it may be faced a time critical problem caused by its complexity. In order to solve such problems, the automotive electronic system can use a real-time scheduling mechanism based on predictability. We first consider the standard specification of the AUTOSAR OS and uC/OS-II such as its scheduling theory with time determinism. In this paper, we propose the scheduling algorithm to be conformable to a conformance class of OSEK/VDX specification. Algorithm analysis shows that our scheduling algorithm outperforms an existing Trampoline OS by intuition.