• Korean Journal of Child Studies
• /
• v.28 no.1
• /
• pp.171-187
• /
• 2007

The 166 elementary school students of this study were divided into four groups by gender and degree of structure in problem situations. Written instruments ascertained intelligence, conceptual knowledge, science process skills, divergent thinking, intrinsic/extrinsic motivation, personality traits, and home environment. Results were that male students scored higher on problem finding in the ill-structured than in the moderately structured problem situation. In the ill-structured problem situation, personality traits, conceptual knowledge, and intrinsic motivation contributed to the scores of male students and home environment and conceptual knowledge contributed to the scores of female students. In the moderately structured problem situation, personality traits and intrinsic motivation contributed to the scores of all students, but science process skills contributed to the scores of female students only.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.1
• /
• pp.19-26
• /
• 2015

Recently, a lot of users are using social network services as the spread of SNS and generalization of smart-phone. In this study, we apply clustering and ranking method for finding twitter influential users. First, we propose five ranking elements. The five elements include the number of follow, the number of retweet, IRP, IFP and influ-score. These elements are used by centroid point of clustering methods. This study can help to find novel approaches for finding twitter influential users.

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

• Journal of Korean Society of Rural Planning
• /
• v.13 no.2
• /
• pp.75-84
• /
• 2007

Rural amenity resources show a particular rural community's identity. They also provide recreational, aesthetic and economic value. This research aimed at systematizing finding surveying techniques of rural amenity resources for planning rural community. For conducting the study, existing finding and surveying techniques of rural amenity resources in the case of comprehensive Amenity Planning of Seochen County in Choongcheongnam Province. The research findings are as followings; (1) 190 amenity resources were found in Seochen County, (2) archival research and interview methods were used for finding resources, (3) the present status and maintenance conditions were examined through on-the-spot survey, (4) resources were photographed and recorded by making descriptive notes verbally and diagrammatically.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.277-284
• /
• 2018

In this paper, a new numerical method of finding the roots of a nonlinear system is proposed, which extends the conventional fixed point iterative method by relaxing the constraints on it. The proposed method determines the real valued roots and expands the convergence region by relaxing the constraints on the conventional fixed point iterative method, which transforms the diverging root searching iterations into the converging iterations by employing the metric induced by the geometrical characteristics of a polynomial. A metric is set to measure the distance between a point of a real-valued function and its corresponding image point of its inverse function. The proposed scheme provides the convenience in finding not only the real roots of polynomials but also the roots of the nonlinear systems in the various application areas of science and engineering.

• Korean Journal of Mathematics
• /
• v.20 no.2
• /
• pp.247-254
• /
• 2012

The Klee-Quaife problem is finding the minimum order ${\mu}(d,c,v)$ of the $(d,c,v)$ graph, which is a $c$-vertex connected $v$-regular graph with diameter $d$. Many authors contributed finding ${\mu}(d,c,v)$ and they also enumerated and classied the graphs in several cases. This problem is naturally extended to the case of digraphs. So we are interested in the extended Klee-Quaife problem. In this paper, we deal with an equivalent problem, finding the maximum diameter of digraphs with given order, focused on 2-regular case. We show that the maximum diameter of strongly connected 2-regular digraphs with order $n$ is $n-3$, and classify the digraphs which have diameter $n-3$. All 15 nonisomorphic extremal digraphs are listed.

• Management Science and Financial Engineering
• /
• v.10 no.1
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

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

• Advances in Energy Research
• /
• v.4 no.2
• /
• pp.163-176
• /
• 2016

Rapid depletion of fossil based oil, coal and gas reserves and its greater demand day by day necessitates the search for other alternatives. Severe environmental impacts caused by the fossil fire based power plants and the escalating fuel costs are the major challenges faced by the electricity supply industry. Integration of Distributed Generators (DG) especially, wind and solar systems to the grid has been steadily increasing due to the concern of clean environment. This paper focuses on a new simple and fast load flow algorithm named Backward Forward Sweep Algorithm (BFSA) for finding the voltage profile and power losses with the integration of various sizes of DG at different locations. Genetic Algorithm (GA) based BFSA is adopted in finding the optimal location and sizing of DG to attain an improved voltage profile and considerable reduced power loss. Simulation results show that the proposed algorithm is more efficient in finding the optimal location and sizing of DG in 15-bus radial distribution system (RDS).The authenticity of the placement of optimized DG is assured with other DG placement techniques.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.427-430
• /
• 2006

Clustering for gene expression data without filtering out noise genes may be distorted or derived inappropriate inference. Identifying significant genes and deleting noise before major analysis is necessary fur meaningful discovery from genes expression pattern. We proposed a new method of finding significant genes using factor analysis which is done on transposed data matrix. We construct significance score that is sum of factor loadings for declared significant number of factor, and set threshold through replication. Our proposed method works well for simulated time-course data for finding significant genes even though variance level gets larger.