• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.27-36
• /
• 2014

In this paper, we introduce the notion of f-derivations from a semilattice S to a lattice L, as a generalization of derivation and f-derivation of lattices. Also, we define the simple f-derivation from S to L, and research the properties of them and the conditions for a lattice L to be distributive. Finally, we prove that a distributive lattice L is isomorphic to the class $SD_f(S,L)$ of all simple f-derivations on S to L for every ${\wedge}$-homomorphism $f:S{\rightarrow}L$ such that $f(x_0){\vee}f(y_0)=1$ for some $x_0,y_0{\in}S$, in particular, $$L{\simeq_-}=SD_f(S,L)$$ for every ${\wedge}$-homomorphism $f:S{\rightarrow}L$ such that $f(x_0)=1$ for some $x_0{\in}S$.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.95-102
• /
• 2007

We define the non-associative algebra $\bar{W(n,m,m+s)}$) and we show that it is simple. We find the non-associative algebra automorphism group $Aut_{non}\bar{(W(1,0,0))}\;of\;\bar{W(1,0,0)}$. Also we find that any derivation of $\bar{W(1,0,0)}$ is a scalar derivation in this paper.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.813-823
• /
• 2024

In this paper, we prove that every 2-local derivation on several classes of C^*-algebras, such as unital properly infinite, type I or residually finite-dimensional C^*-algebras, is a derivation. We show that the following statements are equivalent: (1) every 2-local derivation on a C^*-algebra is a derivation, (2) every 2-local derivation on a unital primitive antiliminal and no properly infinite C^*-algebra is a derivation. We also show that every 2-local derivation on a group C^*-algebra C^*(𝔽) or a unital simple infinite-dimensional quasidiagonal C^*-algebra, which is stable finite antiliminal C^*-algebra, is a derivation.

• Honam Mathematical Journal
• /
• v.27 no.4
• /
• pp.583-593
• /
• 2005

The Weyl-type non-associative algebra ${\overline{WN_{g_n,m,s_r}}$ and its subalgebra ${\overline{WN_{n,m,s_r}}$ are defined and studied in the papers [2], [3], [9], [11], [12]. We find the derivation group $Der_{non}({\overline{WN_{1,0,0_{[2]}}})$ the non-associative simple algebra ${\overline{WN_{1,0,0_{[2]}}}$.

• Journal of the Optical Society of Korea
• /
• v.16 no.3
• /
• pp.215-220
• /
• 2012

In an earlier work, we proposed the chromatic dispersion monitoring technique of non-return to zero (NRZ) signal based on clock-frequency component (CFC) through numerical simulations. However, we have not yet shown any experimental demonstration or analytic derivation of it. In this paper, we show an experimental demonstration and analytic derivation of the proposed chromatic dispersion monitoring technique. We confirm that the experimental results and the analytic results correspond with the simulation results. We also demonstrate that monitoring range and accuracy can be improved by using a simple clock-extraction method.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.407-419
• /
• 2009

The simple non-associative algebra $N(e^{A_S},q,n,t)_k$ and its simple sub-algebras are defined in the papers [1], [3], [4], [5], [6], [12]. We define the non-associative algebra $\overline{WN_{(g_n,\mathfrak{U}),m,s_B}}$ and its antisymmetrized algebra $\overline{WN_{(g_n,\mathfrak{U}),m,s_B}}$. We also prove that the algebras are simple in this work. There are various papers on finding all the derivations of an associative algebra, a Lie algebra, and a non-associative algebra (see [3], [5], [6], [9], [12], [14], [15]). We also find all the derivations $Der_{anti}(WN(e^{{\pm}x^r},0,2)_B^-)$ of te antisymmetrized algebra $WN(e^{{\pm}x^r}0,2)_B^-$ and every derivation of the algebra is outer in this paper.

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.493-503
• /
• 2014

We consider the simple antisymmetrized algebra $N(e^{A_P},n,t)_1^-$. The simple non-associative algebra and its simple subalgebras are defined in the papers [1], [3], [4], [5], [6], [8], [13]. Some authors found all the derivations of an associative algebra, a Lie algebra, and a non-associative algebra in their papers [2], [3], [5], [7], [9], [10], [13], [15], [16]. We find all the derivations of the Lie subalgebra $N(e^{{\pm}x_1x_2x_3},0,3)_{[1]}{^-}$ of $N(e^{A_p},n,t)_k{^-}$ in this paper.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.241-246
• /
• 2007

For the evaluation algebra $F[e^{{\pm}x}]_M\;if\;M=\{{\partial}\}$, then $$Der_{non}(F[e^{{\pm}x}]_M)$$ of the evaluation algebra $(F[e^{{\pm}x}]_M)$ is found in the paper [15]. For $M=\{{\partial},\;{\partial}^2\}$, we find $Der_{non}(F[e^{{\pm}x}]_M))$ of the evaluation algebra $F[e^{{\pm}x}]_M$ in this paper. We show that there is a non-associative algebra which is the direct sum of derivation invariant subspaces.

• Journal of information and communication convergence engineering
• /
• v.22 no.2
• /
• pp.98-108
• /
• 2024

Scrypt is a password-based key derivation function proposed by Colin Percival in 2009 that has a memory-hard structure. Scrypt has been intentionally designed with a memory-intensive structure to make password cracking using ASICs, GPUs, and similar hardware more difficult. However, in this study, we thoroughly analyzed the operation of Scrypt and proposed strategies to maximize computational parallelism in GPU environments. Through these optimizations, we achieved an outstanding performance improvement of 8284.4% compared with traditional CPU-based Scrypt computations. Moreover, the GPU-optimized implementation presented in this paper outperforms the simple GPU-based Scrypt processing by a significant margin, providing a performance improvement of 204.84% in the RTX3090. These results demonstrate the effectiveness of our proposed approach in harnessing the computational power of GPUs and achieving remarkable performance gains in Scrypt calculations. Our proposed implementation is the first GPU implementation of Scrypt, demonstrating the ability to efficiently crack Scrypt.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.638-643
• /
• 2002

MODIS (MODerate-resolution Imaging Spectroradiometer) onboard the first Earth Observing System (EOS) satellite, Terra, was launched successfully at the end of 1999. The direct broadcast MODIS data has been received and utilized in Korea Meteorological Administration (KMA) since february 2001. This study introduces utilizations of this data, especially for the derivation of sea surface temperature (SST). To produce the MODIS SST operationally, we used a simple cloud mask algorithm and MCSST algorithm. By using a simple cloud mask algorithm and by assumption of NOAA daily SST as a true SST, a new set of MCSST coefficients was derived. And we tried to analyze the current NASA's PFSST and new MCSST algorithms by using the collocated buoy observation data. Although the number of collocated data was limited, both algorithms are highly correlated with the buoy SST, but somewhat bigger bias and RMS difference than we expected. And PFSST uniformly underestimated the SST. Through more analyzing the archived and future-received data, we plan to derive better MCSST coefficients and apply to MODIS data of Aqua that is the second EOS satellite. To use the MODIS standard cloud mask algorithm to get better SST coefficients is going to be prepared.