• 대한수학회보
• /
• 제39권3호
• /
• pp.479-484
• /
• 2002

Let I be an ideal in a Gorenstein local ring A with the maximal ideal m and d = dim A. Then we say that I is a good ideal in A, if I contains a reduction $Q=(a_1,a_2,...,a_d)$ generated by d elements in A and $G(I)=\bigoplus_{n\geq0}I^n/I^{n+1}$ of I is a Gorenstein ring with a(G(I)) = 1-d, where a(G(I)) denotes the a-invariant of G(I). Let S = A[Q/a$_1$] and P = mS. In this paper, we show that the following conditions are equivalent. (1) $I^2$ = QI and I = Q:I. (2) $I^2S$ = $a_1$IS and IS = $a_1$S：sIS. (3) $I^2$Sp = $a_1$ISp and ISp = $a_1$Sp ：sp ISp. We denote by $X_A(Q)$ the set of good ideals I in $X_A(Q)$ such that I contains Q as a reduction. As a Corollary of this result, we show that $I\inX_A(Q)\Leftrightarrow\IS_P\inX_{SP}(Qp)$.

• 대한수학회보
• /
• 제51권4호
• /
• pp.1145-1153
• /
• 2014

Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and $x,y{\in}X$ ($x{\neq}y$) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ${\Delta}(G)$. The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(${\Delta}(G)$) is abelian if and only if ${\mid}G{\mid}{\leq}2$; ${\mid}Aut({\Delta}(G)){\mid}$ is of prime power if and only if ${\mid}G{\mid}{\leq}2$, and ${\mid}Aut({\Delta}(G)){\mid}$ is square-free if and only if ${\mid}G{\mid}{\leq}3$. Some new graphs that are useful in studying the automorphism group of ${\Delta}(G)$ are presented and their main properties are investigated.

• Kyungpook Mathematical Journal
• /
• 제55권1호
• /
• pp.63-71
• /
• 2015

Let H be a separable infinite dimensional complex Hilbert space, and let $\mathcal{L}(H)$ denote the algebra of all bounded linear operators on H into itself. Let $A,B{\in}\mathcal{L}(H)$ we define the generalized derivation ${\delta}_{A,B}:\mathcal{L}(H){\mapsto}\mathcal{L}(H)$ by ${\delta}_{A,B}(X)=AX-XB$, we note ${\delta}_{A,A}={\delta}_A$. If the inequality ${\parallel}T-(AX-XA){\parallel}{\geq}{\parallel}T{\parallel}$ holds for all $X{\in}\mathcal{L}(H)$ and for all $T{\in}ker{\delta}_A$, then we say that the range of ${\delta}_A$ is orthogonal to the kernel of ${\delta}_A$ in the sense of Birkhoff. The operator $A{\in}\mathcal{L}(H)$ is said to be finite [22] if ${\parallel}I-(AX-XA){\parallel}{\geq}1(*)$ for all $X{\in}\mathcal{L}(H)$, where I is the identity operator. The well-known inequality (*), due to J. P. Williams [22] is the starting point of the topic of commutator approximation (a topic which has its roots in quantum theory [23]). In [16], the author showed that a paranormal operator is finite. In this paper we present some new classes of finite operators containing the class of paranormal operators and we prove that the range of a generalized derivation is orthogonal to its kernel for a large class of operators containing the class of normal operators.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2680-2700
• /
• 2017

Finite field arithmetic over GF($2^m$) is used in a variety of applications such as cryptography, coding theory, computer algebra. It is mainly used in various cryptographic algorithms such as the Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), Twofish etc. The multiplication in a finite field is considered as highly complex and resource consuming operation in such applications. Many algorithms and architectures are proposed in the literature to obtain efficient multiplication operation in both hardware and software. In this paper, a modified serial multiplication algorithm with interleaved modular reduction is proposed, which allows for an efficient realization of a sequential polynomial basis multiplier. The proposed sequential multiplier supports multiplication of any two arbitrary finite field elements over GF($2^m$) for generic irreducible polynomials, therefore made versatile. Estimation of area and time complexities of the proposed sequential multiplier is performed and comparison with existing sequential multipliers is presented. The proposed sequential multiplier achieves 50% reduction in area-delay product over the best of existing sequential multipliers for m = 163, indicating an efficient design in terms of both area and delay. The Application Specific Integrated Circuit (ASIC) and the Field Programmable Gate Array (FPGA) implementation results indicate a significantly less power-delay and area-delay products of the proposed sequential multiplier over existing multipliers.

• Journal of the Optical Society of Korea
• /
• 제20권3호
• /
• pp.341-357
• /
• 2016

A novel asymmetric multiple-image encryption method using an octonion Fresnel transform (OFST) and a two-dimensional Sine Logistic modulation map (2D-SLMM) is presented. First, a new multiple-image information processing tool termed the octonion Fresneltransform is proposed, and then an efficient method to calculate the OFST of an octonion matrix is developed. Subsequently this tool is applied to process multiple plaintext images, which are represented by octonion algebra, holistically in a vector manner. The complex amplitude, formed from the components of the OFST-transformed original images and modulated by a random phase mask (RPM), is used to derive the ciphertext image by employing an amplitude- and phase-truncation approach in the Fresnel domain. To avoid sending whole RPMs to the receiver side for decryption, a random phase mask generation method based on SLMM, in which only the initial parameters of the chaotic function are needed to generate the RPMs, is designed. To enhance security, the ciphertext and two decryption keys produced in the encryption procedure are permuted by the proposed SLMM-based scrambling method. Numerical simulations have been carried out to demonstrate the proposed scheme's validity, high security, and high resistance to various attacks.

• Wind and Structures
• /
• 제21권5호
• /
• pp.461-487
• /
• 2015

In recent years, the Graphics Processing Unit (GPU) has become a competitive computing technology in comparison with the standard Central Processing Unit (CPU) technology due to reduced unit cost, energy and computing time. This paper describes the derivation and implementation of GPU-based algorithms for the analysis of wind loading uncertainty on high-rise systems, in line with the research field of probability-based wind engineering. The study begins by presenting an application of the GPU technology to basic linear algebra problems to demonstrate advantages and limitations. Subsequently, Monte-Carlo integration and synthetic generation of wind turbulence are examined. Finally, the GPU architecture is used for the dynamic analysis of three high-rise structural systems under uncertain wind loads. In the first example the fragility analysis of a single degree-of-freedom structure is illustrated. Since fragility analysis employs sampling-based Monte Carlo simulation, it is feasible to distribute the evaluation of different random parameters among different GPU threads and to compute the results in parallel. In the second case the fragility analysis is carried out on a continuum structure, i.e., a tall building, in which double integration is required to evaluate the generalized turbulent wind load and the dynamic response in the frequency domain. The third example examines the computation of the generalized coupled wind load and response on a tall building in both along-wind and cross-wind directions. It is concluded that the GPU can perform computational tasks on average 10 times faster than the CPU.

• 대한수학회논문집
• /
• 제9권4호
• /
• pp.881-889
• /
• 1994

Let ($X, \Beta, \mu$) be a measure space with the $\sigma$-algebra $\Beta$ and the probability measure $\mu$. Throughouth this article set equalities and inclusions are understood as being so modulo measure zero sets. A transformation T defined on a probability space X is said to be measure preserving if $\mu(T^{-1}E) = \mu(E)$ for $E \in B$. It is said to be ergodic if $\mu(E) = 0$ or i whenever $T^{-1}E = E$ for $E \in B$. Consider the sequence ${x, Tx, T^2x,...}$ for $x \in X$. One may ask the following questions: What is the relative frequency of the points $T^nx$ which visit the set E\ulcorner Birkhoff Ergodic Theorem states that for an ergodic transformation T the time average $lim_{n \to \infty}(1/N)\sum^{N-1}_{n=0}{f(T^nx)}$ equals for almost every x the space average $(1/\mu(X)) \int_X f(x)d\mu(x)$. In the special case when f is the characteristic function $\chi E$ of a set E and T is ergodic we have the following formula for the frequency of visits of T-iterates to E : $$ lim_{N \to \infty} \frac{$\mid${n : T^n x \in E, 0 \leq n $\mid$}{N} = \mu(E) $$ for almost all $x \in X$ where $$\mid$\cdot$\mid$$ denotes cardinality of a set. For the details, see [8], [10].

• 음성과학
• /
• 제10권2호
• /
• pp.85-95
• /
• 2003

In speech signal processing, it is very important to detect the pitch exactly in speech recognition, synthesis and analysis. If we exactly pitch detect in speech signal, in the analysis, we can use the pitch to obtain properly the vocal tract parameter. It can be used to easily change or to maintain the naturalness and intelligibility of quality in speech synthesis and to eliminate the personality for speaker-independence in speech recognition. In this paper, we proposed a new pitch detection algorithm. First, positive center clipping is process by using the incline of speech in order to emphasize pitch period with a glottal component of removed vocal tract characteristic in time domain. And rough formant envelope is computed through peak-fitting spectrum of original speech signal infrequence domain. Using the roughed formant envelope, obtain the smoothed formant envelope through calculate the linear interpolation. As well get the flattened harmonics waveform with the algebra difference between spectrum of original speech signal and smoothed formant envelope. Inverse fast fourier transform (IFFT) compute this flattened harmonics. After all, we obtain Residual signal which is removed vocal tract element. The performance was compared with LPC and Cepstrum, ACF. Owing to this algorithm, we have obtained the pitch information improved the accuracy of pitch detection and gross error rate is reduced in voice speech region and in transition region of changing the phoneme.

• Journal of the Optical Society of Korea
• /
• 제20권1호
• /
• pp.42-54
• /
• 2016

A hybrid color and grayscale images encryption scheme based on the quaternion Hartley transform (QHT), the two-dimensional (2D) logistic map, the double random phase encoding (DRPE) in gyrator transform (GT) domain and the three-step phase-shifting interferometry (PSI) is presented. First, we propose a new color image processing tool termed as the quaternion Hartley transform, and we develop an efficient method to calculate the QHT of a quaternion matrix. In the presented encryption scheme, the original color and grayscale images are represented by quaternion algebra and processed holistically in a vector manner using QHT. To enhance the security level, a 2D logistic map-based scrambling technique is designed to permute the complex amplitude, which is formed by the components of the QHT-transformed original images. Subsequently, the scrambled data is encoded by the GT-based DRPE system. For the convenience of storage and transmission, the resulting encrypted signal is recorded as the real-valued interferograms using three-step PSI. The parameters of the scrambling method, the GT orders and the two random phase masks form the keys for decryption of the secret images. Simulation results demonstrate that the proposed scheme has high security level and certain robustness against data loss, noise disturbance and some attacks such as chosen plaintext attack.

• 융합신호처리학회논문지
• /
• 제14권1호
• /
• pp.57-61
• /
• 2013

본 논문에서는 하이브리드 유전 알고리즘을 이용한 morphological 뉴럴 네트워크 (MNN)의 최적화 방법을 제안하였다. MNN은 max-plus 연산을 기반으로 하고 있으므로 경사 학습법에 의한 파라미터 학습이 매우 어렵다. 이러한 문제를 해결하기 위해 하이브리드 유전 알고리즘을 이용하여 MNN의 파라미터들을 학습하였다. 제안된 방법의 유용성을 보이기 위해 SIDBA(standard image database) 표준영상에서 추출된 테스트 영상을 이용한 영상 압축/복원 실험을 수행하였고, 그 결과 제안된 방법에 의한 복원 영상이 합-곱 연산에 기반한 기존의 뉴럴 네트워크에 의한 복원영상보다 우수함을 알 수 있었다.