• Journal of The Korean Association of Information Education
• /
• v.23 no.6
• /
• pp.639-653
• /
• 2019

The purpose of this study is to design an instructional framework and cognitive learning environment for AI education based on computational thinking in order to ground the theoretical rationale for AI education. Based on the literature review, the learning model is proposed to select the algorithms and problem-solving models through the abstraction process at the stage of data collection and discovery. Meanwhile, the instructional model of AI education through computational thinking is suggested to enhance the problem-solving ability using the AI by performing the processes of problem-solving and prediction based on the stages of automating and evaluating the selected algorithms. By analyzing the research related to the cognitive learning environment for AI education, the instructional framework was composed mainly of abstraction which is the core thinking process of computational thinking through the transition from the stage of the agency to modeling. The instructional framework of AI education and the process of constructing the cognitive learning environment presented in this study are characterized in that they are based on computational thinking, and those are expected to be the basis of further research for the instructional design of AI education.

• Journal of The Korean Association of Information Education
• /
• v.23 no.6
• /
• pp.561-571
• /
• 2019

Programming education generally includes problem analysis process, automation through algorithms and programming, and generalization process. It is a good software education method for students in improving computing thinking. However, it was found that beginners had difficulties in understanding instruction usage, writing algorithms, and implementing programming. In this study, we developed a game programming education model and curriculum for programming education of pre-service teachers. The 4E model consisted of empathy, exploration, engagement and evaluation. In addition, it is configured to learn game core elements and core command blocks by each stage. To help the pre-service teachers understand the use of various programming blocks, a three-step teaching and learning method was presented, consisting of example learning, self-game creation, and team-based projects. As a result of applying and verifying the curriculum for 15 weeks, it showed significant results in the 4E model and pre-service teachers' perception of block programming competence and the level of computational thinking on the submitted game project results was also high.

• Honam Mathematical Journal
• /
• v.14 no.1
• /
• pp.107-121
• /
• 1992

In this paper, we consider an iterative algorithm for solving a new class of quasi complementarity problems of finding $u{\epsilon}R^{n}$ such that $g(u){\in}K(u)$, $Tu+A(u){\in}K^{*}(u)$, and < g(u), Tu + A(u) >=0, where T, A and g are continuous mappings from $R^{n}$ into itself and $K^{*}(u)$ is the polar cone of the convex cone K(u) in $R^{n}$. The algorithms considered in this paper are general and unifying ones, which include many existing algorithms as special cases for solving the complementarity problems. We also study the convergence criteria of the general algorithms.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.203-221
• /
• 2022

In this paper, we introduce new hybrid inertial contraction projection algorithms for solving variational inequality problems over the intersection of the fixed point sets of demicontractive mappings in a real Hilbert space. The proposed algorithms are based on the hybrid steepest-descent method for variational inequality problems and the inertial techniques for finding fixed points of nonexpansive mappings. Strong convergence of the iterative algorithms is proved. Several fundamental experiments are provided to illustrate computational efficiency of the given algorithm and comparison with other known algorithms

• Genomics & Informatics
• /
• v.21 no.1
• /
• pp.15.1-15.4
• /
• 2023

Bioinformatics education can be defined as the teaching and learning of how to use software tools, along with mathematical and statistical analysis, to solve biological problems. Although many resources are available, most students still struggle to understand even the simplest sequence alignment algorithms. Applying visualizations to these topics benefits both lecturers and students. Unfortunately, educational software for visualizing step-by-step processes in the user experience of sequence alignment algorithms is rare. In this article, an educational visualization tool for biological sequence alignment is presented, and the source code is released in order to encourage the collaborative power of open-source software, with the expectation of further contributions from the community in the future. Two different modules are integrated to enable a student to investigate the characteristics of alignment algorithms.

• Journal of Elementary Mathematics Education in Korea
• /
• v.18 no.1
• /
• pp.105-122
• /
• 2014

In this paper, fraction division algorithms in Korean elementary mathematics textbooks are analyzed as a part of the groundwork to improve teaching methods for fraction division algorithms. There are seemingly six fraction division algorithms in ${\ll}Math\;5-2{\gg}$, ${\ll}Math\;6-1{\gg}$ textbooks according to the 2006 curriculum. Four of them are standard algorithms which show the multiplication by the reciprocal of the divisors modally. Two non-standard algorithms are independent algorithms, and they have weakness in that the integration to the algorithms 8 is not easy. There is a need to reconsider the introduction of the algorithm 4 in that it is difficult to think algorithm 4 is more efficient than algorithm 3. Because (natural number)${\div}$(natural number)=(natural number)${\times}$(the reciprocal of a natural number) is dealt with in algorithm 2, it can be considered to change algorithm 7 to algorithm 2 alike. In textbooks, by converting fraction division expressions into fraction multiplication expressions through indirect methods, the principles of calculation which guarantee the algorithms are explained. Method of using the transitivity, method of using the models such as number bars or rectangles, method of using the equivalence are those. Direct conversion from fraction division expression to fraction multiplication expression by handling the expression is possible, too, but this is beyond the scope of the curriculum. In textbook, when dealing with (natural number)${\div}$(proper fraction) and converting natural numbers to improper fractions, converting natural numbers to proper fractions is used, but it has been never treated officially.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• Journal of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.489-499
• /
• 2004

In this paper, we introduce and study a new system of nonlinear variational inequalities. The existence and uniqueness of solution for this problem are proved and an iterative algorithm for approximating the solution of system of nonlinear variational inequalities is constructed.

• Research in Mathematical Education
• /
• v.2 no.1
• /
• pp.13-19
• /
• 1998

The What-If-Not strategy as proposed by Brown & Walter (1969) is one of the most effective strategies for problem posing. However, it has focused only on the aspect of algorithms for generating problems. The aim of this strategy and how it is used to accomplish the aim of the challenging phase are not clear. We need to clarify the aim of the What-If-Not strategy and to establish the process of the strategy for accomplishing the aim. The purpose of this article is to offer a new What-If-Not strategy by clarifying the aim of the challenging phase.

• Journal of The Korean Association of Information Education
• /
• v.11 no.1
• /
• pp.29-38
• /
• 2007

Computer programming in computer education draws much attention recently. Encouraged by the increased tendency of acquiring logical ability and creativity through learning, various attempts have been made to develop them through learning computer programming in the area of computer education as well. The fact that a computer program is the representation of a computer algorithm expressed in a computer language makes us realize that the devise of a logical method for a solution - i.e., the design of an algorithm - is the key to the solution of a problem. Recognizing the importance of computer algorithm would lead us to such a point that systematic investigations for directional establishment for algorithm education are necessary. We observe that researches on teaching computer algorithm have concentrated mostly on specific problems such as sorting and searching, which can be characterized as problem-dependent and individual. In this paper, the idea of conceptual algorithm is stated from the standpoint of conceptual types of problem-solving methods which are considered as problem-independent and collective. A novice approach to algorithm education based on the characteristics of types of conceptual algorithms is proposed for the purpose of developing systematic, problem-independent, algorithmic problem-solving capabilities of learners, which is widely different from the current methods of individual and problem-dependent algorithm education.