• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• Journal of Korean Elementary Science Education
• /
• v.32 no.4
• /
• pp.464-472
• /
• 2013

The purpose of this study was to analyze the science inquiry problem finding ability of gifted elementary students of science and general elementary students. For this purpose, this study analyzed the types of science inquiry problems in an ill-structured problem finding situation. Also, this study has compared science inquiry problem finding abilities of those two groups. From the results of this study, new ways of improving student' science inquiry problem finding ability and selection of gifted students of science were suggested. The results of this study can be summarized as follows. First, most of the inquiry problems generated by the scientifically gifted and the general students in an ill-structured problem situation could be categorized into seven types (measurement, method, cause, possibility, what, comparison, relationship) according to the inquiry objectives, and both group found more problems in scientific context than in everyday context. Regardless of the context of problem, scientifically gifted students found more problems and the type of problems generated by them were more various than those of general students. Second, there were differences in problem finding ability between scientifically gifted and general students. Scientifically gifted students found more problems and the quality of problems were higher than general students.

• Journal of Korean Elementary Science Education
• /
• v.30 no.4
• /
• pp.624-633
• /
• 2011

The purpose of this study was to compare problem finding ability, creative thinking ability, creative tendency, and science process skill between the scientifically gifted students and the general students. For this study, problem finding ability test, integrating creativity test, and science process skill test were conducted to the elementary gifted students (n=95) in science and the general students (n=149) at the same school district. The results of this study were as follows: The mean scores of problem finding, creative thinking, creative tendency, and science process skill of the gifted students were statistically higher than the general students. The problem finding ability had partially weak correlation with sub-domains of the creative thinking ability, creative tendency, and science process skill. Findings suggest that there are needs of further study about factors affecting problem finding and considering the degree of structure of problem situation.

• Communications of Mathematical Education
• /
• v.22 no.3
• /
• pp.289-310
• /
• 2008

The purpose of study is to propose the possibilities of finding trigonometric function values using trigonometric function graphs instead of the unit circle method. And it is to discuss how to enhance relating trigonometric function value finding to graphs construction, and students conceptual understanding of the properties of trigonometric functions. The conclusions of this study are the effectiveness of function value finding using trigonometric function graphs, the use of a precise term of function value finding given general angles, consideration of a link between function value finding and graphs, and the possibility of teaching trigonometric function graphs in advance of function value finding.

• The Korean Journal of Archival Studies
• /
• no.8
• /
• pp.181-211
• /
• 2003

The purpose of this study is to reveal the context within which EAD was developed, to review the elements and the structure of EAD 1.0 version and to introduce EAD as new standard for encoded archival finding aids in Korea. Encoded Archival Description(EAD) has been developed in 1993 in order to facilitate exchange of ISAD(G) descriptive information. EAD is currently administered and maintained jointly by the Society of American Archivists and the United States Library of Congress. While development was initiated in the United Stares, international interest and contribution are increasing. EAD is a encoding standard designed specifically for marking up information contained in archival finding aids. From its inception, EAD was based on SGML, and, with the release of EAD version 1.0 in 1998, it is also compliant with XML in order to facilitate easier internet access to SGML-encoded finding aids. EAD is the first tool to preserve the multilevel and hierarchical description manifest in finding aids by providing structures in which to describe entire record collections and increasingly smaller subcomponents thereof such as series, subseries, folders, and even items. Archival institutions can form a EAD consortium and also create a union database of EAD finding aids for the geographically dispersed collections. The EAD DTD provides a flexible way for archives to convert finding aids that exist in paper form into electronic documents or to create new finding aids in electronic form.

• Architectural research
• /
• v.15 no.4
• /
• pp.207-214
• /
• 2013

A form-finding technique is proposed for three-dimensional spatial structures. Two-step discrete finite element (FE) mesh generator based on computer aided geometric design (CAGD) is introduced and used to control the shape of three-dimensional spatial structures. Mathematical programming technique is adopted to search new forms (or shapes) of spatial structures. For this purpose, the strain energy is introduced as the objective function to be minimized and the initial volume (or the initial weight) is considered as constraint function. Numerical examples are carried out to test the capability of the proposed form-finding techniques and provided as benchmark tests.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.711-714
• /
• 1989

Autonomous mobile robot Yamabico and his newly developed ultrasonic range finding module(URF) are described. Yamabico is a self-contained autonomous robot for in-door environment. It has a modularized architecture, which consists of master module, ultrasonic range finding module, locomotion module, voice synthesizer module and console. Newly developed ultrasonic range finding module has a 68000 processor and Dual-port memory for communication. It controls the ultrasonic transmitters and receivers and calculate the range distances for 12-direction, simultaneously within every 60 milliseconds.

• Architectural research
• /
• v.14 no.4
• /
• pp.143-152
• /
• 2012

A form-finding procedure is presented for planar tensegrity structures. Notably, a simple decision criteria is proposed to select the desirable candidate position vector from the unitary matrix produced by the eigenvalue decomposition of force density matrix. The soundness of the candidate position vector guarantees faster convergence and produces a desirable form of tensegrity without any member having zero-length. Several numerical examples are provided to demonstrate the capability of the proposed form-finding process.

• Journal of Gifted/Talented Education
• /
• v.18 no.1
• /
• pp.23-52
• /
• 2008

The purpose of this study was to examine the Structural Equation Model (SEM) of scientific problem finding ability based on science related attitude, motivation and self-regulation learning strategy of the gifted in science. A total of 153 scientifically gifted students were selected from a university-based Sifted education center The instruments used for the study were Test of Science-Related Attitudes, Motivated Strategies for Learning Questionnaire (MSLQ), and Science Problem Finding Test. In order to examine Structural Equation Model (SEM) of scientific problem finding ability, we assumed scientific problem finding model related to science inquiry, model I (domain specific), and scientific problem finding model related to creativity, model II (domain general) The results of this research are as follows. First, the correlations between science related attitudes and MSLQ were significant; motivation and self-regulated learning strategy as sub factors were positively correlated to science related attitudes. Only scientific attitude as a sub factor of science related attitudes was significantly correlated to elaboration of creativity category in scientific problem finding ability. In other hand, self-regulated learning strategy was significantly correlated to elaboration, inquiry motivation and inquiry level in scientific problem finding ability. Second, as the results of SEM analysis, we confirmed model I and model II were the best adequate through the indices of best fit (TLI, CFI>.90, RMSEA<.08); scientific problem finding ability was directly influenced motivation and self-regulated learning strategy but science related attitudes indirectly influenced scientific problem finding ability through motivation and self-regulated learning strategy. Based on the results, the implications for science gifted education were discussed.

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.183-194
• /
• 2001

The centralized traffic information system is to gather and analyze real-time traffic information, to receive traffic information request from user, and to send user processed traffic information such as a path finding. Position information, result of destination search, and other information. In the centralized traffic information system, a server received path-finding requests from many clients and must process clients requests in time. The algorithm of multiple path-finding is needed for a server to process clients request, effectively in time. For this reason, this paper presents a heuristic algorithm that decreases time to compute path-finding requests. This heuristic algorithm uses results of the neighbor nodes shortest path-finding that are computed periodically. Path-finding results of this multiple path finding algorithm to use results of neighbor nodes shortest path-finding are the same as a real optimal path in many cases, and are a little different from results of a real optimal path in non-optimal path. This algorithm is efficiently applied to the general topology and the hierarchical topology such as traffic network. The computation time of a path-finding request that uses results of a neighbor nodes shortest path-finding is 50 times faster than other algorithms such as one-to-one label-setting and label-correcting algorithms. Especially in non-optimal path, the average error rate is under 0.1 percent.