• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.283-294
• /
• 2007

By a near ${\lambda}$-lattice is meant an upper ${\lambda}$-semilattice where is defined a parti binary operation $x{\Lambda}y$ with respect to the induced order whenever $x$, $y$ has a common lower bound. Alternatively, a near ${\lambda}$-lattice can be described as an algebra with one ternary operation satisfying nine simple conditions. Hence, the class of near ${\lambda}$-lattices is a quasivariety. A ${\lambda}$-semilattice $\mathcal{A}=(A;{\vee})$ is said to have sectional (antitone) involutions if for each $a{\in}A$ there exists an (antitone) involution on [$a$, 1], where 1 is the greatest element of $\mathcal{A}$. If this antitone involution is a complementation, $\mathcal{A}$ is called an ortho ${\lambda}$-semilattice. We characterize these near ${\lambda}$-lattices by certain identities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.1-8
• /
• 2005

In this paper, we present a novel LDPC code construction called as semi-algebra low density parity check(LDPC) codes which is one kind of deterministic LDPC code based on dual-diagonal sub-matrix. The constructing method results in a class of high rate LDPC codes. Codes in this class have a large girth and good minimum distances. Furthermore, they can be implemented by simple parallel array architecture using cyclic shift register and perform well with the iterative decoding.

• Communications of Mathematical Education
• /
• v.27 no.2
• /
• pp.121-134
• /
• 2013

Linear Algebra are arguably the most popular math subjects in colleges. We believe that students' learning and understanding of linear algebra can be improved substantially if we incorporate the latest advanced information technologies in our teaching. We found that the open source mathematics program 'Sage' (http://sagemath.org) can be a good candidate to achieve our goal of improving students' interest and learning of linear algebra. In particular, we developed a simple mobile content which is available for Sage commands on common cell phones in 2009. In this paper, we introduce the mobile Sage which contains many Sage functions on a smart-phone and the mobile linear algebra content model(lecture notes, and video lectures, problem solving, and CAS tools) and it will be useful to students for self-directed learning in college mathematics education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.387-396
• /
• 2014

Recently, there have been continuous efforts and progresses regarding the research on diverse network control and management platforms for SDN (Software Defined Networking). SDN is defined as a new technology to enable service providers/network operators easily to control and manage their networks by writing a simple application program. In SDN, incomplete or malicious programmable entities could cause break-down of underlying networks shared by heterogeneous devices and stake-holders. In this sense, any misunderstanding or diverse interpretations should be completely avoided. This paper proposes a new framework for SDN application verification and a prototype based on the formal method, especially with process algebra called pACSR which is an extended version of Algebra of Communicating Shared Resources (ACSR).

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.827-832
• /
• 2007

Several partial orders on integral partitions have been studied with many applications such as majorizations, capacities of quantum memory and embeddabilities of matrix algebras. In particular, the embeddability, stable embeddability and strong-stable embeddability problems arise for finite dimensional irreducible modules over a complex simple Lie algebra L. We find a sufficient condition for an L-module strong-stably embeds into another L-module using formal character theory.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Honam Mathematical Journal
• /
• v.27 no.2
• /
• pp.141-162
• /
• 2005

In this paper, by considering the notion of hyperK-algebras of order 3 (which satisfies the simple or normal condition), we state and prove some theorems which determine the relationships between (weak) hyperK-ideals and positive implicative hyperK-ideals of type $1,{\ldots},8$.

• Journal of the Chungcheong Mathematical Society
• /
• v.10 no.1
• /
• pp.117-126
• /
• 1997

We find more simple forms of property T for von Neumann algebras which are finite direct sum of $II_1$ factors.

• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.75-78
• /
• 1997

We show that if a simple $C^*$-algebra A satisfies certain $K_1$-group conditions, then two unitarily equivalent projections are homotopic. Also we show that the equivalence of projections determined by a dimension function is a homotopy.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.653-655
• /
• 2006

We give a simple proof of the statement that if T is a bounded linear operator on a complex HIlbert space then T is Fredholm if and only if ${\pi}(T)$ is not a TDZ, where ${\pi}(\cdot)$ is the Catkin homomorphism.