• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.53-56
• /
• 2007

Symmerge is a stable minimum storage algorithm for merging that needs $O(mlog\frac{n}{m})$ element comparisons, where m and n are the sizes of the input sequences with m ${\leqq}$ n. According to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The objective of this paper is to consider the relationship between m and n for the spanning case with the recursion level m-1.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.8
• /
• pp.640-646
• /
• 2003

We presents an edge-based point correlation algorithm for fast and stable visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties in applying automated inspection systems to real factory environment. First of all, NGC algorithms involve highly complex computation and thus require high performance hardware for realtime process. In addition, lighting condition in realistic factory environments is not stable and therefore intensity variation from uncontrolled lights gives many troubles for applying NGC directly as pattern matching algorithm. We propose an algorithm to solve these problems, using thinned and binarized edge data, which are obtained from the original image. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the computational complexity. Matching edges instead of using original gray-level image pixels overcomes problems in NGC method and pyramid of edges also provides fast and stable processing. All proposed methods are proved by the experiments using real images.

• Journal of the Korea Convergence Society
• /
• v.5 no.4
• /
• pp.163-169
• /
• 2014

A stable neural network control scheme for unknown non-linear systems is developed in this paper. While the control variable is optimised to minimize the performance index, convergence of the index is guaranteed asymptotically stable by a Lyapnov control law. The optimization is achieved using a gradient descent searching algorithm and is consequently slow. A fast convergence algorithm using an adaptive learning rate is employed to speed up the convergence. Application of the stable control to a single input single output (SISO) non-linear system is simulated. The satisfactory control performance is obtained.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.4
• /
• pp.149-154
• /
• 2018

There is well known algorithm is a Gale-Shapley algorithm(GSA) for stable marriage problem. The GSA is performed as each man propose to his most favorite woman(MP), then the woman accepts more than one proposal rejects all but her favorite from among those who have proposed to her. This algorithm always gets a stable set of marriages with man-optimal and woman-pessimal. But the woman proposal and man-accept/reject method(WP) is can be get the distinct result. Also, the optimal stable matching may be fail using MP or WP. This paper suggests always get the optimal stable matching on all occasions in order to overcome the shortcomings of MP and WP. The proposed algorithm perform k-opt, k-women exchange with each other for the result of delete at less preference in each woman from MP result. As a result of applied to various experimental data, this algorithm can be get the optimal stable matching that the MP or WP failed to it.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.6
• /
• pp.175-182
• /
• 1998

An advanced visual tracking and stable grasping algorithm for a moving object is proposed. The stable grasping points for a moving 2D polygonal object are obtained through the visual tracking system with the Kalman filter and image prediction technique. The accuracy and efficiency are improved more than any other prediction algorithms for the tracking of an object. In the processing of a visual tracking. the shape predictors construct the parameterized family and grasp planner find the grasping points of unknown object through the geometric properties of the parameterized family. This algorithm conducts a process of ‘stable grasping and real time tracking’.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.68-74
• /
• 2010

This paper suggest a new ACS algorithm to solve SMP which was solved by Gale-Shapley algorithm. The stable marriage problem is an extensively-studied combinatorial problem with many practical applications. The classical Gale-Shapley algorithm produces a marriage that greatly favors the men at the expense of the women, or vice versa. In this paper we apply ACS algorithm to SMP to find 4 kinds of solutions such as stable matching with man-optimal, woman-optimal, egalitarian stable matching, sex-fair stable matching. So this ACS is a novel method to solve Stable Marriage Problem. Our simulation results show the effectiveness of the proposed ACS.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.961-979
• /
• 2018

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.272-277
• /
• 2008

Symmerge is a stable minimum storage merging algorithm that needs $O(m{\log}{\frac{n}{m}})$ element comparisons, where in and n are the sizes of the input sequences with $m{\leq}n$. Hence, according to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The Symmerge algorithm is based on the standard recursive technique of "divide and conquer". The objective of this paper is to consider the relationship between m and n for the degenerated case where the recursion depth reaches m-1.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2271-2274
• /
• 2005

The desired ZMP is different from the actual ZMP of a humanoid robot during actual walking and stand upright. A humanoid robot must maintain its stable posture although external force is given to the robot. A humanoid robot can know its stability with ZMP. Actual ZMP may be moved out of the foot-print polygons by external disturbance or uneven ground surfaces. If the position of ZMP moves out of stable region, the stability can not be guaranteed. Therefore, The control of the ZMP is necessary. In this paper, ZMP control algorithm is proposed. Herein, the ZMP control uses difference between desired ZMP and actual ZMP. The proposed algorithm gives reaction moment with ankle joint when external force is supplied. 3D simulator shows motion of a humanoid robot and calculated data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.3
• /
• pp.3-11
• /
• 1997

One of major research areas in the recurrent neural network is to develop stable learning algorithm. In this paper, the stable learning algorithm is developed by utilizing the evolutionary programming. The effectiveness of the proposed learning algorithm will be verified by simulating two d.0.f. robot manipulator.