• Journal of the Korean School Mathematics Society
• /
• v.15 no.3
• /
• pp.511-533
• /
• 2012

In order to determine whether there is a significant correlation between relational understanding and creative math. problem finding ability, this study performed relational understanding and problem finding ability tests on a sample of 186 8th grade middle school students. According to the study results, we found a very significant positive correlation between relational understanding and the creativity of the mathematising ability and the combining ability of mathematical concepts in the problem finding ability. Although there was no statistically significant correlation between relational understanding and the extension ability of mathematical facts, the results from analyzing the students response rate and actual scores in each test showed that students with high relational understanding scores also had high response rate and high scores in analogical reasoning and inductive reasoning. Through this study, therefore, relational understanding is found to have a positive impact on the creative mathematics problem finding ability.

• Journal of Science Education
• /
• v.45 no.1
• /
• pp.23-41
• /
• 2021

This study is to investigate the characteristics of problem-finding and problem-solving abilities demonstrated by the secondary gifted students in the context of STEAM convergent problems. For this, using the STEAM convergence problem solving ability test, we qualitatively and quantitatively compared and analyzed the workbook outputs written in the process of finding and solving problems for each student in the gifted class. The results are as follows: First, we found that the speciality of the major of the proposed activity paper influenced the preference for questions and pattern of finding problems. Second, it was found that the difference in the ability to find and solve problems for a specific task was not by the major of the gifted class, but by the composition of the group. Third, in finding and solving the STEAM convergent problem, the individual creativity and the cooperative creativity of the group were more significant than the major. These results suggest that it is necessary to include the affective factors of gifted students and the concept of cooperation in problem-finding and problem-solving ability evaluation, and there is a need to develop a teaching and learning strategy that can improve cooperative problem-solving skills so that group creativity can be exhibited well.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.11-20
• /
• 1998

This paper deals with a mathematical model and an algorithm for the problem of determining k most vital arcs in the shortest path problem. First, we propose a 0-1 integer programming model for finding k most vital arcs in shortest path problem given the ordered set of paths with cardinality q. Next, we also propose an algorithm for finding k most vital arcs ln the shortest path problem which uses the 0-1 Integer programming model and shortest path algorithm and maximum flow algorithms repeatedly Malik et al. proposed a non-polynomial algorithm to solve the problem, but their algorithm was contradicted by Bar-Noy et al. with a counter example to the algorithm in 1995. But using our algorithm. the exact solution can be found differently from the algorithm of Malik et al.

• Journal of Elementary Mathematics Education in Korea
• /
• v.16 no.2
• /
• pp.269-293
• /
• 2012

This study is intended to figure out how the 6th grade students carry out newly added standards regard to the problem solving in the revised mathematics curriculum in 2007 and 2009, which are 'finding useless information in a given problem', 'finding insufficient information in a given problem', and 'posing new problem by changing conditions of the given problem.' In order to achieve this goal, we examined the characteristics of 200 elementary students' problem posing. We constructed and used the survey sheet which consisted of 6 items relevant to 'finding useless information in a given problem', 'finding insufficient information in a given problem', and 'posing new problem by changing conditions of the given problem.'

• 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.

• Journal of The Korean Association For Science Education
• /
• v.36 no.6
• /
• pp.867-876
• /
• 2016

In accordance with the changing of society, remarkable increase in knowledge and information, the competencies to choose and use proper information in various domains are considered as an important skill. As one of the methods in developing these competencies, it is emphasized that a problem-based learning can make student understand and use knowledge by solving the contextualized problem. However, it is skeptical of learner's development of competencies to use knowledge by solving well-defined given problem. Therefore it is required that students be allowed to develop the competency to find problem through experiences to determine and evaluate the purpose of the problem and method. The purpose of this study is to understand how undergraduate students use science or technology in finding a problem. In this line, this study articulated four cases conducted by participants who engaged in convergence teaching-learning program. And this study investigated the participants' process of problem-finding, method and reason to apply science or technology. The results were drawn by analyzing interviews and written data, including their proposal, a poster, and final reports. Participants changed the form of problem from initial ill-structured one into a concrete one, where the participant could derive a detailed solution. Science or technology applied as the detailed example to convert problem into a concrete form, or as the analyzing tool or theoretical background of problem to make a link with other domain. Their reason of applying science or technology could be summarized in 'personal interest based on prior experience' and 'alternatives to resolve a dissatisfaction.' Based on the result, this study suggests holistic approach that is included in both intuitive thinking and logical thinking and metacognitive regulation to stimulate problem-finding in problem-based learning program.

• Journal of the Korean Mathematical Society
• /
• v.38 no.6
• /
• pp.1275-1284
• /
• 2001

In this paper, we introduce an iteration generated by countable nonexpansive mappings and prove a weak convergence theorem which is connected with the feasibility problem. This result is used to solve the problem of finding a solution of the countable convex inequality system and the problem of finding a common fixed point for a commuting countable family of nonexpansive mappings.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.42.2-42
• /
• 2002

We discuss a neural network solver for the inverse optimization problem. The problem is that find functional relations between input and output data, which are include defects. Finding the relations, predictions of the defect parts are also required. The part of finding the defects in the input data is an inverse problem . We consider the meanings to solve the problem on the neural network system at first. Next, we consider the network structure of the system, the learning scheme of the network, and at last, examine the precision on the numerical calculations. In the paper, we proposed the high-precision learning method for plural three-layer neural network system that is series-connect...

• Journal of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.477-492
• /
• 1994

For the eigenvalue problem of $Au = \lambda u$ where A is considered as a semi-bounded self-adjoint operator on a Hilbert space, we are used to apply two complentary methods finding upper bounds and lower bounds to the eigenvalues. The most popular method for finding upper bounds may be the Rayleigh-Ritz method which was developed in the 19th century while a method for computing lower bounds may be the method of intermediate eigenvalue problems which has been developed since 1950's. In the method of intermediate eigenvalue problems (IEP), we consider the original operator eigenvalue problem as a perturbation of a simpler, resolvable, self-adjoint eigenvalue problem, called a base problem, that gives rough lower bounds.

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.777-798
• /
• 2018

In this paper, we study a new iterative method for solving mixed equilibrium problem and a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the framework of reflexive real Banach spaces. Moreover, we prove a strong convergence theorem for finding common fixed points which also are solutions of a mixed equilibrium problem.