• 대한수학회지
• /
• 제50권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
• /
• 제28권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.

• 대한수학회보
• /
• 제59권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
• /
• 제39권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.

• 대한수학교육학회지:학교수학
• /
• 제19권3호
• /
• pp.553-570
• /
• 2017

본 연구는 21세기 필수 능력으로 거론되는 계산적 사고의 의미를 살펴보고, 수학교과에서 CT 교육의 가능성 여부와 그 선행 조건을 탐색할 목적으로 수행되었다. 선행연구를 통해 컴퓨터, 학교교육, 수학교육에서의 CT의 정의와 구성 요소를 조사하였으며 본 연구에서는 수학교과에서 CT를 수학적 문제해결 관련 사고로 보았다. CT-컴퓨팅(컴퓨터 활용)-수학교육 세 영역 사이의 관계 고찰에서 컴퓨팅환경에서 유용한 CT이나 수학교육에는 포함되지 않는 영역에 주목하였다. CT와 수학교육의 통합논의에서는 컴퓨터가 전통적 수학교육의 보조 수단으로 허용되는 우리나라 수학교육 현황을 고려할 때, '컴퓨팅 환경에서의 수학적 문제해결'에 주목할 필요가 있다고 보았다. 수학교육에서 CT 교육은 컴퓨팅 환경 조성을 전제로 수학교과에서 수학 관련 과제에 해결을 위한 코딩, 문제해결, STEAM 교육 맥락에서 수학과 CT의 통합을 제시하였으며 이를 위하여 CT 통합을 지원하는 수학교육과정 마련 등 제반 조건을 논의하였다.

• 전기전자학회논문지
• /
• 제13권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.

• 대한수학회지
• /
• 제38권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.

• 대한수학회지
• /
• 제45권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.

• 대한수학회지
• /
• 제52권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.

• 대한수학회논문집
• /
• 제26권2호
• /
• pp.321-338
• /
• 2011

In this paper, a class of delayed epidemic model with diffusion is investigated. By analyzing the associated characteristic transcendental equation, its linear stability is investigated and Hopf bifurcation is demonstrated. Some explicit formulae determining the stability and the direction of the Hopf bifurcation periodic solutions bifurcating from Hopf bifurcations are obtained by using the normal form theory and center manifold theory. Some numerical simulation are also carried out to support our analytical findings. Finally, biological explanations and main conclusions are given.