• 한국관개배수논문집
• /
• 제14권2호
• /
• pp.181-193
• /
• 2007

The characteristics of non-point source pollutant loads in middle-stream of Nakdong River Were studied through analysis of pollutant loads of 8 sub-watersheds divided based on administrative district. The pollutant concentration of each sub-watershed was collected from Nakdong-River Water Research Institute and Daegu Regional Environmental Office, respectively. Pollution items analysed in this study were BOD, SS, T-N and T-P. High degree of non-point pollution was observed from Gumi, Goryeong, Gyeongsan, Daegu and Sungju, and pollution was usually increased during rainy season. This result indicates that a given pollution condition within the watershed can be more sensitive than location factor to the level of water quality. The main sources of non-point pollution were population and livestock, as well as landuse factor, and were found to significantly contribute to the water pollution. Alternative solutions for controlling pollution sources, therefore, should be provided to meet target levels of water quality in this region.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.895-902
• /
• 2009

In this paper, the singular three-point boundary value problem $$\{{{u"(t)\;+\;f(t,\;u)\;=\;0,\;t\;{\in}\;(0,\;1),}\atop{u(0)\;=\;0,\;u(1)\;=\;{\alpha}u(\eta),}}\$$ is studied, where 0 < $\eta$ < 1, $\alpha$ > 0, f(t,u) may be singular at u = 0. By mixed monotone method, the existence and uniqueness are established for the above singular three-point boundary value problems. The theorems obtained are very general and complement previous know results.

• 전력전자학회논문지
• /
• 제25권1호
• /
• pp.68-71
• /
• 2020

As a T-type three-level PWM converter has several intrinsic advantages, it has been widely studied for many applications. However, it requires an additional voltage control loop for balancing each DC link voltage. Generally, satisfying this requirement involves the use of an offset voltage to provide a neutral point current without affecting other variables, such as the total DC link voltage and three-phase input current. In this study, the theoretical relationship between the offset voltage and the neutral point current is analyzed. The results can be beneficial for effective voltage balancing controller design. The effectiveness of the analytical modeling is verified by simulation and experimental results.

• Journal of information and communication convergence engineering
• /
• 제19권2호
• /
• pp.93-101
• /
• 2021

Cardiac arrhythmias are common heart diseases and generally cause sudden cardiac death. Electrocardiogram (ECG) is an effective tool that can reveal the electrical activity of the heart and diagnose cardiac arrhythmias. We propose detection of P waves based on QRST cancellation zero-one substitution. After preprocessing, the QRST segment is determined by detecting the Q wave start point and T wave end point separately. The Q wave start point is detected by digital analyses of the QRS complex width, and the T wave end point is detected by computation of an indicator related to the area covered by the T wave curve. Then, we determine whether the sampled value of the signal is in the interval of the QRST segment and substitute zero or one for the value to cancel the QRST segment. Finally, the maximum amplitude is selected as the peak of the P wave in each RR interval of the residual signal. The average detection rate for the QT database was 97.67%.

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.73-82
• /
• 2019

In this work, we give necessary and sufficient conditions under which every solution of a class of first-order neutral differential equations of the form $$(x(t)+p(t)x({\tau}(t)))^{\prime}+q(t)Hx({\sigma}(t)))=0$$ either oscillates or converges to zero as $t{\rightarrow}{\infty}$ for various ranges of the neutral coefficient p. Our main tools are the Knaster-Tarski fixed point theorem and the Banach's contraction mapping principle.

• 대한수학회지
• /
• 제45권2호
• /
• pp.377-392
• /
• 2008

Let X be a real reflexive Banach space with a uniformly $G\hat{a}teaux$ differentiable norm, C a nonempty closed convex subset of X, T : C $\rightarrow$ X a continuous pseudocontractive mapping, and A : C $\rightarrow$ C a continuous strongly pseudocontractive mapping. We show the existence of a path ${x_t}$ satisfying $x_t=tAx_t+(1- t)Tx_t$, t $\in$ (0,1) and prove that ${x_t}$ converges strongly to a fixed point of T, which solves the variational inequality involving the mapping A. As an application, we give strong convergence of the path ${x_t}$ defined by $x_t=tAx_t+(1-t)(2I-T)x_t$ to a fixed point of firmly pseudocontractive mapping T.

• 대한수학회보
• /
• 제46권3호
• /
• pp.521-534
• /
• 2009

In this paper we present new large-update primal-dual interior point algorithms for $P_*$ linear complementarity problems(LAPS) based on a class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{1}{\sigma}}(e^{{\sigma}(1-t)}-1)$, p $\in$ [0, 1], ${\sigma}{\geq}1$. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*$ LAPS. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*$ LAPS have $O((1+2+\kappa)n^{{\frac{1}{p+1}}}lognlog{\frac{n}{\varepsilon}})$ complexity bound. When p = 1, we have $O((1+2\kappa)\sqrt{n}lognlog\frac{n}{\varepsilon})$ complexity which is so far the best known complexity for large-update methods.

• 대한수학회논문집
• /
• 제25권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 the Korean Society for Industrial and Applied Mathematics
• /
• 제11권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$.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.63-72
• /
• 2017

In this paper, we propose a security architecture for HDLC-based T4 class common data link. The common data links are composed of point-to-point, multi-to-point, and point-to-multi mode. For multi-to-point mode, one node has a bundle of point-to-point links with different end-point on the other side of the links. Thus multi-to-point mode can be considered as a bundle of point-to-point mode. Point-to-multi mode is broadcasting link. For point-to-point mode we adopted robust security network scheme to establish a secure data link, and for multi-to-point mode we use broadcast encryption scheme based on ID-based cryptography to distribute encryption key for broadcasting message encryption. We also included MACsec technology for point-to-point data link security. Computational and communicational complexity analysis on the broadcast encryption have been done.