• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.185-202
• /
• 2019

In this paper, we investigate many types of stability, like (uniform stability, exponential stability and h-stability) of the first order dynamic equations of the form $$\{u^{\Delta}(t)=Au(t)+f(t),\;\;t{\in}{\mathbb{T}},\;t>t_0\\u(t_0)=x{\in}D(A),$$ and $$\{u^{\Delta}(t)=Au(t)+f(t,u),\;\;t{\in}{\mathbb{T}},\;t>t_0\\u(t_0)=x{\in}D(A),$$ in terms of the stability of the homogeneous equation $$\{u^{\Delta}(t)=Au(t),\;\;t{\in}{\mathbb{T}},\;t>t_0\\u(t_0)=x{\in}D(A),$$ where f is rd-continuous in $t{\in}{\mathbb{T}}$ and with values in a Banach space X, with f(t, 0) = 0, and A is the generator of a $C_0$-semigroup $\{T(t):t{\in}{\mathbb{T}}\}{\subset}L(X)$, the space of all bounded linear operators from X into itself. Here D(A) is the domain of A and ${\mathbb{T}}{\subseteq}{\mathbb{R}}^{{\geq}0}$ is a time scale which is an additive semigroup with property that $a-b{\in}{\mathbb{T}}$ for any $a,b{\in}{\mathbb{T}}$ such that a > b. Finally, we give illustrative examples.

• Journal of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.353-365
• /
• 2022

Let 𝓐 be the collection of analytic functions f defined in 𝔻 := {ξ ∈ ℂ : |ξ| < 1} such that f(0) = f'(0) - 1 = 0. Using the concept of subordination (≺), we define $$S^*_{\ell}\;:=\;\{f{\in}A:\;\frac{{\xi}f^{\prime}({\xi})}{f({\xi})}{\prec}{\Phi}_{\ell}(\xi)=1+{\sqrt{2}{\xi}}+{\frac{{\xi}^2}{2}},\;{\xi}{\in}{\mathbb{D}}\}$$, where the function 𝚽_ℓ(ξ) maps 𝔻 univalently onto the region Ω_ℓ bounded by the limacon curve (9u² + 9v² - 18u + 5)² - 16(9u² + 9v² - 6u + 1) = 0. For 0 < r < 1, let 𝔻_r := {ξ ∈ ℂ : |ξ| < r} and 𝒢 be some geometrically defined subfamily of 𝓐. In this paper, we find the largest number 𝜌 ∈ (0, 1) and some function f₀ ∈ 𝒢 such that for each f ∈ 𝒢 𝓛_f (𝔻_r) ⊂ Ω_ℓ for every 0 < r ≤ 𝜌, and $${\mathcal{L} _{f_0}}({\partial}{\mathbb{D}_{\rho})\;{\cap}\;{\partial}{\Omega}_{\ell}\;{\not=}\;{\emptyset}$$, where the function 𝓛_f : 𝔻 → ℂ is given by $${\mathcal{L}}_f({\xi})\;:=\;{\frac{{\xi}f^{\prime}(\xi)}{f(\xi)}},\;f{\in}{\mathcal{A}}$$. Moreover, certain graphical illustrations are provided in support of the results discussed in this paper.

• Journal of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.565-586
• /
• 2023

We study the Dirichlet problem for the degenerate nonlocal parabolic equation u_t - a(||∇u||²_L²(Ω))∆u = C_b ||u||^β_L²(Ω) |u|^q(x,t)-2 u log |u| + f in Q_T, where Q_T := Ω × (0, T), T > 0, Ω ⊂ ℝ^N, N ≥ 2, is a bounded domain with a sufficiently smooth boundary, q(x, t) is a measurable function in Q_T with values in an interval [q^-, q⁺] ⊂ (1, ∞) and the diffusion coefficient a(·) is a continuous function defined on ℝ₊. It is assumed that a(s) → 0 or a(s) → ∞ as s → 0⁺, therefore the equation degenerates or becomes singular as ||∇u(t)||2 → 0. For both cases, we show that under appropriate conditions on a, β, q, f the problem has a global in time strong solution which possesses the following global regularity property: ∆u ∈ L²(Q_T) and a(||∇u||²_L²(Ω))∆u ∈ L²(Q_T ).

• Journal of Educational Research in Mathematics
• /
• v.20 no.1
• /
• pp.85-102
• /
• 2010

Linear programming(LP) is useful for finding the best way in a given condition for some list of requirements represented as linear equations. This study analysed LP in mathematics contexts and LP in school mathematics contexts, considered learning process of LP from an epistemological point of view, and explored a hypothetical learning trajectory of LP. The differences between mathematics contexts and school mathematics contexts are whether they considered that the convex polytope $\Omega$ is feasible/infeasible or bounded/unbounded or not, and whether they prove the theorem that the optimum is always attained at a vertex of the polyhedronor not. And there is a possibility that students could not understand what is maximum and minimum of a linear function when the domain of the function is limited. By considering these three aspects, we constructed hypothetical learning trajectory consisted of 4 steps. The first step is to see a given linear expression as linear function, the second step is to partition a given domain by straight lines, the third step is to construct the conception of y-intercept by relating lines and the range of k, and the forth step is to identify whether there exists the optimum in a given domain or not.

• Journal of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.747-775
• /
• 2020

In this work we investigate the nonlocal elliptic equation with critical Hardy-Sobolev exponents as follows, $$(P)\;\{(-{\Delta}_p)^su={\lambda}{\mid}u{\mid}^{q-2}u+{\frac{{\mid}u{\mid}^{p{^*_s}(t)-2}u}{{\mid}x{\mid}^t}}{\hspace{10}}in\;{\Omega},\\u=0{\hspace{217}}in\;{\mathbb{R}}^N{\backslash}{\Omega},$$ where Ω ⊂ ℝ^N is an open bounded domain with Lipschitz boundary, 0 < s < 1, λ > 0 is a parameter, 0 < t < sp < N, 1 < q < p < p^∗_s where $p^*_s={\frac{N_p}{N-sp}}$, $p^*_s(t)={\frac{p(N-t)}{N-sp}}$, are the fractional critical Sobolev and Hardy-Sobolev exponents respectively. The fractional p-laplacian (-∆_p)^su with s ∈ (0, 1) is the nonlinear nonlocal operator defined on smooth functions by $\displaystyle(-{\Delta}_p)^su(x)=2{\lim_{{\epsilon}{\searrow}0}}\int{_{{\mathbb{R}}^N{\backslash}{B_{\epsilon}}}}\;\frac{{\mid}u(x)-u(y){\mid}^{p-2}(u(x)-u(y))}{{\mid}x-y{\mid}^{N+ps}}dy$, x ∈ ℝ^N. The main goal of this work is to show how the usual variational methods and some analysis techniques can be extended to deal with nonlocal problems involving Sobolev and Hardy nonlinearities. We also prove that for some α ∈ (0, 1), the weak solution to the problem (P) is in C^1,α(${\bar{\Omega}}$).

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1483-1504
• /
• 2017

We consider weak solutions of the instationary Navier-Stokes system in a smooth bounded domain ${\Omega}{\subset}{\mathbb{R}}^3$ with initial value $u_0{\in}L^2_{\sigma}({\Omega})$. It is known that a weak solution is a local strong solution in the sense of Serrin if $u_0$ satisfies the optimal initial value condition $u_0{\in}B^{-1+3/q}_{q,s_q}$ with Serrin exponents $s_q$ > 2, q > 3 such that ${\frac{2}{s_q}}+{\frac{3}{q}}=1$. This result has recently been generalized by the authors to weighted Serrin conditions such that u is contained in the weighted Serrin class ${{\int}_0^T}({\tau}^{\alpha}{\parallel}u({\tau}){\parallel}_q)^s$ $d{\tau}$ < ${\infty}$ with ${\frac{2}{s}}+{\frac{3}{q}}=1-2{\alpha}$, 0 < ${\alpha}$ < ${\frac{1}{2}}$. This regularity is guaranteed if and only if $u_0$ is contained in the Besov space $B^{-1+3/q}_{q,s}$. In this article we consider the limit case of initial values in the Besov space $B^{-1+3/q}_{q,{\infty}}$ and in its subspace ${{\circ}\atop{B}}^{-1+3/q}_{q,{\infty}}$ based on the continuous interpolation functor. Special emphasis is put on questions of uniqueness within the class of weak solutions.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.1
• /
• pp.205-213
• /
• 2011

The Long Term Evolution (LTE) system is designed to provide a high quality data service for fast moving mobile users. It is based on the Orthogonal Frequency Division Multiplexing (OFDM) and relies its channel estimation on the training samples which are systematically built within the transmitting data. Either a preamble or a lattice type is used for the distribution of training samples and the latter suits better for the multipath fading channel environment whose channel frequency response (CFR) fluctuates rapidly with time. In the lattice-type structure, the estimation of the CFR makes use of the least squares estimate (LSE) for each pilot samples, followed by an interpolation both in time-and in frequency-domain to fill up the channel estimates for subcarriers corresponding to data samples. All interpolation schemes should rely on the pilot estimates only, and thus, their performances are bounded by the quality of pilot estimates. However, the additive noise give rise to high fluctuation on the pilot estimates, especially in a communication environment with low signal-to-noise ratio. These high fluctuations could be monitored in the alternating high values of the first forward differences (FFD) between pilot estimates. In this paper, we analyzed statistically those FFD values and propose a postprocessing algorithm to suppress high fluctuations in the noisy pilot estimates. The proposed method is based on a localized adaptive moving-average filtering. The performance of the proposed technique is verified on a multipath environment suggested on a 3GPP LTE specification. It is shown that the mean-squared error (MSE) between the actual CFR and pilot estimates could be reduced up to 68% from the noisy pilot estimates.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• Economic and Environmental Geology
• /
• v.50 no.6
• /
• pp.525-535
• /
• 2017

Exhumation mechanism of migmatite in orogenic belts provides insights into thermo-mechanical evolution of lithosphere in association with orogeny. This study deals with kinematics of structures in and around the Gwangcheon Gneiss, as a preliminary study on exhumation mechanism, which is a main constituent of a domal structure (viz., Oseosan Dome) in the Hongseong area, southwestern margin of the Gyeonggi massif. Geological structures in the Gwangcheon Gneiss, which mainly comprises southern and northwestern part of the Oseosan Dome, generally have kinematic component of top-outward shear. This feature is likely to represent diapiric dome-up movement. In addition, a high strain zone, by which the tectonic domain involving the Gwangcheon Gneiss is bounded on the west, show structural features with normal sense of shear component. Taking available (thermo)chronological data into account, it is interpreted that activation of the high strain zone and exhumation of the Gwangcheon Gneiss occurred during Late Triassic, when the Gyeonggi massif was widely affected by post-collisional processes. It means that the Gwangcheon Gneiss was diapirically moved up and exhumed in the footwall of extensional high strain zone in association with Triassic post-collisional processes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.5
• /
• pp.11-20
• /
• 2002

Based on regularization principles, we propose a new dequantization scheme on DCT-based transform coding for reducing of blocking artifacts and minimizing the quantization error. The conventional image dequantization is simply to multiply the received quantized DCT coefficients by the quantization matrix. Therefore, for each DCT coefficients, we premise that the quantization noise is as large as half quantizer step size (in DCT domain). Our approach is based on basic constraint that quantization error is bounded to ${\pm}$(quantizer spacing/2) and at least there are not high frequency components corresponding to discontinuities across block boundaries of the images. Through regularization, our proposed dequantization scheme, sharply reduces blocking artifacts in decoded images. Our proposed algorithm guarantees that the dequantization process will map the quantized DCT coefficients will be evaluated against the standard JPEG, MPEG-1 and H.263 (with Annex J deblocking filter) decoding process. The experimental results will show visual improvements as well as numerical improvements in terms of the peak-signal-to-noise ratio (PSNR) and the blockiness measure (BM) to be defined.