• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.647-654
• /
• 2017

Duality methods based on modified Lagrangian functional for solving a model crack problem is considered. Without additional assumptions of regularity of the solution of an initial problem duality ratio is established for initial and dual problem.

• Journal of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.445-464
• /
• 2013

We describe the one-dimensional and zero-dimensional cusps of the Satake compactification for the paramodular groups in degree two for arbitrary levels. We determine the crossings of the one-dimensional cusps. Applications to computing the dimensions of Siegel modular forms are given.

• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.973-984
• /
• 2020

This paper is devoted to study the reproducing property on 2-inner product Hilbert spaces. We focus on a new structure to produce reproducing kernel Hilbert and Banach spaces. According to multi variable computing, this structures play the key role in probability, mathematical finance and machine learning.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.265-276
• /
• 2022

In this paper, we introduce duadic codes over finite local rings and concentrate on quadratic residue codes. We study their properties and give the comprehensive method for the computing the unique idempotent generator of quadratic residue codes.

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.529-536
• /
• 2023

This paper introduces the Frobenius endomophisms on the binary Hessian curves. It provides an efficient and computable homomorphism for computing point multiplication on binary Hessian curves. As an application, it is possible to construct the GLV method combined with the Frobenius endomorphism to accelerate scalar multiplication over the curve.

• School Mathematics
• /
• v.19 no.3
• /
• pp.553-570
• /
• 2017

The purpose of this study was to gain insights into investigating the feasibility on integrating computational thinking(CT) into school mathematics. Definitions and the components of CT were varied among studies. In this study, CT in mathematics was focused on thinking related with mathematical problem solving under ICT supportive environment where computing tools are available to students to solve problems and verify their answers. The focus is not given on the computing environment itself but on CT in mathematics education. For integrating CT into mathematical problem solving, providing computing environment, understanding of tools and supportive curriculum revisions for integration are essential. Coding with language specially developed for mathematics education such as LOGO, and solving realistic mathematical problems using S/W such as Excel in mathematics classrooms, or integrating CT into math under STEAM contexts are suggested for integration CT into math education. Several conditions for the integration were discussed in this paper.

• Journal of IKEEE
• /
• v.13 no.3
• /
• pp.24-31
• /
• 2009

The computation time of FEA(finite element analysis) for one model may range from a few seconds up to several hours according to the complexity of the simulated model. If these FEA is used to calculate the objective and the constraint functions during the optimal solution search, it causes very excessive execution time. To resolve this problem, the distributed computing technique using internet web service is proposed in this paper. And the dynamic load balancing mechanisms are established to advance the performance of distributed computing. To verify its validity, this method is applied to a traditional mathematical optimization problem. And the proposed FEA-based optimization using internet distributed computing is applied to the optimal design of the permanent magnet dc motor(PMDCM) for automotive application.

• Journal of the Korean Mathematical Society
• /
• v.38 no.6
• /
• pp.1275-1284
• /
• 2001

In this paper, we introduce an iteration generated by countable nonexpansive mappings and prove a weak convergence theorem which is connected with the feasibility problem. This result is used to solve the problem of finding a solution of the countable convex inequality system and the problem of finding a common fixed point for a commuting countable family of nonexpansive mappings.

• Journal of the Korean Mathematical Society
• /
• v.45 no.4
• /
• pp.1135-1202
• /
• 2008

We construct the Fock space representations of classical quantum affine algebras using combinatorics of Young walls. We also show that the crystal graphs of the Fock space representations can be realized as the crystal consisting of proper Young walls. Finally, we give a generalized version of Lascoux-Leclerc-Thibon algorithm for computing the global bases of the basic representations of classical quantum affine algebras.

• Journal of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.209-224
• /
• 2015

Computing square, cube and n-th roots in general, in finite fields, are important computational problems with significant applications to cryptography. One interesting approach to computational problems is by using polynomial representations. Agou, Del$\acute{e}$eglise and Nicolas proved results concerning the lower bounds for the length of polynomials representing square roots modulo a prime p. We generalize the results by considering n-th roots over finite fields for arbitrary n > 2.