• 한국정보교육학회:학술대회논문집
• /
• 2008.01a
• /
• pp.67-72
• /
• 2008

지식기반 사회에서는 새로운 지식을 만들어 낼 수 있는 능력과 융통성, 문제해결력, 논리적 사고력 등을 가진 인재를 필요로 하고 있다. 알고리즘 교육은 학생들의 정보마인드와 정보적 사고, 논리적 사고능력의 신장을 위하여 반드시 필요하며, 이는 다변화 되어가는 사회에서 다양한 문제를 해결해 나가는 능력을 키우는 데 큰 역할을 할 것이다. 이에 본 논문은 논리적 사고력 신장을 위한 생활 속의 알고리즘 교육 방법을 모색하여 제안하고자 한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.45-51
• /
• 2012

Programming is an area that many students have difficulty on because it requires various skills, such as problem analysis, logical thinking, and procedural problem-solving skills. In this paper, a system visualizing algorithm was used to set up algorithmic concepts easily and effectiveness of the system was analyzed through scholastic achievement test and survey after learning through this process. For evaluation, we divided students who take courses on programming language and algorithm in 3 universities into 2 groups with 6 teams in each group. The group that trained this system visualizing algorithm had scored 17.4 points higher in terms of scholastic achievement than the group that did not train such method. Moreover, according to the survey, the group had higher scores in terms of interest level, concentration level, comprehension, effectiveness, and convenience.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.455-470
• /
• 2007

In phylogenetic tree construction the neighbor-joining algorithm is the most well known method which constructs a trivalent tree from a pairwise distance data measured by DNA sequences. The core part of the algorithm is its cherry picking criterion based on the tree structure of each quartet. We give a generalized version of the criterion based on the exact box model of quartets, known as the tight span of a metric. We also show by experiment why neighbor-joining and the quartet consistency count method give similar performance.

• International Journal of Precision Engineering and Manufacturing
• /
• v.2 no.1
• /
• pp.76-80
• /
• 2001

A binary parallel robot manipulator uses actuators that have only two stable states being built by stacking variable geometry trusses on top of each other in a long serial chain. Discrete characteristics of the binary manipulator make it impossible to analyze an inverse kinematic problem in conventional ways. We therefore introduce new definitions of workspace and inverse kinematic solution, and the apply a genetic algorithm to the newly defied inverse kinematic problem. Numerical examples show that our genetic algorithm is very efficient to solve the inverse kinematic problem of binary robot manipulators.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.659-661
• /
• 1999

In this paper, we proposed a simple neural network-based parameter tuning algorithm, which could find the gradients of a certain performance index in the PID parameter spaces. In this process, we had to know the dynamics between input and output of the plant, and we used the Back Propagation Neural network to identify them. To make the parameter updating fast and smooth, we constructed the performance index as the sum of past N-squared plant errors, and applied a batch mode algorithm to update parameters. We performed several experiments with a DC Motor to show the validity of the proposed algorithm.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.420-432
• /
• 2020

The reconstruction of archaeological fragments in 3D geometry is an important problem in pattern recognition and computer vision. Therefore, we implement an algorithm with the help of a 3D model to perform reconstruction from the real datasets using the slope features. This approach avoids the problem of gaps created through the loss of parts of the artifacts. Therefore, the aim of this study is to assemble the object without previous knowledge about the form of the original object. We utilize the edges of the fragments as an important feature in reconstructing the objects and apply multiple procedures to extract the 3D edge points. In order to assign the positions of the unknown parts that are supposed to match, the contour must be divided into four parts. Furthermore, to classify the fragments under reconstruction, we apply a backpropagation neural network. We test the algorithm on several models of ceramic fragments. It achieves highly accurate results in reconstructing the objects into their original forms, in spite of absent pieces.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.1
• /
• pp.7-12
• /
• 2012

In this paper, we present an effective viewpoint estimation algorithm for the Moving parallax barrier method of 3D display mobile device. Moving parallax barrier is designed to overcome the biggest problem, the limited view angle. To accomplish it, the position of the viewer's eyes or face should be estimated with strong stability and no latency. We focus on these requirements in the poor performance of mobile processors. We used a pre-processing algorithm in order to overcome the various illumination changes. And, we combined the conventional Viola-Jones face detection method and Optical-flow algorithm for robust and stable viewpoint estimation. Various computer simulations prove the effectiveness of the proposed method.

• Communications of Mathematical Education
• /
• v.21 no.4
• /
• pp.597-612
• /
• 2007

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1046-1048
• /
• 2009

Cooperative transmission is an effective technique to combat multi-path fading and reduce transmitted power. Relay selection and power allocation are important technical issues to determine the performance of cooperative transmission. In this paper, we proposed a new multi-relay selection and power allocation algorithm to increase network lifetime. The proposed relay selection scheme minimizes the transmitted power and increase the network lifetime by considering residual power as well as channel conditions. Simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.