• Journal of Gifted/Talented Education
• /
• v.21 no.2
• /
• pp.575-589
• /
• 2011

The aims of this study are to investigate how Kepler found a scientific problem for the retinal image theory and to investigate how the science high-school students respond when the same situation is applied to them. And their results was compared with general high-school students' results. Kepler found the scientific problem in the eye vision through the critical analysis of contemporary theories of vision, based on his relevant knowledge of optics. When we applied the same situation to the Korean science high school and general high-school students, only a few of science high-school students found the scientific problem as same as Kepler's finding. From the results, it is suggested that in development of creativity teaching material, the situations like Kepler's problem finding need to be included in the programs.

• Communications of the Korean Mathematical Society
• /
• v.21 no.3
• /
• pp.559-567
• /
• 2006

We are interested in the distance problem between two objects in three dimensional Euclidean space. There are many distance problems for various types of objects including line segments, boxes, polygons, circles, disks, etc. In this paper we present an iterative algorithm for finding the distance between two given ellipses. Numerical examples are given.

• Journal of the military operations research society of Korea
• /
• v.15 no.2
• /
• pp.79-93
• /
• 1989

This research paper is aimed at developing an optimal strategy for finding espionage ship sent from North Korea. The optimal strategy developed here handles detection rate and probability that the espionage ship is in a certain specific sea area. A detection model is developed and an application problem is illustrated.

• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.423-439
• /
• 2004

We are concerned with the robust control problem for the Keller-Segel equations with the distributed control and disturbance. We consider the present problem as a differential game finding the best control which takes into account the worst disturbance. We prove the existence of solutions and the optimality conditions to a corresponding problem.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.8
• /
• pp.385-393
• /
• 2008

The best coverage problem is finding a path whose worst distance to the sensor-set is the best among all paths. Instead, if the user stays close to its nearest two sensors, then the stability of the wireless connection may be guaranteed. So we consider the problem of finding a second best coverage path; given the sensor set U, a starting point s and a target point t, find a path whose worst distance to the second closest sensor is minimized. This paper presents an O(n logn) -time algorithm to find such a path. We also give experimental evidence showing that the connection to the sensor-set along a second best coverage path is more stable than that along the best coverage path.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.131-142
• /
• 1991

The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

• Journal of Korean Society of Archives and Records Management
• /
• v.7 no.2
• /
• pp.139-164
• /
• 2007

Finding aids is the first necessary step for users to find records easily. EAD, computerized standardization for finding aids, enables users to access to the finding aids easily and accelerates interoperability between Archives. This research is to review the domestic and foreign archives where they have built EAD finding aids and to analyze the distinctive feature in the EAD finding aids. And to review and point out the problems in current status of finding aids in domestic university archives. And the solution for the problem is presented in this research.

• Journal of Gifted/Talented Education
• /
• v.19 no.2
• /
• pp.279-302
• /
• 2009

This paper was to examine the effects of university-based science gifted education program on scientifically gifted students' science problem finding ability and cognitive-affective factors. For this study, 69 scientifically gifted students with previous Silted education experiences at the university-based science gifted education centers and 91 scientifically gifted students without any previous gifted education experiences were compared. Both groups of students were currently enrolled at a specialized science high school. To compare both groups, scientific problem finding ability, science anxiety, science related attitude, self-efficacy, intrinsic motivation, test anxiety, cognitive strategies, and self-regulation were measured. The results indicate that there was no significant difference on scientific problem finding ability between these two groups. The comparison between the past and now in the aspects of variables observed in the study showed that both groups of students were decreased in the science anxiety and self-efficacy. But the test anxiety was significantly increased compared to the past in both groups. Implications of the study were discussed in depth.

• Korean Management Science Review
• /
• v.4
• /
• pp.76-83
• /
• 1987

The machine-part group formation(MPGF) problem arises frequently in FMS planning. By viewing the problem as one of finding good assignments, a powerful solution algorithm is presented. The new algorithm solves the threshold dilemma found in previous solution procedures employing similarity coefficients. It also compared favorably with other existing MPGF algorithms by finding minimum exceptional elements for the tested problems. Furthermore the new algorithm can solve dynamic and more realistic MPGF problems by considering production volumes or costs. Such diverse machine-part relationship values were not considered in previous MPGF studies, which included only 0,1 incidence values. An example problem is solved where production volumes are the elements of MPGF incidence matrix.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.627-639
• /
• 2010

In this paper, we introduce a new iterative sequence finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a Banach space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse-strongly-monotone mapping, the fixed point problem and the classical variational inequality problem. Our results improve and extend the corresponding results announced by many others.