- P-ISSN1226-0657
- E-ISSN2287-6081
- KCI
ISSN : 1226-0657
Browse Articles
- 2024 (Vol.31)
- 2023 (Vol.30)
- 2022 (Vol.29)
- 2021 (Vol.28)
- 2020 (Vol.27)
- 2019 (Vol.26)
- 2018 (Vol.25)
- 2017 (Vol.24)
- 2016 (Vol.23)
- 2015 (Vol.22)
- 2014 (Vol.21)
- 2013 (Vol.20)
- 2012 (Vol.19)
- 2011 (Vol.18)
- 2010 (Vol.17)
- 2009 (Vol.16)
- 2008 (Vol.15)
- 2007 (Vol.14)
- 2006 (Vol.13)
- 2005 (Vol.12)
- 2004 (Vol.11)
- 2003 (Vol.10)
- 2002 (Vol.9)
- 2001 (Vol.8)
- 2000 (Vol.7)
- 1999 (Vol.6)
- 1998 (Vol.5)
- 1997 (Vol.4)
- 1996 (Vol.3)
- 1995 (Vol.2)
- 1994 (Vol.1)
Vol.12 No.2
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].
Abstract
In this paper convergence of fuzzy filters and graded fuzzy filters have been studied in graded L-fuzzy topological spaces.
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.
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.
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.
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.