• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.880-887
• /
• 2015

In this paper, frame rate up conversion (FRUC) algorithm considering the direction and magnitude of identical motion vectors is proposed. extended bilateral motion estimation (EBME) has higher complexity than bilateral motion estimation (BME). By using average magnitude of motion vector with x and y direction respectively, dynamic frame and static frame are decided. We reduce complexity to decide EBME. also, After we compare the direction and magnitude of identical motion vectors, We reduce complexity to decide motion vector smoothing(MVS). Experimental results show that this proposed algorithm has fast computation and better peak singnal to noise ratio(PSNR) results compared with EBME.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.6
• /
• pp.104-110
• /
• 1994

We proposed a high speed feature extraction algorithm and developed a feature vector extraction chip for high speed character recognition. It is hard to implement a high speed OCR by software alone with statistical method . Thus, the whole recognition process is divided into functional steps, then pipeline processed so that high speed processing is possible with temporal parallelism of the steps. In this paper we discuss the feature extraction step of the functional steps. To extract feature vector, a character image is normalized to 40$\times$40 pixels. Then, it is divided into 5$\times$5 subregions and 4x4 subregions to construct 41 overlapped subregions(10x10 pixels). It requires to execute more than 500 commands to extract a feature vector of a subregion by software. The proposed algorithm, however, requires only 10 cycles since it can extract a feature vector of a columm of subregion in one cycle with array structure. Thus, it is possible to process 12.000 characters per second with the proposed algorithm. The chip is implemented using EPLD and the effectiveness is proved by developing an OCR using it.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.2
• /
• pp.87-93
• /
• 2013

In this paper, we implemented and evaluated the performance of a vector-based rasterization algorithm of 3D graphics using a SIMD-based many-core processor that consists of 4,096 processing elements. In addition, we compared the performance and efficiency of the rasterization algorithm using the many-core processor and commercial GPU (Graphics Processing Unit) system which consists of 7 GPUs and each of which have 512 cores. Experimental results showed that the SIMD-based many-core processor outperforms the commercial GPU system in terms of execution time (3.13x speedup), energy efficiency (17.5x better), and area efficiency (13.3x better). These results demonstrate that the SIMD-based many-core processor has potential as an embedded mobile processor.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.765-774
• /
• 2002

Suppose one is given a vector X of a finite set of quantities $X_i$ which are independent Poisson random variables. A null hypothesis $H_0$ about E(X) is to be tested against an alternative hypothesis $H_1$. A quantity $\sum\limits_{i}w_ix_i$ is to be computed and used for the test. The optimal values of $W_i$ are calculated for three cases: (1) signal to noise ratio is used in the test, (2) normal approximations with unequal variances to the Poisson distributions are used in the test, and (3) the Poisson distribution itself is used. The above three cases are considered to the situations that are without background noise and with background noise. A comparison is made of the optimal values of $W_i$ in the three cases for both situations.

• IMMUNE NETWORK
• /
• v.3 no.1
• /
• pp.23-28
• /
• 2003

Background: Intracellular antibody specific to hepatitis B virus X protein (HBx) might be useful for studying the role of HBx in hepatocellular carcinogenesis and HBV replication. Methods: With variable region genes for H7 monoclonal anti-HBx Ab, we constructed a vector for bacterial expression of single chain Ab (scFv) and a vector for eukaryotic cell expression of it. The expression of H7 scFv and its binding activity against HBx was examined by immunoblotting and immunofluorescence microscopy. Results: H7 scFv expressed in bacterial cells retained reactivity to HBx. We demonstrated its intracytoplasmic expression in CosM6 eukaryotic cells. Conclusion: This is the first study showing the expression of intracellular anti-HBx Ab in eukaryotic cells. H7 scFv may be a good tool to study the function of HBx in HBV infection.

• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.319-357
• /
• 2017

There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions in a way such that uniformly bounded sequences of functions that converge pointwise in the weak (or norm) topology of E are sent to sequences that converge in the weak, norm or weak* topology of the target space. As an application, a new description of uniform closures of convex subsets of C(X, E) is given. Also new and strong results on integral representations of continuous linear operators defined on C(X, E) are presented. A new classes of vector measures are introduced and various bounded convergence theorems for them are proved.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.2
• /
• pp.251-259
• /
• 2015

Let $\mathbb{F}^d_q$ be a d-dimensional vector space over a finite field $\mathbb{F}^d_q$ with q elements. We endow the space $\mathbb{F}^d_q$ with a normalized counting measure dx. Let ${\sigma}$ be a normalized surface measure on an algebraic variety V contained in the space ($\mathbb{F}^d_q$, dx). We define the restricted averaging operator AV by $A_Vf(X)=f*{\sigma}(x)$ for $x{\in}V$, where $f:(\mathbb{F}^d_q,dx){\rightarrow}\mathbb{C}$: In this paper, we initially investigate $L^p{\rightarrow}L^r$ estimates of the restricted averaging operator AV. As a main result, we obtain the optimal results on this problem in the case when the varieties V are any nondegenerate algebraic curves in two dimensional vector spaces over finite fields. The Fourier restriction estimates for curves on $\mathbb{F}^2_q$ play a crucial role in proving our results.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.43-63
• /
• 2022

Let M be a semi-invariant submanifold of codimension 3 with almost contact metric structure (φ, ξ, η, g) in a complex space form M_n+1(c). We denote by R_ξ the structure Jacobi operator with respect to the structure vector field ξ and by ${\bar{r}}$ the scalar curvature of M. Suppose that R_ξ is φ∇_ξξ-parallel and at the same time the third fundamental form t satisfies dt(X, Y) = 2θg(φX, Y) for a scalar θ(≠ 2c) and any vector fields X and Y on M. In this paper, we prove that if it satisfies R_ξφ = φR_ξ, then M is a Hopf hypersurface of type (A) in M_n+1(c) provided that ${\bar{r}-2(n-1)c}$ ≤ 0.

• The Korean Journal of Applied Statistics
• /
• v.34 no.3
• /
• pp.389-399
• /
• 2021

In recent years, word embedding has been a popular field of natural language processing research and a skip-gram has become one successful word embedding method. It assigns a word embedding vector to each word using contexts, which provides an effective way to analyze text data. However, due to the limitation of vector space model, primary word embedding methods assume that every word only have a single meaning. As one faces multi-sense words, that is, words with more than one meaning, in reality, Neelakantan (2014) proposed a multi-sense skip-gram (MSSG) to find embedding vectors corresponding to the each senses of a multi-sense word using a clustering method. In this paper, we propose a modified method of the MSSG to improve statistical accuracy. Moreover, we propose a data-adaptive choice of the number of clusters, that is, the number of meanings for a multi-sense word. Some numerical evidence is given by conducting real data-based simulations.

• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.2
• /
• pp.169-190
• /
• 2004

Let r, s be nonzero real numbers. Let X, Y be vector spaces. It is shown that if a mapping f : $X{\rightarrow}Y$ satisfies f(0) = 0, and $$sf(\frac{x+y{\pm}z}{r})+f(x)+f(y){\pm}f(z)=sf(\frac{x+y}{r})+sf(\frac{y{\pm}z}{r})+sf(\frac{x{\pm}z}{r})$$, or $$sf(\frac{x+y{\pm}y}{r})+f(x)+f(y){\pm}f(z)=f(x+y)+f(y{\pm}z)+f(x{\pm}z)$$ for all x, y, $z{\in}X$, then there exist an additive mapping A : $X{\rightarrow}Y$ and a quadratic mapping Q : $X{\rightarrow}Y$ such that f(x) = A(x) + Q(x) for all $x{\in}X$. Furthermore, we prove the Cauchy-Rassias stability of the functional equations as given above.