• The Mathematical Education
• /
• v.50 no.1
• /
• pp.1-12
• /
• 2011

It is the aim of this paper to study the target problem solving process in reference to the base problem. We observed closely how students solve the target problem in reference to the base problem. The students couldn't solve the target problem, although they succeed to find the base problem. This comes from failing to discover the structural similarity between the target problem and the base problem. Especially it is important to cognize the proper corresponding of primary components between the base problem and target problem. And there is sometimes a part component of the target problem equivalent to the base problem and the target problem can't be solved without the insight into this fact. Consequently, finding the base problem fail to reach solving the target problem without the insight into their structural similarity. We have to make efforts to have an insight into the structural similarity between the target problem and the base problem to solve the target problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1030-1037
• /
• 2008

This paper presents an algorithm for the path-finding problem in unknown environments with cooperative and commutative multi-robots. To verify the algorithm, we investigate the problem of escaping through the exit of a randomly generated maze by muti-robots. For the purpose, we adopt the so called frontier cells and cell utility functions, which were used in the exploration problem for the multi-robots. For the wireless communications among the mobile robots, we modify and utilize the so called the random basket routing, a kind of hop-by-hop opportunistic routing. A mobile robot, once it finds the exit, will choose its next action, either escape immediately or stay-and-relay the exit information for the others, where the robot takes one action based on a given probability. We investigate the optimal probability that minimizes the average escaping time (out of the maze to the exit) of a mobile robot.

• Journal of Gifted/Talented Education
• /
• v.20 no.3
• /
• pp.847-866
• /
• 2010

Enhancing creativity is possible to offer systematic education programs and several conditions as variable thinking, experiment lesson, opened-situation. We developed CNP model as program for enhancing creativity. The CNP model emphasizes that parts of problem finding, embodying and solving ability and includes scientific problem finding tool, Integrated Process Skills and Science Writing Heuristic. The CNP Model is comprised of six step. We developed teachers' guide and student's worksheets for application. Result of applied CNP model to students of scientifically gifted education center in K University, students were able to enhanced originality and fluency and had solved problems by creative way. And creative problem finding, embodying and solving ability were increased. Therefore, the CNP model was effective in enhancing the creativity of scientifically gifted.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.4
• /
• pp.433-442
• /
• 2010

In this paper, self-calibration algorithm based on covariance matrix is proposed for compensating amplitude/phase mismatch in multi-baseline interferometer direction finding system. The proposed method is a solution to nonlinear constrained minimization problem which dramatically calibrate mismatch error using space sector concept with cost function as defined in this paper. This method, however, has a drawback that requires an estimated initial angle to determine the proper space sector. It is well known that this type of drawback is common in nonlinear optimization problem. Superior calibration capabilities achieved with this approach are illustrated by simulation experiments in comparison with interferometer algorithm for a varitiety of amplitude/phase mismatch error. Furthermore, this approach has been found to provide an exceptional calibration capabilities even in case amplitude and phase mismatch are more than 30 dB and over $5^{\circ}$, respectively, with sector spacing of less than $50^{\circ}$.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.623-647
• /
• 2020

The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S. The Frobenius problem, which is also called the coin problem or the money changing problem, is a mathematical problem of finding the Frobenius number. In this paper, we introduce the Frobenius problem for two kinds of numerical semigroups generated by the Thabit numbers of the first kind, and the second kind base b, and by the Cunningham numbers. We provide detailed proofs for the Thabit numbers of the second kind base b and omit the proofs for the Thabit numbers of the first kind base b and Cunningham numbers.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.67-86
• /
• 2002

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.17
• /
• pp.7853-7857
• /
• 2015

Background: Mortality from breast cancer is high in low- and middle-income countries, in part because most patients have advanced stage disease when first diagnosed. Case-finding may be one approach to changing this situation. Materials and Methods: We conducted a pilot study to explore the feasibility of population-based case finding for breast cancer by community health workers (CHWs) using different data collection methods and approaches to management of women found to have breast abnormalities. After training 8 CHWs in breast problem recognition, manual paper data collection and operation of a cell-phone software platform for reporting demographic, history and physical finding information, these CHWs visited 3150 women >age 18 and over they could find-- from 2356 households in 8 villages in rural Bangladesh. By 4 random assignments of villages, data were collected manually (Group 1), or with the cell-phone program alone (Group 2) or with management algorithms (Groups 3 and 4), and women adjudged to have a serious breast problem were shown a motivational video (Group 3), or navigated/accompanied to a breast problem center for evaluation (Group 4). Results: Only three visited women refused evaluation. The manual data acquisition group (1) had missing data in 80% of cases, and took an average of 5 minutes longer to acquire, versus no missing data in the cell phone-reporting groups (2,3 and 4). One woman was identified with stage III breast cancer, and was appropriately treated. Conclusions: Among very poor rural Bangladeshi women, there was very limited reluctance to undergo breast evaluation. The estimated rarity of clinical breast cancer is supported by these population-based findings. The feasibility and efficient use of mobile technology in this setting is supported. Successor studies may most appropriately be trials focusing on improving the suggested benefits of motivation and navigation, on increasing the numbers of cases found, and on stage of disease at diagnosis as the primary endpoint.

• Geophysics and Geophysical Exploration
• /
• v.1 no.3
• /
• pp.176-182
• /
• 1998

The borehole radar reflection survey can image the underground structure with high resolution, however, we cannot get any information on the orientation of the reflectors with dipole antenna alone. The direction-finding antenna system is commonly used to give the solution to the problem. However, the interpretation of the data from direction- finding antenna may be time-consuming, and sometimes have ambiguities in the sense of precise determination of the azimuth. To solve the problem, we developed the automatic azimuth finding scheme of reflectors in borehole radar reflection data using direction-finding antenna. The algorithm is based on finding the azimuthal angle possibly showing the maximum reflection amplitude in the least-squared error sense. The developed algorithm was applied to the field data acquired in quarry mine. It was possible to locate nearly all of the reflectors in three dimensional fashion, which coincide with the known geological structures and man-made discontinuities.

• International journal of advanced smart convergence
• /
• v.2 no.2
• /
• pp.23-26
• /
• 2013

Social networking services that connect a person to other people are attracting people's attention and various types of services are provided on the Internet. Library has been playing a role of social media by providing us with materials such as books and magazines, and with a place for reading, studying, getting lectures, etc. In this paper, we present a method for finding candidates of groups of the library's patrons who share interest areas by utilizing the loan records, which are obtainable in every library. Such a homogeneous group can become a candidate for a study group, a community for exchange ideas, and other activity group. We apply the method to a collection of loan records of a university library, find some problems to be solved, and propose measures for more detailed solutions. Even though the potential group finding problem still remains a lot of issues to be solved, its potential importance is very high and thus to be studies even more for future applications.

• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.72-89
• /
• 1991

In transportation network problems, it is often desirable to select multiple number of the shortect paths. On problems of finding these paths, algorithms have been developed to choose single shortest path, k-shortest paths and k-shortest paths via p-specified nodes in a network. These problems consider the time as the main factor. In wartime, we must consider availability as well as time to determine the shortest transportation path, since we must take into account enemy's threat. Therefore, this paper addresses the problem of finding the shortest transportation path considering both time and availability. To accomplish the objective of this study, values of k-shortest paths are computed using the algorithm for finding the k-shortest paths. Then availabilties of those paths are computed through simulation considering factors such as rates of suffering attack, damage and repair rates of the paths. An optimal path is selected using any one of the four decision rules that combine the value and availability of a path.