• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.15 no.9
• /
• pp.768-778
• /
• 2003

Numerical analysis has been carried out to investigate laminar convective heat transfer in a tube for supercritical water near the thermodynamic critical point. Fluid flow and heat transfer are strongly coupled due to large variations of thermodynamic and transport properties such as density, specific heat, viscosity, and thermal conductivity near the critical point. Heat transfer characteristics in the developing region of the tube show transition behavior between liquid-like and gas-like phases with a peak in heat transfer coefficient distribution near the pseudocritical point. The peak of the heat transfer coefficient depends on pressure and wall heat flux rather than inlet temperature and Reynolds number, Results of the modeling provide convective heat transfer characteristics including velocity vectors, temperature, and the properties as well as the heat transfer coefficient. The effect of proximity to the critical point is considered and a heat transfer correlation is suggested for the peak of Nusselt number in the tube.

• Journal of applied mathematics & informatics
• /
• v.38 no.5_6
• /
• pp.519-532
• /
• 2020

In this paper, we first propose a new total variation-based regularization model for image restoration. We next propose a fixed-point-like method for solving the new image restoration model, and then we provide convergence analysis for the fixed-point-like method. To evaluate the feasibility and efficiency of the fixed-point-like method for the new proposed total variation-based regularization model, we provide numerical experiments for several test problems.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.655-669
• /
• 2010

In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.567-579
• /
• 2009

Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$). In this paper we use this search direction to propose a primal-dual interior-point method for convex quadratic programming (QP). We overcome the difficulty in analyzing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$) for convex quadratic programming.

• 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$.

• International Journal of Air-Conditioning and Refrigeration
• /
• v.13 no.4
• /
• pp.206-216
• /
• 2005

Numerical analysis has been carried out to investigate laminar convective heat transfer at zero gravity in a tube for supercritical water near the thermodynamic critical point. Fluid flow and heat transfer are strongly coupled due to large variation of thermodynamic and transport properties such as density, specific heat, viscosity, and thermal conductivity near the critical point. Heat transfer characteristics in the developing region of the tube show transition behavior between liquid-like and gas-like phases with a peak in heat transfer coefficient distribution near the pseudo critical point. The peak of the heat transfer coefficient depends on pressure and wall heat flux rather than inlet temperature and Reynolds number. Results of the modeling provide convective heat transfer characteristics including velocity vectors, temperature, and the properties as well as the heat transfer coefficient. The effect of proximity on the critical point is considered and a heat transfer correlation is suggested for the peak of Nusselt number in the tube.

• KDI Journal of Economic Policy
• /
• v.38 no.4
• /
• pp.1-21
• /
• 2016

This paper documents how the net profit margin of private firms improves when the CEOs of the companies relocate their primary residence to be closer to the corporate headquarters. By reviewing 127 Korean non-public companies belonging to 66 private business groups, we find that the top managers move closer to the headquarters when the profitability of the firms has recently deteriorated. A one basis point decline in the margin causes CEOs to relocate their homes approximately two kilometers closer to their corporate headquarters. The profit margin rebounds after their relocation. This finding implies that physical proximity can serve as a proxy for personal commitment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.883-886
• /
• 2016

본 논문에서는 장기투약자의 복약 관리 시스템 개발의 기초 연구로 Textile proximity pressure sensor를 개발하였고, 약통의 무게 감지를 통하여 약의 복용 여부를 판별하는 연구를 수행하였다. 실험은 총 2가지로, 약의 개수에 따른 baseline검출 실험과 약 한알의 무게 도출 실험을 수행하였다. 잡음을 제거하기 위해 5 point의 이동평균필터(MAF: Moving average filter)를 적용하였다. 본 논문을 통해 얻은 결과는 차후 장기 투약이 필요한 환자로 하여금 규칙적으로 약을 복용하도록 하여 만성질환의 완치율을 높이는 데 기여할 수 있을 것으로 판단된다.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.48 no.11
• /
• pp.617-624
• /
• 1999

The spiral type thin-film inductor performed in high frequency at 2-5[MHz] range is analyzed by 2-dimensional Finite Element Method(2D FEM). The features of micro thin-film inductor have complicated electromagnetic phenomenon such as skin effect, proximity effect and magnetic saturation. To develope miniatured magnetic device considering these features, it is important to predict the property of the thin film inductor according to design parameter. In this paper, we present the 2D FEM analysis for the spiral type thin film inductor. The characteristics of inductor from point of view of inductance, resistance and quality factor are studied according to design parameter and various pattern construction.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a 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){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.