• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.1-9
• /
• 2020

Many cryptographic and error control coding algorithms rely on finite field GF(2m) arithmetic. Hardware implementation of these algorithms needs an efficient realization of finite field arithmetic operations. Finite field multiplication is complicated among the basic operations, and it is employed in field exponentiation and division operations. Various algorithms and architectures are proposed in the literature for hardware implementation of finite field multiplication to achieve a reduction in area and delay. In this paper, a low area and delay efficient semi-systolic multiplier over finite fields GF(2m) using the modified Montgomery modular multiplication (MMM) is presented. The least significant bit (LSB)-first multiplication and two-level parallel computing scheme are considered to improve the cell delay, latency, and area-time (AT) complexity. The proposed method has the features of regularity, modularity, and unidirectional data flow and offers a considerable improvement in AT complexity compared with related multipliers. The proposed multiplier can be used as a kernel circuit for exponentiation/division and multiplication.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1205-1213
• /
• 2020

Let R be a commutative ring with 1 ≠ 0. In this paper, we introduce a subclass of the class of 1-absorbing primary ideals called the class of strongly 1-absorbing primary ideals. A proper ideal I of R is called strongly 1-absorbing primary if whenever nonunit elements a, b, c ∈ R and abc ∈ I, then ab ∈ I or c ∈ ${\sqrt{0}}$. Firstly, we investigate basic properties of strongly 1-absorbing primary ideals. Hence, we use strongly 1-absorbing primary ideals to characterize rings with exactly one prime ideal (the UN-rings) and local rings with exactly one non maximal prime ideal. Many other results are given to disclose the relations between this new concept and others that already exist. Namely, the prime ideals, the primary ideals and the 1-absorbing primary ideals. In the end of this paper, we give an idea about some strongly 1-absorbing primary ideals of the quotient rings, the polynomial rings, and the power series rings.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.13-46
• /
• 2001

SDP (Semidefinite Programming), as a sort of “cone-LP”, optimizes a linear function over the intersection of an affine space and a cone that has the origin as its apex. SDP, however, has been developed in the process of searching for better solution methods for NP-hard combinatorial optimization problems. We surveyed the basic theories necessary to understand SDP researches. First, We examined SDP duality, comparing it to LP duality, which is essential for the interior point method, Second, we showed that SDP can be optimized from an interior solution in polynomial time with a desired error limit. finally, we summarized several research papers that showed SDP can improve solution methods for some combinatorial optimization problems, and explained why SDP has become one of the most important research topics in optimization. We tried to integrate SDP theories. relatively diverse and complicated. to survey research papers with our own perspective, and thus to help researcher to pursue their SDP researches in depth.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.925-942
• /
• 2016

We study the structure of rings whose principal right ideals contain a sort of two-sided ideals, introducing right ${\pi}$-duo as a generalization of (weakly) right duo rings. Abelian ${\pi}$-regular rings are ${\pi}$-duo, which is compared with the fact that Abelian regular rings are duo. For a right ${\pi}$-duo ring R, it is shown that every prime ideal of R is maximal if and only if R is a (strongly) ${\pi}$-regular ring with $J(R)=N_*(R)$. This result may be helpful to develop several well-known results related to pm rings (i.e., rings whose prime ideals are maximal). We also extend the right ${\pi}$-duo property to several kinds of ring which have roles in ring theory.

• Communications of the Korean Mathematical Society
• /
• v.21 no.4
• /
• pp.641-652
• /
• 2006

In [2], they found some natural generators for the ideals of the finite ring $Z_{pm}$[X]/$(X^n\;-\;1)$, where p and n are relatively prime. If p and n are not relatively prime $X^n\;-\;1$ is not a product of basic irreducible polynomials but a product of primary polynomials. Due to this fact, to consider the ideals of $Z_{pm}$[X]/$(X^n\;-\;1)$ in 'inseparable' case we need to look at the primary ideals of $Z_{pm}$[X]. In this paper, we find a set of generators of ideals of $Z_{pm}$[X]/(f) for some primary polynomials f of $Z_{pm}$[X].

• Journal of Integrative Natural Science
• /
• v.8 no.2
• /
• pp.145-146
• /
• 2015

In this note, we provide some examples of polynomials $z^n-p(z)$, where $p(z)={\limits\sum_{k=o}^{n-1}}a_kz^k$, and ${\limits\sum_{k=o}^{n-1}}a_kz^k=1$, $a_k{\geq}0$ for each k such that p(z) has all its zeros on ${\mid}z{\mid}=c<1$, and $z^n-p(z)$ has all its zeros on two circles ${\mid}z{\mid}=1$ and ${\mid}z{\mid}=d<1$.

• Journal of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1251-1267
• /
• 2014

The semicommutative property of rings was introduced initially by Bell, and has done important roles in noncommutative ring theory. This concept was generalized to one of nil-semicommutative by Chen. We first study some basic properties of nil-semicommutative rings. We next investigate the structure of Ore extensions when upper nilradicals are ${\sigma}$-rigid ${\delta}$-ideals, examining the nil-semicommutative ring property of Ore extensions and skew power series rings, where ${\sigma}$ is a ring endomorphism and ${\delta}$ is a ${\sigma}$-derivation.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.283-293
• /
• 2007

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.67-86
• /
• 2002

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.