• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.10
• /
• pp.622-624
• /
• 2014

In this letter, the joint mode selection and resource allocation method is proposed for D2D communication underlaying OFDMA based cellular networks. In the proposed scheme, D2D mode possible region is determined which satisfies QoS. Then we solve the optimization problem utilizing primal-dual algorithm. The proposed scheme shows better performance than conventional schemes.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.69-88
• /
• 2007

In this paper we propose new large-update primal-dual interior point algorithms for $P_{\neq}({\kappa})$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on a specific class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{t^{-q}-1}{q}}$, q>0, $p{\in}[0,\;1]$, which are the generalized form of the ones in [3] and [12]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$LCPs. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have the best known complexity $O((1+2{\kappa}){\sqrt{2n}}(log2n)log{\frac{n}{\varepsilon}})$ when p=1 and $q=\frac{1}{2}(log2n)-1$.

• 한국문화재보존과학회:학술대회논문집
• /
• 2004.10a
• /
• pp.115-130
• /
• 2004

Plant-based cultural assets using straw and grass as household goods of our people's have been used as indispensable tools for practical living for a very long time. However, only a limited number of artifacts were unearthed so far due to tile fragility of the material. For this reason, research on plant-based cultural properties had close to no progress, and the appropriateness of the PEG method, high-grade alcohol method, alcohol--ether-resin method, and Paraloid B-72 used in preserving plant-based cultural properties has not been sufficiently investigated. Therefore, this study examined the weight change rate by applying the methods of Primal MC-76 and vacuum freeze-drying used mostly as a earth-layer hardening material among PEG and acrylic resin, which are applied widely for preservation of waterlogged archaeological wood, as a means to preserve plant-based cultural properties along with the examination of the subject material, and an experiment was also performed on moisture absorption. The findings as a result were, first, the plant-based material being studied was found to be Typha (Typha orientalis Presl). Secondly, the weight change experiment applying $PEG\#400$ and $PEG\#4000$ confirmed a steady increase of weight if PEG -2Step is used for treatment. Third, in preserving all subject materials with soil, treatment with $PEG\#4000$, Primal MC-76, and vacuum freeze-drying showed that tile vacuum freeze-drying method resulted in the largest or $20\%$ reduction in weight, while Primal MC-76 resulted in $18\%$ and $PEG\#4000$ in $8\%$ of weight reduction. It was concluded that, considering the stability of soil measurement, this came to be because resin permeation was carried out along with tile drying process. Fourth, the weight changes were found to be around $10\%$ in various humidity conditions after the preservation treatment. The greatest weight change rate was seen in the case of $PEG\#4000$, particularly having chemicals gush out in a high humidity (RH $84\%$ or higher) environment. In the case of Primal MC-76 and vacuum freeze-drying methods, $6\~8\%$ weight changes were detected, and the lowest weight change was found in the case of the vacuum freeze-drying method. Fifth, as for color changes after treatment, blackening occurred most strongly with $PEG\#4000$, while Primal MC-76 and vacuum freeze-drying manifested colors closest to dry straw or grass. However, the texture of straw was not very evident in the case of Primal MC-76, due to a glossy surface, but vacuum freeze-drying was found to offer tile best result in terms of texture. Putting together the results of the above experiments, vacuum freeze-drying presented after being treated with PEG2-Step the most stabilized changes in weight, while it offered the smallest change in color as well.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.151-156
• /
• 2007

A connection between weak ${\pi}-regularity$ and the condition every prime ideal is maximal will be investigated. We prove that a certain 2-primal ring R is weakly ${\pi}-regular$ if and only if every prime ideal is maximal. This result extends several known results nontrivially. Moreover a characterization of minimal prime ideals is also considered.

• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.1-9
• /
• 1999

The purpose of this paper is to develope efficient techniques for implementing the dual simplex method. In this paper we proposed one artificial row technique to get an initial dual feasible basic solution, a dual steepest-edge method coupled with a dropping row selection rule, and an anti-degeneracy technique which resembles the EXPAND procedure for the primal simplex method. The efficiency of the above techniques is shown by experiments. Finally, the dual simplex method is shown to be superior to the primal simplex method when it is used in the integer programming.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.289-292
• /
• 1996

In Cholesky factorization of the interior point method, dense columns of A matrix make dense Cholesky factor L regardless of sparsity of A matrix. We introduce a method to transform a primal problem to a dual problem in order to preserve the sparsity.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.641-649
• /
• 2007

We in this note introduce a concept, so called ${\pi}-Armendariz$ ring, that is a generalization of both Armendariz rings and 2-primal rings. We first observe the basic properties of ${\pi}-Armendariz$ rings, constructing typical examples. We next extend the class of ${\pi}-Armendariz$ rings, through various ring extensions.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.97-105
• /
• 1999

When infeasible interior-point methods are applied to large-scale linear programming problems, they become unstable and cannot solve the problems if convergence rates of primal feasibility, dual feasibility and duality gap are not well-balanced. We can balance convergence rates of primal feasibility, dual feasibility and duality gap by introducing control parameters. As a result, the stability and the efficiency of infeasible interior-point methods can be improved.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem