• Proceedings of the KSR Conference
• /
• 2000.05a
• /
• pp.78-85
• /
• 2000

Computer algorithms for the loadflow of the DC traction power supply system are examined. Algorithms to solve the nodal equation are reviewed and the two iterative methods to solve the nonlinear nature of the loadflow are analyzed and tested, which are so called conductance matrix method and current vector iterative mettled. The result of the analysis tells that the current vector iterative method makes faster convergency and needs less computing time, and it is verified by the test running of the programs based on each of the iterative methods.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.989-992
• /
• 2011

Recently, Page and Vercauteren proposed a fault attack on pairing algorithms and two countermeasures against such an attack. The countermeasure uses either a random scalar or a random point to blind the input points. To defeat the countermeasure using a random point, we utilize the point addition formula on an elliptic curve. As a result, we successfully defeat the countermeasure using a random point.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.19-20
• /
• 2007

IEEE 802.lie is a new standard to support Quality of Service. HCCA(HCF controlled channel access) is a channel access mechanism, which polls the Qos-stations, utilized by the HC in AP. In this paper, we proposed an efficient scheduling algorithm in HCCA and compared with existing algorithms. Extensive simulation has done in ns-2 and the simulation results show our algorithm outperforms existing algorithms.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.209-210
• /
• 2007

Obtained disparity map from the stereo camera by using the several stereo matching algorithms carries lots of noise because of various causes. In our approach, mode filtering and noise elimination technique using the histogram and projection-based region merging methods are adopted for improving the quality of disparity map and image segmentation. The proposed algorithms are implemented in VHDL and the real-time experimentation shows the accurately divided objects.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.19 no.4
• /
• pp.84-90
• /
• 2011

In active noise control filter, LMS algorithms which used for control filter, assure the convergence property, and computational burden of these algorithms are proportionate to the filter taps. The convergence speed of LMS algorithms is mainly determined by value of the convergence coefficient, so optimal selection of the value of convergence coefficient is very important. In this paper, We proposed novel adaptive fuzzy logic LMS algorithms with FIR filter structure which has better convergence speed and less computational burden than conventional LMS algorithms, for single channel active noise control with ill conditioned signal case. Computer simulations were performed to show the effectiveness of a proposed algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.68
• /
• pp.21-30
• /
• 2001

The purpose of this study is to present methods for determining the k most vital arcs (k-MVAs) in the minimum spanning tree problem(MSTP) using evolutionary algorithms. The problem of finding the k-MVAs in MSTP is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of minimum spanning tree. Generally, the problem which determine the k-MVAs in MSTP has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithms are needed. In this study we propose to three genetic algorithms as the heuristic methods for finding the k-MVAs in MSTP. The algorithms to be presented in this study are developed using the library of the evolutionary algorithm framework(EAF) and the performance of the algorithms are analyzed through the computer experiment.

• The Journal of Korean Association of Computer Education
• /
• v.19 no.1
• /
• pp.101-109
• /
• 2016

Designing algorithms is a very important learning process in computational thinking education because it requires learner's logical and procedural thinking. But the case studies that have topics of algorithms learning and students' types of errors in learning algorithms are not enough. So the purpose of this study is to analyze students' errors that discovered in the process of learning three control structures of programming using flowchart and provide types of errors in designing algorithms. Results about tests of three types of control structures in university student's algorithms learning class showed different cases of types of errors; types of sequential control error are not presented in the class, types of conditional control error are presented in the case of setting the conditions of nested conditional control, and types of iterative control are showed in the many cases of iterative conditions, statements of single and nested iterative control structure. The results of study will be a good case study about teaching designing algorithms of computational thinking education in elementary, secondary school and university.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.10
• /
• pp.833-838
• /
• 2016

This paper presents a performance evaluation of various feature-initialization algorithms for forward-viewing mono-camera based simultaneous localization and mapping (SLAM), specifically in indoor environments. For mono-camera based SLAM, the position of feature points cannot be known from a single view; therefore, it should be estimated from a feature initialization method using multiple viewpoint measurements. The accuracy of the feature initialization method directly affects the accuracy of the SLAM system. In this study, four different feature initialization algorithms are evaluated in simulations, including linear triangulation; depth parameterized, linear triangulation; weighted nearest point triangulation; and particle filter based depth estimation algorithms. In the simulation, the virtual feature positions are estimated when the virtual robot, containing a virtual forward-viewing mono-camera, moves forward. The results show that the linear triangulation method provides the best results in terms of feature-position estimation accuracy and computational speed.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.14-28
• /
• 2009

The PageRank algorithm is an important component for ranking Web pages in Google and other search engines. While many improvements for the original PageRank algorithm have been proposed, it is unclear which variations (and their combinations) provide the "best" ranked results. In this paper, we evaluate the ranking quality of the well-known variations of the original PageRank algorithm and their combinations. In order to do this, we first classify the variations into link-based approaches, which exploit the link structure of the Web, and knowledge-based approaches, which exploit the semantics of the Web. We then propose algorithms that combine the ranking algorithms in these two approaches and implement both the variations and their combinations. For our evaluation, we perform extensive experiments using a real data set of one million Web pages. Through the experiments, we find the algorithms that provide the best ranked results from either the variations or their combinations.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1142-1149
• /
• 2018

Recently, computer vision application is increasing by using CNN which is one of the deep learning algorithms. However, CNN does not provide perfect classification performance due to gradient vanishing problem. Most of CNN algorithms use an activation function called ReLU to mitigate the gradient vanishing problem. In this study, four activation functions that can replace ReLU were applied to four different structural networks. Experimental results show that ReLU has the lowest performance in accuracy, loss rate, and speed of initial learning convergence from 20 experiments. It is concluded that the optimal activation function varied from network to network but the four activation functions were higher than ReLU.