• Research in Mathematical Education
• /
• v.9 no.4 s.24
• /
• pp.341-350
• /
• 2005

In this increasingly technological world, the creativity development has been highlighted much in many countries. In this paper, two mathematical activities with Chinese characteristics are presented to illustrate how to integrate algorithmic teaching into mathematical activities to develop students' creativity. Case studies show that the learning of algorithm can be transferred into creative learning when students construct their own algorithms in Logo environment rather than being indoctrinated the existing algorithms. Creativity development in different stages of mathematical activities and creativity development in programming are also discussed.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.238-240
• /
• 2003

As remote sensing is weighty in GIS updating, it is indispensable to get spatial information quickly and exactly. In this study, we have designed and implemented the program by two algorithms of GDPA (Gradient Direction Profile Analysis) and Hough transformation to extract linear features automatically from high-resolution imagery. We applied the software to embody both algorithms to KOMPSAT-EOC, IKONOS, and Landsat-ETM and made a comparative study of results.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.269-278
• /
• 2000

A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC(strictly avalanche criterion), PC(propagation criterion) and so on. In this paper, we present the algorithms for generating random nonlinear combining functions satisfying given correlation immune order and nonlinearity. These constructions can be applied for designing the key stream generators. We use Microsoft Visual C++6.0 for our program.

• Education of Primary School Mathematics
• /
• v.16 no.2
• /
• pp.93-106
• /
• 2013

A large part of students' difficulties with fractional division algorithms in the current algorithm textbooks, seem to be due to self-induction methods. Through concrete analysis of surveys and interviews, we confirmed the educational value of fractional algorithms used to elicit alternative ways of context of determination of a unit rate. In addition, we suggested alternative methods based on the results of the teaching methods and curriculum configuration.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.145-152
• /
• 2011

The study analyzed effects of the problem-based learning utilizing cognitive algorithms in elementary mathematics education in terms of academic achievement and math attitude changes. In order to solve the research questions, a cognitive algorithm-based PBL model was derived based on N. Landa's algorithm-based instructional design theory. And the model was applied to a part of second semester math curriculum for 4th grade of an elementary school located in Seoul. The results showed that the PBL utilizing algorithms can be said to have effects on academic achievement. The PBL model is also considered to have positive effects in enhancing mathematical attitudes of the learners.

• Journal of information and communication convergence engineering
• /
• v.11 no.4
• /
• pp.274-281
• /
• 2013

In this study, we consider the challenges in motion planning for automated driving systems. Most of the existing online motion-planning algorithms, which take dynamics into account, find it difficult to operate in an environment with narrow passages. Some of the existing algorithms overcome this by offline preprocessing if environment is known. In this work an online algorithm for motion planning with dynamics in an unknown cluttered environment with narrow passages is presented. It utilizes an idea of hybrid planning with sampling- and discretization-based motion planners, which run simultaneously in a full configuration space and a derived reduced space. The proposed algorithm has been implemented and tested with a real autonomous vehicle. It provides significant improvements in computational time performance over basic planning algorithms and allows the generation of smoother paths than those generated by the recently developed hybrid motion planners.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.166-174
• /
• 2009

In this paper, a distributed power and end-to-end rate control algorithm is proposed in the presence of licensed users. By Lagrangian duality theory, the optimal power and rate control solution is given for the unlicensed users while satisfying the interference temperature limits to licensed users. It is obtained that transmitting with either 0 or the maximum node power is the optimal scheme. The synchronous and asynchronous distributed algorithms are proposed to be implemented at the nodes and links. The convergence of the proposed algorithms are proved. Finally, further discussion on the utility-based fairness is provided for the proposed algorithms. Numerical results show that the proposed algorithm can limit the interference to licensed user under a predefined threshold.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.252-259
• /
• 1998

Vehicle navigation systems employ a certain route planning algorithm that provides the shortest path between the starting point and the destination point. The performance of a given route planning algorithm is measured through the degree of optimal route selection and the time cost to complete searching an optimal path. In this paper, various route planning algorithms are evaluated through computer simulation based on a real digital map database. Among those algorithms evaluated in this paper, the Modified Bi-directional A${\ast}$ algorithm is found to be the best algorithm for use in vehicle navigation systems.

• Journal of The Korean Association of Information Education
• /
• v.14 no.2
• /
• pp.189-197
• /
• 2010

This paper proposes elementary robot programming problems using the algorithmic thinking-based problem model with material factors in the elementary robot programming. And this paper proves the validity of developed robot programming problems in defining them as algorithmic thinking-based problems through experiments. The experimental results are analyzed in views of variety and effectiveness evaluation of answer algorithms and suitability of allocating degrees of difficulties to the developed robot programming problems. As a result of the experiment, we find that the developed problems has various answer algorithms and suitable degrees of difficulties for elementary school students.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1024-1037
• /
• 2021

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+algorithms.