바로가기메뉴

본문 바로가기 주메뉴 바로가기

logo

Vol.12 No.2

IM DONG MAN ; GOO YOON HOE pp.93-103
초록보기
Abstract

We study some stability properties and asymptotic behavior for linear difference systems by using the results in [W. F. Trench: Linear asymptotic equilibrium and uniform, exponential, and strict stability of linear difference systems. Comput. Math. Appl. 36 (1998), no. 10-12, pp. 261-267].

MONDAL K. K. ; SAMANTA S. K. pp.105-124
초록보기
Abstract

In this paper convergence of fuzzy filters and graded fuzzy filters have been studied in graded L-fuzzy topological spaces.

CUI MINGGEN ; LIU HUANPING ; CHUNG PHIL UNG pp.125-131
초록보기
Abstract

In this paper, we introduce the concept of derivative of the function f : <TEX>$\mathbb{Q}p{\to} R$</TEX> where <TEX>$\mathbb{Q}p$</TEX> is the field of the p-adic numbers and R is the set of real numbers. And some basic theorems on derivatives are given.

CHUNG JAEYOUNG pp.133-142
초록보기
Abstract

Generalizing the Cauchy-Rassias inequality in [Th. M. Rassias: On the stability of the linear mapping in Banach spaces. Proc. Amer. Math. Soc. 72 (1978), no. 2, 297-300.] we consider a stability problem of quadratic functional equation in the spaces of generalized functions such as the Schwartz tempered distributions and Sato hyperfunctions.

JUNG YOON-TAE ; CHOI EUN-HEE ; RIM KWANG-CHEOL pp.143-152
초록보기
Abstract

We present a new block cipher called DyC. It consists of four sets (procedures) having the different <TEX>$2^2,\;2^2,\;2^4$</TEX>, and <TEX>$2^8$</TEX> one-to-one correspondence functions as the elements. The round key is used to determine exactly one composite function from the possible <TEX>$2^{16}$</TEX> composite functions. DyC supports 8 <TEX>$\times$</TEX> n bit key size, 16 <TEX>$\times$</TEX> m bit block length, and n rounds. We have confirmed that DyC offers security against other well-known advanced cryptanalytic attacks including the slide attacks and interpolation attacks. In this paper, we show several properties of the key schedule of DyC by mathematical analysis.

KIM CHANG-GEUN pp.153-159
초록보기
Abstract

We investigate the error estimates of the h and p versions of the finite element method for an elliptic problems. We present theoretical results showing the p version gives results which are not worse than those obtained by the h version in the finite element method.

Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics