• Bulletin of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.441-460
• /
• 2016

We introduce the notions of h-v-semi-slant submersions and almost h-v-semi-slant submersions from almost quaternionic Hermitian manifolds onto Riemannian manifolds. We obtain characterizations, investigate the integrability of distributions, the geometry of foliations, and a decomposition theorem. We find a condition for such submersions to be totally geodesic. We also obtain an inequality of a h-v-semi-slant submersion in terms of squared mean curvature, scalar curvature, and h-v-semi-slant angle. Finally, we give examples of such maps.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.637-657
• /
• 2021

In this paper, we decompose (under unitary similarity) the Kronecker sum A ⊞ A (= A ⊗ I + I ⊗ A) into a direct sum of irreducible matrices, when A is a 3×3 matrix. As a consequence we identify 𝒦(A⊞A) as the direct sum of several full matrix algebras as predicted by Artin-Wedderburn theorem, where 𝒦(T) is the unital algebra generated by Tand T^*.

• Communications of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.173-187
• /
• 2021

In this paper, we deal with the notion of a v-semi-slant submersion from an almost Hermitian manifold onto a Riemannian manifold. We investigate the integrability of distributions, the geometry of foliations, and a decomposition theorem. Given such a map with totally umbilical fibers, we have a condition for the fibers of the map to be minimal. We also obtain an inequality of a proper v-semi-slant submersion in terms of squared mean curvature, scalar curvature, and a v-semi-slant angle. Moreover, we give some examples of such maps and some open problems.

• Korean Journal of Remote Sensing
• /
• v.25 no.6
• /
• pp.531-546
• /
• 2009

The main objective of this study is to analyse the polarimetric characteristics of the various terrain targets by ground-based polarimetric SAR system and to confirm the compatible and effective polarimetric analysis method to reveal the polarization properties of different terrain targets by the GB-SAR. The fully polarimetric GB-SAR data with HH, HV, VH, and VV components were focused using the Deramp-FFT (DF) algorithm. The focused GB-SAR images were processed by the H/A/$\alpha$ polarimetric decomposition and the combined H/$\alpha$ or H/A/$\alpha$ and Wishart classification method. The segmented image and distribution graphs in H/$\alpha$ plane using Cloude and Pottier's method showed a reliable result that this quad-polarization GB-SAR data could be useful to classified corresponding scattering mechanism. The H/$\alpha$-Wishart and H/A/$\alpha$-Wishart classification results showed that a natural media and an artificial target were discriminated by the combined classification, in particular, after applying multi-looking and the Lee refined speckle filter.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.127-132
• /
• 2003

Cryptosystems have received very much attention in recent years as importance of information security is increased. Most of Cryptosystems are defined over finite or Galois fields GF($2^m$) . In particular, the finite field GF($2^m$) is mainly used in public-key cryptosystems. These cryptosystems are constructed over finite field arithmetics, such as addition, subtraction, multiplication, and multiplicative inversion defined over GF($2^m$) . Hence, to implement these cryptosystems efficiently, it is important to carry out these operations defined over GF($2^m$) fast. Among these operations, since multiplicative inversion is much more time-consuming than other operations, it has become the object of lots of investigation. Recently, many methods for computing multiplicative inverses at hi호 speed has been proposed. These methods are based on format's theorem, and reduce the number of required multiplication using normal bases over GF($2^m$) . The method proposed by Itoh and Tsujii[2] among these methods reduced the required number of times of multiplication to O( log m) Also, some methods which improved the Itoh and Tsujii's method were proposed, but these methods have some problems such as complicated decomposition processes. In practical applications, m is frequently selected as a power of 2. In this parer, we propose a fast method for computing multiplicative inverses in GF($2^m$) , where m = ($2^n$) . Our method requires fewer ultiplications than the Itoh and Tsujii's method, and the decomposition process is simpler than other proposed methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.69-78
• /
• 2017

Shannon of the 5G smartphone and Fourier of the signal processing meet in the sampling theorem (2 times the highest frequency 1). In this paper, the initial Shannon Theorem finds the Shannon capacity at the point-to-point, but the 5G shows on the Relay channel that the technology has evolved into Multi Point MIMO. Fourier transforms are signal processing with fixed parameters. We analyzed the performance by proposing a 2N-1 multivariate Fourier-Jacket transform in the multimedia age. In this study, the authors tackle this signal processing complexity issue by proposing a Jacket-based fast method for reducing the precoding/decoding complexity in terms of time computation. Jacket transforms have shown to find applications in signal processing and coding theory. Jacket transforms are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^{\dot{+}}=nl_n$, where $A^{\dot{+}}$ is the transpose matrix of the element-wise inverse of A, that is, $A^{\dot{+}}=(a^{-1}_{kj})$, which generalise Hadamard transforms and centre weighted Hadamard transforms. In particular, exploiting the Jacket transform properties, the authors propose a new eigenvalue decomposition (EVD) method with application in precoding and decoding of distributive multi-input multi-output channels in relay-based DF cooperative wireless networks in which the transmission is based on using single-symbol decodable space-time block codes. The authors show that the proposed Jacket-based method of EVD has significant reduction in its computational time as compared to the conventional-based EVD method. Performance in terms of computational time reduction is evaluated quantitatively through mathematical analysis and numerical results.

• Korea-Australia Rheology Journal
• /
• v.18 no.2
• /
• pp.91-98
• /
• 2006

We compare FT (Fourier Transform) and SD (Stress Decomposition), the interpretation methods for LAOS (Large Amplitude Oscillatory Shear). Although the two methods are equivalent in mathematics. they are significantly different in numerical procedures. Precision of FT greatly depends on sampling rate and length of data because FT of experimental data is the discrete version of Fourier integral theorem. FT inevitably involves unnecessary frequencies which must not appear in LAOS. On the other hand, SD is free from the problems from which FT suffers, because SD involves only odd harmonics of primary frequency. SD is based on two axioms on shear stress: [1] shear stress is a sufficiently smooth function of strain and its time derivatives; [2] shear stress satisfies macroscopic time-reversal symmetry. In this paper, we compared numerical aspects of the two interpretation methods for LAOS.

• Bulletin of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.109-114
• /
• 1989

This paper deals with the classifying spaces of finite groups. To any finite group G we associate a space BG with the property that .pi.$_{1}$(BG)=G, .pi.$_{i}$ (BG)=0 for i>1. BG is called the classifying space of G. Consider the problem of finding a stable splitting BG= $X_{1}$$^{V}$ $X_{1}$$^{V}$..$^{V}$ $X_{n}$ localized at pp. Ideally the $X_{i}$ 's are indecomposable, thus displaying the homotopy type of BG in the simplest terms. Such a decomposition naturally splits $H^{*}$(BG). The main purpose of this paper is to give the classification theorem in stable homotopy theory for groups with periodic cohomology i.e. cyclic Sylow p-subgroups for p an odd prime and to calculate some universal stable element. In this paper, all cohomology groups are with Z/p-coefficients and p is an odd prime.prime.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.59-66
• /
• 2008

Keskin and Harmanci defined the family B(M,X) = ${A{\leq}M|{\exists}Y{\leq}X,{\exists}f{\in}Hom_R(M,X/Y),\;Ker\;f/A{\ll}M/A}$. And Orhan and Keskin generalized projective modules via the class B(M, X). In this note we introduce X-local summands and X-hollow modules via the class B(M, X). Let R be a right perfect ring and let M be an X-lifting module. We prove that if every co-closed submodule of any projective module P contains Rad(P), then M has an indecomposable decomposition. This result is a generalization of Kuratomi and Chang's result [9, Theorem 3.4]. Let X be an R-module. We also prove that for an X-hollow module H such that every non-zero direct summand K of H with $K{\in}B$(H, X), if $H{\oplus}H$ has the internal exchange property, then H has a local endomorphism ring.

• Kyungpook Mathematical Journal
• /
• v.58 no.1
• /
• pp.91-103
• /
• 2018

In this paper, we generalize the concept of deferred density to that of deferred f-density, where f is an unbounded modulus and introduce a new non-matrix convergence method, namely deferred f-statistical convergence or $S^f_{p,q}$-convergence. Apart from studying the $K{\ddot{o}}the$-Toeplitz duals of $S^f_{p,q}$, the space of deferred f-statistically convergent sequences, a decomposition theorem is also established. We also introduce a notion of strongly deferred $Ces{\grave{a}}ro$ summable sequences defined by modulus f and investigate the relationship between deferred f-statistical convergence and strongly deferred $Ces{\grave{a}}ro$ summable sequences defined by f.