• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2008년도 International Meeting on Information Display
• /
• pp.749-752
• /
• 2008

Various Motion Estimation (ME) algorithms have been proposed since ME requires large computational complexity. The proposed algorithm employs Enhanced Cross Search Pattern (ECSP) using motion vector of neighbor-blocks to search the motion vector. The experimental results show that proposed algorithm reduces the search point up to 35% compared to conventional methods.

• 충청수학회지
• /
• 제31권4호
• /
• pp.397-409
• /
• 2018

In this paper, we investigate the generalized Hyers-Ulam stability of the functional equation $$f\({\sum\limits_{i=1}^{n}}x_i\)+{\sum\limits_{1{\leq}i<j{\leq}n}}f(x_i-x_j)-n{\sum\limits_{i=1}^{n}f(x_i)=0$$ for integer values of n such that $n{\geq}2$, where f is a mapping from a vector space V to a Banach space Y.

• 충청수학회지
• /
• 제20권1호
• /
• pp.37-45
• /
• 2007

Let X, Y be vector spaces. In this paper, we investigate the generalized Hyers-Ulam-Rassias stability problem for a cubic function $f:X{\rightarrow}Y$ satisfies $$r^3f(\frac{\Sigma_{j=1}^{n-1}x_j+2x_n}{r})+r^3f(\frac{\Sigma_{j=1}^{n-1}x_j-2x_n}{r})+8\sum_{j=1}^{n-1}f(x_j)=2f{\sum_{j=1}^{n-1}}x_j)+4{\sum_{j=1}^{n-1}}(f(x_j+x_n)+f(x_j-x_n))$$ for all $x_1,{\cdots},x_n{\in}X$.

• 자연과학논문집
• /
• 제10권1호
• /
• pp.13-16
• /
• 1998

원 위에서의 모든 복소 vector bundle은 line bundle로 나누어지며 첫째 Chern class는 복소 line bundle을 분류한다. 이것은 원위에서의 모든 복소 vector bundle은 trivial 하다는 것을 의미한다. 이 논문에서는 군작용이 있을 경우에는 원위에서의 복소 vector bundle중에 trivial하지 않는 bundle이 존재함을 보였다.

• Journal of Communications and Networks
• /
• 제16권5호
• /
• pp.523-533
• /
• 2014

Orthogonal frequency division multiple access (OFDMA) is a promising technique, which can provide high downlink capacity for the future wireless systems. The total capacity of OFDMA can be maximized by adaptively assigning subchannels to the user with the best gain for that subchannel, with power subsequently distributed by water-filling. In this paper, we propose the use of composite differential evolution (CoDE) algorithm to allocate the subchannels. The CoDE algorithm is population-based where a set of potential solutions evolves to approach a near-optimal solution for the problem under study. CoDE uses three trial vector generation strategies and three control parameter settings. It randomly combines them to generate trial vectors. In CoDE, three trial vectors are generated for each target vector unlike other differential evolution (DE) techniques where only a single trial vector is generated. Then the best one enters the next generation if it is better than its target vector. It is shown that the proposed method obtains higher sum capacities as compared to that obtained by previous works, with comparable computational complexity.

• 대한전자공학회논문지TC
• /
• 제45권7호
• /
• pp.32-37
• /
• 2008

DVB-S2 (Digital Video Broadcasting - Satellite Version 2)와 같은 위성 통신 시스템은 낮은 신호 대 잡음 비 (SNR; Signal-to-Noise Ratio) 및 큰 주파수 오차에서의 동작이 요구되므로 인해 초기 프레임 동기 과정에서 강건한 프레임 동기 획득을 위한 상관 방식이 필요하다. 초기 프레임 동기 획득을 위해서는 기존의 다양한 상관 방식이 존재하며 채널 환경에 따라 이들 상관 방식은 각각 다른 특성 및 성능을 갖는다. 본 논문에서는 낮은 신호 대 잡음 비 영역 및 큰 주파수 오차 존재 하에서도 우수한 성능을 보이는 상관기 구조를 제시하고 그 성능을 분석 및 검증한다. 제안하는 상관 방식은 동기 수열 내에서 확장된 동기 심볼 거리에 대한 차등 상관의 크기 합과 벡터 합을 각각 이용하며, 계산된 상관값과 수신신호의 Euclidean 거리를 활용하므로써 수신 신호와 동기 수열의 상관도를 극대화하는 효과를 갖는다. 크기 합 상관 방식의 경우 4 dB 이하의 신호 대잡음 비에서 주파수 오차의 존재 유무에 관계없이 최대 우도 (ML; Maximum likelihood) 방식의 근사화를 통해 유도된 방식을 포함한 기존의 알려진 모든 상관 방식보다 향상된 오율을 가지며, 벡터 합 상관 방식은 주파수 오차 감소함에 따라 크기 합 상관 방식보다도 더욱 우수한 성능을 가진다.

• Korean Journal of Mathematics
• /
• 제19권1호
• /
• pp.17-24
• /
• 2011

Let X, Y be vector spaces. It is shown that if an even mapping $f:X{\rightarrow}Y$ satisfies f(0) = 0, and $$2(_{2d-2}C_{d-1}-_{2d-2}C_d)f\({\sum_{j=1}^{2d}}x_j\)+{\sum_{{\iota}(j)=0,1,{{\small\sum}_{j=1}^{2d}}{\iota}(j)=d}}\;f\({\sum_{j=1}^{2d}}(-1)^{{\iota}(j)}x_j\)=2(_{2d-1}C_d+_{2d-2}C_{d-1}-_{2d-2}C_d){\sum_{j=1}^{2d}}f(x_j)$$ for all $x_1$, ${\cdots}$, $x_{2d}{\in}X$, then the even mapping $f:X{\rightarrow}Y$ is quadratic. Furthermore, we prove the Hyers-Ulam stability of the above functional equation in Banach spaces.

• 전자공학회논문지B
• /
• 제32B권10호
• /
• pp.1358-1363
• /
• 1995

This paper presents a new learning method for a noise tolerant Fuzzy ART. In the conventional Fuzzy ART, the top-down and bottom-up weight vectors have the same value. They are updated by a fuzzy AND operation between the input vector and the current value of the top-down or bottom- up weight vectors. However, it can not prevent the abrupt change of the weight vector and can not achieve good performance for a noisy input vector. To solve the problems, we updated using the weighted sum of the input vector and the current value of the top-down vector. To achieve stability, the bottom-up weight vector is updated using the fuzzy AND operation between the newly learned top-down vector and the current value of the bottom-up vector. Computer simulations show that the proposed method prominently resolves the category proliferation problem without increasing the training epoch for stabilization in noisy environments.

• 대한수학회보
• /
• 제55권6호
• /
• pp.1791-1809
• /
• 2018

Let T be the singular integral operator with nonsmooth kernel which was introduced by Duong and McIntosh, and $T_q(q{\in}(1,{\infty}))$ be the vector-valued operator defined by $T_qf(x)=({\sum}_{k=1}^{\infty}{\mid}T\;f_k(x){\mid}^q)^{1/q}$. In this paper, by proving certain weak type endpoint estimate of L log L type for the grand maximal operator of T, the author establishes some quantitative weighted bounds for $T_q$ and the corresponding vector-valued maximal singular integral operator.

• Journal of the Korean Data and Information Science Society
• /
• 제12권1호
• /
• pp.127-133
• /
• 2001

In this article we establish multivariate cumulative sum (CUSUM) control charts based on residual vector with correlated observations. We first find the residual vector and its expectation and variance-covariance matrix and then evaluate the average run length (ARL) of the control charts.