• 한국학교수학회논문집
• /
• 제6권2호
• /
• pp.87-99
• /
• 2003

본 논문에서는 제 7차 교과과정에 의하여 새로운 선택과목으로 선정된 이산수학의 효율적인 교수방안을 논의한다. 이를 위하여 이산수학의 가장 핵심적인 내용인 알고리즘의 개발 필요성 및 목적 등을 강조하기 위하여 행렬 곱셈에 관한 전통적인 방법의 문제점을 분석하며 또한 효율적인 행렬 곱셈 알고리즘을 분석한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권1호
• /
• pp.43-56
• /
• 2010

The representative numerical algorithms to solve the time dependent Navier-Stokes equations are projection type methods. Lots of projection schemes have been developed to find more accurate solutions. But most of projection methods [4, 11] suffer from inconsistency and requesting unknown datum. E and Liu in [5] constructed the gauge method which splits the velocity $u=a+{\nabla}{\phi}$ to make consistent and to replace requesting of the unknown values to known datum of non-physical variables a and ${\phi}$. The errors are evaluated in [9]. But gauge method is not still obvious to find out suitable combination of discrete finite element spaces and to compute boundary derivative of the gauge variable ${\phi}$. In this paper, we define 4 gauge algorithms via combining both 2 decomposition operators and 2 boundary conditions. And we derive variational derivative on boundary and analyze numerical results of 4 gauge algorithms in various discrete spaces combinations to search right discrete space relation.

• 대한수학회지
• /
• 제52권4호
• /
• pp.797-819
• /
• 2015

A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제26권4호
• /
• pp.323-332
• /
• 2022

This paper presents a numerical study on multigrid algorithms of V-cycle type for problems posed in the Hilbert space H(curl) in three dimensions. The multigrid methods are designed for discrete problems originated from the discretization using the hexahedral Nédélec edge element of the lowest-order. Our suggested methods are associated with smoothers constructed by substructuring based on domain decomposition methods of nonoverlapping type. Numerical experiments to demonstrate the robustness and the effectiveness of the suggested algorithms are also provided.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제11권2호
• /
• pp.143-151
• /
• 2007

Nowadays there are practically no mathematical courses in which Computer Algebra Systems (CAS) programs, such as MATHEMATlCA, Maple, and TI-89/92, are not used to some extent. However, generally the usage of these programs is reduced to illustration of computing processes: calculation of integrals, differentiation, solution of various equations, etc. This is obtained by usage of standard command of type: Solve [...] in MATHEMATICA. At the same time the main difficulties arise at teaching nonconventional mathematical courses such as coding theory, discrete mathematics, cryptography, Scientific computing, which are gaining the increasing popularity now. Now it is impossible to imagine a modern engineer not having basic knowledge in discrete mathematics, Cryptography, coding theory. Digital processing of signals (digital sound, digital TV) has been introduced in our lives.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제33권1호
• /
• pp.1-19
• /
• 2019

본 연구는 학생이 학습과정(learning process)에 능동적으로 참여하여, 능력을 향상하며, 자신감을 갖고 학생성공(student success)이라는 궁극적인 목표에 도달하는 것을 목표로 한 기초수학 특히 이산수학 강좌의 운영사례를 다룬다. 이를 위해 첫째, 본 연구진에 의해 개발/제작된 강의록과 사이버실습실을 미리 제공하였다. 둘째, 이를 바탕으로 학생들이 학습관리 시스템(learning management system)을 통해 예습, 복습, 질문, 답변, 토론을 충분히 할 수 있도록 하였으며, 팀별로 기말 프로젝트에 참여하게 하였다. 셋째, 한 학기 동안의 모든 학습과정을 보고서로 작성하여 제출, 발표하고 이를 바탕으로 한 평가를 하였다. 이러한 강의 모델을 통해 학생들은 자신의 학습과정 및 문제해결과정을 서술하고 발표하면서 비판적인 사고 능력을 자연스럽게 갖추는 과정을 경험하고 공유한다. 본 연구는 기존의 연구와 달리 교수자가 많은 시간을 들이지 않고도, 그리고 여러 지원 또는 우수한 조교가 돕지 않아도 교수 스스로 개인별, 수준별, 맞춤형, 창의적 이산수학 교육이 가능하다는 것을 보여주는 모델을 만든 것으로 이를 공유한다.

• Journal of Information Processing Systems
• /
• 제13권5호
• /
• pp.1331-1344
• /
• 2017

In this paper, data hiding algorithm using Discrete Wavelet Transform (DWT) and Arnold Transform is proposed. The secret data is scrambled using Arnold Transform to make it secure. Wavelet subbands of a cover image are obtained using DWT. The scrambled secret data is embedded into significant wavelet coefficients of subbands of a cover image. The proposed algorithm is robust to a variety of attacks like JPEG and JPEG2000 compression, image cropping and median filtering. Experimental results show that the PSNR of the composite image is 1.05 dB higher than the PSNR of existing algorithms and capacity is 25% higher than the capacity of existing algorithms.

• 대한수학회지
• /
• 제50권5호
• /
• pp.1129-1163
• /
• 2013

Based on finite element discretization, two linearization approaches to the defect-correction method for the steady incompressible Navier-Stokes equations are discussed and investigated. By applying $m$ times of Newton and Picard iterations to solve an artificial viscosity stabilized nonlinear Navier-Stokes problem, respectively, and then correcting the solution by solving a linear problem, two linearized defect-correction algorithms are proposed and analyzed. Error estimates with respect to the mesh size $h$, the kinematic viscosity ${\nu}$, the stability factor ${\alpha}$ and the number of nonlinear iterations $m$ for the discrete solution are derived for the linearized one-step defect-correction algorithms. Efficient stopping criteria for the nonlinear iterations are derived. The influence of the linearizations on the accuracy of the approximate solutions are also investigated. Finally, numerical experiments on a problem with known analytical solution, the lid-driven cavity flow, and the flow over a backward-facing step are performed to verify the theoretical results and demonstrate the effectiveness of the proposed defect-correction algorithms.

• ETRI Journal
• /
• 제27권2호
• /
• pp.195-205
• /
• 2005

In this paper, an error-free Butcher algorithm is introduced to study the singular system of a linear electrical circuit for time invariant and time varying cases. The discrete solutions obtained using Runge-Kutta (RK)-Butcher algorithms are compared with the exact solutions of the electrical circuit problem and are found to be very accurate. Stability regions for the single term Walsh series (STWS) method and the RK-Butcher algorithm are presented. Error graphs for inductor currents and capacitor voltages are presented in a graphical form to show the efficiency of the RK-Butcher algorithm. This RK-Butcher algorithm can be easily implemented in a digital computer for any singular system of electrical circuits.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.1-7
• /
• 2013

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested lattice-based proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure ID-based proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.