• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.169-172
• /
• 2002

This paper is concerned with walking trajectory generation by applying the genetic algorithm. The walking trajectory is generated though three via-points and genetic algorithm is employed to find velocity and acceleration at each via-point. Also genetic algorithm is applied for balancing joint trajectory. Fitness function is used for minimizing the trajectory. As a result, new algorithm generated the smooth trajectory. The proposed algorithm is verified by the experiment of biped walking robot developed in our Control laboratory, and we compared the result with the previous walking algorithm. It showed that the new proposed algorithm generated the better walking trajectory.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.3
• /
• pp.71-79
• /
• 1998

This paper introduces a new optimization algorithm which is combined with genetic algorithm and random tabu search method. Genetic algorithm is a random search algorithm which can find the global optimum without converging local optimum. And tabu search method is a very fast search method in convergent speed. The optimizing ability and convergent characteristics of a new combined optimization algorithm is identified by using a test function which have many local optimums and an optimum allocation of pipe support. The caculation results are compared with the existing genetic algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6063-6079
• /
• 2019

When the length of sampling data sequence is too large, the method of gesture recognition based on traditional Dynamic Time Warping (DTW) algorithm will lead to too long calculation time, and the accuracy of recognition result is not high.Support vector machine (SVM) has some shortcomings in precision, Edit Distance on Real Sequences(EDR) algorithm does not guarantee that noise suppression will not suppress effective data.A new method based on Improved Interpolation Dynamic Time Warping (IIDTW)algorithm is proposed to improve the efficiency of gesture recognition and the accuracy of gesture recognition. The results show that the computational efficiency of IIDTW algorithm is more than twice that of SVM-DTW algorithm, the error acceptance rate is FAR reduced by 0.01%, and the error rejection rate FRR is reduced by 0.5%.Gesture recognition based on IIDTW algorithm can achieve better recognition status. If it is applied to unlock mobile phone, it is expected to become a new generation of unlock mode.

• Journal of Korean Society for Quality Management
• /
• v.30 no.4
• /
• pp.68-77
• /
• 2002

EM algorithm has good convergence rate for numerical procedures which converges on very small step. In the case of proportion estimation in a mixed distribution which has very big incomplete data or of update of new data continuously, however, EM algorithm highly depends on a initial value with slow convergence ratio. There have been many studies to improve the convergence rate of EM algorithm in estimating the proportion parameter of a mixed data. Among them, dynamic EM algorithm by Hurray Jorgensen and Titterington algorithm by D. M. Titterington are proven to have better convergence rate than the standard EM algorithm, when a new data is continuously updated. In this paper we suggest dynamic EM algorithm and Titterington algorithm for the estimation of a mixed Poisson distribution and compare them in terms of convergence rate by using a simulation method.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.186-195
• /
• 2022

In this paper, we propose a new algorithm to improve the accuracy of indoor positioning techniques using Wi-Fi access points as beacon nodes. The proposed algorithm is based on the Weighted Centroid algorithm, a popular method widely used for indoor positioning, however, it improves some disadvantages of the Weighted Centroid method and also for other kinds of indoor positioning methods, by using the received signal strength correction method and genetic algorithm to prevent the signal strength fluctuation phenomenon, which is caused by the complex propagation environment. To validate the performance of the proposed algorithm, we conducted experiments in a complex indoor environment, and collect a list of Wi-Fi signal strength data from several access points around the standing user location. By utilizing this kind of algorithm, we can obtain a high accuracy positioning system, which can be used in any building environment with an available Wi-Fi access point setup as a beacon node.

• Journal of Astronomy and Space Sciences
• /
• v.36 no.4
• /
• pp.283-292
• /
• 2019

The purpose of this study was to develop a period analysis algorithm for detecting new variable stars in the time-series data observed by charge coupled device (CCD). We used the data from a variable star monitoring program of the CBNUO. The R filter data of some magnetic cataclysmic variables observed for more than 20 days were chosen to achieve good statistical results. World Coordinate System (WCS) Tools was used to correct the rotation of the observed images and assign the same IDs to the stars included in the analyzed areas. The developed algorithm was applied to the data of DO Dra, TT Ari, RXSJ1803, and MU Cam. In these fields, we found 13 variable stars, five of which were new variable stars not previously reported. Our period analysis algorithm were tested in the case of observation data mixed with various fields of view because the observations were carried with 2K CCD as well as 4K CCD at the CBNUO. Our results show that variable stars can be detected using our algorithm even with observational data for which the field of view has changed. Our algorithm is useful to detect new variable stars and analyze them based on existing time-series data. The developed algorithm can play an important role as a recycling technique for used data

• Journal of Korean Academy of Nursing
• /
• v.41 no.6
• /
• pp.768-779
• /
• 2011

Purpose: This study was designed to adapt a surgical wound care algorithm that is used to provide evidence-based surgical wound care in a critical care unit. Methods: This study used, the 'ADAPTE process', an international clinical practice guideline development method. The -'Bonnie Sue wound care algorithm' - was used as a draft for the new algorithm. A content validity index (CVI) targeting 135 critical care nurses was conducted. A 5-point Likert scale was applied to the CVI test using a statistical criterion of .75. Results: A surgical wound care algorithm comprised 9 components: wound assessment, infection control, necrotic tissue management, wound classification by exudates and depths, dressing selection, consideration of systemic factors, wound expected outcome, reevaluate non-healing wounds, and special treatment for non-healing wounds. All of the CVI tests were ${\leq}$.75. Compared to existing wound care guidelines, the new wound care algorithm provides precise wound assessment, reliabilities of wound care, expands applicability of wound care to critically ill patients, and provides evidence and strength of recommendations. Conclusion: The new surgical wound care algorithm will contribute to the advancement of evidence-based nursing care, and its use is expected as a nursing intervention in critical care.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.1-20
• /
• 2018

Service composition in the Inter-Cloud raises new challenges that are caused by the different Quality of Service (QoS) requirements of the users, which are served by different geo-distributed Cloud providers. This paper aims to explore how to select and compose such services while considering how to reach high efficiency on cost and response time, low network latency, and high reliability across multiple Cloud providers. A new hybrid multi-objective evolutionary algorithm to perform the above task called LS-NSGA-II-DE is proposed, in which the differential evolution (DE) algorithm uses the adaptive mutation operator and crossover operator to replace the those of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to get the better convergence and diversity. At the same time, a Local Search (LS) method is performed for the Non-dominated solution set F{1} in each generation to improve the distribution of the F{1}. The simulation results show that our proposed algorithm performs well in terms of the solution distribution and convergence, and in addition, the optimality ability and scalability are better compared with those of the other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.704-711
• /
• 2008

This paper proposes a new de-interlacing method which results in efficient visual improvement. In the proposed algorithm, the distance weight was considered and the previously developed the EDI (Edge Dependent Interpolation) algorithm and the NAL (New Adaptive Linear interpolation) algorithm were used as a basis. The do-interlacing method was divided into two main parts. First, the edge direction was found by using information of closer pixels. Then, missing pixels were interpolated along with the decided edge direction. In this paper, after predicting the edge through the EDI algorithm, missing pixels were interpolated by using the weighted distance based on the NAL algorithm. Experimental results indicate that the proposed algorithm be superior to the conventional algorithms in terms of the objective and subjective criteria.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.3
• /
• pp.312-319
• /
• 2011

In this paper, a new linearization algorithm for DPD(Digital PreDistorter) is suggested. This new algorithm uses DFP(Davidon-Fletcher-Powell) method. This algorithm is more accurate than that of the existing algorithms, and this method renew the best-fit value in every routine with out setting the initial value of step-size. In modeling power amplifier, the memory polynomial model which can model the memory effect of the power amplifier is used. And the overall structure of linearizer is based on an indirect learning architecture. In order to verify for performance of proposed algorithm, we compared with LMS(Least Mean-Squares), RLS(Recursive Least squares) algorithm.