• 한국항행학회논문지
• /
• 제11권4호
• /
• pp.388-393
• /
• 2007

변환부호화기(Transform coders)를 설계함에 있어서 비트 할당(Bit allocation)은 중요한 설계 요인 중의 하나이다. 본 논문에서는 고해상(high-resolution) 이론에 의한 수식들을 바탕으로 각 계수 양자화기들의 비트율을 정수값으로 할당해주는 최적의 알고리즘인 최대 탐욕 알고리즘과 최소 탐욕 알고리즘을 제안하였다. 특히, 제안된 최대 탐욕 알고리즘과 최소 탐욕 알고리즘에서 쌍대성(duality) 성질을 확인할 수 있었다.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제19권2호
• /
• pp.179-192
• /
• 2012

We find the solution minimizing the shortfall risk by using the Lagrange-multiplier method. The conventional duality method in the expected utility maximization problem is used and we get the same results as in the paper [21].

• 충청수학회지
• /
• 제35권2호
• /
• pp.177-196
• /
• 2022

The Elzaki Transform method is fuzzified to fuzzy Elzaki Transform by Rehab Ali Khudair. In this article, we propose a Double fuzzy Elzaki transform (DFET) method to solving fuzzy partial differential equations (FPDEs) and we prove some properties and theorems of DFET, fundamental results of DFET for fuzzy partial derivatives of the n^th order, construct the Procedure to find the solution of FPDEs by DFET, provide duality relation of Double Fuzzy Laplace Transform (DFLT) and Double Fuzzy Sumudu Transform(DFST) with proposed Transform. Also we solve the Fuzzy Poisson's equation and fuzzy Telegraph equation to show the DFET method is a powerful mathematical tool for solving FPDEs analytically.

• 대한수학회보
• /
• 제42권2호
• /
• pp.387-396
• /
• 2005

In the setting of the half-plane of the complex plane, we introduce a modified reproducing kernel and we show that for $r>-1/2,\;B^{1,r}-cancellation$ property holds and the Bloch space is the dual space of $B^{1,r}$.

• 대한산업공학회지
• /
• 제32권4호
• /
• pp.369-372
• /
• 2006

Suppose that a customer arrives at the GI/M/1/K queueing system when there are customers in the system, $n,m{\geq}0,\;n+m{\leq}K$. Sooner or later, the number of customers in the system will reach . In this paper, we present the Laplace transform of the remaining interarrival time upon reaching level, for the first time, since a customer arrived when there are customers in the system.

• 디지털융복합연구
• /
• 제3권1호
• /
• pp.149-163
• /
• 2005

Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However. Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets shows that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also shows that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

• Korean Journal of Mathematics
• /
• 제24권3호
• /
• pp.409-445
• /
• 2016

The class $\mathcal{W}^{\delta}_{\beta}({\alpha},{\gamma})$ defined in the domain ${\mid}z{\mid}$ < 1 satisfying $Re\;e^{i{\phi}}\((1-{\alpha}+2{\gamma})(f/z)^{\delta}+\({\alpha}-3{\gamma}+{\gamma}\[1-1/{\delta})(zf^{\prime}/f)+1/{\delta}\(1+zf^{\prime\prime}/f^{\prime}\)\]\)(f/z)^{\delta}(zf^{\prime}/f)-{\beta}\)$ > 0, with the conditions ${\alpha}{\geq}0$, ${\beta}$ < 1, ${\gamma}{\geq}0$, ${\delta}$ > 0 and ${\phi}{\in}{\mathbb{R}}$ generalizes a particular case of the largest subclass of univalent functions, namely the class of $Bazilevi{\check{c}}$ functions. Moreover, for 0 < ${\delta}{\leq}{\frac{1}{(1-{\zeta})}}$, $0{\leq}{\zeta}$ < 1, the class $C_{\delta}({\zeta})$ be the subclass of normalized analytic functions such that $Re(1/{\delta}(1+zf^{\prime\prime}/f^{\prime})+1-1/{\delta})(zf^{\prime}/f))$ > ${\zeta}$, ${\mid}z{\mid}$<1. In the present work, the sucient conditions on ${\lambda}(t)$ are investigated, so that the non-linear integral transform $V^{\delta}_{\lambda}(f)(z)=\({\large{\int}_{0}^{1}}{\lambda}(t)(f(tz)/t)^{\delta}dt\)^{1/{\delta}}$, ${\mid}z{\mid}$ < 1, carries the fuctions from $\mathcal{W}^{\delta}_{\beta}({\alpha},{\gamma})$ into $C_{\delta}({\zeta})$. Several interesting applications are provided for special choices of ${\lambda}(t)$. These results are useful in the attempt to generalize the two most important extremal problems in this direction using duality techniques and provide scope for further research.

• 정보처리학회논문지B
• /
• 제10B권5호
• /
• pp.553-560
• /
• 2003

웨이블릿 변환(Wavelet Transform)된 비디오는 주파수와 해상도가 다근 부대역으로 분해되므로 전송 오류가 발생한 패킷의 위치에 따라 복원된 프레임 간 화질 편차가 크게 된다. 복원된 프레임의 화질 변화가 클수록 사용자가 느끼는 비디오의 화질은 떨어진다. 특히, 움직임 예측을 이용한 웨이블릿 비디오의 경우, 특정 부대역에서 발생한 오류는 같은 프레임의 다른 부대역 뿐 아니라 이후 프레임의 화질에도 지속적인 영향을 미치게 된다. 본 논문에서는 웨이블릿 기반 비디오를 네트워크로 전송하기 위해 패킷화론 수행할 때, 오류발생 패킷의 위치에 관계없이 일정한 화질을 유지하며 오류 은닉이 쉬운 블록기반 패킷화 기법인 BDP(Block based Dispersive Packetization)를 제안한다. 본 논문은 MRME(Multi-Resolution Motion Estimation)글 적용하여 압축된 비디오와 무선 네트워크에서의 오류 발생 모델을 이용하여 성능평가를 수행하였다. 실험결과 제안된 기법은 프레임을 일정한 블록으로 분할하여 순차적으로 패킷화하는 BP나 픽셀단위로 분산하는 DP기법에 비해 주ㆍ객관적인 성능 모두 뛰어남을 알 수 있었다.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제14권3호
• /
• pp.195-209
• /
• 2010

Utilizing a structure of operations known as Dissection-Motion-Operations (DMO), a set of mathematics propositions or area-formulas in school mathematics will be introduced through shape-to-shape transforms. The underlying theme for DMO is problem-solving through visual reasoning and proving manipulatively or electronically vs. rote learning and memorization. Visual reasoning is the focus here where two operations that constitute DMO are utilized. One operation is known as Dissection (or Decomposition) operation that operates on a given region in 2D or 3D and dissects it into a number of subregions. The second operation is known as Motion (or Composition) operation applied on the resultant sub-regions to form a distinct area (or volume)-equivalent region. In 2D for example, DMO can transform a given polygon into a variety of new and distinct polygons each of which is area-equivalent to the original polygon (cf [Rahim, M. H. & Sawada, D. (1986). Revitalizing school geometry through Dissection-Motion Operations. Sch. Sci. Math. 86(3), 235-246] and [Rahim, M. H. & Sawada, D. (1990). The duality of qualitative and quantitative knowing in school geometry, International Journal of Mathematical Education in Science and Technology 21(2), 303-308]).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2120-2133
• /
• 2013

In this paper, we address the problem of linear minimum mean-squared error (MMSE) transmitter design for the cognitive radio (CR) multi-user multiple-input single-output (MU-MISO) broadcasting channel (BC), where the cognitive users are subject to not only a sum power constraint, but also a interference power constraint. Evidently, this multi-constraint problem renders it difficult to solve. To overcome this difficulty, we firstly transform it into its equivalent formulation with a single constraint. Then by utilizing BC-MAC duality, the problem of BC transmitter design can be solved by focusing on a dual MAC problem, which is easier to deal with due to its convexity property. Finally we propose an efficient two-level iterative algorithm to search the optimal solution. Our simulation results are provided to corroborate the effectiveness of the proposed algorithm and show that this proposed CR MMSE-based scheme achieves a suboptimal sum-rate performance compared to the optimal DPC-based algorithm with less computational complexity.