• Communications of the Korean Mathematical Society
• /
• v.21 no.3
• /
• pp.451-464
• /
• 2006

In this paper, a sharp inequality for some multilineal singular integral operators are obtained. As the applications, we get the weighted $L^p(p>1)$ norm inequalities and L log L type estimate for the multilinear operators.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.1-10
• /
• 2008

We prove a sharp inequality for some multilinear operator related to Marcinkiewicz integral operator. As application, we obtain the weighted norm inequality and L log L type estimate for the multilinear operator.

• Journal of Soil and Groundwater Environment
• /
• v.8 no.1
• /
• pp.68-74
• /
• 2003

SHARP numerical model was used to estimate the interface, ranges and seasonal variations of seawater intrusion. The interface obtained from the SHARP model represented more sensitive to seasonal variations than that estimated from the monitoring wells. When TDS and groundwater velocity vector distributions generated by SUTRA simulations are compared to the interfaces obtained from SHARP simulation, the difference of the range on seawater intrusion is less than 50 m, and the range of seawater intrusion from seasonal variations has the difference of about 12 m. These differences are small for the numerical simulation of the coastal aquifer at regional scale. Therefore, the model with sharp interface is very useful to estimate the interface at this study site, where is regional aquifer system in the scale of seawater infusion. However the SHARP model have some limitations in simulating the range of seawater intrusion, when the hydrodynamic dispersion is significant for seawater intrusion at local aquifer system.

• Communications of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.113-123
• /
• 2022

In the present paper, we introduce the subclasses 𝔅_1Σ(𝜇), B_1Σ(𝜇, 𝛾) and U_Σ(𝜇, 𝛾) of bi-univalent Bazilevič functions which are defined in the open unit disk 𝔻. Further, we obtain sharp estimates on initial coefficients a₂, a₃, a₄ and also sharp estimate on the Fekete-Szegö functional a₃ - ka²₂ for the functions belong to these subclasses.

• East Asian mathematical journal
• /
• v.6 no.2
• /
• pp.133-144
• /
• 1990

In 1982, N. Miller [5] showed a weighted $L^p$ boundedness theorem for pseudo differential operators with symbols $S^0_{1.0}$. In this paper, we shall prove the pointwise estimates, in terms of the Fefferman, Stein sharp function and Hardy Littlewood maximal function, for pseudo differential operators with reduced symbols and show a weighted $L^p$-boundedness for pseudo differential operators with symbol in $S^m_{\rho,\delta}$, 0{$\leq}{\delta}{\leq}{\rho}{\leq}1$, ${\delta}{\neq}1$, ${\rho}{\neq}0$ and $m=(n+1)(\rho-1)$.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.1409-1425
• /
• 2023

In this paper, we are devoted to studying the mixed radial-angular integrabilities for Hardy type operators. As an application, the upper and lower bounds are obtained for the fractional Hardy operator. In addition, we also establish the sharp weak-type estimate for the fractional Hardy operator.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.127-133
• /
• 1990

In this article, several problems inherent in histogram estimate of unknown probability density function are discussed. Those include so called sharp comers and bin edge effect. A resolution for these problems occurred with histogram is discussed. The resulting estimate is called kernel density estimate which is most widely used by data analysts. One of the most recent and reliable data-based choices of scale factor (bandwidth) of the estimate, which has been known to be most crucial, is also discussed.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.839-850
• /
• 2020

For functions f(z) = z + a₂z² + a₃z³ + ⋯ belonging to particular classes, this paper finds sharp bounds for the initial coefficients a₂, a₃, a₄, as well as the sharp estimate for the second order Hankel determinant H₂(2) = a₂a₄ - a₂³. Two classes are treated: first is the class consisting of f(z) = z + a₂z² + a₃z³ + ⋯ in the unit disk 𝔻 satisfying $$\|\(\frac{z}{f(z)}\)^{1+{\alpha}}\;f^{\prime}(z)-1\|<{\lambda},\;0<{\alpha}<1,\;0<{\lambda}{\leq}1.$$ The second class consists of Bazilevič functions f(z) = z+a₂z²+a₃z³+⋯ in 𝔻 satisfying $$Re\{\(\frac{f(z)}{z}\)^{{\alpha}-1}\;f^{\prime}(z)\}>0,\;{\alpha}>0.$$

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.131-136
• /
• 1997

We present a method to estimate a dense and sharp depth map using multiple cameras for the application to flexible video production. A key issue for obtaining sharp depth map is how to overcome the harmful influence of occlusion. Thus, we first propose to selectively use the depth information from multiple cameras. With a simple sort and discard technique, we resolve the occlusion problem considerably at a slight sacrifice of noise tolerance. However, boundary overreach of more textured area to less textured area at object boundaries still remains to be solved. We observed that the amount of boundary overreach is less than half the size of the matching window and, unlike usual stereo matching, the boundary overreach with the proposed occlusion-overcoming method shows very abrupt transition. Based on these observations, we propose a hierarchical estimation scheme that attempts to reduce boundary overreach such that edges of the depth map coincide with object boundaries on the one hand, and to reduce noisy estimates due to insufficient size of matching window on the other hand. We show the hierarchical method can produce a sharp depth map for a variety of images.

• Journal of Applied Reliability
• /
• v.6 no.2
• /
• pp.187-194
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless communication network such as RBN and MANET To estimate the reliability between nodes, we first modeled RNB and MANET as probability graph. Branches of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp arithmetic to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.