• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.69-86
• /
• 2017

The point $P{\in}{\mathbb{P}}^2$ is referred to as a Galois point for a nonsingular plane algebraic curve C if the projection ${\pi}_P:C{\rightarrow}{\mathbb{P}}^1$ from P is a Galois covering. In contrast, the point $P^{\prime}{\in}C^{\prime}$ is referred to as a weak Galois Weierstrass point of a nonsingular algebraic curve C' if P' is a Weierstrass point of C' and a total ramification point of some Galois covering $f:C^{\prime}{\rightarrow}{\mathbb{P}}^1$. In this paper, we discuss the following phenomena. For a nonsingular plane curve C with a Galois point P and a double covering ${\varphi}:C{\rightarrow}C^{\prime}$, if there exists a common ramification point of ${\pi}_P$ and ${\varphi}$, then there exists a weak Galois Weierstrass point $P^{\prime}{\in}C^{\prime}$ with its Weierstrass semigroup such that H(P') = or , which is a semigroup generated by two positive integers r and 2r + 1 or 2r - 1, such that P' is a branch point of ${\varphi}$. Conversely, for a weak Galois Weierstrass point $P^{\prime}{\in}C^{\prime}$ with H(P') = or , there exists a nonsingular plane curve C with a Galois point P and a double covering ${\varphi}:C{\rightarrow}C^{\prime}$ such that P' is a branch point of ${\varphi}$.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1463-1474
• /
• 2019

Let C be a nonsingular projective curve of genus ${\geq}2$ over an algebraically closed field of characteristic 0. For a point P in C, the Weierstrass semigroup H(P) is defined as the set of non-negative integers n for which there exists a rational function f on C such that the order of the pole of f at P is equal to n, and f is regular away from P. A point P in C is referred to as a weak Galois-Weierstrass point if P is a Weierstrass point and there exists a Galois morphism ${\varphi}:C{\rightarrow}{\mathbb{p}}^1$ such that P is a total ramification point of ${\varphi}$. In this paper, we investigate the number of weak Galois-Weierstrass points of which the Weierstrass semigroups are generated by two positive integers.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.1 no.1
• /
• pp.6-25
• /
• 2002

In this paper, we have implemented UPnP Devices which emulate a Control Point, a Light Controller, and a Digital TV. The Control Point has been developed on Linux host system by using C language. The UPnP Devices emulating the Digital TV and Light Controller are running on embedded linux developer board. For the development of UPnP Devices, UPnP SDK API Vl.04 made by Intel Co. Ltd. has been ported on Assabet Linux Reference board to implement the UPnP protocol. After we analyze and design some services of Digital TV device, we have applied UPnP Device program to those devices. UPnP SDK vl .04 consists of APIs which support HTTP, SSDP, SOAP, GENA and XML DOM Level-1 that are cores of UPnP protocol. The C program written for the UPnP Control Point has been compiled and executed on Linux-based PC. The embedded system running on Embedded Linux OS has been connected all together through Ethernet which allows IP-based communications. Under this environment, the UPnP programs are being executed on each device. Control Point, when in operational mode, discovers UPnP Devices on the network and displays the device list on the consol. By selecting one of the functionalities of the device services that are displayed on the Control Point, the controllability has been accomplished. The experiment that we performed in this thesis have revealed that the Control Point and UPnP Devices have supported the protocols including SSDP, SOAP, GENA, and DHCP.

• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.845-855
• /
• 2016

We introduce the proximal point algorithm in a p-uniformly convex metric space. We first introduce the notion of p-resolvent map in a p-uniformly convex metric space as a generalization of the Moreau-Yosida resolvent in a CAT(0)-space, and then we secondly prove the convergence of the proximal point algorithm by the p-resolvent map in a p-uniformly convex metric space.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.50 no.1
• /
• pp.1-5
• /
• 2001

P(VDF/TrFE) copolymer thin films with 70/30 and 80/20 mol% VDF (polyvinylidene fluoride) and TrFE (trifluoroethylene) rates were prepared by using a vapor deposition method, During thin films were prepared, the substrate temperatures were maintained at 30 $^{\circ}C$ and 120 $^{\circ}C$, and the heating source temperature was fixed at 350 $^{\circ}C$. Contary to PVDF homopolymer, P(VDF/TrFE) copolymers showed the Curie point(Tc) below the melting point. The Curie point (Tc) and the melting point of the P(VDF/TrFE) copolymers were changed as a function of substrate temperature and the VDF mol%. The Curie point and the melting point of P(VDF/TreFE) thin films decreased and increased with increasing substrate temperature, respectively. Also with increasing VDF mol%, the melting point decreased slightly, however the Curie point increased.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.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.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.769-772
• /
• 2003

Middleware enables different networking devices and protocols to inter-operate in ubiquitous home network environments. The UPnP(Universal Plug and Play) middleware, which runs on a PC and is based on the IPv4 protocol, has attracted much interest in the field of home network research since it has versatility. The UPnP, however, cannot be easily accessed via the public Internet since the UPnP devices that provide services and the Control Points that control the devices are configured with non-routable local private or Auto IP networks. The critical question is how to access UPnP network via the public Internet. The purpose of this study is to deal with the non-routability problem in local private and Auto IP networks by improving the conventional Control Point used in UPnP middleware-based home networks. For this purpose, this paper proposes an improved Control Point for accessing and controlling the home network from remote sites via the public Internet, by adding a web server to the conventional Control Point. The improved Control Point is implemented in an embedded GNU/Linux system running on an ARM9 platform.

• Journal of Environmental Science International
• /
• v.17 no.10
• /
• pp.1075-1080
• /
• 2008

The influence of the point source inflow on the water quality variation in the downstream of Hyeongsan River was investigated. As the results of seasonal variation, the pollutant concentrations of dry season were 1.5-4 times higher than those of wet season. The increase rate of $BOD_5$, $COD_{Mn}$, T-N, T-P due to point source were ranged to $8.1\sim42.6%$, $7.3\sim41.9%$ and $17.1\sim207%$ as the inflow of P1, P2 and P3, respectively. After P1, P2 and P3 inflow, the accumulated increase rate were 64.3%, 32.6%, 93.1% and 258.9% in $BOD_5$, $COD_{Mn}$, T-N, T-P, respectively. It was found that the influence of point source inflow on the water quality in the downstream of Hyeongsan River is severe.

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

• The Pure and Applied Mathematics
• /
• v.5 no.2
• /
• pp.109-114
• /
• 1998

Let H be a separable complex H be a space and let (equation omitted)(H) be the *-algebra of all bounded linear operators on H. An operator T in (equation omitted)(H) is said to be p-hyponormal if ($T^{\ast}T)^p - (TT^{\ast})^{p}\geq$ 0 for 0 ＜ p ＜ 1. If p = 1, T is hyponormal and if p = $\frac{1}{2}$, T is semi-hyponormal. In this paper, by using a technique introduced by S. K. Berberian, we show that the approximate point spectrum $\sigma_{\alpha p}(T) of a pure p-hyponormal operator T is empty, and obtains the compact perturbation of T.