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

Let X and Y be vector spaces. In this paper we prove that a mapping $f:X{\rightarrow}Y$ satisfies the following functional equation $${\large}\sum_{1{\leq}k<l{\leq}n}\;(f(x_k+x_l)+f(x_k-x_l))-2(n-1){\large}\sum_{i=1}^{n}f(x_i)=0$$ if and only if the mapping f is quadratic. In addition we investigate the generalized Hyers-Ulam-Rassias stability problem for the functional equation.

• 조명전기설비학회논문지
• /
• 제20권9호
• /
• pp.84-89
• /
• 2006

This paper presents the thickness effect of hysteresis ring of hysteresis motor using finite element method combined with a vector hysteresis model. From the magnitude and direction of the magnetic field intensity, the magnetization of each ring element is calculated by a vector hysteresis model. The developed torque can be obtained with the vector sum of individual torque of each element on the hysteresis ring. From these calculations, it can be found that the motor torque is not in proportion to the thickness of the ring. As a result, there exists a proper point of thickness and that can be determined using the proposed methoㅇ in this paper.

• 말소리와 음성과학
• /
• 제4권4호
• /
• pp.87-92
• /
• 2012

Speech enhancement aims to improve speech quality by removing background noise from noisy speech. Independent vector analysis is a type of frequency-domain independent component analysis method that is known to be free from the frequency bin permutation problem in the process of blind source separation from multi-channel inputs. This paper proposed a new method of microphone array based speech enhancement that combines independent vector analysis and beamforming techniques. Independent vector analysis is used to separate speech and noise components from multi-channel noisy speech, and delay-sum beamforming is used to determine the enhanced speech among the separated signals. To verify the effectiveness of the proposed method, experiments for computer simulated multi-channel noisy speech with various signal-to-noise ratios were carried out, and both PESQ and output signal-to-noise ratio were obtained as objective speech quality measures. Experimental results have shown that the proposed method is superior to the conventional microphone array based noise removal approach like GSC beamforming in the speech enhancement.

• 한국통신학회논문지
• /
• 제36권6A호
• /
• pp.551-557
• /
• 2011

본 논문에서는 다중 사용자 다중 입출력 (MIMO : multiple input multiple output) 시스템에서 Look-Up Table(LUT)을 이용한 격자 감소(LR : Lattice-Reduction) 기반 전부호화(Precoding) 기법에 대해 연구하였다. LR 기반 벡터분산기 법 (VP : Vector Perturbation)은 송신단에서 채널정보를 완벽히 안다고 가정하였을 때 큰 채널전송 용량(Sum Capacity)를 얻을 수 있으면서 부호화 복잡도 문제도 해결할 수 있다. 이러한 성능 향상에도 불구하고 LLL(Lenstra-Lenstra-Lovasz)알고리즘을 사용한 LR과정은 채널 행렬의 열 벡터 교환과정을 포함한 반복 연산에 의해서 복잡도가 높고 하드웨어 구현이 어려운 점이 있다. 본 논문에서는 VP 기법에 LUT를 이용한 격자감소기법을 적용하고, LUT를 효율적으로 구성하는 방법을 제시한다. 모의실험 결과는 기존에 제안된 LUT 구성 방식에 비하여 적은 메모리 용량으로 유사한 직교손실(Orthogonality Defect)와 비트 오류율(BER : Bit Error Rate)을 보인다.

• 대한전자공학회논문지SP
• /
• 제40권5호
• /
• pp.388-396
• /
• 2003

본 논문에서 정수단위 화소(integer pixel unit)로 움직임 예측(motion estimation)을 수행하는 빠른 움직임 예측(fast motion estimation) 알고리즘을 제안한다. 제안하는 방법은, sum norm을 사용하여 가장 좋은 움직임 벡터를 찾아내는 연속 제거 기법(SEA : Successive Elimination Algorithm)을 기반으로 16×16블록에서는 전체 영역에 대해 검색을 하고 16×8, 8×16, 8×8블록에서는 16×16블록의 움직임 벡터로부터 그 주위 8개의 위치에서 가장 좋은 벡터를 구하고, 8×4, 4×8, 4×4블록은 8×8블록의 움직임 벡터로부터 그 주위 8개의 위치에서 벡터를 검색하여 그 중에서 가장 좋은 움직임 벡터를 찾아내는 것이다. 이러한 움직임 검색(motion search) 방법을 가변 크기 블록(16×16, 16×8, 8×16, 8×8, 8×4, 4×8, 4×4)으로 움직임 예측을 하는 H.264 부호기(encoder)에 적용하였다. 제안하는 검색 알고리즘을 계산 복잡도 측면에서 보면, 조기 종료가 적용 안 된 나선형으로 전체 영역을 검색(Spiral full search without early termination)하는 방법보다 23.8배가 빨라졌고, 4×4 블록들의 계층적 SAD(Sum of Absolute Difference)를 이용하는 빠른 움직임 예측 방식보다 4.6배의 속도증가를 보인다. 반면에 신호 대 잡음 비(PSNR : Peak Signal to Noise Ratio)는 0.1dB에서 0.4dB정도 떨어짐을 보인다.

• 한국경영과학회지
• /
• 제6권2호
• /
• pp.21-23
• /
• 1981

It is known that two-person zero-sum game with vector payoff can be reduced to a multiple objective linear programming. However, in this case, solutions for the game nay not be one, but many, In many cases in reality, one may need only one solution rather than all solutions. This paper develops a method to find a practical solution for the game by linear programming.

• Journal of the Korean Statistical Society
• /
• 제27권1호
• /
• pp.1-10
• /
• 1998

In the problem of estimating a vector of unknown regression coefficients under the sum of squared error losses in a hierarchical linear model, we propose the hierarchical Bayes estimator of a vector of unknown regression coefficients in a hierarchical linear model, and then prove the admissibility of this estimator using Blyth's (196\51) method.

• 호남수학학술지
• /
• 제27권2호
• /
• pp.301-315
• /
• 2005

Let $\{A_u,\;u=0,\;1,\;2,\;{\cdots}\}$ be a sequence of coefficient matrices such that ${\sum}_{u=0}^{\infty}{\parallel}A_u{\parallel}<{\infty}$ and ${\sum}_{u=0}^{\infty}\;A_u{\neq}O_{m{\times}m}$, where for any $m{\times}m(m{\geq}1)$, matrix $A=(a_{ij})$, ${\parallel}A{\parallel}={\sum}_{i=1}^m{\sum}_{j=1}^m{\mid}a_{ij}{\mid}$ and $O_{m{\times}m}$ denotes the $m{\times}m$ zero matrix. In this paper, a functional central limit theorem is derived for a stationary m-dimensional linear process ${\mathbb{X}}_t$ of the form ${\mathbb{X}_t}={\sum}_{u=0}^{\infty}A_u{\mathbb{Z}_{t-u}}$, where $\{\mathbb{Z}_t,\;t=0,\;{\pm}1,\;{\pm}2,\;{\cdots}\}$ is a stationary sequence of linearly positive quadrant dependent m-dimensional random vectors with $E({\mathbb{Z}_t})={{\mathbb{O}}$ and $E{\parallel}{\mathbb{Z}_t}{\parallel}^2<{\infty}$.

• 충청수학회지
• /
• 제24권4호
• /
• pp.617-630
• /
• 2011

Let X, Y be vector spaces, and let r be 2 or 4. It is shown that if an odd mapping $f:X{\rightarrow}Y$ satisfies the functional equation $${\hspace{50}}rf(\frac{\sum_{j=1}^{d}\;x_j} {r})+\;{\sum\limits_{\iota(j)=0,1 \atop {\sum_{j=1}^{d}}\;{\iota}(j)=l}}\;rf(\frac{\sum_{j=1}^{d}{(-1)^{\iota(j)}x_j}}{r}) \\({\ddag}){\hspace{160}}=(_{d-1}C_l-_{d-1}C_{l-1}+1)\;{\sum\limits_{j=1}^{d}\;f(x_j)}$$ then the odd mapping $f:X{\rightarrow}Y$ is additive, and we prove the Cauchy-Rassias stability of the functional equation in Banach modules over a unital $C^*$-algebra. As an application, we show that every almost linear bijection $h:{\mathcal{A}}{\rightarrow}{\mathcal{B}}$ of a unital $C^*$-algebra ${\mathcal{A}}$ onto a unital $C^*$-algebra ${\mathcal{B}}$ is a $C^*$-algebra isomorphism when $h(2^nuy)=h(2^nu)h(y)$ for all unitaries $u{\in}{\mathcal{A}}$, all $y{\in}{\mathcal{A}}$, and $n=0,1,2,{\cdots}$.

• 대한수학회보
• /
• 제37권2호
• /
• pp.229-247
• /
• 2000

This paper is concerned with the impulsive Cauchy problem where the control function u is a possibly discontinuous vector-valued function with finite total variation. We assume that the vector fields f, $g_i$(i=1,…, m) are dependent on the time variable. The impulsive Cauchy problem is of the form x(t)=f(t,x) +$\SUMg_i(t,x)u_i(t)$, $t\in$[0,T], x(0)=$\in\; R^n$, where the vector fields f, $g_i$ : $\mathbb{R}\; \times\; \mathbb{R}\; \longrightarrow\; \mathbb(R)^n$ are measurable in t and Lipschitz continuous in x, If $g_i's$ satisfy a condition that $\SUM{\mid}g_i(t_2,x){\mid}{\leq}{\phi}$ $\forallt_1\; <\; t-2,x\; {\epsilon}\;\mathbb{R}^n$ for some increasing function $\phi$, then the imput-output function can be continuously extended to measurable functions of bounded variation.