• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.335-348
• /
• 1996

For an open set G in the complex plane C, we prove the existence of an entire function f such that its integer translations forms a finitely normal family exactly on G if and only if G is periodic with period 1 and G has no hole.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.338-342
• /
• 2000

In order to approximate a nonlinear function, wacelet neural networks combining wacelet theory and neural networks have been proposed as an alternative to conventional multi-layered neural networks. wacelet neural networks provide better approximating performance than conventional neural networks. In this paper, an effective method to construct an optimal wavelet neural network is proposed using genetic alogorithm. Genetic Algorithm is used to determine dilationa and translations of wavelet basic functions of wavelet neural networks. Then, these determined dilations dilations and translations, wavelet neural networks are funther trained by back propagation learning algorithm. The effectiveness of the final network is verified thrifigh the approximation result of a nonlinear function and comparison with conventional neural networks.

• The KIPS Transactions:PartB
• /
• v.14B no.3 s.113
• /
• pp.145-152
• /
• 2007

In this paper, we propose an automatic extraction model for unknown translations and implement an unknown translation extraction system using the proposed model. The proposed model as a phrase-alignment model is incorporated with three models: a phrase-boundary model, a language model, and a translation model. Using the proposed model we implement the system for extracting unknown translations, which consists of three parts: construction of parallel corpora, alignment of Korean and English words, extraction of unknown translations. To evaluate the performance of the proposed system, we have established the reference corpus for extracting unknown translation, which comprises of 2,220 parallel sentences including about 1,500 unknown translations. Through several experiments, we have observed that the proposed model is very useful for extracting unknown translations. In the future, researches on objective evaluation and establishment of parallel corpora with good quality should be performed and studies on improving the performance of unknown translation extraction should be kept up.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.04a
• /
• pp.261-268
• /
• 2003

A first order shear deformable Loop-subdivision triangular element which can handle transverse shear deformation of moderately thick shell is developed. The developed element is general since it includes the effect of transverse shear deformation and has standard six degrees of freedom per node.(three translations and three rotations) The quartic box-spline function is employed as interpolation basis function. Numerical examples for the benchmark problems are analyzed in order to assess the performance of the newly developed subdivision shell element. Both in the uniform and in the distorted mesh configurations.

• School Mathematics
• /
• v.14 no.3
• /
• pp.297-313
• /
• 2012

The purpose of this paper is to discuss the potential and to examine the effect of narrative, as an alternative approach to teach formal proof in more easier and comprehensible way. Identifying the key elements of narrative in proof, we constructed a narrative that derives the equation of function translation. We examined the effect of teaching through the narrative, in comparison with teaching the corresponding proof, on low-achieving students' instrumental understanding and relational understanding of function translation. Since we found no statistically significant differences between the experimental and the comparison group, this study could not conclude that teaching through the narrative was more effective than teaching the corresponding proof. But there were some qualitative differences in the relational understanding responses and the evaluation of the teaching between two groups. These findings suggested some potential of narratives that complement the formal proof.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.04a
• /
• pp.121-124
• /
• 2009

A moving mesh system is one of the critical parts in a computational fluid dynamics analysis. In this study, the RBF(Radial Basis Function) which shows better performance than hybrid meshes was developed to obtain the deformed grid. The RBF method can handle large mesh deformations caused by translations, rotations and deformations, both for 2D and 3D meshes. Another advantage of the method is that it can handle both structured and unstructured grids with ease. The method uses a volume spline technique to compute the deformation of block vertices and block edges, and deformed shape.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.277-283
• /
• 1992

Let GF(q) be a finite field with q elements where q=p$^{n}$ for a prime number p and a positive integer n. Consider an arbitrary function .phi. from GF(q) into GF(q). By using the Largrange's Interpolation formula for the given function .phi., .phi. can be represented by a polynomial which is congruent (mod x$^{q}$ -x) to a unique polynomial over GF(q) with the degree < q. In [3], Wells characterized all polynomial over a finite field which commute with translations. Mullen [2] generalized the characterization to linear polynomials over the finite fields, i.e., he characterized all polynomials f(x) over GF(q) for which deg(f) < q and f(bx+a)=b.f(x) + a for fixed elements a and b of GF(q) with a.neq.0. From those papers, a natural question (though difficult to answer to ask is: what are the explicit form of f(x) with zero terms\ulcorner In this paper we obtain the exact form (together with zero terms) of a polynomial f(x) over GF(q) for which satisfies deg(f) < p$^{2}$ and (1) f(x+a)=f(x)+c for the fixed nonzero elements a and c in GF(q).

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.3
• /
• pp.417-437
• /
• 2009

The notions of $\mathcal{N}$-subalgebras, (closed, commutative, retrenched) $\mathcal{N}$-ideals, $\theta$-negative functions, and $\alpha$-translations are introduced, and related properties are investigated. Characterizations of an $\mathcal{N}$-subalgebra and a (commutative) $\mathcal{N}$-ideal are given. Relations between an $\mathcal{N}$-subalgebra, an $\mathcal{N}$-ideal and commutative $\mathcal{N}$-ideal are discussed. We verify that every $\alpha$-translation of an $\mathcal{N}$-subalgebra (resp. $\mathcal{N}$-ideal) is a retrenched $\mathcal{N}$-subalgebra (resp. retrenched $\mathcal{N}$-ideal).

• Journal of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.65-76
• /
• 2004

An entire function $f\;{\in}\;H(\mathbb{C})$ is called universal with respect to translations if for any $g\;{\in}\;H(\mathbb{C}),\;R\;>\;0,\;and\;{\epsilon}\;>\;0$, there is $n\;{\in}\;{\mathbb{N}}$ such that $$\mid$f(z\;+\;n)\;-\;g(z)$\mid$\;<\;{\epsilon}$ whenever $$\mid$z$\mid$\;{\leq}\;R$. Similarly, it is universal with respect to differentiation if for any g, R, and $\epsilon$, there is n such that $$\mid$f^{(n)}(z)\;-\;g(z)$\mid$\;<\;{\epsilon}\;for\;$\mid$z$\mid$\;{\leq}\;R$. In this note, we review G. MacLane's proof of the existence of universal functions with respect to differentiation, and we give a simplified proof of G. D. Birkhoff's theorem showing the existence of universal functions with respect to translation. We also discuss Godefroy and Shapiro's extension of these results to convolution operators as well as some new, related results and problems.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.775-786
• /
• 2021

To translate in real time, a simultaneous translation system should determine when to stop reading source tokens and generate target tokens corresponding to a partial source sentence read up to that point. However, conventional attention-based neural machine translation (NMT) models cannot produce translations with adequate latency in online scenarios because they wait until a source sentence is completed to compute alignment between the source and target tokens. To address this issue, we propose a reinforced learning (RL)-based attention mechanism, the reinforced attention mechanism, which allows a neural translation model to jointly train the stopping criterion and a partial translation model. The proposed attention mechanism comprises two modules, one to ensure translation quality and the other to address latency. Different from previous RL-based simultaneous translation systems, which learn the stopping criterion from a fixed NMT model, the modules can be trained jointly with a novel reward function. In our experiments, the proposed model has better translation quality and comparable latency compared to previous models.