• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.314-317
• /
• 2005

As demands of VBNS and VDSL increase, the development of kernel parts of optical communication such as PLC(Planar Light Circuit), Coupler, and WDM elements increases. The alignment and the attachment technology are very important in the fabrication of optical elements. The ultra precision stage wasn't yet applied in the optical alignment and the optical element alignment was taken too many times. In this paper, the optical element alignment of ultra precision positioning stage was studied. The alignment algorithm is comprised of field search and peak search algorithms. The procedure of the alignment algorithms applied to the ultra precision positioning stage are developed by LabView programming.

• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.767-788
• /
• 2010

In this paper, we propose two limited memory BFGS algorithms with a nonmonotone line search technique for unconstrained optimization problems. The global convergence of the given methods will be established under suitable conditions. Numerical results show that the presented algorithms are more competitive than the normal BFGS method.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.727-734
• /
• 1999

Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.337-354
• /
• 2004

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.

• The KIPS Transactions:PartD
• /
• v.18D no.2
• /
• pp.101-110
• /
• 2011

According to the increasing use of blogs, a huge number of posts have appeared in a blogosphere. This causes web surfers to face difficulty in finding the quality posts in their search results. As a result, post ranking algorithms are required to help web serfers to effectively search for quality posts. Although there have been various algorithms proposed for web-page ranking, they are not directly applicable to post ranking since posts have their unique features different from those of web pages. In this paper, we propose post ranking algorithms that exploit actions performed by bloggers. We also evaluate the effectiveness of post ranking algorithms by performing extensive experiments using real-world blog data.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.9
• /
• pp.1095-1103
• /
• 1992

An approach to fuse the fuzzy inference system which is able to deal with imprecise and uncertain information and genetic algorithms which display the excellent robustness in complex optimization problems is presented in this paper. In order to combine genetic algorithms and fuzzy inference engine effectively the new reasoning method is suggested. The efficient identification method of fuzzy rules is proposed through the adjustment of search areas of genetic algorithms. The feasibilty of the proposed approach is evaluated through simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.968-971
• /
• 1996

In this paper, feedback controller is designed for ball-beam system using genetic algorithms. A genetic algorithms are implemented for optimizing gain parameters of feedback controller. We can find optimal point in multi-dimensional search space by using genetic algorithms. Performance of controller is tested by simulation of ball-beam system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1190-1193
• /
• 2005

In recent years, as the demands of VBNS and VDSL increase, the development of kernel parts of optical communication such as PLC(Planar Light Circuit), Coupler, and WDM elements increases. The alignment and the attachment technology are very important in the fabrication of optical elements. In this paper, the optical alignment characteristics of multi-axis ultra precision stage were studied. The alignment algorithms were studied for applying to the ultra precision multi-axis stage. The alignment algorithm is comprised of field search and peak search algorithms. The contour of optical power signals can be obtained by field search and the precise coordinate can be found out by peak search. Two kinds of alignments, such as 1 ch. input vs. 1 ch. output optical stack, and 1 ch. input vs. 8 ch. output PLC stacks were performed for investigating the alignment characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3041-3063
• /
• 2018

Community search aims at finding a meaningful community that contains the query node and also maximizes (minimizes) a goodness metric. This problem has recently drawn intense research interest. However, most metric-based algorithms tend to include irrelevant subgraphs in the identified community. Apart from the user-defined metric algorithm, how can we search the natural community that the query node belongs to? In this paper, we propose a novel community search algorithm based on the concept of the k-hop and local distance dynamics model, which can naturally capture a community that contains the query node. The basic idea is to envision the nodes that k-hop away from the query node as an adaptive local dynamical system, where each node only interacts with its local topological structure. Relying on a proposed local distance dynamics model, the distances among nodes change over time, where the nodes sharing the same community with the query node tend to gradually move together, while other nodes stay far away from each other. Such interplay eventually leads to a steady distribution of distances, and a meaningful community is naturally found. Extensive experiments show that our community search algorithm has good performance relative to several state-of-the-art algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.73-78
• /
• 2004

By modeling the block matching algorithm as a function of the correlation of image blocks, we derive search patterns for fast block matching motion estimation. The proposed approach provides an analytical support lot the diamond-shape search pattern, which is widely used in fast block matching algorithms. We also propose a new fast motion estimation algorithm using adaptive search patterns and statistical properties of the object displacement. In order to select an appropriate search pattern, we exploit the relationship between the motion vector and the block differences. By changing the search pattern adaptively, we improve motion prediction accuracy while reducing required computational complexity compared to other fast block matching algorithms.