• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.49-64
• /
• 2024

When setting up a structure with an embedded shallow arch, there is a phenomenon where the end of the arch moves. To study the so-called moving domain problem, one try to transform a considered noncylindrical domain into the cylindrical domain using the transform operator, as well as utilizing the method of penalty and other approaches. However, challenges arise when calculating time derivatives of solutions in a domain depending on time, or when extending the initial conditions from the non-cylindrical domain to the cylindrical domain. In this paper, we employ the transform operator to prove the existence and uniqueness of weak solutions of the shallow arch equation on the moving domain as clarifying the time derivatives of solutions in the moving domain.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

• Honam Mathematical Journal
• /
• v.35 no.4
• /
• pp.717-727
• /
• 2013

In this paper, we study on a higher order extremal problem relating the Ahlfors map associated to the pair of a finitely connected domain in the complex plane and a point there. We show the power of the Ahlfors map with some error term which is conformally equivalent maximizes any higher order derivative of holomorphic functions at the given point in the domain.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.469-474
• /
• 1991

Recent interests in intelligent LP modeling aim to support MS/OR-naive users to be able to apply LP models to practical problems without the expert knowledges required. For more generalized LP modeling, a GPS(General Problem Solver)-based approach is suggested in this paper. It identifies modeling process as a means-ends analysis process. In view of this approach, a) we first divide the knowledges into domain specific assertive knowledges(state) and procedural knowledges about LP modeling(operator and macro) for model-domain independence, b) and then generate LP model according to the difference resolution techniques.

• East Asian mathematical journal
• /
• v.19 no.1
• /
• pp.73-80
• /
• 2003

Let D be a bounded domain in $\mathbb{C}^n$ with $C^2$ boundary. In this paper, we prove the following inequality $${\parallel}u{\parallel}_{p_2,{\alpha}_2}{\lesssim}{\parallel}u{\parallel}_{p_1,{\alpha}_1}+{\parallel}\bar{\partial}u{\parallel}_{p_1,{\alpha}_1+p_1}/2$$, where $1{\leq}p_1{\leq}p_2<\infty,\;{\alpha}_j>0,(n+{\alpha}_1)/p_1=(n+{\alpha}_1)/p_1=(n+{\alpha}_2)/p_2$, and $1/p_2{\geq}1/p_1-1/2n$.

• Journal of Ocean Engineering and Technology
• /
• v.15 no.1
• /
• pp.12-18
• /
• 2001

This study concentrates on the second-order diffraction problem around circular cylinders in multi-frequency waves. The method of solution is a time-domain Rankine panel method which adopts a higher-order approximation for the velocity potential and wave elevation. In the present study, the multiple second-order quadratic transfer functions are extracted from the second-order time signal generated in random waves, and the comparison with other bench-mark test results shows a good agreement. This approach is directly applicable to prediction of nonlinear forces on offshore structures in random ocean.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2590-2606
• /
• 2017

Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.1020-1026
• /
• 2016

Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.1010-1017
• /
• 1999

불완전한 계획 영역 이론은 오류 영역(noisy domain)에서 하나의 상태에 상반된 연산자들이 적용되는 불일치성 문제를 야기할 수 있다. 이 문제를 해결하기 위해서 본 논문은 상태를 기술하기 위해 다치 논리를 도입하여 제어지식으로서의 부정적 선행조건을 학습하는 새로운 방법을 제안한다. 기계에는 알려지지 않은 이러한 제어지식이 인간에게는 반대개념으로 잠재적으로 사용되고 있다. 이러한 잠재된 개념을 학습하기 위해 본 논문은 반대 연산자들로 구성된 사이클을 영역이론으로부터 기계적으로 생성하고, 이 연산자들에 대한 실험을 통해 반대 리터럴(literal)들을 추출한다. 학습된 규칙은 불일치성을 방지하면서 동시에 중복된 선행조건을 제거하여 연산자를 단순화시킬 수 있다.Abstract An incomplete planning domain theory can cause an inconsistency problem in a noisy domain, allowing two opposite operators to be applied to a state. To solve the problem, we present a novel method to learn a negative precondition as control knowledge by introducing a three-valued logic for state description. However, even though the control knowledge is unknown to a machine, it is implicitly known as opposite concept to a human. To learn the implicit concept, we mechanically generate a cycle composed of opposite operators from a domain theory and extract opposite literals through experimenting the operators. A learned rule can simplify the operator by removing a redundant precondition while preventing inconsistency.