• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.749-759
• /
• 2012

A globally convergent algorithm for solving equilibrium problems is proposed. The algorithm is based on a proximal point algorithm (shortly (PPA)) with a positive definite matrix M which is not necessarily symmetric. The proximal function in existing (PPA) usually is the gradient of a quadratic function, namely, ${\nabla}({\parallel}x{\parallel}^2_M)$. This leads to a proximal point-type algorithm. We first solve pseudomonotone equilibrium problems without Lipschitzian assumption and prove the convergence of algorithms. Next, we couple this technique with the Banach contraction method for multivalued variational inequalities. Finally some computational results are given.

• Journal of Computing Science and Engineering
• /
• v.8 no.1
• /
• pp.1-10
• /
• 2014

The Bacterial Foraging Optimization Algorithm is a swarm intelligence optimization algorithm. This paper first analyzes the chemotaxis, as well as elimination and dispersal operation, based on the basic Bacterial Foraging Optimization Algorithm. The elimination and dispersal operation makes a bacterium which has found or nearly found an optimal position escape away from that position, which greatly affects the convergence speed of the algorithm. In order to avoid this escape, the sphere of action of the elimination and dispersal operation can be altered in accordance with the generations of evolution. Secondly, we put forward an algorithm of an adaptive adjustment of step length we called improved bacterial foraging optimization (IBFO) after making a detailed analysis of the impacts of the step length on the efficiency and accuracy of the algorithm, based on chemotaxis operation. The classic test functions show that the convergence speed and accuracy of the IBFO algorithm is much better than the original algorithm.

• Journal of The Korean Association of Information Education
• /
• v.12 no.3
• /
• pp.303-312
• /
• 2008

In correspondence to the educational demand on study of computer principles that is recently being focused, this study promotes basic understanding on data structure and algorithm at the elementary student level through the process of simple numerical expressions and proposes effective education contents and methods. For this, an unplugged type computer education material was produced to understand the method of the computers for receiving data through activities. Also, we proposed students to create animation data to learn numerical expressions and algorithm through arrangements and linked lists. To examine educational effectiveness of this study, an experiment study was conducted through the education content and method to the subject of one class in the fifth-grade of elementary school located in OO metropolitan city. As a result, the student learned that there is a difference in calculation method between computers and people; and this enabled basic understanding on algorithm and data structure and presented positive responses to algorithm and data structure. In conclusion, it is confirmed that it is possible to provide effective education for students if the principle study of algorithm is proposed to proper levels.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.1
• /
• pp.27-36
• /
• 2010

Introducing algorithm and programming education to the middle school 'Information' curriculum is appropriate to develop higher thinking skills like problem solving ability and creativity that is the most important ability to the people living in the knowledge and information society. But to providing reduced algorithm and programming contents of higher education increase the cognitive burden on the students in the concrete operational period who is not yet reached to the formal operational period, and moreover transfering principles and strategies learned in the algorithm to the programming for the problem solving is difficult. For this study, student's developmental characteristics in the concrete operational period among cognitive developmental periods was considered, and FAAP(First-Algorithm After-Programming) learning model which can transfer algorithm to programming was developed, and finally the effectiveness of learning motivation and achievement to the concrete operational period's students was verified. Results of the tests showed that learning motivation and achievement of the concrete operational period's students that learned FAAP model were different significantly.

• Journal of The Korean Association of Information Education
• /
• v.17 no.3
• /
• pp.317-327
• /
• 2013

Algorithm education that become at the base of thinking is emphasized from primary school. However, It is difficult to understand algorithm in elementary school students level. In this research, it considered curriculum that can teach universally to elementary school students by solution plan of problem. So we chose Scratch program with education data, because it is verified the effect in education of algorithm, and easy to control among EPL (Education Programming Language). It was composed curriculum so that interaction is accomplished through group activities to coincide in various level of students, and approached to the problem-solving center to emphasize important thinking process in algorithm education, and got educational value in relevant level of each student. According to validation of expert groups and surveys, we concluded the curriculum that is appropriate. The curriculum proposed in this paper can help to enhance the problem solving ability and the creativity.

• Education of Primary School Mathematics
• /
• v.20 no.1
• /
• pp.69-84
• /
• 2017

The purpose of this study is to review how to introduce a division algorithm in mathematics textbooks which were applied 2009 revised curriculum. As a result, the textbooks do not introduce the algorithm in the context of division by equal part. The standardized division algorithm was introduced apart from the stepwise division algorithms and there is no explanation in between them. And there is a lack connectivity between activities and algorithms. This study is expected to help new curriculum and textbook to introduce division algorithm in proper way.

• Communications of Mathematical Education
• /
• v.19 no.4 s.24
• /
• pp.715-731
• /
• 2005

There are five contexts of division algorithm of fractions such as measurement division, determination of a unit rate, reduction of the quantities in the same measure, division as the inverse of multiplication and analogy with multiplication algorithm of fractions. The division algorithm, however, should be taught by 'dividing by using reciprocals' via 'measurement division' because dividing a fraction by a fraction results in 'multiplying the dividend by the reciprocal of the divisor'. If a fraction is divided by a large fraction, then we can teach the division algorithm of fractions by analogy with 'dividing by using reciprocals'. To achieve the teaching-learning methods above in elementary school, it is essential for children to use the maniplatives. As Piaget has suggested, Cuisenaire color rods is the most efficient maniplative for teaching fractions. The instruction, therefore, of division algorithm of fractions should be focused on 'dividing by using reciprocals' via 'measurement division' using Cuisenaire color rods through analogy if necessary.

• Journal of The Korean Association of Information Education
• /
• v.20 no.2
• /
• pp.151-160
• /
• 2016

Algorithm education is emphasized as an instrument for teaching the basic principles of Computer Science. But these materials is very short-fall. We'll present the CS Unplugged-based algorithm contents, which is easy to learn for elementary student. These contents for self-directed learning consisted of the activity-based learning. For problem-solving algorithm learning in everyday life we were developed the hashing techniques on the basis of the basic searching and sorting algorithms. For checking the adequacy of these materials were tested by surveys of teacher professional groups, and we obtain the appropriate conclusions for sorting algorithm contents for improving the problem-solving ability for in elementary student.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.149-160
• /
• 2010

Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighbor-joining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.

• Journal of the Korean Institute of Educational Facilities
• /
• v.15 no.3
• /
• pp.4-16
• /
• 2008

BTL(Build-Transfer-Lease) Project for Education Facilities is contracted as a package which consists of several education facilities and its maintenance period is 20 years. Thus, total cost variation largely depends on the accuracy of the maintenance cost forecasting in the early stage in the life cycle of the BTL Projects. This research develops a method using complete linkage algorithm and branch & bound algorithm to help in finding optimal bundling combination. The result of this research suggests more reasonable and effective forecasting method for the maintenance bundle in BTL projects.