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

Let $O_n$ and $PO_n$ denote the order-preserving transformation and the partial order-preserving transformation semigroups on the set $X_n=\{1,{\ldots},n\}$, respectively. Then the strictly partial order-preserving transformation semigroup $SPO_n$ on the set $X_n$, under its natural order, is defined by $SPO_n=PO_n{\setminus}O_n$. In this paper we find necessary and sufficient conditions for any subset of SPO(n, r) to be a (minimal) generating set of SPO(n, r) for $2{\leq}r{\leq}n-1$.

• 대한수학회보
• /
• 제54권1호
• /
• pp.289-298
• /
• 2017

Let R denote a commutative Noetherian (not necessarily local) ring and let I be an ideal of R of dimension one. The main purpose of this note is to show that the category ${\mathfrak{M}}(R,\;I)_{com}$ of I-cominimax R-modules forms an Abelian subcategory of the category of all R-modules. This assertion is a generalization of the main result of Melkersson in [15]. As an immediate consequence of this result we get some conditions for cominimaxness of local cohomology modules for ideals of dimension one. Finally, it is shown that the category ${\mathcal{C}}^1_B(R)$ of all R-modules of dimension at most one with finite Bass numbers forms an Abelian subcategory of the category of all R-modules.

• 대한수학회보
• /
• 제55권1호
• /
• pp.115-137
• /
• 2018

Let $R_{u{^2},v^2,w^2,p}$ be a finite non chain ring ${\mathbb{F}}_p[u,v,w]{\langle}u^2,\;v^2,\;w^2,\;uv-vu,\;vw-wv,\;uw-wu{\rangle}$, where p is a prime number. This ring is a part of family of Frobenius rings. In this paper, we explore the structures of cyclic codes over the ring $R_{u{^2},v^2,w^2,p}$ of arbitrary length. We obtain a unique set of generators for these codes and also characterize free cyclic codes. We show that Gray images of cyclic codes are 8-quasicyclic binary linear codes of length 8n over ${\mathbb{F}}_p$. We also determine the rank and the Hamming distance for these codes. At last, we have given some examples.

• Kyungpook Mathematical Journal
• /
• 제45권1호
• /
• pp.33-43
• /
• 2005

Clones are sets of operations which are closed under composition and contain all projections. Identities of clones of term operations of a given algebra correspond to hyperidentities of this algebra, i.e., to identities which are satisfied after any replacements of fundamental operations by derived operations ([7]). If any identity of an algebra is satisfied as a hyperidentity, the algebra is called solid ([3]). Solid algebras correspond to free clones. These connections will be extended to so-called generalized clones, to strong hyperidentities and to strongly solid varieties. On the basis of a generalized superposition operation for terms we generalize the concept of a unitary Menger algebra of finite rank ([6]) to unitary Menger algebras with infinitely many nullary operations and prove that strong hyperidentities correspond to identities in free unitary Menger algebras with infinitely many nullary operations.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.348-351
• /
• 1995

This note proposes a robust LQR method for systems with structured real parameter uncertainty based on Riccati equation approach. Emphasis is on the reduction of design conservatism in the sense of quadratic performance by utilizing the uncertainty structure. The class of uncertainty treated includes all the form of additive real parameter uncertainty, which has the multiple rank structure. To handle the structure of uncertainty, the scaling matrix with block diagonal structure is introduced. By changing the scaling matrix, all the possible set of uncertainty structures can be represented. Modified algebraic Riccati equation (MARE) is newly proposed to obtain a robust feedback control law, which makes the quadratic cost finite for an arbitrary scaling matrix. The remaining design freedom, that is, the scaling matrix is used for minimizing the upper bound of the quadratic cost for all possible set of uncertainties within the given bounds. A design example is shown to demonstrate the simplicity and the effectiveness of proposed method.

• 대한수학회논문집
• /
• 제9권2호
• /
• pp.271-274
• /
• 1994

The concept of a continuous module is a generalization of that of an injective module, and conditions ($C_1$), (C$_2$) and ($C_3$) are given for this concept in [4]. In this paper, we study modules with properties that are dual to continuity. These will be called discrete and we discuss discrete abelian groups. Throughout R is a ring with identity, M is a module over R, G is an abelian group of finite rank, E is the ring of endomorphisms of G and S is the center of E. Dual to the notion of essential submodules, we define small submodules of a module M over R.(omitted)

• 한국멀티미디어학회논문지
• /
• 제7권6호
• /
• pp.781-790
• /
• 2004

This paper presents a fourth-order cumulants based iterative algorithm for blind channel equalization. It is robust with respect to the existence of heavy Gaussian noise in a channel and does not require the minimum phase characteristic of the channel. In this approach, the transmitted signals at the receiver are over-sampled to ensure the channel described by a full-column rank matrix. It changes a single-input/single-output (SISO) finite-impulse response (FIR) channel to a single-input/multi-output (SIMO) channel. Based on the properties of the fourth-order cumulants of the over-sampled channel outputs, the iterative algorithm is derived to estimate the deconvolution matrix which makes the overall transfer matrix transparent, i.e., it can be reduced to the identity matrix by simple reordering and scaling. Both a closed-form and a stochastic version of the proposed algorithm are tested with three-ray multi-path channels in simulation studies, and their performances are compared with a method based on conventional second-order cumulants. Relatively good results are achieved, even when the transmitted symbols are significantly corrupted with Gaussian noise.

• 응용통계연구
• /
• 제24권6호
• /
• pp.1161-1168
• /
• 2011

The approximation for the distribution functions of nonparametric test statistics is a significant step in statistical inference. A rank sum test for dispersions proposed by Ansari and Bradley (1960), which is widely used to distinguish the variation between two populations, has been considered as one of the most popular nonparametric statistics. In this paper, the statistical tables for the distribution of the nonparametric Ansari-Bradley statistic is produced by use of polynomially adjusted normal approximation as a semi parametric density approximation technique. Polynomial adjustment can significantly improve approximation precision from normal approximation. The normal-polynomial density approximation for Ansari-Bradley statistic under finite sample sizes is utilized to provide the statistical table for various combination of its sample sizes. In order to find the optimal degree of polynomial adjustment of the proposed technique, the sum of squared probability mass function(PMF) difference between the exact distribution and its approximant is measured. It was observed that the approximation utilizing only two more moments of Ansari-Bradley statistic (in addition to the first two moments for normal approximation provide) more accurate approximations for various combinations of parameters. For instance, four degree polynomially adjusted normal approximant is about 117 times more accurate than normal approximation with respect to the sum of the squared PMF difference.

• 대한수학회보
• /
• 제54권2호
• /
• pp.559-571
• /
• 2017

We investigate modules M having the injective property relative to nonsingular modules. Such modules are called "$\mathcal{N}$-injective modules". It is shown that M is an $\mathcal{N}$-injective R-module if and only if the annihilator of $Z_2(R_R)$ in M is equal to the annihilator of $Z_2(R_R)$ in E(M). Every $\mathcal{N}$-injective R-module is injective precisely when R is a right nonsingular ring. We prove that the endomorphism ring of an $\mathcal{N}$-injective module has a von Neumann regular factor ring. Every (finitely generated, cyclic, free) R-module is $\mathcal{N}$-injective, if and only if $R^{(\mathbb{N})}$ is $\mathcal{N}$-injective, if and only if R is right t-semisimple. The $\mathcal{N}$-injective property is characterized for right extending rings, semilocal rings and rings of finite reduced rank. Using the $\mathcal{N}$-injective property, we determine the rings whose all nonsingular cyclic modules are injective.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권1호
• /
• pp.13-20
• /
• 2005

This paper addresses a new blind channel equalization method using fourth-order cumulants of channel inputs and a three-layer neural network equalizer. The proposed algorithm is robust with respect to the existence of heavy Gaussian noise in a channel and does not require the minimum-phase characteristic of the channel. The transmitted signals at the receiver are over-sampled to ensure the channel described by a full-column rank matrix. It changes a single-input/single-output (SISO) finite-impulse response (FIR) channel to a single-input/multi-output (SIMO) channel. Based on the properties of the fourth-order cumulants of the over-sampled channel inputs, the iterative algorithm is derived to estimate the deconvolution matrix which makes the overall transfer matrix transparent, i.e., it can be reduced to the identity matrix by simple recordering and scaling. By using this estimated deconvolution matrix, which is the inverse of the over-sampled unknown channel, a three-layer neural network equalizer is implemented at the receiver. In simulation studies, the stochastic version of the proposed algorithm is tested with three-ray multi-path channels for on-line operation, and its performance is compared with a method based on conventional second-order statistics. Relatively good results, withe fast convergence speed, are achieved, even when the transmitted symbols are significantly corrupted with Gaussian noise.