• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• 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.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.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.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.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$.

• The Journal of Natural Sciences
• /
• v.10 no.1
• /
• pp.13-16
• /
• 1998

Every complex vector bundle over $S^1$ splits sum of line bundle and the first Chern class classify complex line bundle. This implies every complex vector bundle over $S^1$ is trivial. In this paper, we show the existence of some nontrivial complex vector bundle over $S^1$ in the equivariant case.

• Journal of Communications and Networks
• /
• v.16 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.32-37
• /
• 2008

Satellite communication systems including the DVB-S2 (Digital Video Broadcasting - Satellite Version 2) system require operations under low signal-to-noise ratio (SNR) and large frequency offset values, and the initial frame synchronization process necessitates a robust correlation method. While a variety of conventional correlation structures exist for the initial synchronization, each method has different characteristics and performance in different channel environments. In this paper, we propose new correlation methods which exhibit enhanced performance in low SNR and large frequency offsets, and analyze their performance. The proposed methods use the magnitude sum and vector sum of extended differential correlation values, to maximize the correlation between the received signal and the synchronization sequence by using the spanned differential correlation result. The magnitude sum correlation method has better performance compared to conventional methods including the approximated ML (Maximum likelihood) method for SNR values below 4 dB with or without frequency offsets. The vector sum correlation method has improved performance over the magnitude sum method for channels with relatively small frequency offsets.

• Korean Journal of Mathematics
• /
• v.19 no.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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.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
• /
• v.12 no.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.