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

Genetic alogorithm(GA) is a well-known global optimization algorithm. However, as the searching bounds grow wider., performance of local optimization deteriorates. In this paper, we propose a hybrid algorithm which integrates the gradient algorithm and GA so as to reinforce the performance of local optimization. We apply this algorithm to the system identification of second order RLC circuit. Identification results show that the proposed algorithm gets the better and robust performance to find the exact values of RLC elements.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.93-100
• /
• 2012

In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.161-165
• /
• 1992

The important properties of industrial scale or weighing machine operated in production lines are quickness and precision. This paper presents an algorithm which meets the importance. The algorithm of Recursive Least Squares Regression is described for the weighing system simulated as a dynamic model of the second order. Using the model and the algorithm, model parameters and then the mass being weighed can be determined from the step input. The performance of the algorithm is illustrated in digital simulation. Discussions have been extended to the development of fast converging algorithm. It turns out that the algorithm shows several desirable features suitable for microcomputer assisted realtime signal processing.

• Proceedings of the KIEE Conference
• /
• 2001.04a
• /
• pp.473-475
• /
• 2001

This paper proposed a MPPT ( Maximum Power Point Tracking) control algorithm for PV(Photovoltaic) array based on a modified constant voltage control MPPT algorithm at low-insolation. This method which combines a IncCond(Incremental Conductance) and a constant voltage control algorithm. In contrast to the typical conventional MPPT algorithm, the proposed method have been obtained high efficiency and good performance. The proposed algorithm is verified through simulation result. In order to confirm the availability of the scheme, a simulation used PSIM and ACSL software tool.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.717-726
• /
• 2006

This study is to investigate the MAE of prediction value by collaborative filtering algorithm originated by GroupLens and improved algorithm. To decrease the MAE on the collaborative recommender system on user based, this research proposes the improved algorithm, which reduces the possibility of over estimation of active user's preference mean collaboratively using other user’s preference mean. The result shows the MAE of prediction by improved algorithm is better than original algorithm, so the active user's preference mean used in prediction formula is possibly over estimated.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.1
• /
• pp.135-142
• /
• 2009

In this paper the Simplified Refined Instrumental Variable (SRIV) identification algorithm for SISO systems is extended to MIMO systems described by a Left Matrix Fraction Description (LMFD). The performance of the extended algorithm is compared to the well-known MIMO four-step instrumental variable (IV4) algorithm. Monte Carlo simulations for different signal to noise ratios are conducted to assess the performance of the algorithm. Moreover, the algorithm is applied to a simulated quadruple tank process.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.653-655
• /
• 2011

EPCglobal proposed a Q-algorithm, which is used for selecting a slot-count in the next query round. However, it is impossible to allocate an optimized slot-count because the original Q-algorithm did not define an optimized weight C value. In this paper, we propose an adaptive Q-algorithm, in which we differentiate the weight values with respect to collision and empty slots. The weight values are defined with the identification time as well as the collision probability.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3209-3211
• /
• 1999

We propose a robust Dual-Mode blind equalization algorithm based on Quadrant-partitioned Constant Modulus Algorithm (QCMA) and Modified Constant Modulus Algorithm(MCMA) for QAM demodulation and its performance evaluated. The proposed algorithm show that the stability in setting 2d range and the faster convergence accomplished to conventional Dual-Mode algorithm.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.